Miracle-dz/UniFAR-FTUs huggingface dataset:
Adversarial Attacks on Online Learning to Rank with Stochastic Click Models

We propose the first study of adversarial attacks on online learning to rank. The goal of the adversary is to misguide the online learning to rank algorithm to place the target item on top of the ranking list linear times to time horizon $T$ with a sublinear attack cost. We propose generalized list poisoning attacks that perturb the ranking list presented to the user. This strategy can efficiently attack any no-regret ranker in general stochastic click models. Furthermore, we propose a click poisoning-based strategy named attack-then-quit that can efficiently attack two representative OLTR algorithms for stochastic click models. We theoretically analyze the success and cost upper bound of the two proposed methods. Experimental results based on synthetic and real-world data further validate the effectiveness and cost-efficiency of the proposed attack strategies.
Combining Matrix Product States and Noisy Quantum Computers for Quantum Simulation

Matrix Product States (MPS) and Operators (MPO) have been proven to be a powerful tool to study quantum many-body systems but are restricted to moderately entangled states as the number of parameters scales exponentially with the entanglement entropy. While MPS can efficiently find ground states of 1D systems, their capacities are limited when simulating their dynamics, where the entanglement can increase ballistically with time. On the other hand, quantum devices appear as a natural platform to encode and perform the time evolution of correlated many-body states. However, accessing the regime of long-time dynamics is hampered by quantum noise. In this study we use the best of worlds: the short-time dynamics is efficiently performed by MPSs, compiled into short-depth quantum circuits, and is performed further in time on a quantum computer thanks to efficient MPO-optimized quantum circuits. We quantify the capacities of this hybrid classical-quantum scheme in terms of fidelities taking into account a noise model. We show that using classical knowledge in the form of tensor networks provides a way to better use limited quantum resources and lowers drastically the noise requirements to reach a practical quantum advantage. Finally we successfully demonstrate our approach with an experimental realization of the technique. Combined with efficient circuit transpilation we simulate a 10-qubit system on an actual quantum device over a longer time scale than low-bond-dimension MPSs and purely quantum Trotter evolution.
Key-Value Transformer

Transformers have emerged as the prevailing standard solution for various AI tasks, including computer vision and natural language processing. The widely adopted Query, Key, and Value formulation (QKV) has played a significant role in this. Nevertheless, no research has examined the essentiality of these three components for transformer performance. Therefore, we conducted an evaluation of the key-value formulation (KV), which generates symmetric attention maps, along with an asymmetric version that incorporates a 2D positional encoding into the attention matrix. Remarkably, this transformer requires fewer parameters and computation than the original one. Through experiments encompassing three task types -- synthetics (such as reversing or sorting a list), vision (mnist or cifar classification), and NLP (character generation and translation) -- we discovered that the KV transformer occasionally outperforms the QKV transformer. However, it also exhibits instances of underperformance compared to QKV, making it challenging to draw a definitive conclusion. Nonetheless, we consider the reported results to be encouraging and anticipate that they may pave the way for more efficient transformers in the future.
Witnessing environment dimension through temporal correlations

We introduce a framework to compute upper bounds for temporal correlations achievable in open quantum system dynamics, obtained by repeated measurements on the system. As these correlations arise by virtue of the environment acting as a memory resource, such bounds are witnesses for the minimal dimension of an effective environment compatible with the observed statistics. These witnesses are derived from a hierarchy of semidefinite programs with guaranteed asymptotic convergence. We compute non-trivial bounds for various sequences involving a qubit system and a qubit environment, and compare the results to the best known quantum strategies producing the same outcome sequences. Our results provide a numerically tractable method to determine bounds on multi-time probability distributions in open quantum system dynamics and allow for the witnessing of effective environment dimensions through probing of the system alone.
On Optimal Regularization Parameters via Bilevel Learning

Variational regularization is commonly used to solve linear inverse problems, and involves augmenting a data fidelity by a regularizer. The regularizer is used to promote a priori information and is weighted by a regularization parameter. Selection of an appropriate regularization parameter is critical, with various choices leading to very different reconstructions. Classical strategies used to determine a suitable parameter value include the discrepancy principle and the L-curve criterion, and in recent years a supervised machine learning approach called bilevel learning has been employed. Bilevel learning is a powerful framework to determine optimal parameters and involves solving a nested optimization problem. While previous strategies enjoy various theoretical results, the well-posedness of bilevel learning in this setting is still an open question. In particular, a necessary property is positivity of the determined regularization parameter. In this work, we provide a new condition that better characterizes positivity of optimal regularization parameters than the existing theory. Numerical results verify and explore this new condition for both small and high-dimensional problems.
Behavioral Causal Inference

