Miracle-dz/UniFAR-FTUs huggingface dataset:
Dynamical Linear Bandits

In many real-world sequential decision-making problems, an action does not immediately reflect on the feedback and spreads its effects over a long time frame. For instance, in online advertising, investing in a platform produces an instantaneous increase of awareness, but the actual reward, i.e., a conversion, might occur far in the future. Furthermore, whether a conversion takes place depends on: how fast the awareness grows, its vanishing effects, and the synergy or interference with other advertising platforms. Previous work has investigated the Multi-Armed Bandit framework with the possibility of delayed and aggregated feedback, without a particular structure on how an action propagates in the future, disregarding possible dynamical effects. In this paper, we introduce a novel setting, the Dynamical Linear Bandits (DLB), an extension of the linear bandits characterized by a hidden state. When an action is performed, the learner observes a noisy reward whose mean is a linear function of the hidden state and of the action. Then, the hidden state evolves according to linear dynamics, affected by the performed action too. We start by introducing the setting, discussing the notion of optimal policy, and deriving an expected regret lower bound. Then, we provide an optimistic regret minimization algorithm, Dynamical Linear Upper Confidence Bound (DynLin-UCB), that suffers an expected regret of order $\widetilde{\mathcal{O}} \Big( \frac{d \sqrt{T}}{(1-\overline{\rho})^{3/2}} \Big)$, where $\overline{\rho}$ is a measure of the stability of the system, and $d$ is the dimension of the action vector. Finally, we conduct a numerical validation on a synthetic environment and on real-world data to show the effectiveness of DynLin-UCB in comparison with several baselines.
New Frontiers in Graph Autoencoders: Joint Community Detection and Link Prediction

Graph autoencoders (GAE) and variational graph autoencoders (VGAE) emerged as powerful methods for link prediction (LP). Their performances are less impressive on community detection (CD), where they are often outperformed by simpler alternatives such as the Louvain method. It is still unclear to what extent one can improve CD with GAE and VGAE, especially in the absence of node features. It is moreover uncertain whether one could do so while simultaneously preserving good performances on LP in a multi-task setting. In this workshop paper, summarizing results from our journal publication (Salha-Galvan et al. 2022), we show that jointly addressing these two tasks with high accuracy is possible. For this purpose, we introduce a community-preserving message passing scheme, doping our GAE and VGAE encoders by considering both the initial graph and Louvain-based prior communities when computing embedding spaces. Inspired by modularity-based clustering, we further propose novel training and optimization strategies specifically designed for joint LP and CD. We demonstrate the empirical effectiveness of our approach, referred to as Modularity-Aware GAE and VGAE, on various real-world graphs.
Empirical Study on Optimizer Selection for Out-of-Distribution Generalization

Modern deep learning systems do not generalize well when the test data distribution is slightly different to the training data distribution. While much promising work has been accomplished to address this fragility, a systematic study of the role of optimizers and their out-of-distribution generalization performance has not been undertaken. In this study, we examine the performance of popular first-order optimizers for different classes of distributional shift under empirical risk minimization and invariant risk minimization. We address this question for image and text classification using DomainBed, WILDS, and Backgrounds Challenge as testbeds for studying different types of shifts -- namely correlation and diversity shift. We search over a wide range of hyperparameters and examine classification accuracy (in-distribution and out-of-distribution) for over 20,000 models. We arrive at the following findings, which we expect to be helpful for practitioners: i) adaptive optimizers (e.g., Adam) perform worse than non-adaptive optimizers (e.g., SGD, momentum SGD) on out-of-distribution performance. In particular, even though there is no significant difference in in-distribution performance, we show a measurable difference in out-of-distribution performance. ii) in-distribution performance and out-of-distribution performance exhibit three types of behavior depending on the dataset -- linear returns, increasing returns, and diminishing returns. For example, in the training of natural language data using Adam, fine-tuning the performance of in-distribution performance does not significantly contribute to the out-of-distribution generalization performance.
The Liouville theorem for a class of Fourier multipliers and its connection to coupling

The classical Liouville property says that all bounded harmonic functions in $\mathbb{R}^n$, i.e.\ all bounded functions satisfying $\Delta f = 0$, are constant. In this paper we obtain necessary and sufficient conditions on the symbol of a Fourier multiplier operator $m(D)$, such that the solutions $f$ to $m(D)f=0$ are Lebesgue a.e. \ constant (if $f$ is bounded) or coincide Lebesgue a.e. \ with a polynomial (if $f$ grows like a polynomial). The class of Fourier multipliers includes the (in general non-local) generators of L\'evy processes. For generators of L\'evy processes we obtain necessary and sufficient conditions for a strong Liouville theorem where $f$ is positive and grows at most exponentially fast. As an application of our results above we prove a coupling result for space-time L\'evy processes.
L2 proficiency assessment using self-supervised speech representations

