Search

In the bottomonium sector, the hindered magnetic dipole (M1) transitions between P-wave states $h_b(2P) \rightarrow \chi_{bJ}(1P) \gamma$, $J=0, \, 1, \, 2$, are expected to be severely suppressed according to the Relativized Quark Model, due to the spin flip of the $b$ quark. Nevertheless, a recent model following the coupled-channel approach predicts the corresponding branching fractions to be enhanced by orders of magnitude. In this Letter, we report the first search for such transitions. We find no significant signals and set upper limits at 90% CL on the corresponding branching fractions: $\mathcal{B}[h_b(2P)\to\gamma\chi_{b0}(1P)] < 2.7 \times 10^{-1}$, $\mathcal{B}[h_b(2P)\to\gamma\chi_{b1}(1P)] < 5.4 \times 10^{-3}$ and $\mathcal{B}[h_b(2P)\to\gamma\chi_{b2}(1P)] < 1.3 \times 10^{-2}$. These values help to constrain the parameters of the coupled-channel models. The results are obtained using a $121.4 \, fb^{-1}$ data sample taken around $\sqrt{s}= 10.860 \, GeV$ with the Belle detector at the KEKB asymmetric-energy $e^+e^-$ collider.

Accelerating end-to-end inference of transformer-based large language models (LLMs) is a critical component of AI services in datacenters. However, diverse compute characteristics of end-to-end LLM inference present challenges as previously proposed accelerators only address certain operations or stages (e.g., self-attention, generation stage, etc.). To address the unique challenges of accelerating end-to-end inference, we propose IANUS -- Integrated Accelerator based on NPU-PIM Unified Memory System. IANUS is a domain-specific system architecture that combines a Neural Processing Unit (NPU) with a Processing-in-Memory (PIM) to leverage both the NPU's high computation throughput and the PIM's high effective memory bandwidth. In particular, IANUS employs a unified main memory system where the PIM memory is used both for PIM operations and for NPU's main memory. The unified main memory system ensures that memory capacity is efficiently utilized and the movement of shared data between NPU and PIM is minimized. However, it introduces new challenges since normal memory accesses and PIM computations cannot be performed simultaneously. Thus, we propose novel PIM Access Scheduling that manages normal memory accesses and PIM computations through workload mapping and scheduling across the PIM and the NPU. Our detailed simulation evaluations show that IANUS improves the performance of GPT-2 by 6.2$\times$ and 3.2$\times$, on average, compared to the NVIDIA A100 GPU and the state-of-the-art accelerator. As a proof-of-concept, we develop a prototype of IANUS with a commercial PIM, NPU, and an FPGA-based PIM controller to demonstrate the feasibility of IANUS., Comment: Updated version of the paper accepted to ASPLOS 2024

We examine diverging preferences in human-labeled preference datasets. We develop a taxonomy of disagreement sources spanning 10 categories across four high-level classes -- task underspecification, response style, refusals, and annotation errors. We find that the majority of disagreements are in opposition with standard reward modeling approaches, which are designed with the assumption that annotator disagreement is noise. We then explore how these findings impact two areas of LLM development: reward modeling and evaluation. In our experiments, we demonstrate how standard reward modeling methods, like the Bradley-Terry model, fail to differentiate whether a given preference judgment is the result of unanimous agreement among annotators or the majority opinion among diverging user preferences. We also find that these tendencies are also echoed by popular LLM-as-Judge evaluation methods, which consistently identify a winning response in cases of diverging preferences. These findings highlight remaining challenges in LLM evaluations, which are greatly influenced by divisive features like response style, and in developing pluralistically aligned LLMs. To address these issues, we develop methods for identifying diverging preferences to mitigate their influence on evaluation and training.

The goal of this paper is to accelerate codec-based speech synthesis systems with minimum sacrifice to speech quality. We propose an enhanced inference method that allows for flexible trade-offs between speed and quality during inference without requiring additional training. Our core idea is to predict multiple tokens per inference step of the AR module using multiple prediction heads, resulting in a linear reduction in synthesis time as the number of heads increases. Furthermore, we introduce a novel speculative decoding technique that utilises a Viterbi-based algorithm to select the optimal sequence of generated tokens at each decoding step. In our experiments, we demonstrate that the time required to predict each token is reduced by a factor of 4 to 5 compared to baseline models, with minimal quality trade-off or even improvement in terms of speech intelligibility. Audio samples are available at: multpletokensprediction.github.io/multipletokensprediction.github.io/., Comment: Submitted to IEEE ICASSP 2025

Large language models (LLMs) have demonstrated remarkable performance in the legal domain, with GPT-4 even passing the Uniform Bar Exam in the U.S. However their efficacy remains limited for non-standardized tasks and tasks in languages other than English. This underscores the need for careful evaluation of LLMs within each legal system before application. Here, we introduce KBL, a benchmark for assessing the Korean legal language understanding of LLMs, consisting of (1) 7 legal knowledge tasks (510 examples), (2) 4 legal reasoning tasks (288 examples), and (3) the Korean bar exam (4 domains, 53 tasks, 2,510 examples). First two datasets were developed in close collaboration with lawyers to evaluate LLMs in practical scenarios in a certified manner. Furthermore, considering legal practitioners' frequent use of extensive legal documents for research, we assess LLMs in both a closed book setting, where they rely solely on internal knowledge, and a retrieval-augmented generation (RAG) setting, using a corpus of Korean statutes and precedents. The results indicate substantial room and opportunities for improvement., Comment: EMNLP 2024 Findings