When inferring the causal effect of one variable on another from correlational data, a common practice by professional researchers as well as lay decision makers is to control for some set of exogenous confounding variables. Choosing an inappropriate set of control variables can lead to erroneous causal inferences. This paper presents a model of lay decision makers who use long-run observational data to learn the causal effect of their actions on a payoff-relevant outcome. Different types of decision makers use different sets of control variables. I obtain upper bounds on the equilibrium welfare loss due to wrong causal inferences, for various families of data-generating processes. The bounds depend on the structure of the type space. When types are"ordered"in a certain sense, the equilibrium condition greatly reduces the cost of wrong causal inference due to poor controls.
A Tale of Two Laws of Semantic Change: Predicting Synonym Changes with Distributional Semantic Models

Lexical Semantic Change is the study of how the meaning of words evolves through time. Another related question is whether and how lexical relations over pairs of words, such as synonymy, change over time. There are currently two competing, apparently opposite hypotheses in the historical linguistic literature regarding how synonymous words evolve: the Law of Differentiation (LD) argues that synonyms tend to take on different meanings over time, whereas the Law of Parallel Change (LPC) claims that synonyms tend to undergo the same semantic change and therefore remain synonyms. So far, there has been little research using distributional models to assess to what extent these laws apply on historical corpora.In this work, we take a first step toward detecting whether LD or LPC operates for given word pairs. After recasting the problem into a more tractable task, we combine two linguistic resources to propose the first complete evaluation framework on this problem and provide empirical evidence in favor of a dominance of LD. We then propose various computational approaches to the problem using Distributional Semantic Models and grounded in recent literature on Lexical Semantic Change detection. Our best approaches achieve a balanced accuracy above 0.6 on our dataset. We discuss challenges still faced by these approaches, such as polysemy or the potential confusion between synonymy and hypernymy.
Rapid identification of time-frequency domain gravitational wave signals from binary black holes using deep learning

Recent developments in deep learning techniques have offered an alternative and complementary approach to traditional matched filtering methods for the identification of gravitational wave (GW) signals. The rapid and accurate identification of GW signals is crucial for the progress of GW physics and multi-messenger astronomy, particularly in light of the upcoming fourth and fifth observing runs of LIGO-Virgo-KAGRA. In this work, we use the 2D U-Net algorithm to identify the time-frequency domain GW signals from stellar-mass binary black hole (BBH) mergers. We simulate BBH mergers with component masses from 5 to 80 $M_{\odot}$ and account for the LIGO detector noise. We find that the GW events in the first and second observation runs could all be clearly and rapidly identified. For the third observing run, about $80\%$ GW events could be identified. In particular, GW190814, currently unknown, is a special case that can be identified by the network, while other binary neutron star mergers and neutron star-black hole mergers can not be identified. Compared to the traditional convolutional neural network, the U-Net algorithm can output the time-frequency domain signal images rather than probabilities, providing a more intuitive investigation. Moreover, some of the results through U-Net can provide preliminary inference on the chirp mass information. In conclusion, the U-Net algorithm can rapidly identify the time-frequency domain GW signals from BBH mergers and potentially be helpful for future parameter inferences.
Data Augmentation Methods of Parameter Identification of a Dynamic Model for Harbor Maneuvers

A dynamic model for an automatic berthing and unberthing controller has to estimate harbor maneuvers, which include berthing, unberthing, approach maneuvers to berths, and entering and leaving the port. When the dynamic model is estimated by the system identification, a large number of tests or trials are required to measure the various motions of harbor maneuvers. However, the amount of data that can be obtained is limited due to the high costs and time-consuming nature of full-scale ship trials. In this paper, we improve the generalization performance of the dynamic model for the automatic berthing and unberthing controller by introducing data augmentation. This study used slicing and jittering as data augmentation methods and confirmed their effectiveness by numerical experiments using the free-running model tests. The dynamic model is represented by a neural network-based model in numerical experiments. Results of numerical experiments demonstrated that slicing and jittering are effective data augmentation methods but could not improve generalization performance for extrapolation states of the original dataset.
Microfluidics Generation of Millimeter-sized Matrigel Droplets

Significant progress has been made to increase access to droplet microfluidics for labs with limited microfluidics expertise or fabrication equipment. In particular, using off-the-shelf systems has been a valuable approach. However, the ability to modify a channel design and, thus, the functional characteristics of the system is of great value. In this work, we describe the development of co-flow microfluidics and their fabrication methods for generating uniform millimeter-sized (0.5 - 2 mm) hydrogel droplets. Two complementary approaches based on desktop CO2 laser cutting were developed to prototype and build durable co-flow droplet microfluidics. After demonstrating the co-flow systems, water-in-oil experiments and dimensionless number analysis were used to examine the operational characteristics of the system. Specifically, the Capillary number analysis indicated that millimeter-sized droplet generators operated in the desirable geometry-controlled regime despite their length scales being larger than traditional microfluidics systems. Next, the tunable generation of Matrigel droplets was demonstrated. By adjusting the relative flow rates, the droplet size could be tuned. Finally, we demonstrated fibroblast encapsulation and cell viability for up to 7 days as a proof-of-concept experiment. The systems presented are simple and effective tools to generate robust hydrogel droplets and increase the accessibility of this technology to teaching labs or research settings with limited resources or access to microfluidics.
A Recipe for Efficient SBIR Models: Combining Relative Triplet Loss with Batch Normalization and Knowledge Distillation