There has been a growing demand for automated spoken language assessment systems in recent years. A standard pipeline for this process is to start with a speech recognition system and derive features, either hand-crafted or based on deep-learning, that exploit the transcription and audio. Though these approaches can yield high performance systems, they require speech recognition systems that can be used for L2 speakers, and preferably tuned to the specific form of test being deployed. Recently a self-supervised speech representation based scheme, requiring no speech recognition, was proposed. This work extends the initial analysis conducted on this approach to a large scale proficiency test, Linguaskill, that comprises multiple parts, each designed to assess different attributes of a candidate's speaking proficiency. The performance of the self-supervised, wav2vec 2.0, system is compared to a high performance hand-crafted assessment system and a BERT-based text system both of which use speech transcriptions. Though the wav2vec 2.0 based system is found to be sensitive to the nature of the response, it can be configured to yield comparable performance to systems requiring a speech transcription, and yields gains when appropriately combined with standard approaches.
Using Auxiliary Information for Person Re-Identification - A Tutorial Overview

Person re-identification (re-id) is a pivotal task within an intelligent surveillance pipeline and there exist numerous re-id frameworks that achieve satisfactory performance in challenging benchmarks. However, these systems struggle to generate acceptable results when there are significant differences between the camera views, illumination conditions, or occlusions. This result can be attributed to the deficiency that exists within many recently proposed re-id pipelines where they are predominately driven by appearance-based features and little attention is paid to other auxiliary information that could aid the re-id. In this paper, we systematically review the current State-Of-The-Art (SOTA) methods in both uni-modal and multimodal person re-id. Extending beyond a conceptual framework, we illustrate how the existing SOTA methods can be extended to support these additional auxiliary information and quantitatively evaluate the utility of such auxiliary feature information, ranging from logos printed on the objects carried by the subject or printed on the clothes worn by the subject, through to his or her behavioural trajectories. To the best of our knowledge, this is the first work that explores the fusion of multiple information to generate a more discriminant person descriptor and the principal aim of this paper is to provide a thorough theoretical analysis regarding the implementation of such a framework. In addition, using model interpretation techniques, we validate the contributions from different combinations of the auxiliary information versus the original features that the SOTA person re-id models extract. We outline the limitations of the proposed approaches and propose future research directions that could be pursued to advance the area of multi-modal person re-id.
Calibration of hybrid resolved star formation rate recipes based on PHANGS-MUSE Halpha and Hbeta maps

Mapping star-formation rates (SFR) within galaxies is key to unveiling their assembly and evolution. Calibrations exist for computing SFR from a combination of ultraviolet and infrared bands for galaxies as integrated systems, but their applicability to sub-galactic (kpc) scales remains largely untested. Here we use integral field spectroscopy of 19 nearby ($D<$ 20 Mpc) galaxies obtained by PHANGS-MUSE to derive accurate Balmer decrements (H$\alpha$/H$\beta$) and attenuation-corrected H$\alpha$ maps. We combine this information with mid-infrared maps from WISE at 22 $\rm \mu m$, and ultraviolet maps from GALEX in the far-UV band, to derive SFR surface densities in nearby galaxies on resolved (kpc) scales. Using the H$\alpha$ attenuation-corrected SFR as a reference, we find that hybrid recipes from the literature overestimate the SFR in regions of low SFR surface density, low specific star-formation rate (sSFR), low attenuation and old stellar ages. We attribute these trends to heating of the dust by old stellar populations (IR cirrus). We calibrate this effect by proposing functional forms for the coefficients in front of the IR term which depend on band ratios sensitive to the sSFR. These calibrations prove reliable as a function of physical scale. In particular, they agree within 10% with the attenuation corrections computed from the Balmer decrement on 100 pc scales. Despite small quantitative differences, our calibrations are also applicable to integrated galaxy scales probed by the MaNGA survey, albeit with a larger scatter (up to 0.22 dex). Observations with JWST open up the possibility to calibrate these relations in nearby galaxies with cloud-scale ($\sim$100 pc) resolution mid-IR imaging.
N2V2 - Fixing Noise2Void Checkerboard Artifacts with Modified Sampling Strategies and a Tweaked Network Architecture

In recent years, neural network based image denoising approaches have revolutionized the analysis of biomedical microscopy data. Self-supervised methods, such as Noise2Void (N2V), are applicable to virtually all noisy datasets, even without dedicated training data being available. Arguably, this facilitated the fast and widespread adoption of N2V throughout the life sciences. Unfortunately, the blind-spot training underlying N2V can lead to rather visible checkerboard artifacts, thereby reducing the quality of final predictions considerably. In this work, we present two modifications to the vanilla N2V setup that both help to reduce the unwanted artifacts considerably. Firstly, we propose a modified network architecture, i.e., using BlurPool instead of MaxPool layers throughout the used U-Net, rolling back the residual U-Net to a non-residual U-Net, and eliminating the skip connections at the uppermost U-Net level. Additionally, we propose new replacement strategies to determine the pixel intensity values that fill in the elected blind-spot pixels. We validate our modifications on a range of microscopy and natural image data. Based on added synthetic noise from multiple noise types and at varying amplitudes, we show that both proposed modifications push the current state-of-the-art for fully self-supervised image denoising.
Bayesian Fixed-Budget Best-Arm Identification

