Miracle-dz/UniFAR-FTUs huggingface dataset:
ALMA Super-resolution Imaging of T Tau: r = 12 au Gap in the Compact Dust Disk around T Tau N

Based on Atacama Large Millimeter/submillimeter Array (ALMA) observations, compact protoplanetary disks with dust radii of r ≲ 20–40 au were found to be dominant in nearby low-mass star formation regions. However, their substructures have not been investigated because of the limited spatial resolution achieved so far. We apply a newly developed super-resolution imaging technique utilizing sparse modeling (SpM) to explore several au-scale structures in such compact disks. SpM imaging can directly solve for the incomplete sampling of visibilities in the spatial frequency and potentially improve the fidelity and effective spatial resolution of ALMA images. Here we present the results of the application to the T Tau system. We use the ALMA 1.3 mm continuum data and achieve an effective spatial resolution of ∼30% (5 au) compared with the conventional CLEAN beam size at a resolution of 17 au. The reconstructed image reveals a new annular gap structure at r = 12 au in the T Tau N compact disk, with a dust radius of 24 au, and resolves the T Tau Sa and Sb binary into two sources. If the observed gap structure in the T Tau N disk is caused by an embedded planet, we estimate a Saturn-mass planet when the viscous parameter of the disk is 10−3. Ultimately, ALMA observations with enough angular resolution and sensitivity should be able to verify the consistency of the super-resolution imaging and definitely confirm the existence of this disk substructure.
HyGain: High-performance, Energy-efficient Hybrid Gain Cell-based Cache Hierarchy

In this article, we propose a “full-stack” solution to designing high-apacity and low-latency on-chip cache hierarchies by starting at the circuit level of the hardware design stack. We propose a novel half VDD precharge 2T Gain Cell (GC) design for the cache hierarchy. The GC has several desirable characteristics, including ~50% higher storage density and ~50% lower dynamic energy as compared to the traditional 6T SRAM, even after accounting for peripheral circuit overheads. We also demonstrate data retention time of 350 us (~17.5× of eDRAM) at 28 nm technology with VDD = 0.9V and temperature = 27°C that, combined with optimizations like staggered refresh, makes it an ideal candidate to architect all levels of on-chip caches. We show that compared to 6T SRAM, for a given area budget, GC-based caches, on average, provide 30% and 36% increase in IPC for single- and multi-programmed workloads, respectively, on contemporary workloads, including SPEC CPU 2017. We also observe dynamic energy savings of 42% and 34% for single- and multi-programmed workloads, respectively. Finally, in a quest to utilize the best of all worlds, we combine GC with STT-RAM to create hybrid hierarchies. We show that a hybrid hierarchy with GC caches at L1 and L2 and an LLC split between GC and STT-RAM is able to provide a 46% benefit in energy-delay product (EDP) as compared to an all-SRAM design, and 13% as compared to an all-GC cache hierarchy, averaged across multi-programmed workloads.
A Survey of Novae in M83

The results of the first synoptic survey of novae in the barred spiral and starburst galaxy, M83 (NGC 5236), are presented. A total of 19 novae and one background supernova were discovered during the course of a nearly 7 year survey comprised of over 200 individual nights of observation between 2012 December 12 and 2019 March 14. After correcting for the limiting magnitude and the spatial and temporal coverage of the survey, the nova rate in M83 was found to be R = 19+5 −3 yr−1. This rate, when normalized to the K-band luminosity of the galaxy, yields a luminosity-specific nova rate, ν K = 3.0+0.9 −0.6 × 10−10 yr −1 L ⊙,K −1. The spatial distribution of the novae is found to be more extended than the overall galaxy light suggesting that the observed novae are likely dominated by a disk population. This result is consistent with the observed novae light curves, which reveals that the M83 novae are on average more luminous at maximum light and fade faster when compared with novae observed in M31. Generally, the more luminous M83 novae were observed to fade more rapidly, with the complete sample being broadly consistent with a linear maximum magnitude versus rate of decline relation.
Large Batch Experience Replay