Sketch-Based Image Retrieval (SBIR) is a crucial task in multimedia retrieval, where the goal is to retrieve a set of images that match a given sketch query. Researchers have already proposed several well-performing solutions for this task, but most focus on enhancing embedding through different approaches such as triplet loss, quadruplet loss, adding data augmentation, and using edge extraction. In this work, we tackle the problem from various angles. We start by examining the training data quality and show some of its limitations. Then, we introduce a Relative Triplet Loss (RTL), an adapted triplet loss to overcome those limitations through loss weighting based on anchors similarity. Through a series of experiments, we demonstrate that replacing a triplet loss with RTL outperforms previous state-of-the-art without the need for any data augmentation. In addition, we demonstrate why batch normalization is more suited for SBIR embeddings than l2-normalization and show that it improves significantly the performance of our models. We further investigate the capacity of models required for the photo and sketch domains and demonstrate that the photo encoder requires a higher capacity than the sketch encoder, which validates the hypothesis formulated in [34]. Then, we propose a straightforward approach to train small models, such as ShuffleNetv2 [22] efficiently with a marginal loss of accuracy through knowledge distillation. The same approach used with larger models enabled us to outperform previous state-of-the-art results and achieve a recall of 62.38% at k = 1 on The Sketchy Database [30].
Graph Neural Networks for Contextual ASR with the Tree-Constrained Pointer Generator

The incorporation of biasing words obtained through contextual knowledge is of paramount importance in automatic speech recognition (ASR) applications. This paper proposes an innovative method for achieving end-to-end contextual ASR using graph neural network (GNN) encodings based on the tree-constrained pointer generator method. GNN node encodings facilitate lookahead for future word pieces in the process of ASR decoding at each tree node by incorporating information about all word pieces on the tree branches rooted from it. This results in a more precise prediction of the generation probability of the biasing words. The study explores three GNN encoding techniques, namely tree recursive neural networks, graph convolutional network (GCN), and GraphSAGE, along with different combinations of the complementary GCN and GraphSAGE structures. The performance of the systems was evaluated using the Librispeech and AMI corpus, following the visual-grounded contextual ASR pipeline. The findings indicate that using GNN encodings achieved consistent and significant reductions in word error rate (WER), particularly for words that are rare or have not been seen during the training process. Notably, the most effective combination of GNN encodings obtained more than 60% WER reduction for rare and unseen words compared to standard end-to-end systems.
Principal eigenvalues for Fully non linear singular or degenerate operators in punctured balls

This paper is devoted to the proof of the existence of the principal eigenvalue and related eigenfunctions for fully nonlinear degenerate or singular uniformly elliptic equations posed in a punctured ball, in presence of a singular potential. More precisely, we analyze existence, uniqueness and regularity of solutions $( \bar\lambda_\gamma, u_\gamma)$ of the equation $$| \nabla u |^\alpha F( D^2 u_\gamma)+ \bar \lambda_\gamma {u_\gamma^{1+\alpha} \over r^\gamma} = 0\ {\rm in} \ B(0,1)\setminus \{0\}, \ u_\gamma = 0 \ {\rm on} \ \partial B(0,1)$$ where $u_\gamma>0$ in $B(0,1)$, $\alpha>-1$ and $\gamma>0$. We prove existence of radial solutions which are continuous on $\overline{ B(0,1)}$ in the case $\gamma<2+\alpha$, existence of unbounded solutions which do ot satisfy the boundary condition in the case $\gamma = 2+\alpha $ and a non existence result for $\gamma>2+\alpha$. We also give the explicit value of $\bar \lambda_{2+\alpha} $ in the case of Pucci's operators, which generalizes the Hardy--Sobolev constant for the Laplacian, and the previous results of Birindelli, Demengel and Leoni
Neural Task Synthesis for Visual Programming

