OpenRaiser/Intern-Atlas huggingface dataset:
Sequential Quantum Channel Discrimination
Venue: arXiv cs.IT 2022
Year: 2022

We consider the sequential quantum channel discrimination problem using adaptive and non-adaptive strategies. In this setting the number of uses of the underlying quantum channel is not fixed but a random variable that is either bounded in expectation or with high probability. We show that both types of error probabilities decrease to zero exponentially fast and, when using adaptive strategies, the rates are characterized by the measured relative entropy between two quantum channels, yielding a strictly larger region than that achievable by non-adaptive strategies. Allowing for quantum memory, we see that the optimal rates are given by the regularized channel relative entropy. Finally, we discuss achievable rates when allowing for repeated measurements via quantum instruments and conjecture that the achievable rate region is not larger than that achievable with POVMs by connecting the result to the strong converse for the quantum channel Stein's Lemma.
Sensor interoperability and fusion in signature verification: A case study using tablet PC
Venue: arXiv cs.CV 2022
Year: 2022

Several works related to information fusion for signature verification have been presented. However, few works have focused on sensor fusion and sensor interoperability. In this paper, these two topics are evaluated for signature verification using two different commercial Tablet PCs. An enrolment strategy using signatures from the two Tablet PCs is also proposed. Authentication performance experiments are reported by using a database with over 3000 signatures.
Dude, where's my NFT? Distributed Infrastructures for Digital Art
Venue: arXiv cs.NI 2022
Year: 2022

We explore issues relating to the storage of digital art, based on an empirical investigation into the storage of audiovisual data referenced by non-fungible tokens (NFTs). We identify current trends in NFT data storage and highlight problems with implemented solutions. We particularly focus our investigation on the use of the Interplanetary Filesystem (IPFS), which emerges as a popular and versatile distributed storage solution for NFTs. Based on the analysis of discovered data storage techniques, we propose a set of best practices to ensure long-term storage survivability of NFT data. While helpful for forming the NFT art market into a legitimate long-term environment for digital art, our recommendations are also directly applicable for improving the availability and integrity of non-NFT digital art.
Mathematical Justification of Hard Negative Mining via Isometric Approximation Theorem
Venue: arXiv cs.LG 2022
Year: 2022

In deep metric learning, the Triplet Loss has emerged as a popular method to learn many computer vision and natural language processing tasks such as facial recognition, object detection, and visual-semantic embeddings. One issue that plagues the Triplet Loss is network collapse, an undesirable phenomenon where the network projects the embeddings of all data onto a single point. Researchers predominately solve this problem by using triplet mining strategies. While hard negative mining is the most effective of these strategies, existing formulations lack strong theoretical justification for their empirical success. In this paper, we utilize the mathematical theory of isometric approximation to show an equivalence between the Triplet Loss sampled by hard negative mining and an optimization problem that minimizes a Hausdorff-like distance between the neural network and its ideal counterpart function. This provides the theoretical justifications for hard negative mining's empirical efficacy. In addition, our novel application of the isometric approximation theorem provides the groundwork for future forms of hard negative mining that avoid network collapse. Our theory can also be extended to analyze other Euclidean space-based metric learning methods like Ladder Loss or Contrastive Learning.
Towards Better Guided Attention and Human Knowledge Insertion in Deep Convolutional Neural Networks
Venue: arXiv cs.CV 2022
Year: 2022

Attention Branch Networks (ABNs) have been shown to simultaneously provide visual explanation and improve the performance of deep convolutional neural networks (CNNs). In this work, we introduce Multi-Scale Attention Branch Networks (MSABN), which enhance the resolution of the generated attention maps, and improve the performance. We evaluate MSABN on benchmark image recognition and fine-grained recognition datasets where we observe MSABN outperforms ABN and baseline models. We also introduce a new data augmentation strategy utilizing the attention maps to incorporate human knowledge in the form of bounding box annotations of the objects of interest. We show that even with a limited number of edited samples, a significant performance gain can be achieved with this strategy.
YOWO-Plus: An Incremental Improvement
Venue: arXiv cs.CV 2022
Year: 2022