Several algorithms have been proposed to sample non-uniformly the replay buffer of deep Reinforcement Learning (RL) agents to speed-up learning, but very few theoretical foundations of these sampling schemes have been provided. Among others, Prioritized Experience Replay appears as a hyperparameter sensitive heuristic, even though it can provide good performance. In this work, we cast the replay buffer sampling problem as an importance sampling one for estimating the gradient. This allows deriving the theoretically optimal sampling distribution, yielding the best theoretical convergence speed. Elaborating on the knowledge of the ideal sampling scheme, we exhibit new theoretical foundations of Prioritized Experience Replay. The optimal sampling distribution being intractable, we make several approximations providing good results in practice and introduce, among others, LaBER (Large Batch Experience Replay), an easy-to-code and efficient method for sampling the replay buffer. LaBER, which can be combined with Deep Q-Networks, distributional RL agents or actor-critic methods, yields improved performance over a diverse range of Atari games and PyBullet environments, compared to the base agent it is implemented on and to other prioritization schemes.
Counterfactual Samples Synthesizing and Training for Robust Visual Question Answering

Today's VQA models still tend to capture superficial linguistic correlations in the training set and fail to generalize to the test set with different QA distributions. To reduce these language biases, recent VQA works introduce an auxiliary question-only model to regularize the training of targeted VQA model, and achieve dominating performance on diagnostic benchmarks for out-of-distribution testing. However, due to the complex model design, ensemble-based methods are unable to equip themselves with two indispensable characteristics of an ideal VQA model: 1) Visual-explainable: The model should rely on the right visual regions when making decisions. 2) Question-sensitive: The model should be sensitive to the linguistic variations in questions. To this end, we propose a novel model-agnostic Counterfactual Samples Synthesizing and Training (CSST) strategy. After training with CSST, VQA models are forced to focus on all critical objects and words, which significantly improves both visual-explainable and question-sensitive abilities. Specifically, CSST is composed of two parts: Counterfactual Samples Synthesizing (CSS) and Counterfactual Samples Training (CST). CSS generates counterfactual samples by carefully masking critical objects in images or words in questions and assigning pseudo ground-truth answers. CST not only trains the VQA models with both complementary samples to predict respective ground-truth answers, but also urges the VQA models to further distinguish the original samples and superficially similar counterfactual ones. To facilitate the CST training, we propose two variants of supervised contrastive loss for VQA, and design an effective positive and negative sample selection mechanism based on CSS. Extensive experiments have shown the effectiveness of CSST. Particularly, by building on top of model LMH+SAR (Clark et al. 2019), (Si et al. 2021), we achieve record-breaking performance on all out-of-distribution benchmarks (e.g., VQA-CP v2, VQA-CP v1, and GQA-OOD).
Robust and Decomposable Average Precision for Image Retrieval

In image retrieval, standard evaluation metrics rely on score ranking, e.g. average precision (AP). In this paper, we introduce a method for robust and decomposable average precision (ROADMAP) addressing two major challenges for end-to-end training of deep neural networks with AP: non-differentiability and non-decomposability. Firstly, we propose a new differentiable approximation of the rank function, which provides an upper bound of the AP loss and ensures robust training. Secondly, we design a simple yet effective loss function to reduce the decomposability gap between the AP in the whole training set and its averaged batch approximation, for which we provide theoretical guarantees. Extensive experiments conducted on three image retrieval datasets show that ROADMAP outperforms several recent AP approximation methods and highlight the importance of our two contributions. Finally, using ROADMAP for training deep models yields very good performances, outperforming state-of-the-art results on the three datasets.
Deep learning model calibration for improving performance in class-imbalanced medical image classification tasks