Large Language Models (LLMs) excel at understanding the semantic relationships between queries and documents, even with lengthy and complex long-tail queries. These queries are challenging for feedback-based rankings due to sparse user engagement and limited feedback, making LLMs' ranking ability highly valuable. However, the large size and slow inference of LLMs necessitate the development of smaller, more efficient models (sLLMs). Recently, integrating ranking label generation into distillation techniques has become crucial, but existing methods underutilize LLMs' capabilities and are cumbersome. Our research, RRADistill: Re-Ranking Ability Distillation, propose an efficient label generation pipeline and novel sLLM training methods for both encoder and decoder models. We introduce an encoder-based method using a Term Control Layer to capture term matching signals and a decoder-based model with a ranking layer for enhanced understanding. A/B testing on a Korean-based search platform, validates the effectiveness of our approach in improving re-ranking for long-tail queries., Comment: Accepted to EMNLP 2024 Industry Track. First two authors contributed equally

Large language models (LLMs) have achieved significant performance gains using advanced prompting techniques over various tasks. However, the increasing length of prompts leads to high computational costs and often obscures crucial information. Prompt compression has been proposed to alleviate these issues, but it faces challenges in (i) capturing the global context and (ii) training the compressor effectively. To tackle these challenges, we introduce a novel prompt compression method, namely Reading To Compressing (R2C), utilizing the Fusion-in-Decoder (FiD) architecture to identify the important information in the prompt. Specifically, the cross-attention scores of the FiD are used to discern essential chunks and sentences from the prompt. R2C effectively captures the global context without compromising semantic consistency while detouring the necessity of pseudo-labels for training the compressor. Empirical results show that R2C retains key contexts, enhancing the LLM performance by 6% in out-of-domain evaluations while reducing the prompt length by 80%., Comment: Findings of the Association for Computational Linguistics: EMNLP 2024; 21 pages; 10 figures and 7 tables

A common challenge in aggregating data from multiple sources can be formalized as an \textit{Optimal Transport} (OT) barycenter problem, which seeks to compute the average of probability distributions with respect to OT discrepancies. However, the presence of outliers and noise in the data measures can significantly hinder the performance of traditional statistical methods for estimating OT barycenters. To address this issue, we propose a novel, scalable approach for estimating the \textit{robust} continuous barycenter, leveraging the dual formulation of the \textit{(semi-)unbalanced} OT problem. To the best of our knowledge, this paper is the first attempt to develop an algorithm for robust barycenters under the continuous distribution setup. Our method is framed as a $\min$-$\max$ optimization problem and is adaptable to \textit{general} cost function. We rigorously establish the theoretical underpinnings of the proposed method and demonstrate its robustness to outliers and class imbalance through a number of illustrative experiments., Comment: 19 pages, 4 figures

Optimal Transport (OT) theory investigates the cost-minimizing transport map that moves a source distribution to a target distribution. Recently, several approaches have emerged for learning the optimal transport map for a given cost function using neural networks. We refer to these approaches as the OT Map. OT Map provides a powerful tool for diverse machine learning tasks, such as generative modeling and unpaired image-to-image translation. However, existing methods that utilize max-min optimization often experience training instability and sensitivity to hyperparameters. In this paper, we propose a novel method to improve stability and achieve a better approximation of the OT Map by exploiting displacement interpolation, dubbed Displacement Interpolation Optimal Transport Model (DIOTM). We derive the dual formulation of displacement interpolation at specific time $t$ and prove how these dual problems are related across time. This result allows us to utilize the entire trajectory of displacement interpolation in learning the OT Map. Our method improves the training stability and achieves superior results in estimating optimal transport maps. We demonstrate that DIOTM outperforms existing OT-based models on image-to-image translation tasks., Comment: 20 pages

Unpaired point cloud completion explores methods for learning a completion map from unpaired incomplete and complete point cloud data. In this paper, we propose a novel approach for unpaired point cloud completion using the unbalanced optimal transport map, called Unbalanced Optimal Transport Map for Unpaired Point Cloud Completion (UOT-UPC). We demonstrate that the unpaired point cloud completion can be naturally interpreted as the Optimal Transport (OT) problem and introduce the Unbalanced Optimal Transport (UOT) approach to address the class imbalance problem, which is prevalent in unpaired point cloud completion datasets. Moreover, we analyze the appropriate cost function for unpaired completion tasks. This analysis shows that the InfoCD cost function is particularly well-suited for this task. Our model is the first attempt to leverage UOT for unpaired point cloud completion, achieving competitive or superior results on both single-category and multi-category datasets. In particular, our model is especially effective in scenarios with class imbalance, where the proportions of categories are different between the incomplete and complete point cloud datasets., Comment: 20 pages, 10 figures

The Optimal Transport (OT) problem investigates a transport map that connects two distributions while minimizing a given cost function. Finding such a transport map has diverse applications in machine learning, such as generative modeling and image-to-image translation. In this paper, we introduce a scalable and simulation-free approach for solving the Entropic Unbalanced Optimal Transport (EUOT) problem. We derive the dynamical form of this EUOT problem, which is a generalization of the Schr\"odinger bridges (SB) problem. Based on this, we derive dual formulation and optimality conditions of the EUOT problem from the stochastic optimal control interpretation. By leveraging these properties, we propose a simulation-free algorithm to solve EUOT, called Simulation-free EUOT (SF-EUOT). While existing SB models require expensive simulation costs during training and evaluation, our model achieves simulation-free training and one-step generation by utilizing the reciprocal property. Our model demonstrates significantly improved scalability in generative modeling and image-to-image translation tasks compared to previous SB methods., Comment: 26 pages