In this technical report, we would like to introduce our updates to YOWO, a real-time method for spatio-temporal action detection. We make a bunch of little design changes to make it better. For network structure, we use the same ones of official implemented YOWO, including 3D-ResNext-101 and YOLOv2, but we use a better pretrained weight of our reimplemented YOLOv2, which is better than the official YOLOv2. We also optimize the label assignment used in YOWO. To accurately detection action instances, we deploy GIoU loss for box regression. After our incremental improvement, YOWO achieves 84.9\% frame mAP and 50.5\% video mAP on the UCF101-24, significantly higher than the official YOWO. On the AVA, our optimized YOWO achieves 20.6\% frame mAP with 16 frames, also exceeding the official YOWO. With 32 frames, our YOWO achieves 21.6 frame mAP with 25 FPS on an RTX 3090 GPU. We name the optimized YOWO as YOWO-Plus. Moreover, we replace the 3D-ResNext-101 with the efficient 3D-ShuffleNet-v2 to design a lightweight action detector, YOWO-Nano. YOWO-Nano achieves 81.0 \% frame mAP and 49.7\% video frame mAP with over 90 FPS on the UCF101-24. It also achieves 18.4 \% frame mAP with about 90 FPS on the AVA. As far as we know, YOWO-Nano is the fastest state-of-the-art action detector. Our code is available on https://github.com/yjh0410/PyTorch_YOWO.
A Dialogue Robot System to Improve Credibility in Sightseeing Spot Recommendations
Venue: arXiv cs.RO 2022
Year: 2022

Various studies have been conducted on human-supporting robot systems. These systems have been put to practical use over the years and are now seen in our daily lives. In particular, robots communicating smoothly with people are expected to play an active role in customer service and guidance. In this case, it is essential to determine whether the customer is satisfied with the dialog robot or not. However, it is not easy to satisfy all of the customer's requests due to the diversity of the customer's speech. In this study, we developed a dialog mechanism that prevents dialog breakdowns and keeps the customer satisfied by providing multiple scenarios for the robot to take control of the dialog. We tested it in a travel destination recommendation task at a travel agency.
Strong Normalization for the Calculus of Constructions
Venue: arXiv cs.PL 2022
Year: 2022

The calculus of constructions (CC) is a core theory for dependently typed programming and higher-order constructive logic. Originally introduced in Coquand's 1985 thesis, CC has inspired 25 years of research in programming languages and type theory. Today, extensions of CC form the basis of languages like Coq and Agda. This survey reviews three proofs of CC's strong normalization property (the fact that there are no infinite reduction sequences from well-typed expressions). It highlights the similarities in the structure of the proofs while showing how their differences are motivated by the varying goals of their authors.
An Efficient Merge Search Matheuristic for Maximising the Net Present Value of Project Schedules
Venue: arXiv cs.NE 2022
Year: 2022

Resource constrained project scheduling is an important combinatorial optimisation problem with many practical applications. With complex requirements such as precedence constraints, limited resources, and finance-based objectives, finding optimal solutions for large problem instances is very challenging even with well-customised meta-heuristics and matheuristics. To address this challenge, we propose a new math-heuristic algorithm based on Merge Search and parallel computing to solve the resource constrained project scheduling with the aim of maximising the net present value. This paper presents a novel matheuristic framework designed for resource constrained project scheduling, Merge search, which is a variable partitioning and merging mechanism to formulate restricted mixed integer programs with the aim of improving an existing pool of solutions. The solution pool is obtained via a customised parallel ant colony optimisation algorithm, which is also capable of generating high quality solutions on its own. The experimental results show that the proposed method outperforms the current state-of-the-art algorithms on known benchmark problem instances. Further analyses also demonstrate that the proposed algorithm is substantially more efficient compared to its counterparts in respect to its convergence properties when considering multiple cores.
Detecting Backdoors in Deep Text Classifiers
Venue: arXiv cs.CR 2022
Year: 2022

