Search

Detecting critical moments, such as emotional outbursts or changes in decisions during conversations, is crucial for understanding shifts in human behavior and their consequences. Our work introduces a novel problem setting focusing on these moments as turning points (TPs), accompanied by a meticulously curated, high-consensus, human-annotated multi-modal dataset. We provide precise timestamps, descriptions, and visual-textual evidence high-lighting changes in emotions, behaviors, perspectives, and decisions at these turning points. We also propose a framework, TPMaven, utilizing state-of-the-art vision-language models to construct a narrative from the videos and large language models to classify and detect turning points in our multi-modal dataset. Evaluation results show that TPMaven achieves an F1-score of 0.88 in classification and 0.61 in detection, with additional explanations aligning with human expectations., Comment: Accepted by ACL 2024 main conference

Because of the previously observed stability of the 171-day period, the superorbital modulation of the low-mass X-ray binary 4U 1820-30 was considered a consequence of a third star orbiting around the binary. This study aims to further verify this triple model by testing the stability of superorbital period using the light curves collected by X-ray sky monitoring/scanning telescopes from 1987 to 2023. Both power spectral and phase analysis results indicate a significant change in the superorbital period from 171 days to 167 days over this 36-year span. The evolution of the superorbital phase suggests that the superorbital period may have experienced an abrupt change between late 2000 and early 2023 or changed gradually with a period derivative of $\dot P_{sup}=(-3.58 \pm 0.72) \times 10^{-4}$ day/day. We conclude that the superorbital period of 4U 1820-30 was not as stable as anticipated by the triple model, which strongly challenges this hypothesis. Instead, we propose an irradiation-induced mass transfer instability scenario to explain the superorbital modulation of 4U 1820-30., Comment: 15 pages, 8 figures, submitted to ApJ

Various exotic phenomena emerge in non-equilibrium quantum many-body systems. The Mpemba effect, denoting the situation where a hot system freezes faster than the colder one, is a counterintuitive non-equilibrium phenomenon that has attracted enduring interest for more than half a century. In this Letter, we report a novel phenomenon of the Mpemba effect in the imaginary-time relaxation dynamics in quantum many-body systems, dubbed as imaginary-time Mpemba effect (ITME). Through numerically exact quantum Monte-Carlo (QMC) simulation, we unambiguously demonstrate that in different classes of interacting quantum models, the initial states with higher energy are relaxed faster than lower-energy initial states in the process of imaginary-time relaxation. The emergence of ITME is intimately associated with the low-energy excitations in quantum many-body systems. More crucially, since imaginary-time dynamics is broadly applied in numerical simulation on the quantum many-body ground states, the discovery of ITME potentially provides a new pathway to expedite the quantum many-body computation, particularly for QMC involving the sign problem., Comment: 4.5+8 pages, 4+6 figures

Distributed learning is indispensable for training large-scale deep models. Asynchronous SGD~(ASGD) and its variants are commonly used distributed learning methods in many scenarios where the computing capabilities of workers in the cluster are heterogeneous. Momentum has been acknowledged for its benefits in both optimization and generalization in deep model training. However, existing works have found that naively incorporating momentum into ASGD can impede the convergence. In this paper, we propose a novel method, called ordered momentum (OrMo), for ASGD. In OrMo, momentum is incorporated into ASGD by organizing the gradients in order based on their iteration indexes. We theoretically prove the convergence of OrMo for non-convex problems. To the best of our knowledge, this is the first work to establish the convergence analysis of ASGD with momentum without relying on the bounded delay assumption. Empirical results demonstrate that OrMo can achieve better convergence performance compared with ASGD and other asynchronous methods with momentum.

Recent advances in automatic speech recognition (ASR) often rely on large speech foundation models for generating high-quality transcriptions. However, these models can be impractical due to limited computing resources. The situation is even more severe in terms of more realistic or difficult scenarios, such as code-switching ASR (CS-ASR). To address this, we present a framework for developing more efficient models for CS-ASR through knowledge distillation using realistic speech-only data. Our proposed method, Leave No Knowledge Behind During Knowledge Distillation (K$^2$D), leverages both the teacher model's knowledge and additional insights from a small auxiliary model. We evaluate our approach on two in-domain and two out-domain datasets, demonstrating that K$^2$D is effective. By conducting K$^2$D on the unlabeled realistic data, we have successfully obtained a 2-time smaller model with 5-time faster generation speed while outperforming the baseline methods and the teacher model on all the testing sets. We have made our model publicly available on Hugging Face (https://huggingface.co/andybi7676/k2d-whisper.zh-en).

