Miracle-dz/UniFAR-FTUs huggingface dataset:
Pre-trained transformer for adversarial purification

With more and more deep neural networks being deployed as various daily services, their reliability is essential. It is frightening that deep neural networks are vulnerable and sensitive to adversarial attacks, the most common one of which for the services is evasion-based. Recent works usually strengthen the robustness by adversarial training or leveraging the knowledge of an amount of clean data. However, retraining and redeploying the model need a large computational budget, leading to heavy losses to the online service. In addition, when training, it is likely that only limited adversarial examples are available for the service provider, while much clean data may not be accessible. Based on the analysis on the defense for deployed models, we find that how to rapidly defend against a certain attack for a frozen original service model with limitations of few clean and adversarial examples, which is named as RaPiD (Rapid Plug-in Defender), is really important. Motivated by the generalization and the universal computation ability of pre-trained transformer models, we come up with a new defender method, CeTaD, which stands for Considering Pretrained Transformers as Defenders. In particular, we evaluate the effectiveness and the transferability of CeTaD in the case of one-shot adversarial examples and explore the impact of different parts of CeTaD as well as training data conditions. CeTaD is flexible for different differentiable service models, and suitable for various types of attacks.
The Asymptotics of the Expected Betti Numbers of Preferential Attachment Clique Complexes

The preferential attachment model is a natural and popular random graph model for a growing network that contains very well-connected ``hubs''. We study the higher-order connectivity of such a network by investigating the topological properties of its clique complex. We concentrate on the expected Betti numbers, a sequence of topological invariants of the complex related to the numbers of holes of different dimensions. We determine the asymptotic growth rates of the expected Betti numbers, and prove that the expected Betti number at dimension 1 grows linearly fast, while those at higher dimensions grow sublinearly fast. Our theoretical results are illustrated by simulations.
Characterizing Niobium Nitride Superconducting Microwave Coplanar Waveguide Resonator Array for Circuit Quantum Electrodynamics in Extreme Conditions

The high critical magnetic field and relatively high critical temperature of niobium nitride (NbN) make it a promising material candidate for applications in superconducting quantum technology. However, NbN-based devices and circuits are sensitive to decoherence sources such as two-level system (TLS) defects. Here, we numerically and experimentally investigate NbN superconducting microwave coplanar waveguide resonator arrays, with a 100 nm thickness, capacitively coupled to a common coplanar waveguide on a silicon chip. We observe that the resonators' internal quality factor (Qi) decreases from Qi ~ 1.07*10^6 in a high power regime (= 27000) to Qi ~ 1.36 *10^5 in single photon regime at temperature T = 100 mK. Data from this study is consistent with the TLS theory, which describes the TLS interactions in resonator substrates and interfaces. Moreover, we study the temperature dependence internal quality factor and frequency tuning of the coplanar waveguide resonators to characterise the quasiparticle density of NbN. We observe that the increase in kinetic inductance at higher temperatures is the main reason for the frequency shift. Finally, we measure the resonators' resonance frequency and internal quality factor at single photon regime in response to in-plane magnetic fields B||. We verify that Qi stays well above 10^4 up to B|| = 240 mT in the photon number= 1.8 at T = 100 mK. Our results may pave the way for realising robust microwave superconducting circuits for circuit quantum electrodynamics (cQED) at high magnetic fields necessary for fault-tolerant quantum computing, and ultrasensitive quantum sensing.
Edit Distance based RL for RNNT decoding

RNN-T is currently considered the industry standard in ASR due to its exceptional WERs in various benchmark tests and its ability to support seamless streaming and longform transcription. However, its biggest drawback lies in the significant discrepancy between its training and inference objectives. During training, RNN-T maximizes all alignment probabilities by teacher forcing, while during inference, it uses beam search which may not necessarily find the maximum probable alignment. Additionally, RNN-T's inability to experience mistakes during teacher forcing training makes it more problematic when a mistake occurs in inference. To address this issue, this paper proposes a Reinforcement Learning method that minimizes the gap between training and inference time. Our Edit Distance based RL (EDRL) approach computes rewards based on the edit distance, and trains the network at every action level. The proposed approach yielded SoTA WERs on LibriSpeech for the 600M Conformer RNN-T model.
Characterizing the Directionality of Gravitational Wave Emission from Matter Motions within Core-collapse Supernovae