Deep neural networks are vulnerable to adversarial attacks, such as backdoor attacks in which a malicious adversary compromises a model during training such that specific behaviour can be triggered at test time by attaching a specific word or phrase to an input. This paper considers the problem of diagnosing whether a model has been compromised and if so, identifying the backdoor trigger. We present the first robust defence mechanism that generalizes to several backdoor attacks against text classification models, without prior knowledge of the attack type, nor does our method require access to any (potentially compromised) training resources. Our experiments show that our technique is highly accurate at defending against state-of-the-art backdoor attacks, including data poisoning and weight poisoning, across a range of text classification tasks and model architectures. Our code will be made publicly available upon acceptance.
Knowledge Management Skills for 21st Century Library Professionals in India A Study
Venue: arXiv cs.DL 2022
Year: 2022

In any kind of educational institute and organization, libraries are playing a crucial role. For the development of library services, skillful library professionals are indispensable. Without knowledge management skills, no one can provide essential services to the users. Library is a growing organism by S.R. Ranganathan 1931, based on his law, as library professionals have to adopt futuristic skills for better user services. The study investigates knowledge management skills and the chief strengths of library and information science professionals in India. For this study, data collected from the Institute of National Importance and Central Universities around India. The principal aim of this study is to understand the current scenario and data literacy skills of library professionals.
Factorisation in the semiring of finite dynamical systems
Venue: arXiv cs.DM 2022
Year: 2022

Finite dynamical systems (FDSs) are commonly used to model systems with a finite number of states that evolve deterministically and at discrete time steps. Considered up to isomorphism, those correspond to functional graphs. As such, FDSs have a sum and product operation, which correspond to the direct sum and direct product of their respective graphs; the collection of FDSs endowed with these operations then forms a semiring. The algebraic structure of the product of FDSs is particularly interesting. For instance, an FDS can be factorised if and only if it is composed of two sub-systems running in parallel. In this work, we further the understanding of the factorisation, division, and root finding problems for FDSs. Firstly, an FDS $A$ is cancellative if one can divide by it unambiguously, i.e. $AX = AY$ implies $X = Y$. We prove that an FDS $A$ is cancellative if and only if it has a fixpoint. Secondly, we prove that if an FDS $A$ has a $k$-th root (i.e. $B$ such that $B^k = A$), then it is unique. Thirdly, unlike integers, the monoid of FDS product does not have unique factorisation into irreducibles. We instead exhibit a large class of monoids of FDSs with unique factorisation. To obtain our main results, we introduce the unrolling of an FDS, which can be viewed as a space-time expansion of the system. This allows us to work with (possibly infinite) trees, where the product is easier to handle than its counterpart for FDSs.
Causal Structural Hypothesis Testing and Data Generation Models
Venue: arXiv cs.LG 2022
Year: 2022

A vast amount of expert and domain knowledge is captured by causal structural priors, yet there has been little research on testing such priors for generalization and data synthesis purposes. We propose a novel model architecture, Causal Structural Hypothesis Testing, that can use nonparametric, structural causal knowledge and approximate a causal model's functional relationships using deep neural networks. We use these architectures for comparing structural priors, akin to hypothesis testing, using a deliberate (non-random) split of training and testing data. Extensive simulations demonstrate the effectiveness of out-of-distribution generalization error as a proxy for causal structural prior hypothesis testing and offers a statistical baseline for interpreting results. We show that the variational version of the architecture, Causal Structural Variational Hypothesis Testing can improve performance in low SNR regimes. Due to the simplicity and low parameter count of the models, practitioners can test and compare structural prior hypotheses on small dataset and use the priors with the best generalization capacity to synthesize much larger, causally-informed datasets. Finally, we validate our methods on a synthetic pendulum dataset, and show a use-case on a real-world trauma surgery ground-level falls dataset.
Tighter PAC-Bayes Generalisation Bounds by Leveraging Example Difficulty
Venue: arXiv cs.LG 2022
Year: 2022