In medical image classification tasks, it is common to find that the number of normal samples far exceeds the number of abnormal samples. In such class-imbalanced situations, reliable training of deep neural networks continues to be a major challenge, therefore biasing the predicted class probabilities toward the majority class. Calibration has been proposed to alleviate some of these effects. However, there is insufficient analysis explaining whether and when calibrating a model would be beneficial. In this study, we perform a systematic analysis of the effect of model calibration on its performance on two medical image modalities, namely, chest X-rays and fundus images, using various deep learning classifier backbones. For this, we study the following variations: (i) the degree of imbalances in the dataset used for training; (ii) calibration methods; and (iii) two classification thresholds, namely, default threshold of 0.5, and optimal threshold from precision-recall (PR) curves. Our results indicate that at the default classification threshold of 0.5, the performance achieved through calibration is significantly superior (p < 0.05) to using uncalibrated probabilities. However, at the PR-guided threshold, these gains are not significantly different (p > 0.05). This observation holds for both image modalities and at varying degrees of imbalance. The code is available at https://github.com/sivaramakrishnan-rajaraman/Model_calibration.
A Class of Nonbinary Symmetric Information Bottleneck Problems

We study two dual settings of information processing. Let $ \mathsf{Y} \rightarrow \mathsf{X} \rightarrow \mathsf{W} $ be a Markov chain with fixed joint probability mass function $ \mathsf{P}_{\mathsf{X}\mathsf{Y}} $ and a mutual information constraint on the pair $ (\mathsf{W},\mathsf{X}) $. For the first problem, known as Information Bottleneck, we aim to maximize the mutual information between the random variables $ \mathsf{Y} $ and $ \mathsf{W} $, while for the second problem, termed as Privacy Funnel, our goal is to minimize it. In particular, we analyze the scenario for which $ \mathsf{X} $ is the input, and $ \mathsf{Y} $ is the output of modulo-additive noise channel. We provide analytical characterization of the optimal information rates and the achieving distributions.
ComOpT: Combination and Optimization for Testing Autonomous Driving Systems

ComOpT is an open-source research tool for coverage-driven testing of autonomous driving systems, focusing on planning and control. Starting with (i) a meta-model characterizing discrete conditions to be considered and (ii) constraints specifying the impossibility of certain combinations, ComOpT first generates constraint-feasible abstract scenarios while maximally increasing the coverage of k-way combinatorial testing. Each abstract scenario can be viewed as a conceptual equivalence class, which is then instantiated into multiple concrete scenarios by (1) randomly picking one local map that fulfills the specified geographical condition, and (2) assigning all actors accordingly with parameters within the range. Finally, ComOpT evaluates each concrete scenario against a set of KPIs and performs local scenario variation via spawning a new agent that might lead to a collision at designated points. We use ComOpT to test the Apollo 6 autonomous driving software stack. ComOpT can generate highly diversified scenarios with limited test budgets while uncovering problematic situations such as inabilities to make simple right turns, uncomfortable accelerations, and dangerous driving patterns. ComOpT participated in the 2021 IEEE AI Autonomous Vehicle Testing Challenge and won first place among more than 110 contending teams.
SolType: Refinement Types for Solidity

As smart contracts gain adoption in financial transactions, it becomes increasingly important to ensure that they are free of bugs and security vulnerabilities. Of particular relevance in this context are arithmetic overflow bugs, as integers are often used to represent financial assets like account balances. Motivated by this observation, this paper presents SolType, a refinement type system for Solidity that can be used to prevent arithmetic over-and under-flows in smart contracts. SolType allows developers to add refinement type annotations and uses them to prove that arithmetic operations do not lead to over-and under-flows. SolType incorporates a rich vocabulary of refinement terms that allow expressing relationships between integer values and aggregate properties of complex data structures. Furthermore, our implementation, called Solid, incorporates a type inference engine and can automatically infer useful type annotations, including non-trivial contract invariants. To evaluate the usefulness of our type system, we use Solid to prove arithmetic safety of a total of 120 smart contracts. When used in its fully automated mode (i.e., using Solid’s type inference capabilities), Solid is able to eliminate 86.3% of redundant runtime checks used to guard against overflows. We also compare Solid against a state-of-the-art arithmetic safety verifier called VeriSmart and show that Solid has a significantly lower false positive rate, while being significantly faster in terms of verification time.
Hierarchical Causal Analysis of Natural Languages on a Chain Event Graph