Generative neural models hold great promise in enhancing programming education by synthesizing new content. We seek to design neural models that can automatically generate programming tasks for a given specification in the context of visual programming domains. Despite the recent successes of large generative models like GPT-4, our initial results show that these models are ineffective in synthesizing visual programming tasks and struggle with logical and spatial reasoning. We propose a novel neuro-symbolic technique, NeurTaskSyn, that can synthesize programming tasks for a specification given in the form of desired programming concepts exercised by its solution code and constraints on the visual task. NeurTaskSyn has two components: the first component is trained via imitation learning procedure to generate possible solution codes, and the second component is trained via reinforcement learning procedure to guide an underlying symbolic execution engine that generates visual tasks for these codes. We demonstrate the effectiveness of NeurTaskSyn through an extensive empirical evaluation and a qualitative study on reference tasks taken from the Hour of Code: Classic Maze challenge by Code-dot-org and the Intro to Programming with Karel course by CodeHS-dot-com.
An Optimization-based Approach To Node Role Discovery in Networks: Approximating Equitable Partitions

Similar to community detection, partitioning the nodes of a network according to their structural roles aims to identify fundamental building blocks of a network. The found partitions can be used, e.g., to simplify descriptions of the network connectivity, to derive reduced order models for dynamical processes unfolding on processes, or as ingredients for various graph mining tasks. In this work, we offer a fresh look on the problem of role extraction and its differences to community detection and present a definition of node roles related to graph-isomorphism tests, the Weisfeiler-Leman algorithm and equitable partitions. We study two associated optimization problems (cost functions) grounded in ideas from graph isomorphism testing, and present theoretical guarantees associated to the solutions of these problems. Finally, we validate our approach via a novel"role-infused partition benchmark", a network model from which we can sample networks in which nodes are endowed with different roles in a stochastic way.
RLAD: Reinforcement Learning from Pixels for Autonomous Driving in Urban Environments

Current approaches of Reinforcement Learning (RL) applied in urban Autonomous Driving (AD) focus on decoupling the perception training from the driving policy training. The main reason is to avoid training a convolution encoder alongside a policy network, which is known to have issues related to sample efficiency, degenerated feature representations, and catastrophic self-overfitting. However, this paradigm can lead to representations of the environment that are not aligned with the downstream task, which may result in suboptimal performances. To address this limitation, this paper proposes RLAD, the first Reinforcement Learning from Pixels (RLfP) method applied in the urban AD domain. We propose several techniques to enhance the performance of an RLfP algorithm in this domain, including: i) an image encoder that leverages both image augmentations and Adaptive Local Signal Mixing (A-LIX) layers; ii) WayConv1D, which is a waypoint encoder that harnesses the 2D geometrical information of the waypoints using 1D convolutions; and iii) an auxiliary loss to increase the significance of the traffic lights in the latent representation of the environment. Experimental results show that RLAD significantly outperforms all state-of-the-art RLfP methods on the NoCrash benchmark. We also present an infraction analysis on the NoCrash-regular benchmark, which indicates that RLAD performs better than all other methods in terms of both collision rate and red light infractions.
The Magic of IF: Investigating Causal Reasoning Abilities in Large Language Models of Code

Causal reasoning, the ability to identify cause-and-effect relationship, is crucial in human thinking. Although large language models (LLMs) succeed in many NLP tasks, it is still challenging for them to conduct complex causal reasoning like abductive reasoning and counterfactual reasoning. Given the fact that programming code may express causal relations more often and explicitly with conditional statements like ``if``, we want to explore whether Code-LLMs acquire better causal reasoning abilities. Our experiments show that compared to text-only LLMs, Code-LLMs with code prompts are significantly better in causal reasoning. We further intervene on the prompts from different aspects, and discover that the programming structure is crucial in code prompt design, while Code-LLMs are robust towards format perturbations.
Dual control variate for faster black-box variational inference

Black-box variational inference is a widely-used framework for Bayesian posterior inference, but in some cases suffers from high variance in gradient estimates, harming accuracy and efficiency. This variance comes from two sources of randomness: Data subsampling and Monte Carlo sampling. Whereas existing control variates only address Monte Carlo noise and incremental gradient methods typically only address data subsampling, we propose a new"dual"control variate capable of jointly reducing variance from both sources of noise. We confirm that this leads to reduced variance and improved optimization in several real-world applications.
Parity-time-symmetric two-qubit system: entanglement and sensing

In this paper we study exceptional-point (EP) effects and quantum sensing in a parity-time (PT)-symmetric two-qubit system with the Ising-type interaction. We explore EP properties of the system by analyzing degeneracy of energy eigenvalues or entanglement of eigenstates. We investigate entanglement dynamics of the two qubits in detail. In particular, we demonstrate that the system can create the steady-state entanglement in the PT-broken phase and collapse-revival phenomenon of entanglement in the PT-symmetric phase during the long-time evolution. We show that entanglement can be generated more quickly than the corresponding Hermitian system. Finally, we prove that the sensitivity of eigenstate quantum sensing for the parameters exhibits the remarkable enharncement at EPs, and propose a quantum-coherence measurement to witness the existence of EPs.