We introduce a modified version of the excess risk, which can be used to obtain tighter, fast-rate PAC-Bayesian generalisation bounds. This modified excess risk leverages information about the relative hardness of data examples to reduce the variance of its empirical counterpart, tightening the bound. We combine this with a new bound for $[-1, 1]$-valued (and potentially non-independent) signed losses, which is more favourable when they empirically have low variance around $0$. The primary new technical tool is a novel result for sequences of interdependent random vectors which may be of independent interest. We empirically evaluate these new bounds on a number of real-world datasets.
Towards Evology: a Market Ecology Agent-Based Model of US Equity Mutual Funds
Venue: arXiv cs.MA 2022
Year: 2022

The profitability of various investment styles in investment funds depends on macroeconomic conditions. Market ecology, which views financial markets as ecosystems of diverse, interacting and evolving trading strategies, has shown that endogenous interactions between strategies determine market behaviour and styles' performance. We present Evology: a heterogeneous, empirically calibrated multi-agent market ecology agent-based model to quantify endogenous interactions between US equity mutual funds, particularly Value and Growth investment styles. We outline the model design, validation and calibration approach and its potential for optimising investment strategies using machine learning algorithms.
Holbert: Reading, Writing, Proving and Learning in the Browser
Venue: arXiv cs.LO 2022
Year: 2022

This paper presents Holbert: a work-in-progress pedagogical proof assistant and online textbook platform, aimed at the educational use-case, specifically for the teaching of programming language theory. Holbert allows proof exercises and rule definitions to be embedded directly in an online textbook, where proofs and rules can be manipulated using a graphical interface. We give an overview of the logical foundations of Holbert, examples of its use, and give an update as to its current implementation status.
Scaling Instruction-Finetuned Language Models
Venue: arXiv cs.LG 2022
Year: 2022

Finetuning language models on a collection of datasets phrased as instructions has been shown to improve model performance and generalization to unseen tasks. In this paper we explore instruction finetuning with a particular focus on (1) scaling the number of tasks, (2) scaling the model size, and (3) finetuning on chain-of-thought data. We find that instruction finetuning with the above aspects dramatically improves performance on a variety of model classes (PaLM, T5, U-PaLM), prompting setups (zero-shot, few-shot, CoT), and evaluation benchmarks (MMLU, BBH, TyDiQA, MGSM, open-ended generation). For instance, Flan-PaLM 540B instruction-finetuned on 1.8K tasks outperforms PALM 540B by a large margin (+9.4% on average). Flan-PaLM 540B achieves state-of-the-art performance on several benchmarks, such as 75.2% on five-shot MMLU. We also publicly release Flan-T5 checkpoints, which achieve strong few-shot performance even compared to much larger models, such as PaLM 62B. Overall, instruction finetuning is a general method for improving the performance and usability of pretrained language models.
Closed-loop Control of Catalytic Janus Microrobots
Venue: arXiv cs.RO 2022
Year: 2022

We report a closed-loop control system for paramagnetic catalytically self-propelled Janus microrobots. We achieve this control by employing electromagnetic coils that direct the magnetic field in a desired orientation to steer the microrobots. The microrobots move due to the catalytic decomposition of hydrogen peroxide, during which they align themselves to the magnetic torques applied to them. Because the angle between their direction of motion and their magnetic orientation is a priori unknown, an algorithm is used to determine this angular offset and adjust the magnetic field appropriately. The microrobots are located using real-time particle tracking that integrates with a video camera. A target location or desired trajectory can be drawn by the user for the microrobots to follow.
ObSynth: An Interactive Synthesis System for Generating Object Models from Natural Language Specifications
Venue: arXiv cs.SE 2022
Year: 2022

