Miracle-dz/UniFAR-FTUs huggingface dataset:
DyREx: Dynamic Query Representation for Extractive Question Answering

Extractive question answering (ExQA) is an essential task for Natural Language Processing. The dominant approach to ExQA is one that represents the input sequence tokens (question and passage) with a pre-trained transformer, then uses two learned query vectors to compute distributions over the start and end answer span positions. These query vectors lack the context of the inputs, which can be a bottleneck for the model performance. To address this problem, we propose \textit{DyREx}, a generalization of the \textit{vanilla} approach where we dynamically compute query vectors given the input, using an attention mechanism through transformer layers. Empirical observations demonstrate that our approach consistently improves the performance over the standard one. The code and accompanying files for running the experiments are available at \url{https://github.com/urchade/DyReX}.
Leveraging Computer Vision Application in Visual Arts: A Case Study on the Use of Residual Neural Network to Classify and Analyze Baroque Paintings

With the increasing availability of large digitized fine art collections, automated analysis and classification of paintings is becoming an interesting area of research. However, due to domain specificity, implicit subjectivity, and pervasive nuances that vaguely separate art movements, analyzing art using machine learning techniques poses significant challenges. Residual networks, or variants thereof, are one the most popular tools for image classification tasks, which can extract relevant features for well-defined classes. In this case study, we focus on the classification of a selected painting 'Portrait of the Painter Charles Bruni' by Johann Kupetzky and the analysis of the performance of the proposed classifier. We show that the features extracted during residual network training can be useful for image retrieval within search systems in online art collections.
Multiferroicity and Topology in Twisted Transition Metal Dichalcogenides

Van der Waals heterostructures have recently emerged as an exciting platform for investigating the effects of strong electronic correlations, including various forms of magnetic or electrical orders. Here, we perform an unbiased exact diagonalization study of the effects of interactions on topological flat bands of twisted transition metal dichalcogenides (TMDs) at odd integer fillings. For hole-filling $\nu_h = 1$, we find that Chern insulator phases, expected from interaction-induced spin-valley polarization of the bare bands, are quite fragile, and give way to spontaneous multiferroic order -- coexisting ferroelectricity and ferromagnetism, in presence of long-range Coulomb repulsion. We provide a simple real-space picture to understand the phase diagram as a function of interaction range and strength. Our findings establish twisted TMDs as a novel and highly tunable platform for multiferroicity, with potential applications to electrical control of magnetism.
Lifelong Bandit Optimization: No Prior and No Regret

Machine learning algorithms are often repeatedly applied to problems with similar structure over and over again. We focus on solving a sequence of bandit optimization tasks and develop LIBO, an algorithm which adapts to the environment by learning from past experience and becomes more sample-efficient in the process. We assume a kernelized structure where the kernel is unknown but shared across all tasks. LIBO sequentially meta-learns a kernel that approximates the true kernel and solves the incoming tasks with the latest kernel estimate. Our algorithm can be paired with any kernelized or linear bandit algorithm and guarantees oracle optimal performance, meaning that as more tasks are solved, the regret of LIBO on each task converges to the regret of the bandit algorithm with oracle knowledge of the true kernel. Naturally, if paired with a sublinear bandit algorithm, LIBO yields a sublinear lifelong regret. We also show that direct access to the data from each task is not necessary for attaining sublinear regret. We propose F-LIBO, which solves the lifelong problem in a federated manner.
Towards customizable reinforcement learning agents: Enabling preference specification through online vocabulary expansion

There is a growing interest in developing automated agents that can work alongside humans. In addition to completing the assigned task, such an agent will undoubtedly be expected to behave in a manner that is preferred by the human. This requires the human to communicate their preferences to the agent. To achieve this, the current approaches either require the users to specify the reward function or the preference is interactively learned from queries that ask the user to compare behavior. The former approach can be challenging if the internal representation used by the agent is inscrutable to the human while the latter is unnecessarily cumbersome for the user if their preference can be specified more easily in symbolic terms. In this work, we propose PRESCA (PREference Specification through Concept Acquisition), a system that allows users to specify their preferences in terms of concepts that they understand. PRESCA maintains a set of such concepts in a shared vocabulary. If the relevant concept is not in the shared vocabulary, then it is learned. To make learning a new concept more feedback efficient, PRESCA leverages causal associations between the target concept and concepts that are already known. In addition, we use a novel data augmentation approach to further reduce required feedback. We evaluate PRESCA by using it on a Minecraft environment and show that it can effectively align the agent with the user's preference.
Disordered Green’s Functions for Random Resistor Networks

We analyze random resistor networks through a study of disordered lattice Green’s functions in arbitrary dimensions. We develop a systematic disorder perturbation expansion to describe the weak disorder regime of such a system. We use this formulation to compute ensemble averaged nodal voltages and bond currents in a hierarchical fashion. We verify the validity of this expansion with direct numerical simulations of a square lattice with resistances at each bond chosen from an exponential distribution. Additionally, we construct a formalism to recursively obtain the exact Green’s functions for ﬁnitely many disordered bonds. We provide explicit expressions for lattices with up to four disordered bonds, which can be used to predict nodal voltage distributions for arbitrarily large disorder strengths. Finally, we introduce a novel order parameter that measures the overlap between the bond current and the optimal path (the path of least resistance), for a given resistance conﬁguration, which helps to characterize the weak and strong disorder regimes of the system.
Experimental Comparison of SNR and RSSI for LoRa-ESL Based on Machine Clustering and Arithmetic Distribution

LoRa lacks the sensing capabilities of channel status. Received signal strength indicator (RSSI) decreases due to collision, interference, and near-far effect while for signal-to-noise ratio (SNR), the packets are rejected by decreasing the transmission power (TP) at a higher spreading factor (SF). To overcome these challenges in the case of electric shelf label (ESL) to minimize the dependency on retransmission and acknowledgment, the end devices (EDs) are allocated around gateways (GWs) based on machine clustering with dynamic SF for SNR while dynamic TP for RSSI. The experimental results determined that the RSSI approach is more dominant than SNR because of determining the exact locality of the ED that diminished the capture effect. Arithmetic distribution of EDs for various GWs in different clusters helps to minify the near-far effect. The resultant received power (RP) at each cluster is higher for most of the connected EDs than the threshold RP.
Neuro-symbolic partial differential equation solver

We present a highly scalable strategy for developing mesh-free neuro-symbolic partial differential equation solvers from existing numerical discretizations found in scientiﬁc computing. This strategy is unique in that it can be used to efﬁciently train neural network surrogate models for the solution functions and the differential operators, while retaining the accuracy and convergence properties of state-of-the-art numerical solvers. This neural bootstrapping method is based on minimizing residuals of discretized differential systems on a set of random collocation points with respect to the trainable parameters of the neural network, achieving unprecedented resolution and optimal scaling for solving physical and biological systems.
TASA: Deceiving Question Answering Models by Twin Answer Sentences Attack

We present Twin Answer Sentences Attack (TASA), an adversarial attack method for question answering (QA) models that produces fluent and grammatical adversarial contexts while maintaining gold answers. Despite phenomenal progress on general adversarial attacks, few works have investigated the vulnerability and attack specifically for QA models. In this work, we first explore the biases in the existing models and discover that they mainly rely on keyword matching between the question and context, and ignore the relevant contextual relations for answer prediction.Based on two biases above, TASA attacks the target model in two folds: (1) lowering the model’s confidence on the gold answer with a perturbed answer sentence; (2) misguiding the model towards a wrong answer with a distracting answer sentence. Equipped with designed beam search and filtering methods, TASA can generate more effective attacks than existing textual attack methods while sustaining the quality of contexts, in extensive experiments on five QA datasets and human evaluations.
Induced drag of multiplanes

The most important part of the resistance or drag of a wing system,the induced drag, can be calculated theoretically, when the distribution of lift on the individual wings is known. The calculation is based upon the assumption that the lift on the wings is distributed along the wing in proportion to the ordinates of a semi-ellipse. Formulas and numerical tables are given for calculating the drag. In this connection, the most favorable arrangements of biplanes and triplanes are discussed and the results are further elucidated by means of numerical examples.
Incorporating Causal Effects into Deep Learning Predictions on EHR Data

—Electronic Health Records (EHR) data analysis plays a crucial role in healthcare system quality. Because of its highly complex underlying causality and limited observable nature, causal inference on EHR is quite challenging. Deep Learning (DL) achieved great success among the advanced ma- chine learning methodologies. Nevertheless, it is still obstructed by the inappropriately assumed causal conditions. This work proposed a novel method to quantify clinically well-deﬁned causal effects as a generalized estimation vector that is simply utilizable for causal models. We incorporated it into DL models to achieve better predictive performance and result interpretation. Furthermore, we also proved the existence of causal information blink spots that regular DL models cannot reach.
DecoMine: A Compilation-Based Graph Pattern Mining System with Pattern Decomposition

Graph pattern mining (GPM) is an important application that identifies structures from graphs. Despite the recent progress, the performance gap between the state-of-the-art GPM systems and an efficient algorithm—pattern decomposition—is still at least an order of magnitude. This paper clears the fundamental obstacles of adopting pattern decomposition to a GPM system. First, the performance of pattern decomposition algorithms depends on how to decompose the whole pattern into subpatterns. The original method performs complexity analysis of algorithms for different choices, and selects the one with the lowest complexity upper bound. Clearly, this approach is not feasible for average or even expert users. To solve this problem, we develop a GPM compiler with conventional and GPM-specific optimizations to generate algorithms for different decomposition choices, which are evaluated based on an accurate cost model. The executable of the GPM task is obtained from the algorithm with the best performance. Second, we propose a novel partial-embedding API that is sufficient to construct advanced GPM applications while preserving pattern decomposition algorithm advantages. Compared to state-of-the-art systems, our new GPM system, DecoMine, developed based on the ideas, reduces the execution time of GPM on large graphs and patterns from days to a few hours with low programming effort.
Aerial Manipulation Using a Novel Unmanned Aerial Vehicle Cyber-Physical System

Unmanned Aerial Vehicles(UAVs) are attaining more and more maneuverability and sensory ability as a promising teleoperation platform for intelligent interaction with the environments. This work presents a novel 5-degree-of-freedom (DoF) unmanned aerial vehicle (UAV) cyber-physical system for aerial manipulation. This UAV's body is capable of exerting powerful propulsion force in the longitudinal direction, decoupling the translational dynamics and the rotational dynamics on the longitudinal plane. A high-level impedance control law is proposed to drive the vehicle for trajectory tracking and interaction with the environments. In addition, a vision-based real-time target identification and tracking method integrating a YOLO v3 real-time object detector with feature tracking, and morphological operations is proposed to be implemented onboard the vehicle with support of model compression techniques to eliminate latency caused by video wireless transmission and heavy computation burden on traditional teleoperation platforms.
Taxonomic Classification of IoT Smart Home Voice Control

Voice control in the smart home is commonplace, enabling the convenient control of smart home Internet of Things hubs, gateways and devices, along with information seeking dialogues. Cloud-based voice assistants are used to facilitate the interaction, yet privacy concerns surround the cloud analysis of data. To what extent can voice control be performed using purely local computation, to ensure user data remains private? In this paper we present a taxonomy of the voice control technologies present in commercial smart home systems. We first review literature on the topic, and summarise relevant work categorising IoT devices and voice control in the home. The taxonomic classification of these entities is then presented, and we analyse our findings. Following on, we turn to academic efforts in implementing and evaluating voice-controlled smart home set-ups, and we then discuss open-source libraries and devices that are applicable to the design of a privacy-preserving voice assistant for smart homes and the IoT. Towards the end, we consider additional technologies and methods that could support a cloud-free voice assistant, and conclude the work.
Drug repositioning for Alzheimer's disease with transfer learning

Deep Learning and DRUG-seq (Digital RNA with perturbation of genes) have attracted attention in drug discovery. However, the public DRUG-seq dataset is too small to be used for directly training a deep learning neural network from scratch. Inspired by the transfer learning technique, we pretrain a drug efficacy prediction neural network model with the Library of Integrated Network-based Cell-Signature (LINCS) L1000 data and then use human neural cell DRUG-seq data to fine-tune it. After training, the model is used for virtual screening to find potential drugs for Alzheimer's disease (AD) treatment. Finally, we find 27 potential drugs for AD treatment including Irsogladine (PDE4 inhibitor), Tasquinimod (HDAC4 selective inhibitor), Suprofen (dual COX-1/COX-2 inhibitor) et al.
Stochastic volatility modeling of high-frequency CSI 300 index and dynamic jump prediction driven by machine learning

This paper models stochastic process of price time series of $ CSI $ $ 300 $ index in Chinese financial market, analyzes volatility characteristics of intraday high-frequency price data. In the new generalized Barndorff-Nielsen and Shephard model, the lag caused by asynchrony of market information and market microstructure noises are considered, and the problem of lack of long-term dependence is solved. To speed up the valuation process, several machine learning and deep learning algorithms are used to estimate parameter and evaluate forecast results. Tracking historical jumps of different magnitudes offers promising avenues for simulating dynamic price processes and predicting future jumps. Numerical results show that the deterministic component of stochastic volatility processes would always be captured over short and longer-term windows. Research finding could be suitable for influence investors and regulators interested in predicting market dynamics based on high-frequency realized volatility.
Low-Latency Speech Separation Guided Diarization for Telephone Conversations

In this paper, we carry out an analysis on the use of speech separation guided diarization (SSGD) in telephone conversations. SSGD performs diarization by separating the speakers signals and then applying voice activity detection on each estimated speaker signal. In particular, we compare two low-latency speech separation models. Moreover, we show a post-processing algorithm that significantly reduces the false alarm errors of a SSGD pipeline. We perform our experiments on two datasets: Fisher Corpus Part 1 and CALLHOME, evaluating both separation and diarization metrics. Notably, our SSGD DPRNN-based online model achieves 11.1% DER on CALL-HOME, comparable with most state-of-the-art end-to-end neural diarization models despite being trained on an order of magnitude less data and having considerably lower latency, i.e., 0.1 vs. 10 seconds. We also show that the separated signals can be readily fed to a speech recognition back-end with performance close to the oracle source signals.
A Structural Model for Detecting Communities in Networks

The objective of this paper is to identify and analyze the response actions of a set of players embedded in sub-networks in the context of interaction and learning. We characterize strategic network formation as a static game of interactions where players maximize their utility depending on the connections they establish and multiple interdependent actions that permit group-specific parameters of players. It is challenging to apply this type of model to real-life scenarios for two reasons: The computation of the Bayesian Nash Equilibrium is highly demanding and the identification of social influence requires the use of excluded variables that are oftentimes unavailable. Based on the theoretical proposal, we propose a set of simulant equations and discuss the identification of the social interaction effect employing multi-modal network autoregressive.
Convergence and Complexity of an Adaptive Planewave Method for Eigenvalue Computations

In this paper, we study the adaptive planewave discretization for a cluster of eigenvalues of second-order elliptic partial differential equations. We first design an a posteriori error estimator and prove both the upper and lower bounds. Based on the a posteriori error estimator, we propose an adaptive planewave method. We then prove that the adaptive planewave approximations have the linear convergence rate and quasi-optimal complexity.
Gas dynamics in the inner few AU around the Herbig B[e] star MWC297: Indications of a disk wind from kinematic modeling and velocity-resolved interferometric imaging

We present near-infrared AMBER (R = 12, 000) and CRIRES (R = 100, 000) observations of the Herbig B[e] star MWC297 in the hydrogen Br-gamma-line. Using the VLTI unit telescopes, we obtained a uv-coverage suitable for aperture synthesis imaging. We interpret our velocity-resolved images as well as the derived two-dimensional photocenter displacement vectors, and fit kinematic models to our visibility and phase data in order to constrain the gas velocity field on sub-AU scales. The measured continuum visibilities constrain the orientation of the near-infrared-emitting dust disk, where we determine that the disk major axis is oriented along a position angle of 99.6 +/- 4.8 degrees. The near-infrared continuum emission is 3.6 times more compact than the expected dust-sublimation radius, possibly indicating the presence of highly refractory dust grains or optically thick gas emission in the inner disk. Our velocity-resolved channel maps and moment maps reveal the motion of the Br-gamma-emitting gas in six velocity channels, marking the first time that kinematic effects in the sub-AU inner regions of a protoplanetary disk could be directly imaged. We find a rotation-dominated velocity field, where the blue- and red-shifted emissions are displaced along a position angle of 24 +/- 3 degrees and the approaching part of the disk is offset west of the star. The visibility drop in the line as well as the strong non-zero phase signals can be modeled reasonably well assuming a Keplerian velocity field, although this model is not able to explain the 3 sigma difference that we measure between the position angle of the line photocenters and the position angle of the dust disk. We find that the fit can be improved by adding an outflowing component to the velocity field, as inspired by a magneto-centrifugal disk-wind scenario.
Training with More Confidence: Mitigating Injected and Natural Backdoors During Training

The backdoor or Trojan attack is a severe threat to deep neural networks (DNNs). Researchers find that DNNs trained on benign data and settings can also learn backdoor behaviors, which is known as the natural backdoor. Existing works on anti-backdoor learning are based on weak observations that the backdoor and benign behaviors can differentiate during training. An adaptive attack with slow poisoning can bypass such defenses. Moreover, these methods cannot defend natural backdoors. We found the fundamental differences between backdoor-related neurons and benign neurons: backdoor-related neurons form a hyperplane as the classification surface across input domains of all affected labels. By further analyzing the training process and model architectures, we found that piece-wise linear functions cause this hyperplane surface. In this paper, we design a novel training method that forces the training to avoid generating such hyperplanes and thus remove the injected backdoors. Our extensive experiments on five datasets against five state-of-the-art attacks and also benign training show that our method can outperform existing state-of-the-art defenses. On average, the ASR (attack success rate) of the models trained with NONE is 54.83 times lower than undefended models under standard poisoning backdoor attack and 1.75 times lower under the natural backdoor attack. Our code is available at https://github.com/RU-System-Software-and-Security/NONE.
Spontaneous 
CP
 violation and the strong 
CP
 problem in left-right symmetric theories

We study spontaneous CP violation as a solution to the strong CP problem in left-right symmetric theories. The discrete CP symmetry is broken by a complex vacuum expectation value of a right-handed Higgs doublet. Heavy vectorlike down-type quarks mix with the Standard Model quarks introducing the known CP violation - realizing a variant of the Nelson-Barr mechanism. A nonvanishing QCD vacuum angle is generated at loop level. The implementation in the ultraviolet complete theory of trinification at low scales is discussed. We further comment on the phenomenology and future testability of the model.