We analyze the directional dependence of the gravitational wave (GW) emission from 15 3D neutrino radiation hydrodynamic simulations of core-collapse supernovae (CCSNe). Using spin weighted spherical harmonics, we develop a new analytic technique to quantify the evolution of the distribution of GW emission over all angles. We construct a physics-informed toy model that can be used to approximate GW distributions for general ellipsoid-like systems, and use it to provide closed form expressions for the distribution of GWs for different CCSN phases. Using these toy models, we approximate the protoneutron star (PNS) dynamics during multiple CCSN stages and obtain similar GW distributions to simulation outputs. When considering all viewing angles, we apply this new technique to quantify the evolution of preferred directions of GW emission. For nonrotating cases, this dominant viewing angle drifts isotropically throughout the supernova, set by the dynamical timescale of the PNS. For rotating cases, during core bounce and the following tens of milliseconds, the strongest GW signal is observed along the equator. During the accretion phase, comparable—if not stronger—GW amplitudes are generated along the axis of rotation, which can be enhanced by the low T/∣W∣ instability. We show two dominant factors influencing the directionality of GW emission are the degree of initial rotation and explosion morphology. Lastly, looking forward, we note the sensitive interplay between GW detector site and supernova orientation, along with its effect on detecting individual polarization modes.
Training Like a Medical Resident: Universal Medical Image Segmentation via Context Prior Learning

A major enduring focus of clinical workflows is disease analytics and diagnosis, leading to medical imaging datasets where the modalities and annotations are strongly tied to specific clinical objectives. To date, building task-specific segmentation models is intuitive yet a restrictive approach, lacking insights gained from widespread imaging cohorts. Inspired by the training of medical residents, we explore universal medical image segmentation, whose goal is to learn from diverse medical imaging sources covering a range of clinical targets, body regions, and image modalities. Following this paradigm, we propose Hermes, a context prior learning approach that addresses the challenges related to the heterogeneity on data, modality, and annotations in the proposed universal paradigm. In a collection of seven diverse datasets, we demonstrate the appealing merits of the universal paradigm over the traditional task-specific training paradigm. By leveraging the synergy among various tasks, Hermes shows superior performance and model scalability. Our in-depth investigation on two additional datasets reveals Hermes' strong capabilities for transfer learning, incremental learning, and generalization to different downstream tasks. The code is available: https://github.com/yhygao/universal-medical-image-segmentation.
Provable Dynamic Fusion for Low-Quality Multimodal Data

The inherent challenge of multimodal fusion is to precisely capture the cross-modal correlation and flexibly conduct cross-modal interaction. To fully release the value of each modality and mitigate the influence of low-quality multimodal data, dynamic multimodal fusion emerges as a promising learning paradigm. Despite its widespread use, theoretical justifications in this field are still notably lacking. Can we design a provably robust multimodal fusion method? This paper provides theoretical understandings to answer this question under a most popular multimodal fusion framework from the generalization perspective. We proceed to reveal that several uncertainty estimation solutions are naturally available to achieve robust multimodal fusion. Then a novel multimodal fusion framework termed Quality-aware Multimodal Fusion (QMF) is proposed, which can improve the performance in terms of classification accuracy and model robustness. Extensive experimental results on multiple benchmarks can support our findings.
Improving the Generalizability and Robustness of Large-Scale Traffic Signal Control

A number of deep reinforcement-learning (RL) approaches propose to control traffic signals. Compared to traditional approaches, RL approaches can learn from higher-dimensionality input road and vehicle sensors and better adapt to varying traffic conditions resulting in reduced travel times (in simulation). However, these RL methods require training from massive traffic sensor data. To offset this relative inefficiency, some recent RL methods have the ability to first learn from small-scale networks and then generalize to unseen city-scale networks without additional retraining (zero-shot transfer). In this work, we study the robustness of such methods along two axes. First, sensor failures and GPS occlusions create missing-data challenges and we show that recent methods remain brittle in the face of these missing data. Second, we provide a more systematic study of the generalization ability of RL methods to new networks with different traffic regimes. Again, we identify the limitations of recent approaches. We then propose using a combination of distributional and vanilla reinforcement learning through a policy ensemble. Building upon the state-of-the-art previous model which uses a decentralized approach for large-scale traffic signal control with graph convolutional networks (GCNs), we first learn models using a distributional reinforcement learning (DisRL) approach. In particular, we use implicit quantile networks (IQN) to model the state-action return distribution with quantile regression. For traffic signal control problems, an ensemble of standard RL and DisRL yields superior performance across different scenarios, including different levels of missing sensor data and traffic flow patterns. Furthermore, the learning scheme of the resulting model can improve zero-shot transferability to different road network structures, including both synthetic networks and real-world networks (e.g., Luxembourg, Manhattan). We conduct extensive experiments to compare our approach to multi-agent reinforcement learning and traditional transportation approaches. Results show that the proposed method improves robustness and generalizability in the face of missing data, varying road networks, and traffic flows.
Spreading dynamics of drop impacts