We introduce ObSynth, an interactive system leveraging the domain knowledge embedded in large language models (LLMs) to help users design object models from high level natural language prompts. This is an example of specification reification, the process of taking a high-level, potentially vague specification and reifying it into a more concrete form. We evaluate ObSynth via a user study, leading to three key findings: first, object models designed using ObSynth are more detailed, showing that it often synthesizes fields users might have otherwise omitted. Second, a majority of objects, methods, and fields generated by ObSynth are kept by the user in the final object model, highlighting the quality of generated components. Third, ObSynth altered the workflow of participants: they focus on checking that synthesized components were correct rather than generating them from scratch, though ObSynth did not reduce the time participants took to generate object models.
VIBUS: Data-efficient 3D Scene Parsing with VIewpoint Bottleneck and Uncertainty-Spectrum Modeling
Venue: arXiv cs.CV 2022
Year: 2022

Recently, 3D scenes parsing with deep learning approaches has been a heating topic. However, current methods with fully-supervised models require manually annotated point-wise supervision which is extremely user-unfriendly and time-consuming to obtain. As such, training 3D scene parsing models with sparse supervision is an intriguing alternative. We term this task as data-efficient 3D scene parsing and propose an effective two-stage framework named VIBUS to resolve it by exploiting the enormous unlabeled points. In the first stage, we perform self-supervised representation learning on unlabeled points with the proposed Viewpoint Bottleneck loss function. The loss function is derived from an information bottleneck objective imposed on scenes under different viewpoints, making the process of representation learning free of degradation and sampling. In the second stage, pseudo labels are harvested from the sparse labels based on uncertainty-spectrum modeling. By combining data-driven uncertainty measures and 3D mesh spectrum measures (derived from normal directions and geodesic distances), a robust local affinity metric is obtained. Finite gamma/beta mixture models are used to decompose category-wise distributions of these measures, leading to automatic selection of thresholds. We evaluate VIBUS on the public benchmark ScanNet and achieve state-of-the-art results on both validation set and online test server. Ablation studies show that both Viewpoint Bottleneck and uncertainty-spectrum modeling bring significant improvements. Codes and models are publicly available at https://github.com/AIR-DISCOVER/VIBUS.
Optical Networking in Future-land: From Optical-bypass-enabled to Optical-processing-enabled Paradigm
Venue: arXiv cs.NI 2022
Year: 2022

Conventional wisdom in designing the optical switching nodes is rooted in the intuition that when an optical channel crossing an intermediate node, it should be maximally isolated from other optical channels to avoid interference. Such long-established paradigm perceiving the interference of optical channels transiting at the same node as an adversarial factor and should therefore circumvent, albeit reasonable, may leave vast unexplored opportunities. Indeed, rapid advances in all-optical signal processing technologies has brought opportunities to re-define the optical node architecture by upgrading its naive functionalities from simply add/drop and cross-connecting to proactively mixing optical channels in photonic domain. Specifically, all-optical channel (de-) aggregation technologies have been remarkably advancing in recent years, permitting two or more optical channels at lower bit-rate and/or modulation formats could be all-optically aggregated to a single channel of higher-rate and/or higher-order modulation format and vice versa. Such evolutionary technique is poised to disrupt the existing ecosystem for optical network design and planning, and thus necessitates for a radical change to unlock new potentials. In addressing this disruptive idea, we present a new paradigm for future optical networks, namely, optical-processing-enabled networks powered by in-network all-optical mixing capability. We introduce the operational principle of optical channel (de-) aggregation and show how spectrally beneficial such innovative operations could yield by an illustrative example. Next, in order to maximize the aggregation opportunity, we present a mathematical model for optimal routing based on integer linear programming model. Numerical results on the realistic network topology COST239 are provided to quantify the spectral gain of aggregation-aware routing compared to the conventional one.