Fixed-budget best-arm identification (BAI) is a bandit problem where the agent maximizes the probability of identifying the optimal arm within a fixed budget of observations. In this work, we study this problem in the Bayesian setting. We propose a Bayesian elimination algorithm and derive an upper bound on its probability of misidentifying the optimal arm. The bound reflects the quality of the prior and is the first distribution-dependent bound in this setting. We prove it using a frequentist-like argument, where we carry the prior through, and then integrate out the bandit instance at the end. We also provide a lower bound on the probability of misidentification in a $2$-armed Bayesian bandit and show that our upper bound (almost) matches it for any budget. Our experiments show that Bayesian elimination is superior to frequentist methods and competitive with the state-of-the-art Bayesian algorithms that have no guarantees in our setting.
Tailoring On-Surface Molecular Reactions and Assembly through Hydrogen-Modified Synthesis: From Triarylamine Monomer to 2D Covalent Organic Framework

Relative to conventional wet-chemical synthesis techniques, on-surface synthesis of organic networks in ultrahigh vacuum has few control parameters. The molecular deposition rate and substrate temperature are typically the only synthesis variables to be adjusted dynamically. Here we demonstrate that reducing conditions in the vacuum environment can be created and controlled without dedicated sources—relying only on backfilled hydrogen gas and ion gauge filaments—and can dramatically influence the Ullmann-like on-surface reaction used for synthesizing two-dimensional covalent organic frameworks (2D COFs). Using tribromo dimethylmethylene-bridged triphenylamine ((Br3)DTPA) as monomer precursors, we find that atomic hydrogen (H•) blocks aryl–aryl bond formation to such an extent that we suspect this reaction may be a factor in limiting the ultimate size of 2D COFs created through on-surface synthesis. Conversely, we show that control of the relative monomer and hydrogen fluxes can be used to produce large self-assembled islands of monomers, dimers, or macrocycle hexamers, which are of interest in their own right. On-surface synthesis of oligomers, from a single precursor, circumvents potential challenges with their protracted wet-chemical synthesis and with multiple deposition sources. Using scanning tunneling microscopy and spectroscopy (STM/STS), we show that changes in the electronic states through this oligomer sequence provide an insightful view of the 2D COF (synthesized in the absence of atomic hydrogen) as the end point in an evolution of electronic structures from the monomer.
Masked Reconstruction Contrastive Learning with Information Bottleneck Principle

Contrastive learning (CL) has shown great power in self-supervised learning due to its ability to capture insight correlations among large-scale data. Current CL models are biased to learn only the ability to discriminate positive and negative pairs due to the discriminative task setting. However, this bias would lead to ignoring its sufﬁ-ciency for other downstream tasks, which we call the discriminative information overﬁtting problem. In this paper, we propose to tackle the above problems from the aspect of the Information Bottleneck (IB) principle, further pushing forward the frontier of CL. Speciﬁcally, we present a new perspective that CL is an instantiation of the IB principle, including information compression and expression. We theoretically analyze the optimal information situation and demonstrate that minimum sufﬁcient augmentation and information-generalized representation are the optimal requirements for achieving maximum compression and generalizability to downstream tasks. Therefore, we propose the Masked Reconstruction Contrastive Learning (MRCL) model to improve CL models. For implementation in prac-tice, MRCL utilizes the masking operation for stronger augmentation, further eliminating redundant and noisy information. In order to alleviate the discriminative information overﬁtting problem effectively, we employ the reconstruction task to regularize the discriminative task. We conduct comprehensive experiments and show the superiority of the proposed model on multiple tasks, including image classiﬁ-*
A Combinational Multi-Kernel Decoder for Polar Codes

Polar codes have been selected as the channel coding scheme for control channel in the fifth generation (5G) communication system thanks to their capacity achieving characteristics. However, the traditional polar codes support only codes constructed by binary (2x2) kernel which limits the code lengths to powers of 2. Multi-kernel polar codes are proposed to achieve flexible block length. In this paper, the first combinational decoder for multi-kernel polar codes based on successive cancellation algorithm is proposed. The proposed decoder can decode pure-binary and binary-ternary (3x3) mixed polar codes. The architecture is rate-flexible with the capability of online rate assignment and supports any kernel sequences. The FPGA implementation results reveal that for a code of length N = 48, the coded throughput of 812.1 Mbps can be achieved.
Correlation of viral loads in disease transmission chains could bias early estimates of the reproduction number

