Machine Learning
DCTracks: An Open Dataset for Machine Learning-Based Drift Chamber Track Reconstruction
Qian Liyan, Zhang Yao, Yuan Ye et al. (+11 more)
We introduce a Monte Carlo (MC)
dataset of single- and two-track drift chamber events to advance Machine Learning (ML)-based track reconstruction. To enable standardized and comparable evaluation, we define track reconstruction specific metrics and report results for traditional track reconstruction
algorithms and a Graph Neural Networks (GNNs) method, facilitating rigorous, reproducible validation for future research.
Read the full abstract ▾
All authors Qian Liyan, Zhang Yao, Yuan Ye, Zhang Zhaoke, Fang Jin, Jiang Shimiao, Zhang Jin, Li Ke, Liu Beijiang, Xu Chenglin, Zhang Yifan, Jia Xiaoqian, Qin Xiaoshuai, Huang Xingtao
Machine Learning
Fluid-Agent Reinforcement Learning
Shishir Sharma, Doina Precup and Theodore J. Perkins
The primary focus of multi-
agent reinforcement learning (MARL) has been to study interactions among a fixed number of
agents embedded in an environment. However, in the real world, the number of
agents is neither fixed nor known a priori. Moreover, an
agent can decide to create other
agents (for example, a
cell may divide, or a company may
spin off a division). In this paper, we propose a framework that allows
agents to create other
agents; we call this a fluid-
agent environment. We present game-theoretic solution concepts for fluid-
agent games and empirically evaluate the performance of several MARL
algorithms within this framework. Our experiments include fluid variants of established
benchmarks such as Predator-Prey and Level-Based Foraging, where
agents can dynamically spawn, as well as a new environment we introduce that highlights how fluidity can unlock novel solution strategies beyond those observed in fixed-population settings. We demonstrate that this framework yields
agent teams that adjust their size dynamically to match environmental demands.
Read the full abstract ▾
Machine Learning
Governing AI Forgetting: Auditing for Machine Unlearning Compliance
Qinqi Lin, Ningning Ding, Lingjie Duan et al. (+1 more)
Despite legal mandates for the right to be forgotten, AI operators routinely fail to comply with data deletion requests. While machine unlearning (MU) provides a technical solution to remove personal data's influence from trained models, ensuring compliance remains challenging due to the fundamental gap between MU's technical feasibility and regulatory implementation. In this paper, we introduce the first economic framework for
auditing MU compliance, by integrating certified unlearning theory with regulatory enforcement. We first characterize MU's inherent verification uncertainty using a hypothesis-testing interpretation of certified unlearning to derive the auditor's detection capability, and then propose a game-theoretic model to capture the strategic interactions between the auditor and the operator. A key technical challenge arises from MU-specific nonlinearities inherent in the model utility and the detection probability, which create complex strategic couplings that traditional
auditing frameworks do not address and that also preclude closed-form solutions. We address this by transforming the complex bivariate nonlinear fixed-point problem into a tractable univariate auxiliary problem, enabling us to decouple the system and establish the
equilibrium existence, uniqueness, and structural properties without relying on explicit solutions. Counterintuitively, our analysis reveals that the auditor can optimally reduce the inspection intensity as deletion requests increase, since the operator's weakened unlearning makes non-compliance easier to detect. This is consistent with recent
auditing reductions in China despite growing deletion requests. Moreover, we prove that although undisclosed
auditing offers informational advantages for the auditor, it paradoxically reduces the regulatory cost-effectiveness relative to disclosed
auditing.
Read the full abstract ▾
All authors Qinqi Lin, Ningning Ding, Lingjie Duan, Jianwei Huang
Machine Learning
Truly Adapting to Adversarial Constraints in Constrained MABs
Francesco Emanuele Stradi, Kalana Kalupahana, Matteo Castiglioni et al. (+2 more)
We study the constrained variant of the multi-armed bandit (MAB) problem, in which the learner aims not only at minimizing the total loss incurred during the learning dynamic, but also at controlling the violation of multiple unknown constraints, under both full and bandit feedback. We consider a non-stationary environment that subsumes both
stochastic and
adversarial models and where, at each round, both losses and constraints are drawn from distributions that may change arbitrarily over time. In such a setting, it is provably not possible to guarantee both sublinear regret and sublinear violation. Accordingly, prior work has mainly focused either on settings with
stochastic constraints or on relaxing the
benchmark with fully
adversarial constraints (e.g., via competitive ratios with respect to the optimum). We provide the first
algorithms that achieve optimal rates of regret and positive constraint violation when the constraints are
stochastic while the losses may vary arbitrarily, and that simultaneously yield guarantees that degrade smoothly with the degree of adversariality of the constraints. Specifically, under full feedback we propose an
algorithm attaining $\widetilde{\mathcal{O}}(\sqrt{T}+C)$ regret and $\widetilde{\mathcal{O}}(\sqrt{T}+C)$ {positive} violation, where $C$ quantifies the amount of non-stationarity in the constraints. We then show how to extend these guarantees when only bandit feedback is available for the losses. Finally, when bandit feedback is available for the constraints, we design an
algorithm achieving $\widetilde{\mathcal{O}}(\sqrt{T}+C)$ {positive} violation and $\widetilde{\mathcal{O}}(\sqrt{T}+C\sqrt{T})$ regret.
Read the full abstract ▾
All authors Francesco Emanuele Stradi, Kalana Kalupahana, Matteo Castiglioni, Alberto Marchesi, Nicola Gatti
Machine Learning · Cross-listed from cs.RO
TWISTED-RL: Hierarchical Skilled Agents for Knot-Tying without Human Demonstrations
Guy Freund, Tom Jurgenson, Matan Sudry et al. (+1 more)
Robotic
knot-tying represents a fundamental challenge in robotics due to the complex interactions between deformable objects and strict topological constraints. We present TWISTED-RL, a framework that improves upon the previous state-of-the-art in demonstration-free
knot-tying (TWISTED), which smartly decomposed a single
knot-tying problem into manageable subproblems, each addressed by a specialized
agent. Our approach replaces TWISTED's single-step inverse model that was learned via supervised learning with a multi-step Reinforcement Learning policy conditioned on abstract topological actions rather than goal states. This change allows more delicate topological state transitions while avoiding costly and ineffective data collection protocols, thus enabling better generalization across diverse
knot configurations. Experimental results demonstrate that TWISTED-RL manages to solve previously unattainable
knots of higher complexity, including commonly used
knots such as the Figure-8 and the Overhand. Furthermore, the increase in success rates and drop in planning time establishes TWISTED-RL as the new state-of-the-art in robotic
knot-tying without human demonstrations.
Read the full abstract ▾
All authors Guy Freund, Tom Jurgenson, Matan Sudry, Erez Karpas
Machine Learning
DeepMTL2R: A Library for Deep Multi-task Learning to Rank
Chaosheng Dong, Peiyao Xiao, Yijia Wang et al. (+1 more)
This paper presents DeepMTL2R, an open-source deep learning framework for Multi-task Learning to Rank (MTL2R), where multiple relevance criteria must be optimized simultaneously. DeepMTL2R integrates heterogeneous relevance signals into a unified, context-aware model by leveraging the self-
attention mechanism of
transformer architectures, enabling effective learning across diverse and potentially conflicting objectives. The framework includes 21 state-of-the-art multi-task learning
algorithms and supports multi-objective optimization to identify Pareto-optimal ranking models. By capturing complex dependencies and long-range interactions among items and labels, DeepMTL2R provides a scalable and expressive solution for modern ranking systems and facilitates controlled comparisons across MTL strategies. We demonstrate its effectiveness on a publicly available
dataset, report competitive performance, and visualize the resulting trade-offs among objectives. DeepMTL2R is available at \href{https://github.com/amazon-science/DeepMTL2R}{https://github.com/amazon-science/DeepMTL2R}.
Read the full abstract ▾
All authors Chaosheng Dong, Peiyao Xiao, Yijia Wang, Kaiyi Ji
Machine Learning · Cross-listed from cs.CL
Large Language Models for Math Education in Low-Resource Languages: A Study in Sinhala and Tamil
Sukumar Kishanthan, Kumar Thushalika, Buddhi Jayasekara et al. (+1 more)
Large
language models (LLMs) have achieved strong results in mathematical
reasoning, and are increasingly deployed as tutoring and learning support tools in educational settings. However, their reliability for students working in non-English
languages, especially low-resource
languages, remains poorly understood. We examine this gap by evaluating mathematical
reasoning in Sinhala and Tamil – two
languages widely used in South Asian schools but underrepresented in artificial intelligence (AI) research. Using a taxonomy of six math problem types, from basic arithmetic to complex unit conflict and optimization problems, we evaluate four prominent large
language models. To avoid translation artifacts that confound
language ability with translation quality, we construct a parallel
dataset in which each problem is independently authored in Sinhala and Tamil by native speakers, and in English by fluent speakers, all with strong mathematical backgrounds. Our analysis demonstrates that while basic arithmetic
reasoning transfers robustly across
languages, complex
reasoning tasks show significant degradation in Tamil and Sinhala. The pattern of failures varies by model and problem type, suggesting that strong performance in English does not guarantee reliable performance across
languages. These findings have direct implications for the deployment of AI tools in
multilingual classrooms, and highlight the need for
language-specific evaluation before adopting large
language models as math tutoring aids in non-English educational contexts.
Read the full abstract ▾
All authors Sukumar Kishanthan, Kumar Thushalika, Buddhi Jayasekara, Asela Hevapathige
Machine Learning
Covariance-Aware Transformers for Quadratic Programming and Decision Making
Kutay Tire, Yufan Zhang, Ege Onur Taga et al. (+1 more)
We explore the use of
transformers for solving quadratic programs and how this capability benefits decision-making problems that involve covariance
matrices. We first show that the linear
attention mechanism can provably solve unconstrained QPs by tokenizing the
matrix variables (e.g.~$A$ of the objective $\frac{1}{2}x^\top Ax+b^\top x$) row-by-row and emulating gradient descent iterations. Furthermore, by incorporating MLPs, a
transformer block can solve (i) $\ell_1$-penalized QPs by emulating iterative soft-thresholding and (ii) $\ell_1$-constrained QPs when equipped with an additional feedback loop. Our theory motivates us to introduce Time2Decide: a generic method that enhances a time series foundation model (TSFM) by explicitly feeding the covariance
matrix between the variates. We empirically find that Time2Decide uniformly outperforms the base TSFM model for the classical portfolio optimization problem that admits an $\ell_1$-constrained QP formulation. Remarkably, Time2Decide also outperforms the classical "Predict-then-Optimize (PtO)" procedure, where we first forecast the returns and then explicitly solve a constrained QP, in suitable settings. Our results demonstrate that
transformers benefit from explicit use of second-order statistics, and this can enable them to effectively solve complex decision-making problems, like portfolio construction, in one forward pass.
Read the full abstract ▾
All authors Kutay Tire, Yufan Zhang, Ege Onur Taga, Samet Oymak
Machine Learning · Cross-listed from cs.AI
Formally Verifying and Explaining Sepsis Treatment Policies with COOL-MC
Dennis Gross
Safe and interpretable sequential decision-making is critical in healthcare, yet reinforcement learning (RL) policies for sepsis treatment optimization remain opaque and difficult to verify. Standard probabilistic model checkers operate on the full state space, which becomes infeasible for larger MDPs, and cannot explain why a learned policy makes particular decisions. COOL-MC wraps the model checker Storm but adds three key capabilities: it constructs only the reachable state space induced by a trained policy, yielding a smaller discrete-time Markov chain amenable to verification even when full-MDP analysis is intractable; it automatically labels states with clinically meaningful atomic propositions; and it integrates explainability methods with probabilistic computation tree logic (PCTL) queries to reveal which features drive decisions across treatment trajectories. We demonstrate COOL-MC's capabilities on the ICU-Sepsis MDP, a
benchmark derived from approximately 17,000 sepsis patient records, which serves as a case study for applying COOL-MC to the formal analysis of sepsis treatment policies. Our analysis establishes hard bounds via full MDP verification, trains a safe RL policy that achieves optimal survival probability, and analyzes its behavior via PCTL verification and explainability on the induced DTMC. This reveals, for instance, that our trained policy relies predominantly on prior dosing history rather than the patient's evolving condition, a weakness that is invisible to standard evaluation but is exposed by COOL-MC's integration of formal verification and explainability. Our results illustrate how COOL-MC could serve as a tool for clinicians to investigate and debug sepsis treatment policies before deployment.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.CV
Aryan Das, Tanishq Rachamalla, Koushik Biswas et al. (+2 more)
We introduce a novel uncertainty-aware
multimodal segmentation framework that leverages both radiological images and associated clinical text for precise medical diagnosis. We propose a Modality Decoding
Attention Block (MoDAB) with a lightweight State Space Mixer (SSMix) to enable efficient cross-modal fusion and long-range dependency modelling. To guide learning under ambiguity, we propose the Spectral-Entropic Uncertainty (SEU) Loss, which jointly captures spatial overlap, spectral consistency, and predictive uncertainty in a unified objective. In complex clinical circumstances with poor image quality, this formulation improves model reliability. Extensive experiments on various publicly available medical
datasets, QATA-COVID19, MosMed++, and Kvasir-SEG, demonstrate that our method achieves superior
segmentation performance while being significantly more computationally efficient than existing State-of-the-Art (SoTA) approaches. Our results highlight the importance of incorporating uncertainty modelling and structured modality
alignment in
vision-
language medical
segmentation tasks. Code: https://github.com/arya-domain/UA-VLS
Read the full abstract ▾
All authors Aryan Das, Tanishq Rachamalla, Koushik Biswas, Swalpa Kumar Roy, Vinay Kumar Verma
Machine Learning
Divine Benevolence is an $x^2$: GLUs scale asymptotically faster than MLPs
Alejandro Francisco Queiruga
Scaling laws can be understood from ground-up numerical analysis, where traditional function approximation theory can explain shifts in model architecture choices. GLU variants now dominate frontier LLMs and similar outer-product architectures are prevalent in ranking models. The success of these architectures has mostly been left as an empirical discovery. In this paper, we apply the tools of numerical analysis to expose a key factor: these models have an $x^2$ which enables asymptotically faster scaling than MLPs. GLUs have piecewise quadratic functional forms that are sufficient to exhibit quadratic order of approximation. Our key contribution is to demonstrate that the $L(P)$ scaling slope is $L(P)\propto P^{-3}$ for GLUs but only $L(P)=P^{-2}$ for MLPs on function reconstruction problems. We provide a parameter construction and empirical verification of these slopes for 1D function approximation. From the first principles we discover, we make one stride and propose the “Gated Quadratic Unit” which has an even steeper $L(P)$ slope than the GLU and MLP. This opens the possibility of architecture design from first principles numerical theory to unlock superior scaling in large models. Replication code is available at https://github.com/afqueiruga/divine_scaling.
Read the full abstract ▾
Machine Learning
Parameter-Efficient Fine-Tuning of LLMs with Mixture of Space Experts
Buze Zhang, Jinkai Tao, Zilang Zeng et al. (+4 more)
Large
Language Models (LLMs) have achieved remarkable progress, with Parameter-Efficient Fine-Tuning (PEFT) emerging as a key technique for downstream task adaptation. However, existing PEFT methods mainly operate in Euclidean space, fundamentally limiting their capacity to capture complex
geometric structures inherent in
language data. While alternative
geometric spaces, like
hyperbolic geometries for hierarchical data and spherical
manifolds for circular patterns, offer theoretical advantages, forcing representations into a single
manifold type ultimately limits expressiveness, even when
curvature parameters are learnable. To address this, we propose Mixture of Space (MoS), a unified framework that leverages multiple
geometric spaces simultaneously to learn richer,
curvature-aware representations. Building on this scheme, we develop MoSLoRA, which extends Low-Rank Adaptation (LoRA) with heterogeneous
geometric experts, enabling models to dynamically select or combine appropriate
geometric spaces based on input context. Furthermore, to address the computational overhead of frequent
manifold switching, we develop a lightweight routing mechanism. Moreover, we provide empirical insights into how
curvature optimization impacts training stability and model performance. Our experiments across diverse
benchmarks demonstrate that MoSLoRA consistently outperforms strong baselines, achieving up to 5.6% improvement on MATH500 and 15.9% on MAWPS.
Read the full abstract ▾
All authors Buze Zhang, Jinkai Tao, Zilang Zeng, Neil He, Ali Maatouk, Menglin Yang, Rex Ying
Machine Learning
Revisiting the Platonic Representation Hypothesis: An Aristotelian View
Fabian Gröger, Shuo Wen and Maria Brbić
The Platonic Representation Hypothesis suggests that representations from neural networks are converging to a common statistical model of reality. We show that the existing metrics used to measure representational similarity are confounded by network scale: increasing model depth or width can systematically inflate representational similarity scores. To correct these effects, we introduce a permutation-based null-calibration framework that transforms any representational similarity metric into a calibrated score with statistical guarantees. We revisit the Platonic Representation Hypothesis with our calibration framework, which reveals a nuanced picture: the apparent convergence reported by global spectral measures largely disappears after calibration, while local neighborhood similarity, but not local distances, retains significant agreement across different modalities. Based on these findings, we propose the Aristotelian Representation Hypothesis: representations in neural networks are converging to shared local neighborhood relationships.
Read the full abstract ▾
Machine Learning · Cross-listed from stat.ML
Constrained and Composite Sampling via Proximal Sampler
Thanh Dang and Jiaming Liang
We study two log-concave sampling problems: constrained sampling and composite sampling. First, we consider sampling from a distribution proportional to $e^{-f}$ on a convex set $K\subset\mathbb R^d$, where $f$ is convex. Using an epigraph lifting, we reduce this problem to uniform sampling up to a one-dimensional exponential tilt over a convex set in $\mathbb R^{d+1}$. We then apply the proximal sampler to the lifted distribution. We develop an unbiased implementation of its restricted Gaussian oracle by using the cutting-plane method and rejection sampling, requiring only a separation oracle for $K$ and evaluation and subgradient oracles for $f$, without relying on projections or barrier functions. Second, we study composite sampling from $e^{-f-h}$, where $f$ and $h$ are closed and convex. This structure arises naturally in
Bayesian inference, where $f$ represents data fidelity and $h$ encodes prior information. By applying an epigraph lifting to $h$, we reduce composite sampling to constrained sampling in $\mathbb R^{d+1}$, allowing us to build on the approach developed in the first part. This leads to a double lifting formulation in $\mathbb R^{d+2}$, for which we implement the proximal sampler using different combinations of subgradient and proximal oracles for $f$ and $h$. We establish mixing time bounds in Rényi and $\chi^2$ divergences for both problems. Finally, we revisit the convergence analysis of the proximal sampler from a variational perspective. Starting from variational formulations of its two half-steps as optimization problems over probability measures, we use a dynamic formulation of
entropy-regularized optimal transport to recast them as optimal control problems. This allows us to derive their governing PDEs directly through the lens of optimization, without first analyzing particle-level SDEs.
Read the full abstract ▾
Machine Learning
One Good Source is All You Need: Near-Optimal Regret for Bandits under Heterogeneous Noise
Amith Bhat, Haipeng Luo and Aadirupa Saha
We study $K$-armed Multiarmed Bandit (MAB) problem with $M$ heterogeneous data sources, each exhibiting unknown and distinct noise variances $\{\sigma_j^2\}_{j=1}^M$. The learner's objective is standard MAB regret minimization, with the additional complexity of adaptively selecting which data source to query from at each round. We propose Source-Optimistic Adaptive Regret minimization (SOAR), a novel
algorithm that quickly prunes high-variance sources using sharp variance-concentration bounds, followed by a `balanced min-max LCB-UCB approach' that seamlessly integrates the parallel tasks of identifying the best arm and the optimal (minimum-variance) data source. Our analysis shows SOAR achieves an instance-dependent regret bound of $\tilde{O}\left({\sigma^*}^2\sum_{i=2}^K \frac{\log T}{\Delta_i} + \sqrt{K \sum_{j=1}^M \sigma_j^2}\right)$, up to preprocessing costs depending only on problem parameters, where ${\sigma^*}^2 := \min_j \sigma_j^2$ is the minimum source variance and $\Delta_i$ denotes the suboptimality gap of the $i$-th arm. This result is both surprising as despite lacking prior knowledge of the minimum-variance source among $M$ alternatives, SOAR attains the optimal instance-dependent regret of standard single-source MAB with variance ${\sigma^*}^2$, while incurring only an small (and unavoidable) additive cost of $\tilde O(\sqrt{K \sum_{j=1}^M \sigma_j^2})$ towards the optimal (minimum variance) source identification. Our theoretical bounds represent a significant improvement over some proposed baselines, e.g. Uniform UCB or Explore-then-Commit UCB, which could potentially suffer regret scaling with $\sigma_{\max}^2$ in place of ${\sigma^*}^2$-a gap that can be arbitrarily large when $\sigma_{\max} \gg \sigma^*$. Experiments on multiple synthetic problem instances and the real-world MovieLens\;25M
dataset, demonstrating the superior performance of SOAR over the baselines.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.RO
Learning Transferability: A Two-Stage Reinforcement Learning Approach for Enhancing Quadruped Robots' Performance in U-Shaped Stair Climbing
Baixiao Huang, Baiyu Huang and Yu Hou
Quadruped
robots are employed in various scenarios in building construction. However, autonomous stair climbing across different indoor staircases remains a major challenge for
robot dogs to complete building construction tasks. In this project, we employed a two-stage end-to-end deep reinforcement learning (RL) approach to optimize a
robot's performance on U-shaped stairs. The training
robot-dog modality, Unitree Go2, was first trained to climb stairs on Isaac Lab's pyramid-stair terrain, and then to climb a U-shaped indoor staircase using the learned policies. This project explores end-to-end RL methods that enable
robot dogs to autonomously climb stairs. The results showed (1) the successful goal reached for
robot dogs climbing U-shaped stairs with a stall penalty, and (2) the transferability from the policy trained on U-shaped stairs to deployment on straight, L-shaped, and spiral stair terrains, and transferability from other stair models to deployment on U-shaped terrain.
Read the full abstract ▾
Machine Learning · Cross-listed from math.ST
Frequentist Regret Analysis of Gaussian Process Thompson Sampling via Fractional Posteriors
Somjit Roy, Prateek Jaiswal, Anirban Bhattacharya et al. (+2 more)
We study Gaussian Process Thompson Sampling (GP-TS) for sequential decision-making over compact, continuous action spaces and provide a frequentist regret analysis based on fractional Gaussian process posteriors, without relying on domain discretization as in prior work. We show that the variance inflation commonly assumed in existing analyses of GP-TS can be interpreted as Thompson Sampling with respect to a fractional posterior with tempering parameter $\alpha \in (0,1)$. We derive a kernel-agnostic regret bound expressed in terms of the information gain parameter $\gamma_t$ and the posterior contraction rate $\epsilon_t$, and identify conditions on the Gaussian process prior under which $\epsilon_t$ can be controlled. As special cases of our general bound, we recover regret of order $\tilde{\mathcal{O}}(T^{\frac{1}{2}})$ for the squared exponential kernel, $\tilde{\mathcal{O}}(T^{\frac{2\nu+3d}{2(2\nu+d)}} )$ for the Matérn-$\nu$ kernel, and a bound of order $\tilde{\mathcal{O}}(T^{\frac{2\nu+3d}{2(2\nu+d)}})$ for the rational quadratic kernel. Overall, our analysis provides a unified and discretization-free regret framework for GP-TS that applies broadly across kernel classes.
Read the full abstract ▾
All authors Somjit Roy, Prateek Jaiswal, Anirban Bhattacharya, Debdeep Pati, Bani K. Mallick
Machine Learning · Cross-listed from cs.MA
Socially-Weighted Alignment: A Game-Theoretic Framework for Multi-Agent LLM Systems
Furkan Mumcu and Yasin Yilmaz
Deploying large
language model (LLM)
agents in shared environments introduces a fundamental tension between individual
alignment and collective stability: locally rational decisions can impose negative externalities that degrade system-level performance. We propose Socially-Weighted
Alignment (SWA), a game-theoretic framework that modifies inference-time decision making by interpolating between an
agent's private objective and an estimate of group welfare via a social weight $\lambda\in[0,1]$. In a shared-resource congestion game with $n$
agents and congestion severity $\beta$, we show that SWA induces a critical threshold $\lambda^*=(n-\beta)/(n-1)$ above which
agents no longer have marginal incentive to increase demand under overload, yielding a phase transition from persistent congestion to stable operation near capacity. We further provide an inference-time algorithmic instantiation of SWA that does not require parameter updates or multi-
agent reinforcement learning, and use a multi-
agent simulation to empirically validate the predicted threshold behavior.
Read the full abstract ▾
Machine Learning
LACONIC: Length-Aware Constrained Reinforcement Learning for LLM
Chang Liu, Yiran Zhao, Lawrence Liu et al. (+3 more)
Reinforcement learning (RL) has enhanced the capabilities of large
language models (LLMs) through reward-driven training. Nevertheless, this process can introduce excessively long responses, inflating inference latency and computational overhead. Prior length-control approaches typically rely on fixed heuristic reward shaping, which can misalign with the task objective and require brittle tuning. In this work, we propose LACONIC, a reinforcement learning method that enforces a target
token budget during training. Specifically, we update policy models using an augmented objective that combines the task reward with a length-based cost. To balance brevity and task performance, the cost scale is adaptively adjusted throughout training. This yields robust length control while preserving task reward. We provide a theoretical guarantee that support the method. Across mathematical
reasoning models and
datasets, LACONIC preserves or improves pass@1 while reducing output length by over 50%. It maintains out-of-domain performance on general knowledge and
multilingual benchmarks with 44% fewer
tokens. Moreover, LACONIC integrates into standard RL-tuning with no inference changes and minimal deployment overhead.
Read the full abstract ▾
All authors Chang Liu, Yiran Zhao, Lawrence Liu, Yaoqi Ye, Csaba Szepesvári, Lin F. Yang
Machine Learning
Silent Inconsistency in Data-Parallel Full Fine-Tuning: Diagnosing Worker-Level Optimization Misalignment
Hong Li, Zhen Zhou, Honggang Zhang et al. (+4 more)
Data-parallel (DP) training with synchronous all-reduce is a dominant paradigm for full-parameter fine-tuning of large
language models (LLMs). While parameter synchronization guarantees numerical equivalence of model weights after each iteration, it does not necessarily imply
alignment of worker-level optimization dynamics before gradient aggregation. This paper identifies and studies this latent mismatch, termed silent inconsistency, where cross-worker divergence in losses and gradients can remain invisible under conventional aggregated monitoring signals. We propose a lightweight, model-agnostic diagnostic framework that quantifies worker-level consistency using training signals readily available in standard pipelines. Specifically, we introduce three complementary metrics: loss dispersion, gradient-norm dispersion, and gradient-direction consistency measured by inter-worker cosine similarity. The proposed metrics incur negligible overhead and require no modification to model architecture, synchronization mechanisms, or optimization
algorithms. We validate the framework by fully fine-tuning the 1B-parameter openPangu-Embedded-1B-V1.1 model on the tatsu-lab/alpaca
dataset using an 8-NPU DP setup, under controlled perturbations of cross-rank stochasticity. Experimental results show that progressively desynchronized data shuffling and random seeds lead to substantial increases in loss/gradient dispersion and reduced directional
alignment, despite smooth globally averaged loss curves. These findings demonstrate that the proposed indicators provide actionable visibility into hidden instability modes in large-scale DP fine-tuning, enabling more reliable diagnosis and configuration assessment.
Read the full abstract ▾
All authors Hong Li, Zhen Zhou, Honggang Zhang, Yuping Luo, Xinyue Wang, Han Gong, Zhiyuan Liu
Machine Learning · Cross-listed from cs.AI
Frontier AI Risk Management Framework in Practice: A Risk Analysis Technical Report v1.5
Dongrui Liu, Yi Yu, Jie Zhang et al. (+18 more)
To understand and identify the unprecedented risks posed by rapidly advancing artificial intelligence (AI) models, Frontier AI Risk Management Framework in Practice presents a comprehensive assessment of their frontier risks. As Large
Language Models (LLMs) general capabilities rapidly evolve and the proliferation of agentic AI, this version of the risk analysis technical report presents an updated and granular assessment of five critical dimensions: cyber offense, persuasion and manipulation, strategic deception, uncontrolled AI R&D, and self-replication. Specifically, we introduce more complex scenarios for cyber offense. For persuasion and manipulation, we evaluate the risk of LLM-to-LLM persuasion on newly released LLMs. For strategic deception and scheming, we add the new experiment with respect to emergent misalignment. For uncontrolled AI R&D, we focus on the “mis-
evolution” of
agents as they autonomously expand their
memory substrates and toolsets. Besides, we also monitor and evaluate the safety performance of OpenClaw during the interaction on the Moltbook. For self-replication, we introduce a new resource-constrained scenario. More importantly, we propose and validate a series of robust mitigation strategies to address these emerging threats, providing a preliminary technical and actionable pathway for the secure deployment of frontier AI. This work reflects our current understanding of AI frontier risks and urges collective action to mitigate these challenges.
Read the full abstract ▾
All authors Dongrui Liu, Yi Yu, Jie Zhang, Guanxu Chen, Qihao Lin, Hanxi Zhu, Lige Huang, Yijin Zhou, Peng Wang, Shuai Shao, Boxuan Zhang, Zicheng Liu, Jingwei Sun, Yu Li, Yuejin Xie, Jiaxuan Guo, Jia Xu, Chaochao Lu, Bowen Zhou, Xia Hu, Jing Shao
Machine Learning
Traceable Latent Variable Discovery Based on Multi-Agent Collaboration
Huaming Du, Tao Hu, Yijie Huang et al. (+5 more)
Revealing the underlying causal mechanisms in the real world is crucial for scientific and technological progress. Despite notable advances in recent decades, the lack of high-quality data and the reliance of traditional causal discovery
algorithms (TCDA) on the assumption of no latent confounders, as well as their tendency to overlook the precise semantics of latent variables, have long been major obstacles to the broader application of causal discovery. To address this issue, we propose a novel causal modeling framework, TLVD, which integrates the metadata-based
reasoning capabilities of large
language models (LLMs) with the data-driven modeling capabilities of TCDA for inferring latent variables and their semantics. Specifically, we first employ a data-driven approach to construct a causal graph that incorporates latent variables. Then, we employ multi-LLM collaboration for latent variable inference, modeling this process as a game with incomplete information and seeking its
Bayesian Nash
Equilibrium (BNE) to infer the possible specific latent variables. Finally, to validate the inferred latent variables across multiple real-world web-based data sources, we leverage LLMs for evidence exploration to ensure traceability. We comprehensively evaluate TLVD on three de-identified real patient
datasets provided by a hospital and two
benchmark datasets. Extensive experimental results confirm the effectiveness and reliability of TLVD, with average improvements of 32.67% in Acc, 62.21% in CAcc, and 26.72% in ECit across the five
datasets.
Read the full abstract ▾
All authors Huaming Du, Tao Hu, Yijie Huang, Yu Zhao, Guisong Liu, Tao Gu, Gang Kou, Carl Yang
Machine Learning
WiSparse: Boosting LLM Inference Efficiency with Weight-Aware Mixed Activation Sparsity
Lei Chen, Yuan Meng, Xiaoyu Zhan et al. (+2 more)
Large
Language Models (LLMs) offer strong capabilities but incur high inference costs due to dense computation and
memory access. Training-free activation sparsity is a promising approach for efficient LLM inference, yet existing methods often rely solely on activation information and uniform sparsity ratios. This overlooks the critical interplay with weights and inter-block sensitivity variation, leading to suboptimal performance. We identify two key phenomena in modern LLMs: 1) less significant activations may align with highly important weights, and 2) sparsity sensitivity varies non-monotonically across model blocks. We propose Weight-aware Mixed-Granularity Training-free Activation Sparsity (WiSparse), which leverages both activation and weight information for adaptive sparsity allocation. Specifically, we introduce a weight-aware mechanism integrating activation magnitudes with precomputed weight norms to accurately identify salient channels. This is combined with a mixed-granularity allocation scheme: a global budget is distributed across blocks via evolutionary search to protect sensitive regions, then refined within blocks to minimize reconstruction error. We improve sparse kernels and demonstrate effectiveness on three representative models. Notably, at 50% sparsity, WiSparse preserves 97% of Llama3.1's dense performance, surpassing the strongest baseline by 2.23 percentage points while achieving a 21.4% acceleration in end-to-end inference speed. Our research advances the limits of training-free approaches for efficient LLM inference, pushing the boundaries of achievable speedup without training.
Read the full abstract ▾
All authors Lei Chen, Yuan Meng, Xiaoyu Zhan, Zhi Wang, Wenwu Zhu
Machine Learning
Selective Synchronization Attention
Hasi Hays
The
Transformer architecture has become the foundation of modern deep learning, yet its core self-
attention mechanism suffers from quadratic computational complexity and lacks grounding in biological neural computation. We propose Selective Synchronization
Attention (SSA), a novel
attention mechanism that replaces the standard dot-product self-
attention with a closed-form operator derived from the steady-state solution of the Kuramoto model of coupled oscillators. In SSA, each
token is represented as an oscillator characterized by a learnable natural frequency and phase; the synchronization strength between
token pairs, determined by a frequency-dependent coupling and phase-locking condition, serves as the
attention weight. This formulation provides three key advantages: (i) natural sparsity arising from the phase-locking threshold, whereby
tokens with incompatible frequencies automatically receive zero
attention weight without explicit masking; (ii) unified positional-semantic encoding through the natural frequency spectrum, eliminating the need for separate positional encodings; and (iii) a single-pass, closed-form computation that avoids iterative ODE integration, with all components (coupling, order parameter, synchronization) derived from the oscillatory framework. We instantiate SSA within the Oscillatory Synchronization Network (OSN), a drop-in replacement for the
Transformer block. Analysis of the synchronization
matrices reveals non-uniform, head-diverse coupling patterns even at initialization, demonstrating a stronger architectural inductive bias than the approximately uniform
attention produced by randomly initialized
Transformers.
Read the full abstract ▾
Machine Learning
Broken Chains: The Cost of Incomplete Reasoning in LLMs
Ian Su, Gaurav Purushothaman, Jey Narayan et al. (+5 more)
Reasoning-specialized models like OpenAI's 5.1 and DeepSeek-V3.2 allocate substantial inference compute to extended chain-of-thought (CoT) traces, yet
reasoning tokens incur significant costs. How do different
reasoning modalities of code, natural
language, hybrid, or none do perform under
token constraints? We introduce a framework that constrains models to reason exclusively through code, comments, both, or neither, then systematically ablates
token budgets to 10%, 30%, 50%, and 70% of optimal. We evaluate four frontier models (GPT-5.1, Gemini 3 Flash, DeepSeek-V3.2, Grok 4.1) across mathematical
benchmarks (AIME, GSM8K, HMMT). Our findings reveal: (1) truncated
reasoning can hurt as DeepSeek-V3.2 achieves 53% with no
reasoning but only 17% with truncated CoT at 50% budget; (2) code degrades gracefully as Gemini's comments collapse to 0% while code maintains 43-47%; (3) hybrid
reasoning underperforms single modalities; (4) robustness is model-dependent as Grok maintains 80-90% at 30% budget where OpenAI and DeepSeek collapse to 7-27%. These results suggest incomplete
reasoning chains actively mislead models, with implications for deploying
reasoning-specialized systems under resource constraints.
Read the full abstract ▾
All authors Ian Su, Gaurav Purushothaman, Jey Narayan, Ruhika Goel, Kevin Zhu, Sunishchal Dev, Yash More, Maheep Chaudhary
Machine Learning · Cross-listed from stat.ME
CAIRO: Decoupling Order from Scale in Regression
Harri Vanhems, Yue Zhao, Peng Shi et al. (+1 more)
Standard regression methods typically optimize a single pointwise objective, such as mean squared error, which conflates the learning of ordering with the learning of scale. This coupling renders models vulnerable to outliers and heavy-tailed noise. We propose CAIRO (Calibrate After Initial Rank Ordering), a framework that decouples regression into two distinct stages. In the first stage, we learn a scoring function by minimizing a scale-invariant ranking loss; in the second, we recover the target scale via isotonic regression. We theoretically characterize a class of "Optimal-in-Rank-Order" objectives – including variants of RankNet and Gini covariance – and prove that they recover the ordering of the true conditional mean under mild assumptions. We further show that subsequent monotone calibration recovers the true regression function at the population level and mathematically guarantees that finite-sample predictions are strictly auto-calibrated. Empirically, CAIRO combines the representation learning of neural networks with the robustness of rank-based statistics. It matches the performance of state-of-the-art tree ensembles on tabular
benchmarks and significantly outperforms standard regression objectives in regimes with heavy-tailed or heteroskedastic noise.
Read the full abstract ▾
All authors Harri Vanhems, Yue Zhao, Peng Shi, Archer Y. Yang
Machine Learning
S2D: Selective Spectral Decay for Quantization-Friendly Conditioning of Neural Activations
Arnav Chavan, Nahush Lele, Udbhav Bamba et al. (+3 more)
Activation outliers in large-scale
transformer models pose a fundamental challenge to model quantization, creating excessively large ranges that cause severe accuracy drops during quantization. We empirically observe that outlier severity intensifies with pre-training scale (e.g., progressing from CLIP to the more extensively trained SigLIP and SigLIP2). Through theoretical analysis as well as empirical correlation studies, we establish the direct link between these activation outliers and dominant singular values of the weights. Building on this insight, we propose Selective Spectral Decay ($S^2D$), a geometrically-principled conditioning method that surgically regularizes only the weight components corresponding to the largest singular values during fine-tuning. Through extensive experiments, we demonstrate that $S^2D$ significantly reduces activation outliers and produces well-conditioned representations that are inherently quantization-friendly. Models trained with $S^2D$ achieve up to 7% improved PTQ accuracy on ImageNet under W4A4 quantization and 4% gains when combined with QAT. These improvements also generalize across downstream tasks and
vision-
language models, enabling the scaling of increasingly large and rigorously trained models without sacrificing deployment efficiency.
Read the full abstract ▾
All authors Arnav Chavan, Nahush Lele, Udbhav Bamba, Sankalp Dayal, Aditi Raghunathan, Deepak Gupta
Machine Learning
A unified framework for evaluating the robustness of machine-learning interpretability for prospect risking
Prithwijit Chowdhury, Ahmad Mustafa, Mohit Prabhushankar et al. (+1 more)
In geophysics, hydrocarbon prospect risking involves assessing the risks associated with hydrocarbon exploration by integrating data from various sources. Machine learning-based classifiers trained on tabular data have been recently used to make faster decisions on these prospects. The lack of transparency in the decision-making processes of such models has led to the emergence of explainable AI (XAI). LIME and SHAP are two such examples of these XAI methods which try to generate explanations of a particular decision by ranking the input features in terms of importance. However, explanations of the same scenario generated by these two different explanation strategies have shown to disagree or be different, particularly for complex data. This is because the definitions of "importance" and "relevance" differ for different explanation strategies. Thus, grounding these ranked features using theoretically backed causal ideas of necessity and sufficiency can prove to be a more reliable and robust way to improve the trustworthiness of the concerned explanation strategies.We propose a unified framework to generate counterfactuals as well as quantify necessity and sufficiency and use these to perform a robustness evaluation of the explanations provided by LIME and SHAP on high dimensional structured prospect risking data. This robustness test gives us deeper insights into the models capabilities to handle erronous data and which XAI module works best in pair with which model for our
dataset for hydorcarbon indication.
Read the full abstract ▾
All authors Prithwijit Chowdhury, Ahmad Mustafa, Mohit Prabhushankar, Ghassan AlRegib
Machine Learning
The geometry of invariant learning: an information-theoretic analysis of data augmentation and generalization
Abdelali Bouyahia, Frédéric LeBlanc and Mario Marchand
Data augmentation is one of the most widely used techniques to improve generalization in modern machine learning, often justified by its ability to promote invariance to label-irrelevant transformations. However, its theoretical role remains only partially understood. In this work, we propose an information-theoretic framework that systematically accounts for the effect of augmentation on generalization and invariance learning. Our approach builds upon mutual information-based bounds, which relate the generalization gap to the amount of information a learning
algorithm retains about its training data. We extend this framework by modeling the augmented distribution as a composition of the original data distribution with a distribution over transformations, which naturally induces an orbit-averaged loss function. Under mild sub-Gaussian assumptions on the loss function and the augmentation process, we derive a new generalization bound that decompose the expected generalization gap into three interpretable terms: (1) a distributional divergence between the original and augmented data, (2) a stability term measuring the
algorithm dependence on training data, and (3) a sensitivity term capturing the effect of augmentation variability. To connect our bounds to the geometry of the augmentation group, we introduce the notion of group diameter, defined as the maximal perturbation that augmentations can induce in the input space. The group diameter provides a unified control parameter that bounds all three terms and highlights an intrinsic trade-off: small diameters preserve data fidelity but offer limited regularization, while large diameters enhance stability at the cost of increased bias and sensitivity. We validate our theoretical bounds with numerical experiments, demonstrating that it reliably tracks and predicts the behavior of the true generalization gap.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.CL
WavePhaseNet: A DFT-Based Method for Constructing Semantic Conceptual Hierarchy Structures (SCHS)
Kiyotaka Kasubuchi and Kazuo Fukiya
This paper reformulates
Transformer/
Attention mechanisms in Large
Language Models (LLMs) through measure theory and frequency analysis, theoretically demonstrating that
hallucination is an inevitable structural limitation. The
embedding space functions as a conditional expectation over a {\sigma}-
algebra, and its failure to be isomorphic to the semantic truth set fundamentally causes logical consistency breakdown. WavePhaseNet Method The authors propose WavePhaseNet, which explicitly constructs a Semantic Conceptual Hierarchy Structure (SCHS) using Discrete
Fourier Transform (DFT). By applying DFT along the sequence dimension, semantic information is decomposed into frequency bands: low-frequency components capture global meaning and intent, while high-frequency components represent local syntax and expression. This staged separation enables precise semantic manipulation in diagonalized space. Dimensionality Reduction GPT-4's 24,576-dimensional
embedding space exhibits a 1/f spectral structure based on
language self-similarity and Zipf's law. Through cumulative energy analysis, the authors derive that approximately 3,000 dimensions constitute the lower bound for "complete representation." This demonstrates that reduction from 24,576 to 3,000 dimensions preserves meaning and intent while enabling rigorous
reasoning and suppressing
hallucination. Cohomological Consistency Control The reduced
embedding space, constructed via cohomological regularization over overlapping local windows, allows defining a graph structure and cochain complex. This quantifies inconsistencies among local inferences as coboundary-based losses. Applying harmonic projection based on Hodge theory positions
cohomology as a computable regularization principle for controlling semantic consistency, extracting maximally consistent global representations.
Read the full abstract ▾