The radio-frequency quadrupole (RFQ) at the Facility for Rare Isotope Beams (FRIB) is a critical device to accelerate heavy ion beams from 12 keV/u to 0.5 MeV/u for state-of-the-art nuclear physics experiments. Efficient control of the RFQ resonance frequency detuning still remains a challenge because the temperature-sensitive frequency is solely control by a cooling water system, exhibiting complicated transport delay and nonlinearity in the heat transfer processes. In this work, we propose a long-short term memory (LSTM)-based Koopman network model that can simultaneously learn the time-delayed and non-delayed correlations hidden in the historical operating data. It is proven that the model can effectively predict the behavior of the RFQ resonance frequency using historical data as inputs. With this model, a model predictive control (MPC) framework based on the Newton-Raphson method is proposed and tested. We demonstrate that the MPC framework utilizing deep learning model is able to provide precise and rapid control for the RFQ frequency detuning, reducing the control time by half compared to the proportional-integral-derivative (PID) controller.

Evaluating the performance of autonomous vehicle planning algorithms necessitates simulating long-tail safety-critical traffic scenarios. However, traditional methods for generating such scenarios often fall short in terms of controllability and realism; they also neglect the dynamics of agent interactions. To address these limitations, we introduce SAFE-SIM, a novel diffusion-based controllable closed-loop safety-critical simulation framework. Our approach yields two distinct advantages: 1) generating realistic long-tail safety-critical scenarios that closely reflect real-world conditions, and 2) providing controllable adversarial behavior for more comprehensive and interactive evaluations. We develop a novel approach to simulate safety-critical scenarios through an adversarial term in the denoising process of diffusion models, which allows an adversarial agent to challenge a planner with plausible maneuvers while all agents in the scene exhibit reactive and realistic behaviors. Furthermore, we propose novel guidance objectives and a partial diffusion process that enables users to control key aspects of the scenarios, such as the collision type and aggressiveness of the adversarial agent, while maintaining the realism of the behavior. We validate our framework empirically using the nuScenes and nuPlan datasets across multiple planners, demonstrating improvements in both realism and controllability. These findings affirm that diffusion models provide a robust and versatile foundation for safety-critical, interactive traffic simulation, extending their utility across the broader autonomous driving landscape. Project website: https://safe-sim.github.io/., Comment: Accepted by ECCV2024; Project website: https://safe-sim.github.io/