Abstract We present an experimental study of drop impact on a solid surface in the spreading regime with no splashing. Using the space–time-resolved Fourier transform profilometry technique, we can follow the evolution of the drop shape during the impact. We show that a self-similar dynamical regime drives the drop spreading until the growth of a viscous boundary layer from the substrate selects a residual minimal film thickness. Finally, we discuss the interplay between capillary and viscous effects in the spreading dynamics, which suggests a pertinent impact parameter.
Global transonic solution of hot accretion flow with thermal conduction

We examine the effect of thermal conduction on the low-angular momentum hot accretion flow (HAF) around non-rotating black holes accreting mass at very low rate. While doing so, we adopt the conductive heat flux in the saturated form, and solve the set of dynamical equations corresponding to a steady, axisymmetric, viscous, advective accretion flow using numerical methods. We study the dynamical and thermodynamical properties of accreting matter in terms of the input parameters, namely energy (ε0), angular momentum (ℓ0), viscosity parameter (α), and saturation constant (Φs) regulating the effect of thermal conduction. We find that Φs plays a pivotal role in deciding the transonic properties of the global accretion solutions. In general, when Φs is increased, the critical point (rc) is receded away from the black hole, and flow variables are altered particularly in the outer part of the disc. To quantify the physically acceptable range of Φs, we compare the global transonic solutions with the self-similar solutions, and observe that the maximum saturation constant ($\Phi ^{\rm max}_{\rm s}$) estimated from the global solutions exceeds the saturated thermal conduction limit (Φsc) derived from the self-similar formalism. Moreover, we calculate the correlation between α and $\Phi ^{\rm max}_{\rm s}$ and find ample disagreement between global solutions and self-similar solutions. Further, using the global flow variables, we compute the Bernoulli parameter (Be) which remains positive all throughout the disc, although flow becomes loosely unbound for higher Φs. Finally, we indicate the relevance of this work in the astrophysical context in explaining the possibility of mass-loss/outflows from the unbound disc.
LIC-GAN: Language Information Conditioned Graph Generative GAN Model

Deep generative models for Natural Language data offer a new angle on the problem of graph synthesis: by optimizing differentiable models that directly generate graphs, it is possible to side-step expensive search procedures in the discrete and vast space of possible graphs. We introduce LIC-GAN, an implicit, likelihood-free generative model for small graphs that circumvents the need for expensive graph matching procedures. Our method takes as input a natural language query and using a combination of language modelling and Generative Adversarial Networks (GANs) and returns a graph that closely matches the description of the query. We combine our approach with a reward network to further enhance the graph generation with desired properties. Our experiments, show that LIC-GAN does well on metrics such as PropMatch and Closeness getting scores of 0.36 and 0.48. We also show that LIC-GAN performs as good as ChatGPT, with ChatGPT getting scores of 0.40 and 0.42. We also conduct a few experiments to demonstrate the robustness of our method, while also highlighting a few interesting caveats of the model.
multiRegionFoam -- A Unified Multiphysics Framework for Multi-Region Coupled Continuum-Physical Problems

This paper presents a unified framework, called multiRegionFoam, for solving multiphysics problems of the multi-region coupling type within OpenFOAM (FOAM-extend). It is intended to supersede the existing solver with the same name. The design of the new framework is modular, allowing users to assemble a multiphysics problem region-by-region and coupling conditions interface-by-interface. The present approach allows users to choose between deploying either monolithic or partitioned interface coupling for each individual transport equation. The formulation of boundary conditions is generalised in the sense that their implementation is based on the mathematical jump/transmission conditions in the most general form for tensors of any rank. The present contribution focuses on the underlying mathematical model for these types of multiphysics problems, as well as on the software design and resulting code structure that enable a flexible and modular approach. Finally, deployment for different multi-region coupling cases is demonstrated, including conjugate heat, multiphase flows and fuel-cells.
Social Robots As Companions for Lonely Hearts: The Role of Anthropomorphism and Robot Appearance