Various graphical models are widely used in reliability to provide a qualitative description of domain experts hypotheses about how a system might fail. Here we argue that the semantics developed within standard causal Bayesian networks are not rich enough to fully capture the intervention calculus needed for this domain and a more tree-based approach is necessary. We instead construct a Bayesian hierarchical model with a chain event graph at its lowest level so that typical interventions made in reliability models are supported by a bespoke causal calculus. We then demonstrate how we can use this framework to automate the process of causal discovery from maintenance logs, extracting natural language information describing hypothesised causes of failures. Through our customised causal algebra we are then able to make predictive inferences about the effects of a variety of types of remedial interventions. The proposed methodology is illustrated throughout with examples drawn from real maintenance logs.
Extrema of Luroth Digits and a zeta function limit relation

We describe how certain properties of the extrema of the digits of Luroth expansions lead to a probabilistic proof of a limiting relation involving the Riemann zeta function and the Bernoulli triangles. We also discuss trimmed sums of Luroth digits. Our goal is to show how direct computations in this case lead to formulas and some interesting discussions of special functions.
Permutation Entropy for Graph Signals

Entropy metrics (for example, permutation entropy) are nonlinear measures of irregularity in time series (one-dimensional data). Some of these entropy metrics can be generalised to data on periodic structures such as a grid or lattice pattern (two-dimensional data) using its symmetry, thus enabling their application to images. However, these metrics have not been developed for signals sampled on irregular domains, defined by a graph. Here, we define for the first time an entropy metric to analyse signals measured over irregular graphs by generalising permutation entropy, a well-established nonlinear metric based on the comparison of neighbouring values within patterns in a time series. Our algorithm is based on comparing signal values on neighbouring nodes, using the adjacency matrix. We show that this generalisation preserves the properties of classical permutation for time series and the recent permutation entropy for images, and it can be applied to any graph structure with synthetic and real signals. We expect the present work to enable the extension of other nonlinear dynamic approaches to graph signals.
Feel-Good Thompson Sampling for Contextual Bandits and Reinforcement Learning

Thompson Sampling has been widely used for contextual bandit problems due to the flexibility of its modeling power. However, a general theory for this class of methods in the frequentist setting is still lacking. In this paper, we present a theoretical analysis of Thompson Sampling, with a focus on frequentist regret bounds. In this setting, we show that the standard Thompson Sampling is not aggressive enough in exploring new actions, leading to suboptimality in some pessimistic situations. A simple modification called Feel-Good Thompson Sampling, which favors high reward models more aggressively than the standard Thompson Sampling, is proposed to remedy this problem. We show that the theoretical framework can be used to derive Bayesian regret bounds for standard Thompson Sampling, and frequentist regret bounds for Feel-Good Thompson Sampling. It is shown that in both cases, we can reduce the bandit regret problem to online least squares regression estimation. For the frequentist analysis, the online least squares regression bound can be directly obtained using online aggregation techniques which have been well studied. The resulting bandit regret bound matches the minimax lower bound in the finite action case. Moreover, the analysis can be generalized to handle a class of linearly embeddable contextual bandit problems (which generalizes the popular linear contextual bandit model). The obtained result again matches the minimax lower bound. Finally we illustrate that the analysis can be extended to handle some MDP problems.
Simulating superluminal propagation of Dirac particles using trapped ions

Simulating quantum phenomena in extreme spacetimes in the laboratory represents a powerful approach to explore fundamental physics in the interplay of quantum field theory and general relativity. Here we propose to simulate the movement of a Dirac particle propagating with a superluminal velocity caused by the emergent Alcubierre warp drive spacetime using trapped ions. We demonstrate that the platform allows observing the tilted lightcone that manifests as a superluminal velocity, which is in agreement with the prediction of general relativity. Furthermore, the Zitterbewegung effect arising from relativistic quantum mechanics persists with the superluminal propagation and is experimentally measurable. The present scheme can be extended to simulate the Dirac equation in other exotic curved spacetimes, thus provides a versatile tool to gain insights into the fundamental limit of these extreme spacetimes.
Aspect Sentiment Quad Prediction as Paraphrase Generation