We argue that time series analysis is fundamentally different in nature to either vision or natural language processing with respect to the forms of meaningful self-supervised learning tasks that can be defined. Motivated by this insight, we introduce a novel approach called \textit{Series2Vec} for self-supervised representation learning. Unlike other self-supervised methods in time series, which carry the risk of positive sample variants being less similar to the anchor sample than series in the negative set, Series2Vec is trained to predict the similarity between two series in both temporal and spectral domains through a self-supervised task. Series2Vec relies primarily on the consistency of the unsupervised similarity step, rather than the intrinsic quality of the similarity measurement, without the need for hand-crafted data augmentation. To further enforce the network to learn similar representations for similar time series, we propose a novel approach that applies order-invariant attention to each representation within the batch during training. Our evaluation of Series2Vec on nine large real-world datasets, along with the UCR/UEA archive, shows enhanced performance compared to current state-of-the-art self-supervised techniques for time series. Additionally, our extensive experiments show that Series2Vec performs comparably with fully supervised training and offers high efficiency in datasets with limited-labeled data. Finally, we show that the fusion of Series2Vec with other representation learning models leads to enhanced performance for time series classification. Code and models are open-source at \url{https://github.com/Navidfoumani/Series2Vec.}

The use of proximal point operators for optimization can be computationally expensive when the dimensionality of a function (i.e., the number of variables) is high. In this study, we sought to reduce the cost of calculating proximal point operators by developing a directional operator in which the proximal regularization of a function along a specific direction is penalized. We used this operator in a novel approach to optimization, referred to as the directional proximal point method (Direction PPM). When using Direction PPM, the key to achieving convergence is the selection of direction sequences for directional proximal point operators. In this paper, we present the conditions/assumptions by which to derive directions capable of achieving global convergence for convex functions. Considered a light version of PPM, Direction PPM uses scalar optimization to derive a stable step-size via a direction envelope function and an auxiliary method to derive a direction sequence that satisfies the assumptions. This makes Direction PPM adaptable to a larger class of functions. Through applications to differentiable convex functions, we demonstrate that negative gradient directions at the current iterates could conceivably be used to achieve this end. We provide experimental results to illustrate the efficacy of Direction PPM in practice.

Embedding-based Retrieval Models (ERMs) have emerged as a promising framework for large-scale text retrieval problems due to powerful large language models. Nevertheless, fine-tuning ERMs to reach state-of-the-art results can be expensive due to the extreme scale of data as well as the complexity of multi-stages pipelines (e.g., pre-training, fine-tuning, distillation). In this work, we propose the PEFA framework, namely ParamEter-Free Adapters, for fast tuning of ERMs without any backward pass in the optimization. At index building stage, PEFA equips the ERM with a non-parametric k-nearest neighbor (kNN) component. At inference stage, PEFA performs a convex combination of two scoring functions, one from the ERM and the other from the kNN. Based on the neighborhood definition, PEFA framework induces two realizations, namely PEFA-XL (i.e., extra large) using double ANN indices and PEFA-XS (i.e., extra small) using a single ANN index. Empirically, PEFA achieves significant improvement on two retrieval applications. For document retrieval, regarding Recall@100 metric, PEFA improves not only pre-trained ERMs on Trivia-QA by an average of 13.2%, but also fine-tuned ERMs on NQ-320K by an average of 5.5%, respectively. For product search, PEFA improves the Recall@100 of the fine-tuned ERMs by an average of 5.3% and 14.5%, for PEFA-XS and PEFA-XL, respectively. Our code is available at https://github.com/amzn/pecos/tree/mainline/examples/pefa-wsdm24., Comment: Accept by WSDM 2024

The symmetric mass generation (SMG) phase is an insulator in which a single-particle gap is intrinsically opened by the interaction, without involving symmetry spontaneously breaking or topological order. Here, we perform unbiased quantum Monte-Carlo simulation and systematically investigate a bilayer fermionic model hosting Fermi surface SMG in the strongly interacting regime. With increasing interaction strength, the model undergoes a quantum phase transition from an exciton insulator to an SMG phase, belonging to the (2+1)-dimensional O(4) universality class. We access the spectral properties of the SMG phase, resembling a Mott insulating phase with relatively flat dispersion and pronounced spectral broadening. The dispersion of Green's function zeros is extracted from spectral function, featuring a surface at zero frequency precisely located at the original non-interacting Fermi surface, which constitutes a hallmark of the Fermi surface SMG phase. The bilayer model we study is potentially relevant to the newly discovered high-$T_c$ superconductor $\rm{La}_3 \rm{Ni}_2 \rm{O}_7$. Our results in SMG phase qualitatively capture the salient features of spectral function unveiled in recent ARPES experiments, shedding new insight on the underlying physics of $\rm{La}_3 \rm{Ni}_2 \rm{O}_7$., Comment: 4.5 pages plus supplemental material, 4 figures

In this paper we leverage self-supervised vision transformer models and their emergent semantic abilities to improve the generalization abilities of imitation learning policies. We introduce BC-ViT, an imitation learning algorithm that leverages rich DINO pre-trained Visual Transformer (ViT) patch-level embeddings to obtain better generalization when learning through demonstrations. Our learner sees the world by clustering appearance features into semantic concepts, forming stable keypoints that generalize across a wide range of appearance variations and object types. We show that this representation enables generalized behaviour by evaluating imitation learning across a diverse dataset of object manipulation tasks. Our method, data and evaluation approach are made available to facilitate further study of generalization in Imitation Learners.

Recent advances in few-shot question answering (QA) mostly rely on the power of pre-trained large language models (LLMs) and fine-tuning in specific settings. Although the pre-training stage has already equipped LLMs with powerful reasoning capabilities, LLMs still need to be fine-tuned to adapt to specific domains to achieve the best results. In this paper, we propose to select the most informative data for fine-tuning, thereby improving the efficiency of the fine-tuning process with comparative or even better accuracy on the open-domain QA task. We present MinPrompt, a minimal data augmentation framework for open-domain QA based on an approximate graph algorithm and unsupervised question generation. We transform the raw text into a graph structure to build connections between different factual sentences, then apply graph algorithms to identify the minimal set of sentences needed to cover the most information in the raw text. We then generate QA pairs based on the identified sentence subset and train the model on the selected sentences to obtain the final model. Empirical results on several benchmark datasets and theoretical analysis show that MinPrompt is able to achieve comparable or better results than baselines with a high degree of efficiency, bringing consistent improvements in F-1 scores., Comment: ACL 2024 main conference

Imitation Learning from Observation (ILfO) is a setting in which a learner tries to imitate the behavior of an expert, using only observational data and without the direct guidance of demonstrated actions. In this paper, we re-examine optimal transport for IL, in which a reward is generated based on the Wasserstein distance between the state trajectories of the learner and expert. We show that existing methods can be simplified to generate a reward function without requiring learned models or adversarial learning. Unlike many other state-of-the-art methods, our approach can be integrated with any RL algorithm and is amenable to ILfO. We demonstrate the effectiveness of this simple approach on a variety of continuous control tasks and find that it surpasses the state of the art in the IlfO setting, achieving expert-level performance across a range of evaluation domains even when observing only a single expert trajectory without actions., Comment: Update to newest version, presented at RLC 2024

In the field of reinforcement learning (RL), representation learning is a proven tool for complex image-based tasks, but is often overlooked for environments with low-level states, such as physical control problems. This paper introduces SALE, a novel approach for learning embeddings that model the nuanced interaction between state and action, enabling effective representation learning from low-level states. We extensively study the design space of these embeddings and highlight important design considerations. We integrate SALE and an adaptation of checkpoints for RL into TD3 to form the TD7 algorithm, which significantly outperforms existing continuous control algorithms. On OpenAI gym benchmark tasks, TD7 has an average performance gain of 276.7% and 50.7% over TD3 at 300k and 5M time steps, respectively, and works in both the online and offline settings., Comment: NeurIPS 2023