Loneliness is a distressing personal experience and a growing social issue. Social robots could alleviate the pain of loneliness, particularly for those who lack in-person interaction. This paper investigated how the effect of loneliness on the anthropomorphism of social robots differs by robot appearance, and how it influences purchase intention. Participants viewed a video of one of the three robots (machine-like, animal-like, and human-like) moving and interacting with a human counterpart. Bootstrapped multiple regression results revealed that although the unique effect of animal-likeness on anthropomorphism compared to human-likeness was higher, lonely individuals’ tendency to anthropomorphize the animal-like robot was lower than that of the human-like robot. This moderating effect remained significant after covariates were included. Bootstrapped mediation analysis showed that anthropomorphism had both a positive direct effect on purchase intent and a positive indirect effect mediated by likability. Our results suggest that lonely individuals’ tendency of anthropomorphizing social robots should not be summarized into one unified inclination. Moreover, by extending the effect of loneliness on anthropomorphism to likability and purchase intent, this current study explored the potential of social robots to be adopted as companions of lonely individuals in their real life. Lastly, we discuss the practical implications of the current study for designing social robots.
Sampling binary sparse coding QUBO models using a spiking neuromorphic processor

We consider the problem of computing a sparse binary representation of an image. To be precise, given an image and an overcomplete, non-orthonormal basis, we aim to find a sparse binary vector indicating the minimal set of basis vectors that when added together best reconstruct the given input. We formulate this problem with an L2 loss on the reconstruction error, and an L0 (or, equivalently, an L1) loss on the binary vector enforcing sparsity. This yields a so-called Quadratic Unconstrained Binary Optimization (QUBO) problem, whose solution is generally NP-hard to find. The contribution of this work is twofold. First, the method of unsupervised and unnormalized dictionary feature learning for a desired sparsity level to best match the data is presented. Second, the binary sparse coding problem is then solved on the Loihi 1 neuromorphic chip by the use of stochastic networks of neurons to traverse the non-convex energy landscape. The solutions are benchmarked against the classical heuristic simulated annealing. We demonstrate neuromorphic computing is suitable for sampling low energy solutions of binary sparse coding QUBO models, and although Loihi 1 is capable of sampling very sparse solutions of the QUBO models, there needs to be improvement in the implementation in order to be competitive with simulated annealing.
Energy-Sustainable IoT Connectivity: Vision, Technological Enablers, Challenges, and Future Directions

Technology solutions must effectively balance economic growth, social equity, and environmental integrity to achieve a sustainable society. Notably, although the Internet of Things (IoT) paradigm constitutes a key sustainability enabler, critical issues such as the increasing maintenance operations, energy consumption, and manufacturing/disposal of IoT devices have long-term negative economic, societal, and environmental impacts and must be efficiently addressed. This calls for self-sustainable IoT ecosystems requiring minimal external resources and intervention, effectively utilizing renewable energy sources, and recycling materials whenever possible, thus encompassing energy sustainability. In this work, we focus on energy-sustainable IoT during the operation phase, although our discussions sometimes extend to other sustainability aspects and IoT lifecycle phases. Specifically, we provide a fresh look at energy-sustainable IoT and identify energy provision, transfer, and energy efficiency as the three main energy-related processes whose harmonious coexistence pushes toward realizing self-sustainable IoT systems. Their main related technologies, recent advances, challenges, and research directions are also discussed. Moreover, we overview relevant performance metrics to assess the energy-sustainability potential of a certain technique, technology, device, or network, together with target values for the next generation of wireless systems, and discuss protocol, integration, and implementation issues. Overall, this paper offers insights that are valuable for advancing sustainability goals for present and future generations.
Matrix Completion from General Deterministic Sampling Patterns

Most of the existing works on provable guarantees for low-rank matrix completion algorithms rely on some unrealistic assumptions such that matrix entries are sampled randomly or the sampling pattern has a specific structure. In this work, we establish theoretical guarantee for the exact and approximate low-rank matrix completion problems which can be applied to any deterministic sampling schemes. For this, we introduce a graph having observed entries as its edge set, and investigate its graph properties involving the performance of the standard constrained nuclear norm minimization algorithm. We theoretically and experimentally show that the algorithm can be successful as the observation graph is well-connected and has similar node degrees. Our result can be viewed as an extension of the works by Bhojanapalli and Jain [2014] and Burnwal and Vidyasagar [2020], in which the node degrees of the observation graph were assumed to be the same. In particular, our theory significantly improves their results when the underlying matrix is symmetric.
The dynamics of unsteady frictional slip pulses

Significance A prominent failure mode of frictional systems, such as contacting tectonic plates in the earth’s crust and the geological faults separating them, is self-healing slip pulses. Slip pulses, e.g., propagating along geological faults during earthquakes, feature a finite size that emerges from an interplay between leading-edge contact breakage and trailing-edge contact healing. Here, we develop a comprehensive understanding of frictional slip pulses. We show that slip pulses are intrinsically unstable objects, yet their unsteady dynamics are slow and inherently related to their steady-state counterparts. This deep relation allows us to understand the dynamical behaviors of pulses, whether growing or decaying. The theoretical picture is quantitatively supported by large-scale computer simulations of realistic frictional systems.