cs.LG · 2026-10-10 · No. 139

Machine Learning, 2026-10-10.

60 new papers in cs.LG. Titles, authors, abstracts. Links to arXiv. Want this in your inbox every morning? Subscribe →

01 — The papers

60 entries
  1. 01

    Bi-FORK: Generative Modeling of High-Dimensional Bifurcating Systems

    Anna Zimmel, Fleur Hendriks, Markus Holzleitner, Florian Sestak, Martin Weichselbaumer, Vlado Menkovski, Johannes...

    cs.LG · cs.AI · cs.CE · physics.comp-ph

    Bifurcations are ubiquitous in physical systems, from structural buckling to fluid and climate dynamics, yet they remain largely unexplored in deep learning. At a symmetry-breaking bifurcation, a single input admits multiple equally valid solutions, violating the one-to-one assumption underlying most learned physical surrogates. We introduce Bi-FORK, a generative framework for learning these one-to-many solution maps in high-dimensional...

    arxiv.org/abs/2610.12449 · PDF

  2. 02

    Caught in the Act: Probes Effectively Detect Sabotage and Catch Unverbalized Deception

    Oskar J. Hollinsworth, Alex F. Spies, Tigist Diriba, Adam Gleave, Chris Cundy

    cs.LG · cs.AI

    Recent incidents have highlighted the challenge of monitoring LLM agents and the danger of models deceiving people. We show that white-box deception detection via probes can be scaled up to frontier monitoring settings by collecting the largest deception dataset to date for training probes and introducing a novel probe architecture which can aggregate information across many layers and tokens. Our probes achieve 98.8% AUC in SHADE-Arena,...

    arxiv.org/abs/2610.12445 · PDF

  3. 03

    Rounding in Preconditioner Space: Redesigning 4-bit AdamW Optimizer-State Quantization

    Hanyang Li, Shao Tang, Daniel Thomas Braithwaite, Gregory Dexter, Leonardo Neves, Aman Gupta, Hiroto Udagawa,...

    cs.LG

    Quantizing AdamW's optimizer states reduces persistent storage, but quantization errors propagate through the moment recurrences and perturb subsequent adaptive updates. We redesign 4-bit optimizer-state quantization for AdamW from the perspective of \emph{rounding space}: the coordinate in which a quantizer chooses between adjacent reconstruction levels. For the second moment, a local analysis of the quantization cell adjacent to zero shows...

    arxiv.org/abs/2610.12444 · PDF

  4. 04

    A Unified Bellman Operator for Safety-Critical Reinforcement Learning

    Nishanth Arun Rao, Royina Karegoudra Jayanth, Benjamin Eysenbach, Jaime Fernández Fisac

    cs.LG

    Reinforcement learning in safety-critical domains requires maximizing task performance while strictly adhering to safety constraints. Existing safe reinforcement learning paradigms typically force a trade-off: they either require a priori knowledge to provide strict safety guarantees (e.g., safety filters), or they enable joint learning but only satisfy safety constraints on average. In this work, we propose a novel Bellman operator that...

    arxiv.org/abs/2610.12420 · PDF

  5. 05

    Learning Kilometer-Scale Weather Prediction with Global-Regional Alignment

    Guowen Li, Yang Liu, Yujie Wang, Qiuyan Sun, Haoyuan Liang, Juepeng Zheng, Hong Cheng, Haohuan Fu

    cs.LG

    Kilometer-scale regional weather forecasting is essential for local weather warnings and weather-sensitive decisions. Existing data-driven approaches often rely on numerical forecasts for large-scale guidance or require additional training of global forecasting components. Pretrained global weather models offer an efficient source of large-scale forecasts, motivating their reuse to guide high-resolution regional prediction. However, this...

    arxiv.org/abs/2610.12401 · PDF

  6. 06

    Prospective Prediction of OOD Degradation from Source-Side Training Dynamics

    Sasha, Monin

    cs.LG

    We study whether persistent out-of-distribution (OOD) degradation can be predicted before it is directly observed using only source-side training dynamics. In a controlled shortcut-learning setting, a simple logistic regression predictor develops a clear prospective signal, while training time alone does not. Temporal summaries of the source-side quantities are substantially more informative than their current values. When transferred without...

    arxiv.org/abs/2610.12397 · PDF

  7. 07

    Long Text to Predictive Features: LLM-Guided Blockwise Feature Engineering via Executable Program Search

    Ziming Dai, Dabiao Ma, Ziheng Guo, Jack Dong, Zimu Zhou

    cs.LG · cs.CL

    Industrial risk-control systems typically rely on structured-data models for efficient prediction, yet substantial valuable information remains embedded in unstructured long text. Extracting this information through manual feature engineering is labor-intensive, while requiring a large language model (LLM) to process every real-time input may not meet practical deployment requirements. To address this challenge, we propose LLM-BlockFE, an...

    arxiv.org/abs/2610.12390 · PDF

  8. 08

    Marformer: A Transformer for Predicting Missing Data Distributions

    Prabhav Singh, Xiheng Tom Wang, Haojun Shi, Jason Eisner

    cs.LG · stat.ME

    Real decisions are made under incomplete information. If we observe only some of the random variables we need, we can predict the others. The \textbf{conditional marginals} over the missing variables are the key ingredient for computing Bayes risk and Value of Information (VOI), the expected gain from acquiring one more observation before deciding. We present the Marformer, a Transformer trained to directly predict conditional marginals given...

    arxiv.org/abs/2610.12379 · PDF

  9. 09

    Bilevel optimization for data-driven learning of Koopman embeddings using kernel-based autoencoders

    Joel-Pascal Ntwali N'konzi, Feliks Nüske, Stefan Klus

    cs.LG · math.DS · stat.ML

    Koopman operator theory provides a linear framework for analyzing nonlinear dynamical systems and has become a major tool for data-driven modeling. A central challenge, however, is that finite-dimensional approximations computed by methods such as extended dynamic mode decomposition (EDMD) require the dictionary to be specified a priori. Recent machine-learning approaches address this limitation by learning the dictionary from data,...

    arxiv.org/abs/2610.12370 · PDF

  10. 10

    Closing the Horizon Gap in Policy Optimization for Adversarial MDPs

    Mingyi Li, Taira Tsuchiya

    cs.LG · stat.ML

    We consider policy optimization for online episodic tabular Markov decision processes (MDPs) with adversarial losses and bandit feedback. Policy optimization updates the policy locally at each state and avoids optimization over the occupancy-measure polytope, but its existing regret bounds are larger by a factor of the horizon $H$ than those of occupancy-measure-based algorithms. We close this gap by using regularized $Q$-functions, which...

    arxiv.org/abs/2610.12362 · PDF

  11. 11

    SplitJEPA: Learning Invariant and Variant Latent Worlds without Reconstruction

    Ruijin Hua, Zichuan Liu, Zhuokai Zhao, Yujia Zheng

    cs.LG

    Understanding a dynamical world calls for more than a latent state that summarizes its observations: the state should also be organized into the factors that stay shared across related observations and the factors that vary between them. For example, a robot pushing a cube to a goal should take the same action when the camera shifts or the lights dim, since nothing in the scene has moved. Existing approaches to this decomposition commonly...

    arxiv.org/abs/2610.12349 · PDF

  12. 12

    Ambient Discrete Diffusion: Using the Wrong Data at the Right Time for Data Efficient Learning

    Julian Kleutgens, Mauricio Tec, Claudio Battiloro, Francesca Dominici, Giannis Daras

    cs.LG

    We introduce RefineMix, a framework for training discrete diffusion models under severe data scarcity, a common constraint in scientific applications. RefineMix uses out-of-distribution data at selected diffusion times to improve generalization without biasing the sampling distribution. Although this strategy has been explored in continuous diffusion, discrete diffusion presents a distinct challenge: unlike Gaussian noise, masking preserves...

    arxiv.org/abs/2610.12340 · PDF

  13. 13

    Composite Online-to-Nonconvex Conversion with Optimal Oracle Complexity

    Mingyi Li, Taira Tsuchiya, Kenji Yamanishi

    cs.LG · math.OC · stat.ML

    We consider stochastic nonsmooth nonconvex composite optimization, which includes several important problems such as constrained optimization and the regularized training of neural networks. The objective is the sum of a possibly nonsmooth nonconvex Lipschitz function and a convex regularizer, and the function is accessed through stochastic gradients or function values. The goal is to find a point that satisfies a Goldstein-type stationarity...

    arxiv.org/abs/2610.12328 · PDF

  14. 14

    SparseDecoding: Decoding-Aware Pruning for Accurate and Efficient LLM Inference

    Qitong Wang, Xinwei Niu, Mingluo Su, Shanwei Zhao, Shiai Zhu, Huan Wang

    cs.LG · cs.CL

    The memory-bound nature of the decoding stage of large language model (LLM) inference incurs significant latency. Layer-wise training-free network pruning approaches guided by the Hessian have been a prominent solution to this problem, as pruning reduces the number of nonzero parameters read from memory during decoding. Nevertheless, typical methods in this line compute the Hessian using pre-collected natural sequences, whereas the model is...

    arxiv.org/abs/2610.12327 · PDF

  15. 15

    AdaptLSTM: Efficient Adaptive Online Learning for Cloud Workload Forecasting under Distribution Drift

    Xinhua Miao, Bowei Yang, Zhengong Cai

    cs.LG

    Accurate workload forecasting is critical for elastic resource provisioning in web-scale cloud services, where distribution shifts driven by viral content, product launches, and user behavior degrade offline-trained models rapidly. Naive online learning recovers accuracy but incurs prohibitive per-step compute cost. We propose AdaptLSTM, an adaptive online framework that detects drift via validation-calibrated thresholds and applies...

    arxiv.org/abs/2610.12265 · PDF

  16. 16

    Batch Before You Lift: Scalable Topological Deep Learning on Large Graphs

    David Leko, Luka Benić, Guillermo Bernárdez, Nina Miolane, Olga Fink, Lev Telyatnikov

    cs.LG · cs.AI

    Topological Deep Learning extends graph-based learning to higher-order domains, such as hypergraphs, cellular, and simplicial complexes. These domains are typically constructed from patterns in an input graph through a process of graph lifting. Full-domain training constructs and stores the complete lifted representation before model execution. On large and dense datasets like Reddit (233k nodes and 57.3M edges), this global materialization...

    arxiv.org/abs/2610.12247 · PDF

  17. 17

    RIFT: Relative Isolation From Trees For Anomaly Detection

    Mark Daniel Szalai, Gabor Horvath

    cs.LG

    Isolation Forest (IF) is a widely used baseline for unsupervised anomaly detection. Recent studies provide a closed-form expression for the infinite-forest limit for one-dimensional data. Inspired by the geometric interpretation of this formula, we introduce RIFT (Relative Isolation From Trees), a deterministic anomaly detection method that generates the minimum spanning tree and scores each point by the sum of the apparent sizes of tree...

    arxiv.org/abs/2610.12244 · PDF

  18. 18

    AdaCast: Conditional Parameter Generation for Adaptive Time Series Forecasting

    Darahaas Nallagatla, Darryl Cherian Jacob, Pan He

    cs.LG · cs.AI

    Time-series foundation models (TSFMs) have achieved strong forecasting performance across domains. However, most adaptation methods remain static. Existing all-in-one methods learn a single set of dataset-level parameter updates and apply the same adapted model to every input. As a result, they cannot adapt the model parameters to the temporal patterns, seasonality and dynamics of each input time series. This limits their ability to produce...

    arxiv.org/abs/2610.12240 · PDF

  19. 19

    Training on the Future: A Delay-Aware Audit of Test-Time Adaptation for Time-Series Forecasting

    Mohamed Readh Fentazi, Mazene Ameur, Adlen Ksentini

    cs.LG

    Test-time adaptation (TTA) methods for time-series forecasting update a deployed model, or a small adapter around it, from incoming ground truth. But the label of an $H$-step forecast exists only $H$ steps later, and real data pipelines add further delay. We build a leakage-free harness in which the label of forecast origin $s$ is released for updates only at step $s+d$ with $d \ge H$, and enforce this rule inside the released code of four...

    arxiv.org/abs/2610.12232 · PDF

  20. 20

    Verification with Transfer: Exact Information Frontiers and Their Price in Calls

    Hazar Yueksel

    cs.LG · cs.CR · cs.IT · stat.ML

    A verifier that accepts or rejects whole answers reveals little: under a flat prior over $k$-bit answers, zero error needs $2^k-1$ verifications. The usual remedy is to solve related source tasks, either all first, as a curriculum does, or interleaved with verification. We price this remedy in information and in calls. With an exact verifier, the least causal information that any interleaving of source calls and $n$ verifications needs to...

    arxiv.org/abs/2610.12211 · PDF

  21. 21

    DataSense-Bench: The First Step Toward an AI Scientist

    Yudi Zhang, Mingyu Cao, Lu Yin, Mykola Pechenizkiy, Shiwei Liu

    cs.LG

    As claims about recursive self-improvement (RSI) and artificial general intelligence (AGI) proliferate, we ask a simple question: do frontier AI models have a sense of data, i.e., can they reliably select the right data for training? We introduce DataSense-Bench to study this capability through the fundamental problem of data selection and performance forecasting in machine learning. We ask AI agents to select and rank candidate training...

    arxiv.org/abs/2610.12190 · PDF

  22. 22

    Just Weather Scoring: Efficient End-to-end Nowcasting with Distributional Diffusion

    Jannik Wiese, Johannes Schusterbauer, Tommaso Martorella, Björn Ommer

    cs.LG · cs.CV

    Generative diffusion models are well-suited for probabilistic precipitation nowcasting, but existing approaches often rely on separately trained compression or deterministic forecasting components and remain costly at inference due to iterative denoising. We introduce Just Weather Scoring (JWS), a single-stage, end-to-end diffusion model which addresses both issues by forecasting directly in radar space and enabling few-step generation....

    arxiv.org/abs/2610.12189 · PDF

  23. 23

    A Closer Look at Agentic BBO: Benchmarking LLM Agents for Black-Box Optimization

    Ming Chen, Rong-Xi Tan, Ke Xue, Yu-Jie Zhou, Taiye Lu, Zhi-Xuan Gao, Peng Xie, Zijun Shen, Chen Lu, Haopu Shang, Chao Qian

    cs.LG · cs.AI · cs.NE

    Black-box optimization (BBO) arises in many scientific and engineering problems where objective evaluations are expensive and limited. Recent large language model (LLM) agents offer a new way to approach BBO by combining task semantics, computation, optimization tools, and feedback-driven decision making, showing great potential due to the integration with mathematically rigorous tools. However, existing agentic BBO studies use different task...

    arxiv.org/abs/2610.12183 · PDF

  24. 24

    Is Real-World Training Data Necessary for Generalist Graph Anomaly Detection?

    Yujing Liu, Yixin Liu, Yue Tan, Xiaofeng Cao, Alan Wee-Chung Liew, Heng Tao Shen, Shirui Pan

    cs.LG

    Generalist graph anomaly detection (GAD) aims to build a foundation model that detects anomalies on arbitrary unseen graphs without retraining or fine-tuning. Sufficient data are essential for foundation model training, yet generalist GAD still faces a data shortage, as real-world anomalous graphs are scarce and costly to collect and annotate. To fill this gap, we propose AG-FORGE, an Anomalous Graph generation Forge for automatic synthesis...

    arxiv.org/abs/2610.12167 · PDF

  25. 25

    Scalable Hierarchical Graph Generation via Soft Community Structure

    Ahmet Tüzen, Helge Langseth, Kjetil Nørvåg

    cs.LG · cs.AI

    Generating large attributed graphs requires reproducing the topology, generating attributes jointly with the structure, and remaining scalable. Many real-world graphs exist as a single large graph, so a generative model has to generalize from the one graph it is fit on, without independent samples. We present Schema, which recursively decomposes a reference graph into a hierarchy of soft communities, assigning each node a membership...

    arxiv.org/abs/2610.12163 · PDF

  26. 26

    When KL Regularization Misfires in Group Policy Optimization

    Fei Ding

    cs.LG · cs.CL

    Why does removing reference-policy KL regularization sometimes improve group policy optimization? This motivates studying how reference-policy information should enter group-relative updates. We analyze seven potential failure modes in the interactions between KL and rewards: residual KL updates after reward clipping, after gradient cancellation, and in groups with identical rewards; KL growth with response length and an imbalance in its...

    arxiv.org/abs/2610.12161 · PDF

  27. 27

    Toward Optimal Regret in Adversarial MDPs with Stochastic Hard Constraints

    Qian Zuo, Francesco Emanuele Stradi

    cs.LG

    We study episodic constrained Markov decision processes with adversarial losses under stochastic hard constraints. Specifically, starting from a known strictly feasible policy with margin $d$, we seek to obtain optimal regret while satisfying the expected cost constraints in every episode. In this setting, Stradi et al. (2025) show that a carefully designed mixing rule attains regret of order $\widetilde{\mathcal{O}}(\sqrt{T}/\min\{d,d^2\})$....

    arxiv.org/abs/2610.12153 · PDF

  28. 28

    Bayesian Optimisation under State-Preservation Constraints

    Gabriel Diaz-Aylwin, Vignesh Gopakumar, Omkar Myatra, David Moulton, Lorenzo Zanisi, David S. Leslie, Henry B. Moss

    cs.LG

    In many engineering design problems, the objective and constraints depend on the state: the solution of a PDE determined by the design parameters. We consider improving a design while holding selected state observables near trusted values, which we call state preservation constraints. Constrained Bayesian optimisation handles these with a learnt feasibility model, but struggles with this problem's highly anisotropic feasible set. Our central...

    arxiv.org/abs/2610.12150 · PDF

  29. 29

    Large-Scale Benchmarking of Quantum Neural Network Configurations for Financial Time Series Forecasting

    Jack Waller, Xing Liang, Dimitrios Makris, Rajagopal Nilavalan

    cs.LG · quant-ph

    Quantum machine learning, and quantum neural networks (QNNs) in particular, are advancing fields with growing potential. Although systematic comparisons of QNN configurations have been explored primarily for classification tasks, comparatively little attention has been given to regression problems, particularly financial time series forecasting. This study presents a large-scale systematic comparative evaluation of QNN component...

    arxiv.org/abs/2610.12148 · PDF

  30. 30

    Using Weisfeiler-Leman Features for Algorithm Selection in Constraint Optimisation

    Alessio Pellegrino, Jacopo Mauro

    cs.LG · cs.AI

    Algorithm Selection is essential for efficient Constraint Programming. Over the years, many algorithm selectors based on machine learning methods have been successfully applied, yet traditional feature extraction methods often rely on manually decided instance-level statistics that fail to capture the underlying problem structure. In this paper we aim to bridge this gap by introducing a novel, automated feature extraction methodology that...

    arxiv.org/abs/2610.12119 · PDF

  31. 31

    Credal Machine Learning for Risk-Averse Decision Making

    Timo Löhr, Paul Hofman, Maximilian Muschalik, Eyke Hüllermeier

    cs.LG · stat.ML

    In many machine learning applications, it is necessary to guard against worst-case scenarios and predictions that could result in substantial losses. In principle, this can be achieved by training risk-averse predictive models that minimize loss functions such as conditional value-at-risk (CVaR), rather than relying on models that perform well on average. In practice, however, the effectiveness of this approach to risk aversion is undermined...

    arxiv.org/abs/2610.12115 · PDF

  32. 32

    A Geometric Approach to Soft Actor-Critic with Zonotopes for Locomotion Learning

    Panagiotis Roditis, Panagiotis P. Filntisis, Petros Maragos

    cs.LG · cs.AI

    Off-policy actor--critic methods control overestimation bias by taking the minimum of two critics. This uses the same aggregation rule everywhere, regardless of how the critics disagree. We propose \textbf{GeZo-SAC}, which uses auxiliary geometric representations to adapt critic pessimism to the state and action. Alongside its scalar value, each critic predicts a set of generators defining a zonotope. Probing this zonotope along sampled...

    arxiv.org/abs/2610.12113 · PDF

  33. 33

    Few-Step Generation via Data-Space Iteration

    Shanchuan Lin, Yansong Peng, Fu-Yun Wang, Haoqi Fan

    cs.LG · cs.CV

    Flow matching has emerged as a scalable paradigm for training high-quality generative models, but sampling from the learned probability flow requires many network evaluations. Distillation can reduce this cost to one or a few evaluations; however, one-step generation often sacrifices quality, making few-step generation the practical operating regime. Existing few-step methods perform their iterative computation along the probability flow and...

    arxiv.org/abs/2610.12102 · PDF

  34. 34

    SCORE: Spectral Correlation Estimation for Multivariate Gaussians

    Christopher Bülte, Emil Partow, Astha Gupta, Pascal Esser, Gitta Kutyniok

    cs.LG

    Neural network-based predictive modeling with high-dimensional structured Gaussian targets requires an efficient and numerically stable, yet expressive approximation of the covariance matrix. We propose SCORE: a scalable framework, combining scoring rule training with an expressive covariance approximation learned in spectral space. For $d$-dimensional data, the learning task is decomposed into learning the marginal distributions and learning...

    arxiv.org/abs/2610.12096 · PDF

  35. 35

    Exploiting Gradients in Bayesian Inference of Expensive Simulators

    Šimon Soldát, Václav Šmídl

    cs.LG · stat.ML

    Simulators based on differential equations are ubiquitous in science and engineering. They are often used in simulation-based inference to evaluate the posterior distribution of the input parameters based on real-world observations of the simulator outputs. However, inference becomes challenging when individual simulator evaluations are computationally expensive. In such cases, a Bayesian optimization-based active learning approach with...

    arxiv.org/abs/2610.12076 · PDF

  36. 36

    MPGE: A Multi-Perspective Graph Explainer for Molecular Classification Explanation

    Mahtab Sarvmaili

    cs.LG · cs.AI

    Graph neural networks (GNNs) predict molecular properties from chemical graph data, but predictive accuracy does not explain how graph information supports an individual decision. A compact prediction-preserving rationale does not necessarily reveal which changes reverse the decision or which modifications the model tolerates. We propose the Multi-Perspective Graph Explainer (MPGE), unifying factual support, counterfactual sensitivity, and...

    arxiv.org/abs/2610.12039 · PDF

  37. 37

    CausalDreamer: Learning Predictive World Models with Latent Disentanglement

    Prince Jha, Nils Lukas, Kun Zhang, Salem Lahlou

    cs.LG

    World models for control must capture which aspects of the environment respond to the agent's actions and which are relevant to reward. Generative world models such as Dreamer 4 consist of a video tokenizer, which encodes each frame into a latent, and a dynamics model, which is pretrained to predict future latents from past latents and actions. Yet the tokenizer is trained with a reconstruction objective, without action or reward supervision,...

    arxiv.org/abs/2610.12016 · PDF

  38. 38

    Test-Time Compute for Tabular Foundation Models: Mechanisms, Gains, and Limits

    Kanghui Ning, Marin Biloš, James T. Wilson, Yilang Zhang, Kashif Rasul, Dongjin Song, Anderson Schneider, Yuriy Nevmyvaka

    cs.LG

    Which forms of test-time compute improve the predictions of strong pretrained tabular foundation models (TFMs)? We systematically study this along three axes: adaptation, aggregation, and context construction. Our evaluation spans modern TFMs across the TabArena benchmark, supplemented by experiments on wide and large-scale tables from OpenML. For adaptation, we introduce DiagScale, a diagonal query-key similarity update. It trains only...

    arxiv.org/abs/2610.12005 · PDF

  39. 39

    The Polytopal Neural Network

    A. Emilie J. Wedenborg, Anders V. Nørskov, Teresa Dorszewski, Kristoffer Wickstrøm, Morten Mørup

    cs.LG · cs.AI

    Understanding how deep neural networks process information remains a central challenge. Existing interpretability methods often compromise structural fidelity, rely on prespecified corpora, or explain models post-hoc. We propose Polytopal Neural Networks (PNNs), a framework that extracts distinct layer-wise aspects by enforcing a polytope-based structure that is used directly in subsequent information processing. We scale our approach using...

    arxiv.org/abs/2610.12004 · PDF

  40. 40

    Agentic-TTT: Training test-time policy for test-time training

    Jiahao Lu, Mohan Kankanhalli

    cs.LG · cs.AI · cs.CL

    Test-time training (TTT) adapts an LLM's parameters using signals derived from test inputs, and can make striking improvements in pre-specified settings such as IMO competitions or designated open problems. By turning deployment experience into parameter updates, TTT provides a direct mechanism for model-level self-improvement. Yet TTT is not universally beneficial: each TTT algorithm works in different settings, and applying an ill-suited...

    arxiv.org/abs/2610.12002 · PDF

  41. 41

    Example-driven Parametrisations for Bayesian Shape Optimisation

    Gabriel Diaz-Aylwin, Joseph Neighbor, Abiel Malkani Talwar, Rui-Yang Zhang, Henry B. Moss

    cs.LG

    Bayesian optimisation is the natural tool for shape design when objectives are expensive and non-differentiable, but it needs a compact yet expressive parameterisation of the search space. Hand-crafting one is a complex endeavour requiring domain expertise, and often yields implicit infeasible regions, artificial bounds, and coupled, unordered coordinates. We instead learn the parameterisation from a collection of existing designs, applying...

    arxiv.org/abs/2610.11984 · PDF

  42. 42

    Stochastic Grouping Conformal Prediction for Effective Subgroup Reliability

    Meihui Zhong, Wenxin Tai, Ting Zhong, Fan Zhou

    cs.LG · cs.AI

    Conformal prediction offers a distribution-free coverage guarantee, making it especially attractive for clinical applications. Standard conformal prediction, however, provides such guarantees only at the population level, and its prediction sets can exhibit coverage disparities across clinically important subgroups. A natural remedy is to calibrate within predefined groups. However, this can require access to sensitive subgroup attributes and...

    arxiv.org/abs/2610.11957 · PDF

  43. 43

    Interval-valued SHAP in Tree-Based Models

    Chenrui Zhu, Vu-Linh Nguyen, Marie-Hélène Masson, Sébastien Destercke

    cs.LG

    Shapley values are among the most popular feature-attribution explanations. Efficient approaches for computing/estimating Shapley values for tree-based models, which are state-of-the-art for tabular data sets, have been developed. However, it is known that Shapley values can be (highly) unrobust due to small and realistic changes. In this paper, we propose an imprecise Dirichlet model (IDM) based method to analyze the robustness of Shapley...

    arxiv.org/abs/2610.11953 · PDF

  44. 44

    Puffin: Probabilistic Learning of Spatial Detail From Coarse Observations

    Chaitanya Jobanputra, Sebastian Vollmer, Gerrit Großmann

    cs.LG

    High-resolution socioeconomic variables are important for applications such as urban planning, public health, disaster response, and resource allocation. In practice, however, these variables are often observed only at a coarse spatial resolution. We introduce Puffin, a probabilistic framework for statistical disaggregation that raises the resolution of coarse totals using high-resolution satellite embeddings as covariates. Instead of...

    arxiv.org/abs/2610.11914 · PDF

  45. 45

    Automated Assembly Instruction Generation from CAD Models Using Grounded Large Language Models: A Human-in-the-Loop Framework

    Aaron Dsouza, Mohammed Azeez Khan, Ashutosh Mishra, Arshaan Khan, Neha K. Nair, Amar Kumar Behera

    cs.LG

    Assembly documentation is a downstream manufacturing artifact that is still usually authored by interpreting CAD models by hand. Structured product data and large language models are both available, yet studies of CAD interpretation, assembly sequence planning, instruction writing, and human oversight have largely proceeded separately. This paper formulates CAD-grounded assembly instruction generation: the production of natural-language...

    arxiv.org/abs/2610.11896 · PDF

  46. 46

    Understanding Latent-Dimension Scaling in Dynamical-System Learning through Spectral Reliability

    Itsushi Sakata, Yuta Miyauchi, Yoshinobu Kawahara

    cs.LG · math.DS · nlin.CD

    In deep learning, approximation theory motivates increasing representation size. We ask whether this benefit extends to dynamics learning through autoregressive prediction. We analyze the learned time evolution through the eigenstructure of Koopman operators, using relative residuals to detect spurious eigenpairs arising even as one-step error falls. For bounded Koopman operators, we show that minimal residuals over learned dictionary spaces...

    arxiv.org/abs/2610.11866 · PDF

  47. 47

    GRPODropout: Less is More for Online Reinforcement Learning Rollouts

    Hexuan Deng, Zihao Yan, Xuebo Liu, Shuo Nie, Yue Wang, Chen Wang, Zhaohua Zhang, Tianwen Jiang, Qiuyong Xiao, Jihong...

    cs.LG · cs.AI · cs.CL

    Reinforcement learning (RL) methods such as GRPO substantially improve large language model reasoning but often suffer from policy entropy collapse: the loss of sampling diversity weakens exploration and limits further improvement. Existing methods address this issue either through algorithm-level interventions, such as reward modification and entropy/KL regularization, or through token-level reweighting. We investigate a complementary...

    arxiv.org/abs/2610.11854 · PDF

  48. 48

    DADP: Dynamic Activity-Dependent Pruning, A Reverse Hebbian-Inspired Structural Pruning Method

    Bhushan Deshpande

    cs.LG

    Modern neural networks are heavily over-parameterized. This redundancy incurs substantial compute and memory overhead during training and inference. Existing pruning methods rely on post-hoc magnitude thresholds or static initialization heuristics. Consequently, they often require manual per-layer sparsity targets or expensive retraining cycles. We propose Dynamic Activity-Dependent Pruning (DADP), a biologically inspired structural...

    arxiv.org/abs/2610.11853 · PDF

  49. 49

    Recovery Guarantees for Posterior Sampling of One-Bit Compressed Sensing

    Jing Ma, Yujia Wu, Zhaoqiang Liu

    cs.LG · cs.IT

    We study the sample complexity of noisy one-bit compressed sensing for signals drawn from a prior distribution. By characterizing the effective distributional complexity of the prior via its approximate covering number, we prove that posterior sampling achieves accurate recovery with high probability when the number of measurements scales with the logarithm of the approximate covering number, up to a one-bit separation gap factor. This upper...

    arxiv.org/abs/2610.11834 · PDF

  50. 50

    Self-Supervised Speech Representations for Cross-Speaker Dysarthria Detection During Awake Craniotomy

    Kanthila Chinmayi, Abdallah Nassib, Misy Harrison, Panheleux Celine, Saliou Vanessa, Seizeur Romuald, Dardenne Guillaume

    cs.LG · cs.SD · eess.SP

    Detecting intra-operative speech impairment during awake craniotomy is essential for preserving language function. However, automated detection remains challenging because operating-room recordings contain substantial acoustic interference, clinically relevant speech events are rare, and available cohorts are small and heterogeneous across speakers. This study presents a systematic component-wise evaluation of a pipeline for distinguishing...

    arxiv.org/abs/2610.11825 · PDF

  51. 51

    PRAXIS: Learning Dynamics of Self-Improving Models with Symbolic Archives

    Venkat Margapuri, Mustafa Teber

    cs.LG

    Self-improving learning systems adapt data selection, optimization, and auxiliary symbolic components, inducing nonstationary objectives outside standard learning assumptions. We introduce \textsc{PRAXIS}, a co-evolutionary framework that models generators, learners, and symbolic archives as interacting dynamical processes. We prove that KL-constrained generator updates and controlled archive-weight movement bound one-step objective drift,...

    arxiv.org/abs/2610.11803 · PDF

  52. 52

    Compile the Table: Query-Calibrated Operator Compression for Tabular In-Context Learning

    Xu Zhao, Jiaming Zhao, Bin Zhao, Yong Yang

    cs.LG

    Tabular in-context learning (ICL) has emerged as a training-free and accurate paradigm for tabular prediction, but current approaches to compressing its in-context examples face an accuracy-throughput tradeoff: fixed subsets can sacrifice accuracy, while query-specific retrieval limits cache reuse and batching across queries, reducing throughput. We propose QCOC (Query-Calibrated Operator Compression), which exploits the exchangeability and...

    arxiv.org/abs/2610.11784 · PDF

  53. 53

    In-Ride Alcohol-Impairment Detection in E-Scooterists with False-Alarm Control

    Marco Capuccini, Rahul Rajendra Pai

    cs.LG

    Shared e-scooter services have become a widely adopted urban transport mode. While most users ride responsibly, alcohol intoxication stands out among the factors contributing to severe crashes. Nonetheless, countermeasures remain limited to single-point reaction tests and night bans that suspend the service altogether. This paper proposes a new approach in which onboard sensors evaluate the rider as the trip unfolds, raising an alarm as soon...

    arxiv.org/abs/2610.11783 · PDF

  54. 54

    RAGenome: Scaling Retrieval-Based Genomic Language Models to Long Contexts

    Frederikke Isa Marin, Panagiotis Antoniadis, Dionysia Danai Brilli, Andreas Bjerregaard, Rachael DeVries, Yan Li,...

    cs.LG

    The genome holds the blueprint that governs the biological properties of the cell. Consequently, advancing our knowledge of genomic function is crucial both for a broader understanding of biology and for continued biomedical advances. The success of large language models on natural language and protein sequences has motivated similar efforts on genomic data. However, standard genomic language models (gLMs) often require extremely large...

    arxiv.org/abs/2610.11761 · PDF

  55. 55

    SR-TTA: Spatial-Redundancy Test-Time Adaptation for Interference-Robust Respiration Sensing

    Jingyuan Liu, Zheng Chang, Haoqiu Xiong, Zhuangzhuang Cui, Sofie Pollin

    cs.LG

    Future 6G networks aim to expose sensing as a native service by reusing communication infrastructure. We study respiration sensing on a cell-free massive multiple-input multiple-output (MIMO) base station, where a 64-antenna channel must be fused into a breathing waveform. The state-of-the-art hand-crafted fusion is near-optimal in benign conditions. It collapses, however, under strong in-band motion interference, whose frequency falls inside...

    arxiv.org/abs/2610.11755 · PDF

  56. 56

    The Ball and the Box: Two Geometries of Computation in Superposition

    Xiaoyu Li, Lequan Lin, Dai Shi, Jiaojiao Jiang, Junbin Gao, Andi Han

    cs.LG

    Neural representations can encode more features than they have dimensions, a phenomenon known as superposition. We study the dimension needed to compute Boolean gates from such representations. For a single threshold layer with a Gaussian random dictionary and uniformly random sparse Boolean inputs, we derive sharp dimension thresholds under two error criteria. A vanishing expected error count can require more dimensions than correctness of...

    arxiv.org/abs/2610.11744 · PDF

  57. 57

    TraceRelay: Attention-Aligned Recurrence over Rolling Traces

    Sungwoo Goo, Hwi-yeol Yun, Sangkeun Jung

    cs.LG

    We present TraceRelay, an attention-aligned recurrent architecture that distributes persistent representations over a rolling sequence of low-dimensional traces. Local right looking attention forms increments from lower-layer representations; delivery is delayed until all attended inputs are in the causal past. A fixed additive phase recurrence accumulates the delayed increments, and left-looking attention reads the resulting residual...

    arxiv.org/abs/2610.11743 · PDF

  58. 58

    Correlational Training of Morphological Neural Networks

    Konstantinos Fotopoulos, Petros Maragos

    cs.LG

    Neural networks are typically trained using first-order methods and back-propagation. It is unclear whether this approach is optimal for morphological layers whose weight Jacobians are sparse and whose resulting parameter gradients can be poor. In this work, we propose a novel weight update method for morphological neural networks inspired from the Multiplicative Weights Update (MWU) scheme. We view each morphological perceptron as an...

    arxiv.org/abs/2610.11740 · PDF

  59. 59

    Uncovering and Fixing Collider Bias in Bayesian PINNs

    Michael Obermayr, Robert Peharz

    cs.LG · cs.AI

    Bayesian physics-informed neural networks (B-PINNs) are a popular framework for parameter and state inference from sparse or noisy observations. They are commonly formulated via a collider structure, in which physical and trajectory parameters are assumed to be a priori independent and become coupled through virtual likelihoods on differential-equation residuals that enforce physical consistency. We show that this modeling choice can induce...

    arxiv.org/abs/2610.11737 · PDF

  60. 60

    Timer-M1: A Multivariate Time Series Foundation Model via Learning Primitives

    Haoran Zhang, Haixuan Liu, Xingjian Su, Yong Liu, Zhi Chen, Yuxuan Wang, Jianmin Wang, Mingsheng Long

    cs.LG · cs.AI

    We introduce Timer-M1, a pretrained multivariate time series foundation model that learns with primitives for zero-shot forecasting. Across domains, time series share elementary temporal and relational patterns, termed primitives, yet differ in how these primitives manifest and evolve across different contexts. Despite progress in zero-shot and task-general forecasting, existing foundation models may still struggle to generalize to complex...

    arxiv.org/abs/2610.11734 · PDF

This edition is part of The Daily Abstract — cs.LG archive. Subscribe to receive these in your inbox each morning, automatically translated to Spanish, with reply-to-PDF: arxivdaily.ignorelist.com.

Colophon Set in Georgia, with system sans for interface chrome and a monospaced stack for code and paper identifiers. Sole accent: amber #D99C5E. Built and served on an always-free VM. The masthead is set 14% letterspaced because newspapers do that and it works.