Machine Learning
Geometry-Preserving Neural Architectures on Manifolds with Boundary
Karthik Elamvazhuthi, Shiba Biswal, Kian Rosenblum et al. (+4 more)
A growing number of neural architectures have been proposed to enforce
geometric constraints, including projection-based networks, exponential-map updates, constrained output layers, and
manifold neural ODEs. We provide a unified framework for these geometry-preserving architectures by organizing them according to where and how constraints are enforced, either throughout the intermediate layers or only at the final output. This perspective reveals several gaps in the existing theory. To address these gaps, we prove high-level approximation
theorems for projected neural ODEs, intermediate augmented architectures, and final augmented architectures on prox-regular constraint sets, including smooth
manifolds with boundary. Numerical experiments on synthetic dynamics over S^2, the disk, SO(3), together with real-world
protein backbone data on SE(3), demonstrate exact feasibility for analytic updates and show that the final augmentation have simpler architecture and outperform in most tasks considered. When the constraint set is unknown, we learn projections via small-time heat-kernel limits, showing
diffusion/flow-matching can be used as data-based projections. Moreover, we also the demonstrate the usefulness of the architectures that enforce non-convex constraints for path planning on
manifolds with boundary.
Read the full abstract ▾
All authors Karthik Elamvazhuthi, Shiba Biswal, Kian Rosenblum, Arushi Katyal, Tianli Qu, Grady Ma, Rishi Sonthalia
Machine Learning
TMS: Trajectory-Mixed Supervision for Reward-Free, On-Policy SFT
Rana Muhammad Shahroz Khan, Zijie Liu, Zhen Tan et al. (+2 more)
Reinforcement Learning (RL) and Supervised Fine-Tuning (SFT) are the two dominant paradigms for enhancing Large
Language Model (LLM) performance on downstream tasks. While RL generally preserves broader model capabilities (retention) better than SFT, it comes with significant costs: complex reward engineering, instability, and expensive on-policy sampling. In contrast, SFT is efficient but brittle, often suffering from catastrophic forgetting due to $\textbf{Supervision Mismatch}$: the divergence between the model's evolving policy and static training labels. We address this trade-off with $\textbf{Trajectory-Mixed Supervision (TMS)}$, a reward-free framework that approximates the on-policy benefits of RL by creating a dynamic curriculum from the model's own historical checkpoints. TMS minimizes $\textit{Policy-Label Divergence (PLD)}$, preventing the mode collapse that drives forgetting in standard SFT. Experiments across
reasoning (MATH, GSM8K) and instruction-following
benchmarks demonstrate that TMS effectively shifts the accuracy–retention Pareto frontier. While RL remains the gold standard for retention, TMS significantly outperforms standard and iterative SFT, bridging the gap to RL without requiring reward models or verifiers. Mechanistic analysis confirms that PLD drift accurately predicts forgetting and that TMS successfully mitigates this drift.
Read the full abstract ▾
All authors Rana Muhammad Shahroz Khan, Zijie Liu, Zhen Tan, Charles Fleming, Tianlong Chen
Machine Learning
FlashSinkhorn: IO-Aware Entropic Optimal Transport on GPU
Felix X.-F. Ye, Xingjie Li, An Yu et al. (+3 more)
Entropic optimal transport (EOT) via Sinkhorn iterations is widely used in modern machine learning, yet GPU solvers remain inefficient at scale. Tensorized implementations suffer quadratic HBM traffic from dense $n\times m$ interactions, while existing online backends avoid storing dense
matrices but still rely on generic tiled map-reduce reduction kernels with limited fusion. We present FlashSinkhorn, an IO-aware EOT solver for squared Euclidean cost that rewrites stabilized log-domain Sinkhorn updates as row-wise LogSumExp reductions of biased dot-product scores, the same normalization as
transformer attention. This enables FlashAttention-style fusion and tiling: fused Triton kernels stream tiles through on-chip SRAM and update dual potentials in a single pass, substantially reducing HBM IO per iteration while retaining linear-
memory operations. We further provide streaming kernels for transport application, enabling scalable first- and second-order optimization. On A100 GPUs, FlashSinkhorn achieves up to $32\times$ forward-pass and $161\times$ end-to-end speedups over state-of-the-art online baselines on point-cloud OT, improves scalability on OT-based downstream tasks. For reproducibility, we release an open-source implementation at https://github.com/ot-triton-lab/flash-sinkhorn .
Read the full abstract ▾
All authors Felix X.-F. Ye, Xingjie Li, An Yu, Ming-Ching Chang, Linsong Chu, Davis Wertheimer
Machine Learning
Shortcut Features as Top Eigenfunctions of NTK: A Linear Neural Network Case and More
Jinwoo Lim, Suhyun Kim and Soo-Mook Moon
One of the chronic problems of deep-learning models is shortcut learning. In a case where the majority of training data are dominated by a certain feature, neural networks prefer to learn such a feature even if the feature is not generalizable outside the training set. Based on the framework of Neural Tangent Kernel (NTK), we analyzed the case of linear neural networks to derive some important properties of shortcut learning. We defined a feature of a neural network as an eigenfunction of NTK. Then, we found that shortcut features correspond to features with larger
eigenvalues when the shortcuts stem from the imbalanced number of samples in the clustered distribution. We also showed that the features with larger
eigenvalues still have a large influence on the neural network output even after training, due to data variances in the clusters. Such a preference for certain features remains even when a margin of a neural network output is controlled, which shows that the max-margin bias is not the only major reason for shortcut learning. These properties of linear neural networks are empirically extended for more complex neural networks as a two-layer fully-connected ReLU network and a ResNet-18.
Read the full abstract ▾
Machine Learning
Evaluating LLMs When They Do Not Know the Answer: Statistical Evaluation of Mathematical Reasoning via Comparative Signals
Zihan Dong, Zhixian Zhang, Yang Zhou et al. (+3 more)
Evaluating mathematical
reasoning in LLMs is constrained by limited
benchmark sizes and inherent model stochasticity, yielding high-variance accuracy estimates and unstable rankings across platforms. On difficult problems, an LLM may fail to produce a correct final answer, yet still provide reliable pairwise comparison signals indicating which of two candidate solutions is better. We leverage this observation to design a statistically efficient evaluation framework that combines standard labeled outcomes with pairwise comparison signals obtained by having models judge auxiliary
reasoning chains. Treating these comparison signals as control variates, we develop a semiparametric
estimator based on the efficient influence function (EIF) for the setting where auxiliary
reasoning chains are observed. This yields a one-step
estimator that achieves the semiparametric efficiency bound, guarantees strict variance reduction over naive sample averaging, and admits asymptotic normality for principled uncertainty quantification. Across simulations, our one-step
estimator substantially improves ranking accuracy, with gains increasing as model output noise grows. Experiments on GPQA Diamond, AIME 2025, and GSM8K further demonstrate more precise performance estimation and more reliable model rankings, especially in small-sample regimes where conventional evaluation is pretty unstable.
Read the full abstract ▾
All authors Zihan Dong, Zhixian Zhang, Yang Zhou, Can Jin, Ruijia Wu, Linjun Zhang
Machine Learning
Fedcompass: Federated Clustered and Periodic Aggregation Framework for Hybrid Classical-Quantum Models
Yueheng Wang, Xing He, Zinuo Cai et al. (+4 more)
Federated learning enables collaborative model training across decentralized clients under
privacy constraints.
Quantum computing offers potential for alleviating computational and communication burdens in
federated learning, yet hybrid classical-
quantum federated learning remains susceptible to performance degradation under non-IID data. To address this,we propose FEDCOMPASS, a layered aggregation framework for hybrid classical-
quantum federated learning. FEDCOMPASS employs spectral clustering to group clients by class distribution similarity and performs cluster-wise aggregation for classical feature extractors. For
quantum parameters, it uses circular mean aggregation combined with adaptive optimization to ensure stable global updates. Experiments on three
benchmark datasets show that FEDCOMPASS improves test accuracy by up to 10.22% and enhances convergence stability under non-IID settings, outperforming six strong
federated learning baselines.
Read the full abstract ▾
All authors Yueheng Wang, Xing He, Zinuo Cai, Rui Zhang, Ruhui Ma, Yuan Liu, Rajkumar Buyya
Machine Learning · Cross-listed from stat.ML
Unified Inference Framework for Single and Multi-Player Performative Prediction: Method and Asymptotic Optimality
Zhixian Zhang, Xiaotian Hou and Linjun Zhang
Performative prediction characterizes environments where predictive models alter the very data distributions they aim to forecast, triggering complex feedback loops. While prior research treats single-
agent and multi-
agent performativity as distinct phenomena, this paper introduces a unified statistical inference framework that bridges these contexts, treating the former as a special case of the latter. Our contribution is two-fold. First, we put forward the Repeated Risk Minimization (RRM) procedure for estimating the performative stability, and establish a rigorous inferential theory for admitting its asymptotic normality and confirming its asymptotic efficiency. Second, for the performative optimality, we introduce a novel two-step plug-in
estimator that integrates the idea of Recalibrated Prediction Powered Inference (RePPI) with Importance Sampling, and further provide formal derivations for the Central Limit
Theorems of both the underlying distributional parameters and the plug-in results. The theoretical analysis demonstrates that our
estimator achieves the semiparametric efficiency bound and maintains robustness under mild distributional misspecification. This work provides a principled toolkit for reliable estimation and decision-making in dynamic, performative environments.
Read the full abstract ▾
Machine Learning
CoBA-RL: Capability-Oriented Budget Allocation for Reinforcement Learning in LLMs
Zhiyuan Yao, Yi-Kai Zhang, Yuxin Chen et al. (+7 more)
Reinforcement Learning with Verifiable Rewards (RLVR) has emerged as a key approach for enhancing LLM
reasoning. However, standard frameworks like Group Relative Policy Optimization (GRPO) typically employ a uniform rollout budget, leading to resource inefficiency. Moreover, existing adaptive methods often rely on instance-level metrics, such as task pass rates, failing to capture the model's dynamic learning state. To address these limitations, we propose CoBA-RL, a reinforcement learning
algorithm designed to adaptively allocate rollout budgets based on the model's evolving capability. Specifically, CoBA-RL utilizes a Capability-Oriented Value function to map tasks to their potential training gains and employs a heap-based greedy strategy to efficiently self-calibrate the distribution of computational resources to samples with high training value. Extensive experiments demonstrate that our approach effectively orchestrates the trade-off between exploration and exploitation, delivering consistent generalization improvements across multiple challenging
benchmarks. These findings underscore that quantifying sample training value and optimizing budget allocation are pivotal for advancing LLM post-training efficiency.
Read the full abstract ▾
All authors Zhiyuan Yao, Yi-Kai Zhang, Yuxin Chen, Yueqing Sun, Zishan Xu, Yu Yang, Tianhao Hu, Qi Gu, Hui Su, Xunliang Cai
Machine Learning
Clarify Before You Draw: Proactive Agents for Robust Text-to-CAD Generation
Bo Yuan, Zelin Zhao, Petr Molodyk et al. (+2 more)
Large
language models have recently enabled text-to-CAD systems that synthesize parametric CAD programs (e.g., CadQuery) from natural-
language prompts. In practice, however,
geometric descriptions can be under-specified or internally inconsistent: critical dimensions may be missing and constraints may conflict. However, existing fine-tuned models tend to reactively follow the user instructions and hallucinate dimensions when the text is ambiguous. To address this, we propose a proactive agentic framework for text-to-CadQuery generation, named as ProCAD, that resolves specification issues before code synthesis. Our framework pairs a proactive clarifying
agent, which audits the
prompt and asks targeted clarification questions only when necessary to produce a self-consistent specification, with a CAD coding
agent that translates the specification into an executable CadQuery program. We fine-tune the coding
agent based on a curated high-quality text-to-CadQuery
dataset and train the clarifying
agent via agentic SFT on clarification trajectories. Experiments show that proactive clarification significantly improves robustness to ambiguous
prompts while keeping interaction overhead low. ProCAD outperforms frontier closed-source models, including Claude Sonnet 4.5, reducing the mean Chamfer distance by 79.9% and lowering the invalidity ratio from 4.8% to 0.9%. Our code and
datasets are made publicly available on https://github.com/BoYuanVisionary/Pro-CAD.
Read the full abstract ▾
All authors Bo Yuan, Zelin Zhao, Petr Molodyk, Bin Hu, Yongxin Chen
Machine Learning
SAFE-KD: Risk-Controlled Early-Exit Distillation for Vision Backbones
Salim Khazem
Early-exit networks reduce inference cost by allowing “easy” inputs to stop early, but practical deployment hinges on knowing when early exit is safe. We introduce SAFE-KD, a universal multi-exit wrapper for modern
vision backbones that couples hierarchical
distillation with conformal risk control. SAFE-KD attaches lightweight exit heads at intermediate depths, distills a strong teacher into all exits via Decoupled Knowledge
Distillation (DKD), and enforces deep-to-shallow consistency between exits. At inference, we calibrate per-exit stopping thresholds on a held-out set using conformal risk control (CRC) to guarantee a user-specified selective misclassification risk (among the samples that exit early) under exchangeability. Across multiple
datasets and architectures, SAFE-KD yields improved accuracy compute trade-offs, stronger calibration, and robust performance under corruption while providing finite-sample risk guarantees.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.CL
LatentMem: Customizing Latent Memory for Multi-Agent Systems
Muxin Fu, Xiangyuan Xue, Yafu Li et al. (+5 more)
Large
language model (LLM)-powered multi-
agent systems (MAS) demonstrate remarkable collective intelligence, wherein multi-
agent memory serves as a pivotal mechanism for continual adaptation. However, existing multi-
agent memory designs remain constrained by two fundamental bottlenecks: (i)
memory homogenization arising from the absence of role-aware customization, and (ii) information overload induced by excessively fine-grained
memory entries. To address these limitations, we propose LatentMem, a learnable multi-
agent memory framework designed to customize
agent-specific
memories in a
token-efficient manner. Specifically, LatentMem comprises an experience bank that stores raw interaction trajectories in a lightweight form, and a
memory composer that synthesizes compact latent
memories conditioned on retrieved experience and
agent-specific contexts. Further, we introduce Latent
Memory Policy Optimization (LMPO), which propagates task-level optimization signals through latent
memories to the composer, encouraging it to produce compact and high-utility representations. Extensive experiments across diverse
benchmarks and mainstream MAS frameworks show that LatentMem achieves a performance gain of up to $19.36$% over vanilla settings and consistently outperforms existing
memory architectures, without requiring any modifications to the underlying frameworks.
Read the full abstract ▾
All authors Muxin Fu, Xiangyuan Xue, Yafu Li, Zefeng He, Siyuan Huang, Xiaoye Qu, Yu Cheng, Yang Yang
Machine Learning · Cross-listed from cs.CR
Generalizable and Interpretable RF Fingerprinting with Shapelet-Enhanced Large Language Models
Tianya Zhao, Junqing Zhang, Haowen Xu et al. (+3 more)
Deep neural networks (DNNs) have achieved remarkable success in
radio frequency (RF) fingerprinting for wireless device authentication. However, their practical deployment faces two major limitations: domain shift, where models trained in one environment struggle to generalize to others, and the black-box nature of DNNs, which limits interpretability. To address these issues, we propose a novel framework that integrates a group of variable-length two-dimensional (2D) shapelets with a pre-trained large
language model (LLM) to achieve efficient, interpretable, and generalizable RF fingerprinting. The 2D shapelets explicitly capture diverse local temporal patterns across the in-phase and quadrature (I/Q) components, providing compact and interpretable representations. Complementarily, the pre-trained LLM captures more long-range dependencies and global contextual information, enabling strong generalization with minimal training overhead. Moreover, our framework also supports prototype generation for few-shot inference, enhancing cross-domain performance without additional retraining. To evaluate the effectiveness of our proposed method, we conduct extensive experiments on six
datasets across various protocols and domains. The results show that our method achieves superior standard and few-shot performance across both source and unseen domains.
Read the full abstract ▾
All authors Tianya Zhao, Junqing Zhang, Haowen Xu, Xiaoyan Sun, Jun Dai, Xuyu Wang
Machine Learning · Cross-listed from cond-mat.dis-nn
Kimihiro Yamazaki, Itsushi Sakata, Takuya Konishi et al. (+1 more)
Neural
quantum states (NQS) are powerful ansätze in the variational Monte Carlo framework, yet their architectures are often treated as black boxes. We propose a physically transparent framework in which NQS are treated as neural approximations to latent imaginary-time
evolution. This viewpoint suggests that standard
Transformer-based NQS (TQS) architectures correspond to physically unmotivated effective
Hamiltonians dependent on imaginary time in a latent space. Building on this interpretation, we introduce physics-inspired
transformer quantum states (PITQS), which enforce a static effective
Hamiltonian by sharing weights across layers and improve propagation accuracy via Trotter-Suzuki decompositions without increasing the number of variational parameters. For the frustrated $J_1$-$J_2$ Heisenberg model, our ansätze achieve accuracies comparable to or exceeding state-of-the-art TQS while using substantially fewer variational parameters. This study demonstrates that reinterpreting the deep network structure as a latent cooling process enables a more physically grounded, systematic, and compact design, thereby bridging the gap between black-box expressivity and physically transparent construction.
Read the full abstract ▾
All authors Kimihiro Yamazaki, Itsushi Sakata, Takuya Konishi, Yoshinobu Kawahara
Machine Learning
Consistency Deep Equilibrium Models
Junchao Lin, Zenan Ling, Jingwen Xu et al. (+1 more)
Deep
Equilibrium Models (DEQs) have emerged as a powerful paradigm in deep learning, offering the ability to model infinite-depth networks with constant
memory usage. However, DEQs incur significant inference latency due to the iterative nature of fixed-point solvers. In this work, we introduce the Consistency Deep
Equilibrium Model (C-DEQ), a novel framework that leverages consistency
distillation to accelerate DEQ inference. We cast the DEQ iterative inference process as
evolution along a fixed ODE trajectory toward the
equilibrium. Along this trajectory, we train C-DEQs to consistently map intermediate states directly to the fixed point, enabling few-step inference while preserving the performance of the teacher DEQ. At the same time, it facilitates multi-step evaluation to flexibly trade computation for performance gains. Extensive experiments across various domain tasks demonstrate that C-DEQs achieve consistent 2-20$\times$ accuracy improvements over implicit DEQs under the same few-step inference budget. Our code is available at https://github.com/landrarwolf/CDEQ.
Read the full abstract ▾
All authors Junchao Lin, Zenan Ling, Jingwen Xu, Robert C. Qiu
Machine Learning · Cross-listed from cs.SD
Rethinking Music Captioning with Music Metadata LLMs
Irmak Bukey, Zhepei Wang, Chris Donahue et al. (+1 more)
Music captioning, or the task of generating a natural
language description of music, is useful for both music understanding and controllable music generation. Training captioning models, however, typically requires high-quality music caption data which is scarce compared to metadata (e.g., genre, mood, etc.). As a result, it is common to use large
language models (LLMs) to synthesize captions from metadata to generate training data for captioning models, though this process imposes a fixed stylization and entangles factual information with natural
language style. As a more direct approach, we propose metadata-based captioning. We train a metadata prediction model to infer detailed music metadata from audio and then convert it into expressive captions via pre-trained LLMs at inference time. Compared to a strong end-to-end baseline trained on LLM-generated captions derived from metadata, our method: (1) achieves comparable performance in less training time over end-to-end captioners, (2) offers flexibility to easily change stylization post-training, enabling output captions to be tailored to specific stylistic and quality requirements, and (3) can be prompted with audio and partial metadata to enable powerful metadata imputation or in-filling–a common task for organizing music data.
Read the full abstract ▾
All authors Irmak Bukey, Zhepei Wang, Chris Donahue, Nicholas J. Bryan
Machine Learning
FedKRSO: Communication and Memory Efficient Federated Fine-Tuning of Large Language Models
Guohao Yang, Tongle Wu, Yuanxiong Guo et al. (+2 more)
Fine-tuning is essential to adapt general-purpose large
language models (LLMs) to domain-specific tasks. As a
privacy-preserving framework to leverage decentralized data for collaborative model training,
Federated Learning (FL) is gaining popularity in LLM fine-tuning, but remains challenging due to the high cost of transmitting full model parameters and computing full gradients on resource-constrained clients. While Parameter-Efficient Fine-Tuning (PEFT) methods are widely used in FL to reduce communication and
memory costs, they often sacrifice model performance compared to FFT. This paper proposes FedKRSO (
Federated $K$-Seed Random Subspace Optimization), a novel method that enables communication and
memory efficient FFT of LLMs in
federated settings. In FedKRSO, clients update the model within a shared set of random low-dimension subspaces generated by the server to save
memory usage. Furthermore, instead of transmitting full model parameters in each FL round, clients send only the model update accumulators along the subspaces to the server, enabling efficient global model aggregation and dissemination. By using these strategies, FedKRSO can substantially reduce communication and
memory overhead while overcoming the performance limitations of PEFT, closely approximating the performance of
federated FFT. The convergence properties of FedKRSO are analyzed rigorously under general FL settings. Extensive experiments on the GLUE
benchmark across diverse FL scenarios demonstrate that FedKRSO achieves both superior performance and low communication and
memory overhead, paving the way towards on
federated LLM fine-tuning at the resource-constrained edge.
Read the full abstract ▾
All authors Guohao Yang, Tongle Wu, Yuanxiong Guo, Ying Sun, Yanmin Gong
Machine Learning
From Zero to Hero: Advancing Zero-Shot Foundation Models for Tabular Outlier Detection
Xueying Ding, Haomin Wen, Simon Klüttermann et al. (+1 more)
Outlier detection (OD) is widely used in practice; but its effective deployment on new tasks is hindered by lack of labeled outliers, which makes
algorithm and hyperparameter selection notoriously hard. Foundation models (FMs) have transformed ML, and OD is no exception: Shen et. al. (2025) introduced FoMo-0D, the first FM for OD, achieving remarkable performance against numerous baselines. This work introduces OUTFORMER, which advances FoMo-0D with (1) a mixture of synthetic priors and (2) self-evolving curriculum training. OUTFORMER is pretrained solely on synthetic labeled
datasets and infers test labels of a new task by using its training data as in-context input. Inference is fast and zero-shot, requiring merely forward pass and no labeled outliers. Thanks to in-context learning, it requires zero additional work-no OD model training or bespoke model selection-enabling truly plug-and-play deployment. OUTFORMER achieves state-of-the-art performance on the prominent AdBench, as well as two new large-scale OD
benchmarks that we introduce, comprising over 1,500
datasets, while maintaining speedy inference.
Read the full abstract ▾
All authors Xueying Ding, Haomin Wen, Simon Klüttermann, Leman Akoglu
Machine Learning · Cross-listed from cs.CV
VOILA: Value-of-Information Guided Fidelity Selection for Cost-Aware Multimodal Question Answering
Rahul Atul Bhope, K. R. Jayaram, Vinod Muthusamy et al. (+3 more)
Despite significant costs from retrieving and processing high-fidelity visual inputs, most
multimodal vision-
language systems operate at fixed fidelity levels. We introduce VOILA, a framework for Value-Of-Information-driven adaptive fidelity selection in Visual Question Answering (VQA) that optimizes what information to retrieve before model execution. Given a query, VOILA uses a two-stage pipeline: a gradient-boosted regressor estimates correctness likelihood at each fidelity from question features alone, then an isotonic calibrator refines these probabilities for reliable decision-making. The system selects the minimum-cost fidelity maximizing expected utility given predicted accuracy and
retrieval costs. We evaluate VOILA across three deployment scenarios using five
datasets (VQA-v2, GQA, TextVQA, LoCoMo, FloodNet) and six
Vision-
Language Models (VLMs) with 7B-235B parameters. VOILA consistently achieves 50-60% cost reductions while retaining 90-95% of full-resolution accuracy across diverse query types and model architectures, demonstrating that pre-
retrieval fidelity selection is vital to optimize
multimodal inference under resource constraints.
Read the full abstract ▾
All authors Rahul Atul Bhope, K. R. Jayaram, Vinod Muthusamy, Ritesh Kumar, Vatche Isahagian, Nalini Venkatasubramanian
Machine Learning
Graph Autoencoder for Process Monitoring
Xiangrui Zhang
To improve the reliability and interpretability of industrial process monitoring, this article proposes a Causal Graph Spatial-Temporal Autoencoder (CGSTAE). The network architecture of CGSTAE combines two components: a correlation graph structure learning module based on spatial self-
attention mechanism (SSAM) and a spatial-temporal encoder-decoder module utilizing graph convolutional long-short term
memory (GCLSTM). The SSAM learns correlation graphs by capturing dynamic relationships between variables, while a novel three-step causal graph structure learning
algorithm is introduced to derive a causal graph from these correlation graphs. The
algorithm leverages a reverse perspective of causal invariance principle to uncover the invariant causal graph from varying correlations. The spatial-temporal encoder-decoder, built with GCLSTM units, reconstructs time-series process data within a sequence-to-sequence framework. The proposed CGSTAE enables effective process monitoring and fault detection through two statistics in the feature space and residual space. Finally, we validate the effectiveness of CGSTAE in process monitoring through the Tennessee Eastman process and a real-world air separation process.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.AI
Open Problems in Differentiable Social Choice: Learning Mechanisms, Decisions, and Alignment
Zhiyu An and Wan Du
Social choice has become a foundational component of modern machine learning systems. From auctions and resource allocation to the
alignment of large generative models, machine learning pipelines increasingly aggregate heterogeneous preferences and incentives into collective decisions. In effect, many contemporary machine learning systems already implement social choice mechanisms, often implicitly and without explicit normative scrutiny. This Review surveys differentiable social choice: an emerging paradigm that formulates voting rules, mechanisms, and aggregation procedures as learnable, differentiable models optimized from data. We synthesize work across auctions, decision aggregation, and preference learning, showing how classical axioms and impossibility results reappear as objectives, constraints, and optimization trade-offs. We conclude by identifying 18 open problems defining a new research agenda at the intersection of machine learning and social choice theory.
Read the full abstract ▾
Machine Learning
Adaptive Batch Sizes Using Non-Euclidean Gradient Noise Scales for Stochastic Sign and Spectral Descent
Hiroki Naganuma, Shagun Gupta, Youssef Briki et al. (+4 more)
To maximize hardware utilization, modern machine learning systems typically employ large constant or manually tuned batch size schedules, relying on heuristics that are brittle and costly to tune. Existing adaptive strategies based on gradient noise scale (GNS) offer a principled alternative. However, their assumption of SGD's Euclidean geometry creates a fundamental mismatch with popular optimizers based on generalized norms, such as signSGD / Signum ($\ell_\infty$) and
stochastic spectral descent (specSGD) /
Muon ($\mathcal{S}_\infty$). In this work, we derive gradient noise scales for signSGD and specSGD that naturally emerge from the geometry of their respective dual norms. To practically estimate these non-Euclidean metrics, we propose an efficient variance estimation procedure that leverages the local mini-batch gradients on different ranks in distributed data-parallel systems. Our experiments demonstrate that adaptive batch size strategies using non-Euclidean GNS enable us to match the validation loss of constant-batch baselines while reducing training steps by up to 66% for Signum and
Muon on a 160 million parameter Llama model.
Read the full abstract ▾
All authors Hiroki Naganuma, Shagun Gupta, Youssef Briki, Ioannis Mitliagkas, Irina Rish, Parameswaran Raman, Hao-Jun Michael Shi
Machine Learning
Learning to Repair Lean Proofs from Compiler Feedback
Evan Wang, Simon Chess, Daniel Lee et al. (+4 more)
As neural
theorem provers become increasingly agentic, the ability to interpret and act on compiler feedback is critical. However, existing Lean
datasets consist almost exclusively of correct proofs, offering little supervision for understanding and repairing failures. We study Lean proof repair as a supervised learning problem: given an erroneous proof and compiler feedback, predict both a corrected proof and a natural-
language diagnosis grounded in the same feedback. We introduce APRIL (Automated Proof Repair in Lean), a
dataset of 260,000 supervised tuples pairing systematically generated proof failures with compiler diagnostics and aligned repair and explanation targets. Training
language models on APRIL substantially improves repair accuracy and feedback-conditioned
reasoning; in our single-shot repair evaluation setting, a finetuned 4B-parameter model outperforms the strongest open-source baseline. We view diagnostic-conditioned supervision as a complementary training signal for feedback-using provers. Our
dataset is available at https://huggingface.co/
datasets/uw-math-ai/APRIL.
Read the full abstract ▾
All authors Evan Wang, Simon Chess, Daniel Lee, Siyuan Ge, Ajit Mallavarapu, Jarod Alper, Vasily Ilin
Machine Learning
NLI:Non-uniform Linear Interpolation Approximation of Nonlinear Operations for Efficient LLMs Inference
Jiangyong Yu, Xiaomeng Han, Xing Hu et al. (+3 more)
Large
Language Models (LLMs) have demonstrated remarkable performance across a wide range of tasks, but their deployment is often constrained by substantial
memory footprints and computational costs. While prior work has achieved significant progress in compressing and accelerating linear layers, nonlinear layers-such as SiLU, RMSNorm, and Softmax-still heavily depend on high-precision floating-point operations. In this paper, we propose a calibration-free, dynamic-programming-optimal, and hardware-friendly framework called Non-uniform Linear Interpolation (NLI). NLI is capable of efficiently approximating a variety of nonlinear functions, enabling seamless integration into LLMs and other deep neural networks with almost no loss in accuracy. NLI ingeniously recasts cutpoint selection as a dynamic-programming problem, achieving the globally minimal interpolation error in O(MxN2) time via Bellman's optimality principle. Based on the NLI
algorithm, we also design and implement a plug-and-play universal nonlinear computation unit. Hardware experiments demonstrate that the NLI Engine achieves more than 4x improvement in computational efficiency compared to the state-of-the-art designs.
Read the full abstract ▾
All authors Jiangyong Yu, Xiaomeng Han, Xing Hu, Chen Xu, Zhe Jiang, Dawei Yang
Machine Learning
Why Some Models Resist Unlearning: A Linear Stability Perspective
Wei-Kai Chang and Rajiv Khanna
Machine unlearning, the ability to erase the effect of specific training samples without retraining from scratch, is critical for
privacy, regulation, and efficiency. However, most progress in unlearning has been empirical, with little theoretical understanding of when and why unlearning works. We tackle this gap by framing unlearning through the lens of asymptotic linear stability to capture the interaction between optimization dynamics and data geometry. The key quantity in our analysis is data coherence which is the cross sample
alignment of loss surface directions near the optimum. We decompose coherence along three axes: within the retain set, within the forget set, and between them, and prove tight stability thresholds that separate convergence from divergence. To further link data properties to forgettability, we study a two layer ReLU CNN under a signal plus noise model and show that stronger memorization makes forgetting easier: when the signal to noise ratio (SNR) is lower, cross sample
alignment is weaker, reducing coherence and making unlearning easier; conversely, high SNR, highly aligned models resist unlearning. For empirical verification, we show that Hessian tests and CNN heatmaps align closely with the predicted boundary, mapping the stability frontier of gradient based unlearning as a function of batching, mixing, and data/model
alignment. Our analysis is grounded in random
matrix theory tools and provides the first principled account of the trade offs between memorization, coherence, and unlearning.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.CL
CPMobius: Iterative Coach-Player Reasoning for Data-Free Reinforcement Learning
Ran Li, Zeyuan Liu, Yinghao Chen et al. (+8 more)
Large
Language Models (LLMs) have demonstrated strong potential in complex
reasoning, yet their progress remains fundamentally constrained by reliance on massive high-quality human-curated tasks and labels, either through supervised fine-tuning (SFT) or reinforcement learning (RL) on
reasoning-specific data. This dependence renders supervision-heavy training paradigms increasingly unsustainable, with signs of diminishing scalability already evident in practice. To overcome this limitation, we introduce CPMöbius (CPMobius), a collaborative Coach-Player paradigm for data-free reinforcement learning of
reasoning models. Unlike traditional
adversarial self-play, CPMöbius, inspired by real world human sports collaboration and multi-
agent collaboration, treats the Coach and Player as independent but cooperative roles. The Coach proposes instructions targeted at the Player's capability and receives rewards based on changes in the Player's performance, while the Player is rewarded for solving the increasingly instructive tasks generated by the Coach. This cooperative optimization loop is designed to directly enhance the Player's mathematical
reasoning ability. Remarkably, CPMöbius achieves substantial improvement without relying on any external training data, outperforming existing unsupervised approaches. For example, on Qwen2.5-Math-7B-Instruct, our method improves accuracy by an overall average of +4.9 and an out-of-distribution average of +5.4, exceeding RENT by +1.5 on overall accuracy and R-zero by +4.2 on OOD accuracy. Our codebase has been released at https://github.com/thunlp/CPMobius.
Read the full abstract ▾
All authors Ran Li, Zeyuan Liu, Yinghao Chen, Bingxiang He, Jiarui Yuan, Zixuan Fu, Weize Chen, Jinyi Hu, Chen Qian, Zhiyuan Liu, Maosong Sun
Machine Learning · Cross-listed from cs.CV
Aligning Forest and Trees in Images & Long Captions for Visually Grounded Understanding
Byeongju Woo, Zilin Wang, Byeonghyun Pak et al. (+2 more)
Vision-
language models such as CLIP often struggle to faithfully understand long, detail-rich captions, relying on dominant scene cues while overlooking fine-grained visual evidence. We propose a hierarchical
vision-
language learning principle for understanding scenes as part-to-whole compositions: before forming a whole-scene representation, a model should uncover what semantic parts appear where in the image. To this end, we propose CAFT (Cross-domain
Alignment of Forest and Trees), a
vision-
language model that jointly learns local text-region
alignment at intermediate representations and global image-text
alignment at the final representation. Exploiting the organization of long captions, where local descriptions often correspond to scene parts, CAFT employs a fine-to-coarse image encoder and a part-whole text encoder to discover localized part semantics and progressively compose them into a global image-text representation. Trained on 30M image-text pairs, CAFT achieves state-of-the-art performance on six long-text
retrieval benchmarks and exhibits strong scaling behavior. Experiments show that CAFT learns fine-grained representations that localize textual semantics in image regions without explicit region-level supervision.
Read the full abstract ▾
All authors Byeongju Woo, Zilin Wang, Byeonghyun Pak, Sangwoo Mo, Stella X. Yu
Machine Learning · Cross-listed from cs.CL
Where Norms and References Collide: Evaluating LLMs on Normative Reasoning
Mitchell Abrams, Kaveh Eskandari Miandoab, Felix Gervits et al. (+2 more)
Embodied agents, such as
robots, will need to interact in situated environments where successful communication often depends on
reasoning over social norms: shared expectations that constrain what actions are appropriate in context. A key capability in such settings is norm-based reference resolution (NBRR), where interpreting referential expressions requires inferring implicit normative expectations grounded in physical and social context. Yet it remains unclear whether Large
Language Models (LLMs) can support this kind of
reasoning. In this work, we introduce SNIC (Situated Norms in Context), a human-validated diagnostic testbed designed to probe how well state-of-the-art LLMs can extract and utilize normative principles relevant to NBRR. SNIC emphasizes physically grounded norms that arise in everyday tasks such as cleaning, tidying, and serving. Across a range of controlled evaluations, we find that even the strongest LLMs struggle to consistently identify and apply social norms, particularly when norms are implicit, underspecified, or in conflict. These findings reveal a blind spot in current LLMs and highlight a key challenge for deploying
language-based systems in socially situated,
embodied settings.
Read the full abstract ▾
All authors Mitchell Abrams, Kaveh Eskandari Miandoab, Felix Gervits, Vasanth Sarathy, Matthias Scheutz
Machine Learning · Cross-listed from cs.SC
Learning Fast Monomial Orders for Gröbner Basis Computations
R. Caleb Bunch, Alperen A. Ergür, Melika Golestani et al. (+3 more)
The efficiency of Gröbner basis computation, the standard engine for solving systems of
polynomial equations, depends on the choice of monomial ordering. Despite a near-continuum of possible monomial orders, most implementations rely on static heuristics such as GrevLex, guided primarily by expert intuition. We address this gap by casting the selection of monomial orderings as a reinforcement learning problem over the space of admissible orderings. Our approach leverages domain-informed reward signals that accurately reflect the computational cost of Gröbner basis computations and admits efficient Monte Carlo estimation. Experiments on
benchmark problems from systems biology and computer
vision show that the resulting learned policies consistently outperform standard heuristics, yielding substantial reductions in computational cost. Moreover, we find that these policies resist
distillation into simple interpretable models, providing empirical evidence that deep reinforcement learning allows the
agents to exploit non-linear
geometric structure beyond the scope of traditional heuristics.
Read the full abstract ▾
All authors R. Caleb Bunch, Alperen A. Ergür, Melika Golestani, Jessie Tong, Malia Walewski, Yunus E. Zeytuncu
Machine Learning
Co2PO: Coordinated Constrained Policy Optimization for Multi-Agent RL
Shrenik Patel and Christine Truong
Constrained multi-
agent reinforcement learning (MARL) faces a fundamental tension between exploration and safety-constrained optimization. Existing leading approaches, such as Lagrangian methods, typically rely on global penalties or centralized critics that react to violations after they occur, often suppressing exploration and leading to over-conservatism. We propose Co2PO, a novel MARL communication-augmented framework that enables coordination-driven safety through selective, risk-aware communication. Co2PO introduces a shared blackboard architecture for broadcasting positional intent and yield signals, governed by a learned hazard predictor that proactively forecasts potential violations over an extended temporal horizon. By integrating these forecasts into a constrained optimization objective, Co2PO allows
agents to anticipate and navigate collective hazards without the performance trade-offs inherent in traditional reactive constraints. We evaluate Co2PO across a suite of complex multi-
agent safety
benchmarks, where it achieves higher returns compared to leading constrained baselines while converging to cost-compliant policies at deployment. Ablation studies further validate the necessity of risk-triggered communication, adaptive gating, and shared
memory components.
Read the full abstract ▾
Machine Learning
Q-ShiftDP: A Differentially Private Parameter-Shift Rule for Quantum Machine Learning
Hoang M. Ngo, Nhat Hoang-Xuan, Quan Nguyen et al. (+3 more)
Quantum Machine Learning (QML) promises significant computational advantages, but preserving training data
privacy remains challenging. Classical approaches like differentially private
stochastic gradient descent (DP-SGD) add noise to gradients but fail to exploit the unique properties of
quantum gradient estimation. In this work, we introduce the Differentially Private Parameter-Shift Rule (Q-ShiftDP), the first
privacy mechanism tailored to QML. By leveraging the inherent boundedness and stochasticity of
quantum gradients computed via the parameter-shift rule, Q-ShiftDP enables tighter sensitivity analysis and reduces noise requirements. We combine carefully calibrated Gaussian noise with intrinsic
quantum noise to provide formal
privacy and utility guarantees, and show that harnessing
quantum noise further improves the
privacy-utility trade-off. Experiments on
benchmark datasets demonstrate that Q-ShiftDP consistently outperforms classical DP methods in QML.
Read the full abstract ▾
All authors Hoang M. Ngo, Nhat Hoang-Xuan, Quan Nguyen, Nguyen Do, Incheol Shin, My T. Thai