Early estimates of the transmission properties of a newly emerged pathogen are critical to an effective public health response, and are often based on limited outbreak data. Here, we use simulations to investigate a potential source of bias in such estimates, arising from correlations between the viral load of cases in transmission chains. We show that this mechanism can affect estimates of fundamental transmission properties characterising the spread of a virus. Our computational model simulates a disease transmission mechanism in which the viral load of the infector at the time of transmission influences the infectiousness of the infectee. These correlations in transmission pairs produce a population-level decoherence process during which the distributions of initial viral loads in each subsequent generation converge to a steady state. We find that outbreaks arising from index cases with low initial viral loads give rise to early estimates of transmission properties that are subject to large biases. These findings demonstrate the potential for bias arising from transmission mechanics to affect estimates of the transmission properties of newly emerged viruses.
Cognitive Simplification Operations Improve Text Simplification

Text Simplification (TS) is the task of converting a text into a form that is easier to read while maintaining the meaning of the original text. A sub-task of TS is Cognitive Simplification (CS), converting text to a form that is readily understood by people with cognitive disabilities without rendering it childish or simplistic. This sub-task has yet to be explored with neural methods in NLP, and resources for it are scarcely available. In this paper, we present a method for incorporating knowledge from the cognitive accessibility domain into a TS model, by introducing an inductive bias regarding what simplification operations to use. We show that by adding this inductive bias to a TS-trained model, it is able to adapt better to CS without ever seeing CS data, and outperform a baseline model on a traditional TS benchmark. In addition, we provide a novel test dataset for CS, and analyze the differences between CS corpora and existing TS corpora, in terms of how simplification operations are applied.
Realization of Causal Representation Learning to Adjust Confounding Bias in Latent Space

Causal DAGs(Directed Acyclic Graphs) are usually considered in a 2D plane. Edges indicate causal effects' directions and imply their corresponding time-passings. Due to the natural restriction of statistical models, effect estimation is usually approximated by averaging the individuals' correlations, i.e., observational changes over a specific time. However, in the context of Machine Learning on large-scale questions with complex DAGs, such slight biases can snowball to distort global models - More importantly, it has practically impeded the development of AI, for instance, the weak generalizability of causal models. In this paper, we redefine causal DAG as \emph{do-DAG}, in which variables' values are no longer time-stamp-dependent, and timelines can be seen as axes. By geometric explanation of multi-dimensional do-DAG, we identify the \emph{Causal Representation Bias} and its necessary factors, differentiated from common confounding biases. Accordingly, a DL(Deep Learning)-based framework will be proposed as the general solution, along with a realization method and experiments to verify its feasibility.
Robust Online Video Instance Segmentation with Track Queries

Recently, transformer-based methods have achieved impressive results on Video Instance Segmentation (VIS). However, most of these top-performing methods run in an offline manner by processing the entire video clip at once to predict instance mask volumes. This makes them incapable of handling the long videos that appear in challenging new video instance segmentation datasets like UVO and OVIS. We propose a fully online transformer-based video instance segmentation model that performs comparably to top offline methods on the YouTube-VIS 2019 benchmark and considerably outperforms them on UVO and OVIS. This method, called Robust Online Video Segmentation (ROVIS), augments the Mask2Former image instance segmentation model with track queries, a lightweight mechanism for carrying track information from frame to frame, originally introduced by the TrackFormer method for multi-object tracking. We show that, when combined with a strong enough image segmentation architecture, track queries can exhibit impressive accuracy while not being constrained to short videos.
A constant lower bound for the union-closed sets conjecture

We show that for any union-closed family $\mathcal{F} \subseteq 2^{[n]}, \mathcal{F} \neq \{\emptyset\}$, there exists an $i \in [n]$ which is contained in a $0.01$ fraction of the sets in $\mathcal{F}$. This is the first known constant lower bound, and improves upon the $\Omega(\log_2(|\mathcal{F}|)^{-1})$ bounds of Knill and W\'{o}jick. Our result follows from an information theoretic strengthening of the conjecture. Specifically, we show that if $A, B$ are independent samples from a distribution over subsets of $[n]$ such that $Pr[i \in A]<0.01$ for all $i$ and $H(A)>0$, then $H(A \cup B)>H(A)$.
Error bounds for Lie group representations in quantum mechanics

We provide state-dependent error bounds for strongly continuous unitary representations of connected Lie groups. That is, we bound the difference of two unitaries applied to a state in terms of the energy with respect to a reference Hamiltonian associated with the representation and a left-invariant metric distance on the group. Our method works for any connected Lie group and the metric is independent of the chosen representation. The approach also applies to projective representations and allows us to provide bounds on the energy-constrained diamond norm distance of any suitably continuous channel representation of the group.