Aspect-based sentiment analysis (ABSA) has been extensively studied in recent years, which typically involves four fundamental sentiment elements, including the aspect category, aspect term, opinion term, and sentiment polarity. Existing studies usually consider the detection of partial sentiment elements, instead of predicting the four elements in one shot. In this work, we introduce the Aspect Sentiment Quad Prediction (ASQP) task, aiming to jointly detect all sentiment elements in quads for a given opinionated sentence, which can reveal a more comprehensive and complete aspect-level sentiment structure. We further propose a novel Paraphrase modeling paradigm to cast the ASQP task to a paraphrase generation process. On one hand, the generation formulation allows solving ASQP in an end-to-end manner, alleviating the potential error propagation in the pipeline solution. On the other hand, the semantics of the sentiment elements can be fully exploited by learning to generate them in the natural language form. Extensive experiments on benchmark datasets show the superiority of our proposed method and the capacity of cross-task transfer with the proposed unified Paraphrase modeling framework.
The Need for a Fine-grained approach in Just-in-Time Defect Prediction

With software system complexity leading to the rise of software defects, research efforts have been done on techniques towards predicting software defects and Just-in-time (JIT) defect prediction which predicts whether a code change is defective. While using features to determine potentially defective code change, inspection effort is still significant. As code change can impact several files, we investigate an open source project to identify potential gaps with features in JIT perspective. In addition, with a lack of publicly available JIT dataset that link the features with actual commits, we also present a new dataset that can be utilized in JIT and semantic analysis.
Local orthogonality dimension

An orthogonal representation of a graph G $G$ over a field F ${\mathbb{F}}$ is an assignment of a vector uv∈Ft ${u}_{v}\in {{\mathbb{F}}}^{t}$ to every vertex v $v$ of G $G$ , such that 〈uv,uv〉≠0 $\langle {u}_{v},{u}_{v}\rangle \ne 0$ for every vertex v $v$ and 〈uv,uv′〉=0 $\langle {u}_{v},{u}_{{v}^{^{\prime} }}\rangle =0$ whenever v $v$ and v′ $v^{\prime} $ are adjacent in G $G$ . The locality of the orthogonal representation is the largest dimension of a subspace spanned by the vectors associated with a closed neighborhood in the graph. We introduce a novel graph parameter, called the local orthogonality dimension, defined for a given graph G $G$ and a given field F ${\mathbb{F}}$ , as the smallest possible locality of an orthogonal representation of G $G$ over F ${\mathbb{F}}$ . This is a local variant of the well‐studied orthogonality dimension of graphs, introduced by Lovász, analogously to the local variant of the chromatic number introduced by Erdös et al. We investigate the usefulness of topological methods for proving lower bounds on the local orthogonality dimension. Such methods are known to imply tight lower bounds on the chromatic number of several graph families of interest, such as Kneser graphs and Schrijver graphs. We prove that graphs for which topological methods imply a lower bound of t $t$ on their chromatic number have local orthogonality dimension at least ⌈t∕2⌉+1 $\lceil t\unicode{x02215}2\rceil +1$ over every field, strengthening a result of Simonyi and Tardos on the local chromatic number. We show that for certain graphs this lower bound is tight, whereas for others, the local orthogonality dimension over the reals is equal to the chromatic number. More generally, we prove that for every complement of a line graph, the local orthogonality dimension over R ${\mathbb{R}}$ coincides with the chromatic number. This strengthens a recent result by Daneshpajouh, Meunier, and Mizrahi, who proved that the local and standard chromatic numbers of these graphs are equal. As another extension of their result, we prove that the local and standard chromatic numbers are equal for some additional graphs, from the family of Kneser graphs. We also study the computational aspects of the local orthogonality dimension and show that for every integer k≥3 $k\ge 3$ and a field F ${\mathbb{F}}$ , it is NP‐hard to decide whether the local orthogonality dimension of an input graph over F ${\mathbb{F}}$ is at most k $k$ . We finally present an application of the local orthogonality dimension to the index coding problem from information theory, extending a result of Shanmugam, Dimakis, and Langberg.