Place recognition plays an important role in achieving robust long-term autonomy. Real-world robots face a wide range of weather conditions (e.g. overcast, heavy rain, and snowing) and most sensors (i.e. camera, LiDAR) essentially functioning within or near-visible electromagnetic waves are sensitive to adverse weather conditions, making reliable localization difficult. In contrast, radar is gaining traction due to long electromagnetic waves, which are less affected by environmental changes and weather independence. In this work, we propose a radar-based lightweight and robust place recognition. We achieve rotational invariance and lightweight by selecting a one-dimensional ring-shaped description and robustness by mitigating the impact of false detection utilizing opposite noise characteristics between free space and feature. In addition, the initial heading can be estimated, which can assist in building a SLAM pipeline that combines odometry and registration, which takes into account onboard computing. The proposed method was tested for rigorous validation across various scenarios (i.e. single session, multi-session, and different weather conditions). In particular, we validate our descriptor achieving reliable place recognition performance through the results of extreme environments that lacked structural information such as an OORD dataset., Comment: 8 pages, 8 figures, accepted to RA-L

Text-to-SQL systems have become crucial for translating natural language into SQL queries in various industries, enabling non-technical users to perform complex data operations. The need for accurate evaluation methods has increased as these systems have grown more sophisticated. However, the Execution Accuracy (EX), the most prevalent evaluation metric, still shows many false positives and negatives. Thus, this paper introduces FLEX (False-Less EXecution), a novel approach to evaluating text-to-SQL systems using large language models (LLMs) to emulate human expert-level evaluation of SQL queries. Our metric improves agreement with human experts (from 62 to 87.04 in Cohen's kappa) with comprehensive context and sophisticated criteria. Our extensive experiments yield several key insights: (1) Models' performance increases by over 2.6 points on average, substantially affecting rankings on Spider and BIRD benchmarks; (2) The underestimation of models in EX primarily stems from annotation quality issues; and (3) Model performance on particularly challenging questions tends to be overestimated. This work contributes to a more accurate and nuanced evaluation of text-to-SQL systems, potentially reshaping our understanding of state-of-the-art performance in this field., Comment: preprint, under review

For over 25 years, the DAMA/LIBRA collaboration has claimed to observe an annual modulation signal, suggesting the existence of dark matter interactions. However, no other experiments have replicated their result using different detector materials. To address this puzzle, the COSINE-100 collaboration conducted a model-independent test using 106 kg of sodium iodide as detectors, the same target material as DAMA/LIBRA. Analyzing data collected over 6.4 years, with improved energy calibration and time-dependent background description, we found no evidence of an annual modulation signal, challenging the DAMA/LIBRA result with a confidence level greater than 3$\sigma$. This finding represents a significant step toward resolving the long-standing debate surrounding DAMA/LIBRA's dark matter claim, indicating that the observed modulation is unlikely to be caused by dark matter interactions.

We report the first measurement of the azimuthal anisotropy of J$/\psi$ at forward rapidity ($1.2<|\eta|<2.2$) in Au$+$Au collisions at $\sqrt{s_{_{NN}}}=200$ GeV at the Relativistic Heavy Ion Collider. The data were collected by the PHENIX experiment in 2014 and 2016 with integrated luminosity of 14.5~nb$^{-1}$. The second Fourier coefficient ($v_2$) of the azimuthal distribution of $J/\psi$ is determined as a function of the transverse momentum ($p_T$) using the event-plane method. The measurements were performed for several selections of collision centrality: 0\%--50\%, 10\%--60\%, and 10\%-40\%. We find that in all cases the values of $v_2(p_T)$, which quantify the elliptic flow of J$/\psi$, are consistent with zero. The results are consistent with measurements at midrapidity, indicating no significant elliptic flow of the J$/\psi$ within the quark-gluon-plasma medium at collision energies of $\sqrt{s_{_{NN}}}=200$ GeV., Comment: 369 authors from 72 institutions, 12 pages, 7 figures, 5 tables. v1 is version submitted to Physical Review C. HEPdata tables for the points plotted in figures for this and previous PHENIX publications are (or will be) publicly available at http://www.phenix.bnl.gov/papers.html

We present the first forward-rapidity measurements of elliptic anisotropy of open-heavy-flavor muons at the BNL Relativistic Heavy Ion Collider. The measurements are based on data samples of Au$+$Au collisions at $\sqrt{s_{_{NN}}}=200$ GeV collected by the PHENIX experiment in 2014 and 2016 with integrated luminosity of 14.5~nb$^{-1}$. The measurements are performed in the pseudorapidity range $1.2<|\eta|<2$ and cover transverse momenta $1

We propose a multichannel-to-multichannel target sound extraction (M2M-TSE) framework for separating multichannel target signals from a multichannel mixture of sound sources. Target sound extraction (TSE) isolates a specific target signal using user-provided clues, typically focusing on single-channel extraction with class labels or temporal activation maps. However, to preserve and utilize spatial information in multichannel audio signals, it is essential to extract multichannel signals of a target sound source. Moreover, the clue for extraction can also include spatial or temporal cues like direction-of-arrival (DoA) or timestamps of source activation. To address these challenges, we present an M2M framework that extracts a multichannel sound signal based on spatio-temporal clues. We demonstrate that our transformer-based architecture can successively accomplish the M2M-TSE task for multichannel signals synthesized from audio signals of diverse classes in different room environments. Furthermore, we show that the multichannel extraction task introduces sufficient inductive bias in the DNN, allowing it to directly handle DoA clues without utilizing hand-crafted spatial features., Comment: 5 pages, 4 figures

Air pollution, particularly particulate matter (PM2.5), poses significant risks to public health and the environment, necessitating accurate prediction and continuous monitoring for effective air quality management. However, air quality monitoring (AQM) data often suffer from missing records due to various technical difficulties. This study explores the application of Sparse Identification of Nonlinear Dynamics (SINDy) for imputing missing PM2.5 data by predicting, using training data from 2016, and comparing its performance with the established Soft Impute (SI) and K-Nearest Neighbors (KNN) methods.

State-of-the-art (SOTA) video denoising methods employ multi-frame simultaneous denoising mechanisms, resulting in significant delays (e.g., 16 frames), making them impractical for real-time cameras. To overcome this limitation, we propose a multi-fusion gated recurrent Transformer network (GRTN) that achieves SOTA denoising performance with only a single-frame delay. Specifically, the spatial denoising module extracts features from the current frame, while the reset gate selects relevant information from the previous frame and fuses it with current frame features via the temporal denoising module. The update gate then further blends this result with the previous frame features, and the reconstruction module integrates it with the current frame. To robustly compute attention for noisy features, we propose a residual simplified Swin Transformer with Euclidean distance (RSSTE) in the spatial and temporal denoising modules. Comparative objective and subjective results show that our GRTN achieves denoising performance comparable to SOTA multi-frame delay networks, with only a single-frame delay., Comment: 5 pages, 5 figures

The $J/\psi$ and $\psi(2S)$ charmonium states, composed of $c\bar{c}$ quark pairs and known since the 1970s, are widely believed to serve as ideal probes to test quantum chromodynamics in high-energy hadronic interactions. However, there is not yet a complete understanding of the charmonium-production mechanism. Recent measurements of $J/\psi$ production as a function of event charged-particle multiplicity at the collision energies of both the Large Hadron Collider (LHC) and the Relativistic Heavy Ion Collider (RHIC) show enhanced $J/\psi$ production yields with increasing multiplicity. One potential explanation for this type of dependence is multiparton interactions (MPI). We carry out the first measurements of self-normalized $J/\psi$ yields and the $\psi(2S)$ to $J/\psi$ ratio at both forward and backward rapidities as a function of self-normalized charged-particle multiplicity in $p$$+$$p$ collisions at $\sqrt{s}=200$ GeV. In addition, detailed {\sc pythia} studies tuned to RHIC energies were performed to investigate the MPI impacts. We find that the PHENIX data at RHIC are consistent with recent LHC measurements and can only be described by {\sc pythia} calculations that include MPI effects. The forward and backward $\psi(2S)$ to $J/\psi$ ratio, which serves as a unique and powerful approach to study final-state effects on charmonium production, is found to be less dependent on the charged-particle multiplicity., Comment: 301 authors from 69 institutions, 8 pages, 3 figures. v1 is version submitted to Physical Review D Letters. HEPdata tables for the points plotted in figures for this and previous PHENIX publications are (or will be) publicly available at http://www.phenix.bnl.gov/papers.html

We present the first measurement of the missing energy due to nuclear effects in monoenergetic, muon neutrino charged-current interactions on carbon, originating from $K^+ \rightarrow \mu^+ \nu_\mu$ decay-at-rest ($E_{\nu_\mu}=235.5$ MeV), performed with the JSNS$^2$ liquid scintillator based experiment. Towards characterizing the neutrino interaction, ostensibly $\nu_\mu n \rightarrow \mu^- p$ or $\nu_\mu$$^{12}\mathrm{C}$ $\rightarrow \mu^-$$^{12}\mathrm{N}$, and in analogy to similar electron scattering based measurements, we define the missing energy as the energy transferred to the nucleus ($\omega$) minus the kinetic energy of the outgoing proton(s), $E_{m} \equiv \omega-\sum T_p$, and relate this to visible energy in the detector, $E_{m}=E_{\nu_\mu}~(235.5~\mathrm{MeV})-m_\mu~(105.7~\mathrm{MeV}) - E_{vis}$. The missing energy, which is naively expected to be zero in the absence of nuclear effects (e.g. nucleon separation energy, Fermi momenta, and final-state interactions), is uniquely sensitive to many aspects of the interaction, and has previously been inaccessible with neutrinos. The shape-only, differential cross section measurement reported, based on a $(77\pm3)$% pure double-coincidence KDAR signal (621 total events), provides an important benchmark for models and event generators at 100s-of-MeV neutrino energies, characterized by the difficult-to-model transition region between neutrino-nucleus and neutrino-nucleon scattering, and relevant for applications in nuclear physics, neutrino oscillation measurements, and Type-II supernova studies.

Visual text design plays a critical role in conveying themes, emotions, and atmospheres in multimodal formats such as film posters and album covers. Translating these visual and textual elements across languages extends the concept of translation beyond mere text, requiring the adaptation of aesthetic and stylistic features. To address this, we introduce a novel task of Multimodal Style Translation (MuST-Bench), a benchmark designed to evaluate the ability of visual text generation models to perform translation across different writing systems while preserving design intent. Our initial experiments on MuST-Bench reveal that existing visual text generation models struggle with the proposed task due to the inadequacy of textual descriptions in conveying visual design. In response, we introduce SIGIL, a framework for multimodal style translation that eliminates the need for style descriptions. SIGIL enhances image generation models through three innovations: glyph latent for multilingual settings, pretrained VAEs for stable style guidance, and an OCR model with reinforcement learning feedback for optimizing readable character generation. SIGIL outperforms existing baselines by achieving superior style consistency and legibility while maintaining visual fidelity, setting itself apart from traditional description-based approaches. We release MuST-Bench publicly for broader use and exploration https://huggingface.co/datasets/yejinc/MuST-Bench.

Understanding species dynamics in heterogeneous environments is essential for ecosystem studies. Traditional models assumed homogeneous habitats, but recent approaches include spatial and temporal variability, highlighting species migration. We adopt starvation-driven diffusion (SDD) models as nonlinear diffusion to describe species dispersal based on local resource conditions, showing advantages for species survival. However, accurate prediction remains challenging due to model simplifications. This study uses multi-agent reinforcement learning (MARL) with deep Q-networks (DQN) to simulate single species and predator-prey interactions, incorporating SDD-type rewards. Our simulations reveal evolutionary dispersal strategies, providing insights into species dispersal mechanisms and validating traditional mathematical models.

Using $(27.12\pm0.14) \times 10^{8}$ $\psi(2S)$ events collected by the BESIII detector operating at BEPCII, we search for the decay $\eta_c(2S)\to p\bar{p}$ via the process $\psi(2S)\to \gamma\eta_c(2S)$, and only find a signal with a significance of $1.7\,\sigma$. The upper limit of the product branching fraction at the 90% confidence level is determined to be $\mathcal{B}(\psi(2S)\to \gamma\eta_c(2S))\times \mathcal{B}(\eta_c(2S)\to p\bar{p})<2.4\times 10^{-7}$. The branching fractions of $\chi_{cJ}\to p\bar{p}~(J=0,1,2)$ are also measured to be $\mathcal{B}(\chi_{c0}\to p\bar{p})=(2.51\pm0.02\pm0.08)\times 10^{-4}$, $\mathcal{B}(\chi_{c1}\to p\bar{p})=(8.16\pm0.09\pm0.25)\times 10^{-4}$, and $\mathcal{B}(\chi_{c2}\to p\bar{p})=(8.33\pm0.09\pm0.22)\times 10^{-4}$, where the first uncertainty is statistical and the second systematic.

Futaki invariants of the classical moduli space of 4d N=1 supersymmetric gauge theories determine whether they have a conformal fixed point in the IR. We systematically compute the Futaki invariants for a large family of 4d N=1 supersymmetric gauge theories coming from D3-branes probing Calabi-Yau 3-fold singularities whose bases are Gorenstein Fano surfaces. In particular, we focus on the toric case where the Fano surfaces are given by the 16 reflexive convex polygons and the moduli spaces are given by the corresponding toric Calabi-Yau 3-folds. We study the distribution of and conjecture new bounds on the Futaki invariants with respect to various topological and geometric quantities. These include the minimum volume of the Sasaki-Einstein base manifolds as well as the Chern and Euler numbers of the toric Fano surfaces. Even though the moduli spaces for the family of theories studied are known to be K-stable, our work sheds new light on how the topological and geometric quantities restrict the Futaki invariants for a plethora of moduli spaces., Comment: 65 pages, 19 figures, 11 tables

In today's machine learning world for tabular data, XGBoost and fully connected neural network (FCNN) are two most popular methods due to their good model performance and convenience to use. However, they are highly complicated, hard to interpret, and can be overfitted. In this paper, we propose a new modeling framework called cross spline net (CSN) that is based on a combination of spline transformation and cross-network (Wang et al. 2017, 2021). We will show CSN is as performant and convenient to use, and is less complicated, more interpretable and robust. Moreover, the CSN framework is flexible, as the spline layer can be configured differently to yield different models. With different choices of the spline layer, we can reproduce or approximate a set of non-neural network models, including linear and spline-based statistical models, tree, rule-fit, tree-ensembles (gradient boosting trees, random forest), oblique tree/forests, multi-variate adaptive regression spline (MARS), SVM with polynomial kernel, etc. Therefore, CSN provides a unified modeling framework that puts the above set of non-neural network models under the same neural network framework. By using scalable and powerful gradient descent algorithms available in neural network libraries, CSN avoids some pitfalls (such as being ad-hoc, greedy or non-scalable) in the case-specific optimization methods used in the above non-neural network models. We will use a special type of CSN, TreeNet, to illustrate our point. We will compare TreeNet with XGBoost and FCNN to show the benefits of TreeNet. We believe CSN will provide a flexible and convenient framework for practitioners to build performant, robust and more interpretable models.

The high electron temperature in galaxy clusters ($>1\,$keV or $>10^7\,$K) leads to corrections at the level of a few percent in their thermal Sunyaev-Zeldovich effect signatures. Both the size and frequency dependence of these corrections, which are known as relativistic temperature corrections, depend upon the temperature of the objects. In this work we exploit this effect to measure the average temperature of a stack of Compton-$y$ selected clusters. Specifically, we apply the "spectroscopic method" and search for the temperature that best fits the clusters' signal measured at frequencies from 30 to 545 GHz by the Atacama Cosmology Telescope and Planck satellite. We measure the average temperature of clusters detected in the ACT maps to be $8.5\pm 2.4\,$keV, with an additional systematic error of comparable amplitude dominated by passband uncertainty. Upcoming surveys, such as the Simons Observatory and CMB-S4, have the potential to dramatically improve upon these measurements and thereby enable precision studies of cluster temperatures with millimeter observations. The key challenge for future observations will be mitigating instrumental systematic effects, which already limit this analysis., Comment: 21 pages with 17 figures

We present new measurements of the two-dimensional (2-D) geometry of the LMC's stellar bar with precise astrometric observations of red clump stars in Gaia DR3. We develop a novel solution to tackle crowding induced incompleteness in Gaia datasets with the Gaia BP-RP color excess. Utilizing the color excess information, we derive a 2-D completeness map of the LMC's disk. We find that incompleteness biases the bar measurements and induces large uncertainties. With the completeness-corrected 2-D red clump map, we precisely measure the LMC bar's properties for the first time using Fourier decomposition. The bar radius is $R_{bar} = 2.13^{+0.03}_{-0.04}$ kpc, and its position angle is $121.26^{\circ} \pm 0.21^{\circ}$. The bar's strength as quantified by the Fourier bi-symmetric amplitude is $S_{bar} = 0.27$, indicating that the LMC has a significant bar perturbation. We find the bar has an axis ratio of $0.54 \pm 0.03$, and is offset with respect to the center of the outer disk isophote at R $\approx$ 5 kpc by $0.76 \pm 0.01$ kpc. These LMC bar properties agree with a hydrodynamic model where the SMC has undergone a recent direct collision with the LMC. We compare the LMC's bar properties with other barred galaxies in the local universe, and discover that the LMC is similar to other barred galaxies in terms of bar-galaxy scaling relations. We discuss how our completeness correction framework can be applied to other systems in the Local Group., Comment: 21 pages, submitted to ApJ, comments welcome

Despite significant advancements in neural text-to-audio generation, challenges persist in controllability and evaluation. This paper addresses these issues through the Sound Scene Synthesis challenge held as part of the Detection and Classification of Acoustic Scenes and Events 2024. We present an evaluation protocol combining objective metric, namely Fr\'echet Audio Distance, with perceptual assessments, utilizing a structured prompt format to enable diverse captions and effective evaluation. Our analysis reveals varying performance across sound categories and model architectures, with larger models generally excelling but innovative lightweight approaches also showing promise. The strong correlation between objective metrics and human ratings validates our evaluation approach. We discuss outcomes in terms of audio quality, controllability, and architectural considerations for text-to-audio synthesizers, providing direction for future research., Comment: accepted to NeurIPS 2024 Workshop: Audio Imagination

We have analyzed the dynamics of entanglement in dissipative fermionic and bosonic Su-Schrieffer-Heeger (SSH) models and found that, when the decoherence channel preserves the chiral symmetry, they exhibit a revival of entanglement in a wide range of parameters. This behavior only emerges in the topological phase, with the visibility of the revival dropping to zero at the phase boundary. Furthermore, the revival acquires a universal character once the system size exceeds the localization length of the edge modes. Our findings indicate that the universal entanglement revival has its origin in the topological properties of the SSH model. These dynamical properties may be experimentally accessible, for example, using photonic quantum computers., Comment: 19 pages with 8 figures

Density-equalizing map is a shape deformation technique originally developed for cartogram creation and sociological data visualization on planar geographical maps. In recent years, there has been an increasing interest in developing density-equalizing mapping methods for surface and volumetric domains and applying them to various problems in geometry processing and imaging science. However, the existing surface density-equalizing mapping methods are only applicable to surfaces with relatively simple topologies but not surfaces with topological holes. In this work, we develop a novel algorithm for computing density-equalizing maps for toroidal surfaces. In particular, different shape deformation effects can be easily achieved by prescribing different population functions on the torus and performing diffusion-based deformations on a planar domain with periodic boundary conditions. Furthermore, the proposed toroidal density-equalizing mapping method naturally leads to an effective method for computing toroidal parameterizations of genus-one surfaces with controllable shape changes, with the toroidal area-preserving parameterization being a prime example. Experimental results are presented to demonstrate the effectiveness of our proposed methods.

Autonomous agents powered by large language models (LLMs) show promising potential in assistive tasks across various domains, including mobile device control. As these agents interact directly with personal information and device settings, ensuring their safe and reliable behavior is crucial to prevent undesirable outcomes. However, no benchmark exists for standardized evaluation of the safety of mobile device-control agents. In this work, we introduce MobileSafetyBench, a benchmark designed to evaluate the safety of device-control agents within a realistic mobile environment based on Android emulators. We develop a diverse set of tasks involving interactions with various mobile applications, including messaging and banking applications. To clearly evaluate safety apart from general capabilities, we design separate tasks measuring safety and tasks evaluating helpfulness. The safety tasks challenge agents with managing potential risks prevalent in daily life and include tests to evaluate robustness against indirect prompt injections. Our experiments demonstrate that while baseline agents, based on state-of-the-art LLMs, perform well in executing helpful tasks, they show poor performance in safety tasks. To mitigate these safety concerns, we propose a prompting method that encourages agents to prioritize safety considerations. While this method shows promise in promoting safer behaviors, there is still considerable room for improvement to fully earn user trust. This highlights the urgent need for continued research to develop more robust safety mechanisms in mobile environments. We open-source our benchmark at: https://mobilesafetybench.github.io/.

Existing fairness benchmarks for large language models (LLMs) primarily focus on simple tasks, such as multiple-choice questions, overlooking biases that may arise in more complex scenarios like long-text generation. To address this gap, we introduce the Long Text Fairness Test (LTF-TEST), a framework that evaluates biases in LLMs through essay-style prompts. LTF-TEST covers 14 topics and 10 demographic axes, including gender and race, resulting in 11,948 samples. By assessing both model responses and the reasoning behind them, LTF-TEST uncovers subtle biases that are difficult to detect in simple responses. In our evaluation of five recent LLMs, including GPT-4o and LLaMa3, we identify two key patterns of bias. First, these models frequently favor certain demographic groups in their responses. Second, they show excessive sensitivity toward traditionally disadvantaged groups, often providing overly protective responses while neglecting others. To mitigate these biases, we propose FT-REGARD, a finetuning approach that pairs biased prompts with neutral responses. FT-REGARD reduces gender bias by 34.6% and improves performance by 1.4 percentage points on the BBQ benchmark, offering a promising approach to addressing biases in long-text generation tasks., Comment: 22 page, 38 figures, Neurips (SoLaR Workshop)

The integration of ferroelectrics with semiconductors is crucial for developing functional devices, such as field-effect transistors, tunnel junctions, and nonvolatile memories. However, the synthesis of high-quality single-crystalline ferroelectric nitride perovskites has been limited, hindering a comprehensive understanding of their switching dynamics and potential applications. Here we report the synthesis and characterizations of epitaxial single-phase ferroelectric cerium tantalum nitride (CeTaN3) on both oxides and semiconductors. The polar symmetry of CeTaN3 was confirmed by observing the atomic displacement of central ions relative to the center of the TaN6 octahedra, as well as through optical second harmonic generation. We observed switchable ferroelectric domains in CeTaN3 films using piezo-response force microscopy, complemented by the characterization of square-like polarization-electric field hysteresis loops. The remanent polarization of CeTaN3 reaches approximately 20 uC/cm2 at room temperature, consistent with theoretical calculations. This work establishes a vital link between ferroelectric nitride perovskites and their practical applications, paving the way for next-generation information and energy-storage devices with enhanced performance, scalability, and manufacturability., Comment: 47 pages, 4 figures

Studies are performed of the Cabibbo-favored decay $\Lambda_{c}^{+}\to\Lambda K_{S}^{0}K^+$ and the singly Cabibbo-suppressed decay $\Lambda_{c}^{+}\to\Lambda K_{S}^{0}\pi^+$, based on a sample of $e^{+}e^{-}$ collision data, corresponding to an integrated luminosity of 4.5 fb$^{-1}$, accumulated at center-of-mass energies between $4599.53$ MeV and $4698.82$ MeV with the BESIII detector. The decay $\Lambda_{c}^{+}\to\Lambda K_{S}^{0}\pi^+$ is observed for the first time. The branching fractions of $\Lambda_{c}^{+}\to\Lambda K_{S}^{0}K^+$ and $\Lambda_{c}^{+}\to\Lambda K_{S}^{0}\pi^+$ are measured to be $(3.04\pm0.30\pm0.16)\times 10^{-3}$ and $(1.73\pm0.27\pm0.10)\times 10^{-3}$, respectively, where the first uncertainties are statistical and the second are systematic. These results correspond to the most precise measurement of these quantities for both decays. Evidence of a $K^{*+}$ contribution in the $\Lambda_{c}^{+}\to\Lambda K_{S}^{0}\pi^+$ decay is found with a statistical significance of $4.7\sigma$. The branching fraction of $\Lambda_{c}^{+}\to\Lambda K^{*+}$ is calculated under three possible interference scenarios.

We prove that if $f:X \rightarrow A$ is a morphism from a smooth projective variety $X$ to an abelian variety $A$ over a number field $K$, $G$ is a subgroup of automorphisms of $X$ satisfying certain properties, and if a prime $p$ divides the order of $G$, then the rank of $A$ increases by at least $p$ over infinitely many linearly disjoint $G$-extensions $L_i/K$. We also explore the conditions on such varieties $X$ and groups $G$, with applications to Jacobian varieties, and provide two infinite families of elliptic curves with rank growth of $2$ and $3$, respectively., Comment: 19 pages

The ideal LLM content moderation system would be both structurally interpretable (so its decisions can be explained to users) and steerable (to reflect a community's values or align to safety standards). However, current systems fall short on both of these dimensions. To address this gap, we present SafetyAnalyst, a novel LLM safety moderation framework. Given a prompt, SafetyAnalyst creates a structured "harm-benefit tree," which identifies 1) the actions that could be taken if a compliant response were provided, 2) the harmful and beneficial effects of those actions (along with their likelihood, severity, and immediacy), and 3) the stakeholders that would be impacted by those effects. It then aggregates this structured representation into a harmfulness score based on a parameterized set of safety preferences, which can be transparently aligned to particular values. Using extensive harm-benefit features generated by SOTA LLMs on 19k prompts, we fine-tuned an open-weight LM to specialize in generating harm-benefit trees through symbolic knowledge distillation. On a comprehensive set of prompt safety benchmarks, we show that our system (average F1=0.75) outperforms existing LLM safety moderation systems (average F1$<$0.72) on prompt harmfulness classification, while offering the additional advantages of interpretability and steerability.

We study two types of approximations of Lipschitz maps with derivatives of maximal slopes on Banach spaces. First, we characterize the Radon-Nikod\'ym property in terms of strongly norm attaining Lipschitz maps and maximal derivative attaining Lipschitz maps, which complements the characterization presented in \cite{CCM}. It is shown in particular that if every Lipschitz map can be approximated by those that either strongly attain their norm or attain their maximal derivative for every renorming of the range space, then the range space must have the Radon-Nikod\'ym property. Next, we prove that every Lipschitz functional defined on the real line can be locally approximated by maximal affine functions, while such an approximation cannot be guaranteed in the context of uniform approximation. This extends the previous work in \cite{BJLPS} in view of maximal affine functions., Comment: 16 pages

This paper studies the approximation property of ReLU neural networks (NNs) to piecewise constant functions with unknown interfaces in bounded regions in $\mathbb{R}^d$. Under the assumption that the discontinuity interface $\Gamma$ may be approximated by a connected series of hyperplanes with a prescribed accuracy $\varepsilon >0$, we show that a three-layer ReLU NN is sufficient to accurately approximate any piecewise constant function and establish its error bound. Moreover, if the discontinuity interface is convex, an analytical formula of the ReLU NN approximation with exact weights and biases is provided., Comment: 17 pages, 8 figures, submitted to the journal

We present archival HST and JWST ultraviolet through near infrared time series photometric observations of a massive minimal-contact binary candidate in the metal-poor galaxy WLM ($Z = 0.14 Z_{\odot}$). This discovery marks the lowest metallicity contact binary candidate observed to date. We determine the nature of the two stars in the binary by using the eclipsing binary modeling software (PHysics Of Eclipsing BinariEs; PHOEBE) to train a neural network to fit our observed panchromatic multi-epoch photometry. The best fit model consists of two hot MS stars ($T_1=29800^{+2300}_{-1700}$ K, $M_1=16^{+2}_{-3}~M_{\odot}$, and $T_2=18000^{+5000}_{-5000}$ K, $M_2=7^{+5}_{-3}~M_{\odot}$). We discuss plausible evolutionary paths for the system, and suggest the system is likely to be currently in a contact phase before ultimately ending in a merger. Future spectroscopy will help to further narrow down evolutionary pathways. This work showcases a novel use of data of JWST and HST imaging originally taken to characterize RR Lyrae. We expect time series imaging from LSST, BlackGEM, etc. to uncover similar types of objects in nearby galaxies., Comment: comments welcome

The development of magnetic refrigerators that operate at room temperature without the use of environmentally harmful substances represents a significant advancement in eco-friendly technology. These refrigerators employ the magnetocaloric effect (MCE), which has traditionally been achieved using expensive rare-earth elements such as gadolinium. To facilitate cost-effective commercialization, it is essential to investigate alternative materials, such as transition metal alloys. In this study, an Fe47.5Ni37.5Mn15 alloy, which has a Curie temperature that is close to room temperature, is cast, and the alloy exhibits a noteworthy cooling power of 297.68 J/kg, which makes it good for cost-effective applications. To further enhance MCE performance through super-paramagnetism (e.g. size reduction), nanoparticles of the same composition are synthesized using a top-down approach via pulsed-laser ablation in ethanol. However, these nanoparticles do not exhibit a Curie temperature near room temperature, likely due to significant carbon incorporation during synthesis, which adversely affected their magnetocaloric properties. This study underscores the potential of transition metal alloys for magnetic refrigeration and highlights the need for optimized synthesis methods to achieve desired thermal properties in nanoparticulate form.

Recently, pre-trained language models (PLMs) have been increasingly adopted in spoken language understanding (SLU). However, automatic speech recognition (ASR) systems frequently produce inaccurate transcriptions, leading to noisy inputs for SLU models, which can significantly degrade their performance. To address this, our objective is to train SLU models to withstand ASR errors by exposing them to noises commonly observed in ASR systems, referred to as ASR-plausible noises. Speech noise injection (SNI) methods have pursued this objective by introducing ASR-plausible noises, but we argue that these methods are inherently biased towards specific ASR systems, or ASR-specific noises. In this work, we propose a novel and less biased augmentation method of introducing the noises that are plausible to any ASR system, by cutting off the non-causal effect of noises. Experimental results and analyses demonstrate the effectiveness of our proposed methods in enhancing the robustness and generalizability of SLU models against unseen ASR systems by introducing more diverse and plausible ASR noises in advance., Comment: 9 pages, 3 figures

The Transformer architecture has become widely adopted due to its demonstrated success, attributed to the attention mechanism at its core. Despite these successes, the attention mechanism of Transformers is associated with two well-known issues: rank-collapse and gradient vanishing. In this paper, we present a theoretical analysis that it is inherently difficult to address both issues simultaneously in the conventional attention mechanism. To handle these issues, we introduce a novel class of attention mechanism, referred to as generalized probabilistic attention mechanism (GPAM), and its dual-attention implementation within the Transformer architecture. Unlike conventional attention mechanisms, GPAM allows for negative attention scores while preserving a fixed total sum. We provide theoretical evidence that the proposed dual-attention GPAM (daGPAM) effectively mitigates both the rank-collapse and gradient vanishing issues which are difficult to resolve simultaneously with the conventional attention mechanisms. Furthermore, we empirically validate this theoretical evidence, demonstrating the superiority of daGPAM compared to other alternative attention mechanisms that were proposed to address the same issues. Additionally, we demonstrate the practical benefits of GPAM in natural language processing tasks, such as language modeling and neural machine translation.

The majority of online continual learning (CL) advocates single-epoch training and imposes restrictions on the size of replay memory. However, single-epoch training would incur a different amount of computations per CL algorithm, and the additional storage cost to store logit or model in addition to replay memory is largely ignored in calculating the storage budget. Arguing different computational and storage budgets hinder fair comparison among CL algorithms in practice, we propose to use floating point operations (FLOPs) and total memory size in Byte as a metric for computational and memory budgets, respectively, to compare and develop CL algorithms in the same 'total resource budget.' To improve a CL method in a limited total budget, we propose adaptive layer freezing that does not update the layers for less informative batches to reduce computational costs with a negligible loss of accuracy. In addition, we propose a memory retrieval method that allows the model to learn the same amount of knowledge as using random retrieval in fewer iterations. Empirical validations on the CIFAR-10/100, CLEAR-10/100, and ImageNet-1K datasets demonstrate that the proposed approach outperforms the state-of-the-art methods within the same total budget

As the number of low Earth orbit (LEO) satellites rapidly increases, the consideration of frequency sharing or cooperation between geosynchronous Earth orbit (GEO) and LEO satellites is gaining attention. In this paper, we consider a hybrid GEO-LEO satellite network where GEO and LEO satellites are distributed according to independent Poisson point processes (PPPs) and share the same frequency resources. Based on the properties of PPPs, we first analyze satellite-visible probabilities, distance distributions, and association probabilities. Then, we derive an analytical expression for the network's coverage probability. Through Monte Carlo simulations, we verify the analytical results and demonstrate the impact of system parameters on coverage performance. The analytical results effectively estimate the coverage performance in scenarios where GEO and LEO satellites cooperate or share the same resource., Comment: 5 pages, 4 figures, 1 table, submitted to IEEE Transactions on Vehicular Technology