cs.LG · 2026-10-31 · No. 159

Machine Learning, 2026-10-31.

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

01 — The papers

68 entries
  1. 01

    Propose-Filter-Release: Scaling Noise to Typical Sensitivity via Private Filtering

    Moshe Shenfeld, Eliad Tsfadia, Katrina Ligett

    cs.LG

    An estimator can be accurate and stable on typical data, yet sensitive to a few possible records. Differentially private mechanisms commonly scale their noise to the worst-case influence of a single record, which lets these records dictate the noise even when the remaining data would allow far less. Removing them first would restore the smaller scale, but the removal must itself be private. We introduce \emph{propose-filter-release} (PFR),...

    arxiv.org/abs/2610.40654 · PDF

  2. 02

    Rethinking Neural Thickets Without Weight Perturbations

    Nicolas Dufour, Elouan Gardès, Amil Dravid, Patrick Pérez, Loic Landrieu

    cs.LG · cs.AI · cs.CV

    The Neural Thickets hypothesis posits that pretrained language models lie in dense neighborhoods of task-specific experts in weight space, which random Gaussian perturbations can uncover. We reproduce the reported gains, but show that they do not require this geometric explanation. Perturbing a single decoder block already recovers much of the improvement, while keeping the model entirely frozen and adding a random bias to its output logits...

    arxiv.org/abs/2610.40649 · PDF

  3. 03

    world2vec: Mechanistic world models through latent dynamics learning

    Tobias Schmidt, Rodrigo Gonzalez Laiz, Krisztián Szuppinger, Steffen Schneider

    cs.LG

    World models can achieve strong control performance without faithfully capturing the dynamics of their environment, limiting their potential for mechanistic interpretability and scientific discovery. Here, we introduce world2vec to learn mechanistic world models without reward information directly from observations and actions. World2vec learns latent dynamics that faithfully reproduce the true system over long prediction horizons, with at...

    arxiv.org/abs/2610.40637 · PDF

  4. 04

    An ODE-based Sampler for Discrete Diffusion Models

    Samson Gourevitch, Yazid Janati, Eric Moulines, Eric P. Xing, Alain Durmus, Giacomo Zanella

    cs.LG · stat.ML

    The marginals of a continuous diffusion model can be reproduced by a deterministic ordinary differential equation (ODE), known as the probability flow ODE, which provides a foundation for accelerated sampling and consistency distillation. In this paper we address the question whether an analogous formulation exists for discrete diffusion models and answer it affirmatively by introducing exponential residual flows (ERFs). Our framework...

    arxiv.org/abs/2610.40618 · PDF

  5. 05

    Training Foundation Models with a Single Algorithm

    Yuda Song, Alvin Zhang, Fahim Tajwar, Daman Arora, Jeff Schneider, Daniel Khashabi, Ruslan Salakhutdinov, J. Andrew...

    cs.LG

    Foundation models are typically trained in stages: pretraining, midtraining, supervised fine-tuning (SFT), and reinforcement learning (RL), with changes in both data and learning algorithms. We show that this algorithmic separation is not fundamental. By deriving suitable RL objectives as maximum-likelihood fitting to model-generated target distributions, we place all of these stages under a single likelihood-based training algorithm, unified...

    arxiv.org/abs/2610.40564 · PDF

  6. 06

    Machine Learning-Based Detection of Mobile Money Scan Messages in Ghana: A Comparative Evaluation of Naive Bayes, Support Vector Machine, and Randon Forest Classifiers

    Ibrahim Salifu, Muhaisin Tiyumba Nantogmah

    cs.LG

    Mobile money (MoMo) is Ghana's preferred retail payment channel, recording GHC518.4 billion in transactions in December 2025 and over 26.7 million active accounts (Graphic Online, 2026). This growth has coincided with increased social-engineering fraud over Short Message Service (SMS) and Unstructured Supplementary Service Data (USSD), where fraudsters impersonate network operators, agents, relatives, or regulators to obtain personal...

    arxiv.org/abs/2610.40544 · PDF

  7. 07

    Numerical Integration on Bounded Domains via Learned Reflected Diffusions

    Kirill Korolev, Artur Goldman, Timofei Gritsaev, Tigran Ramazyan, Nikita Morozov

    cs.LG · stat.ML

    We study high-dimensional integration on bounded convex domains. Given a non-negative integrand $r$, the goal is to estimate $Z=\int_{D}r(x)\,\mathrm dx$ on $D\subset\mathbb R^d$. Standard Quasi-Monte Carlo does not adapt its evaluation points to the integrand, while effective importance sampling requires a proposal that captures its concentration. Learned diffusion samplers can supply such a proposal, but existing methods are formulated on...

    arxiv.org/abs/2610.40499 · PDF

  8. 08

    The Precision Wall: An Optimizer-Dependent Boundary for Optimization under Power-Law Measurement Spectra

    Lngel Kyo

    cs.LG

    In low-rank matrix sensing of a rank-$D$ factor $U^\ast \in \mathbb{R}^{V \times D}$, replacing isotropic Gaussian designs with power-law measurement covariance $Σ= \mathrm{diag}(j^{-s})_{j=1}^V$ leaves the Burer--Monteiro landscape free of spurious local minima, yet division-normalised first-order optimizers stall above a critical exponent $s^\ast$. We trace this failure to a numerical precision wall. At the ground truth, the smallest...

    arxiv.org/abs/2610.40485 · PDF

  9. 09

    Preserving Utility in Continual LLM Unlearning via Orthogonal Projections

    Juan Belieni, Ana Carolina Erthal, Eliezer de Souza da Silva, Diego Mesquita

    cs.LG · cs.CL

    Unlearning concerns the task of removing the influence of a sensitive portion of the training data, such as protected, copyrighted or private text, from a model without retraining it from scratch. While unlearning requests happen continuously during a model's lifetime, the vast majority of LLM unlearning methods are ill-suited for iterated removal, yielding steep decay in forgetting and utility upon sequential unlearning. This decay stems...

    arxiv.org/abs/2610.40483 · PDF

  10. 10

    Rural Readiness: Domain Generalization with Adversarially Chosen Domains

    Cynthia Dwork, Andisheh Ghasemi, Lunjia Hu

    cs.LG · stat.ML

    Predictive models trained at well-resourced data-rich institutions often fail when deployed in new populations. Motivated by the goal of building clinical diagnosis and decision-making algorithms for data-scarce rural populations using the general knowledge learned from data-rich hospitals, we formulate the fundamental question of \emph{domain generalization with adversarially chosen domains}, which asks a learner to perform on any unseen...

    arxiv.org/abs/2610.40468 · PDF

  11. 11

    Reinforcement learning for control of partial differential equations

    Nicolò Botteghi, Matteo Tomasetto, Andrea Manzoni

    cs.LG

    Controlling dynamical systems governed by partial differential equations (PDEs) remains a challenging task in scientific computing, owing to high-dimensional state spaces, distributed actuation, nonlinear dynamics, and stringent real-time constraints. Reinforcement learning (RL) has emerged as a promising paradigm for synthesizing feedback controllers that adapt to varying operating conditions and can be deployed efficiently in real-time....

    arxiv.org/abs/2610.40449 · PDF

  12. 12

    Framework-Conditional Open Materials Generation

    Maya M. Martirossyan, Hillary Pan, Philipp Höllmer, Stefano Martiniani

    cs.LG · cond-mat.mtrl-sci

    Theoretical predictions of novel materials rely on a variety of techniques, from data-mining-based ion substitution methods to fully de novo generative models. Each approach imposes specific constraints and encounters unique challenges when extrapolating beyond the distribution of known materials to discover new ones. The foremost goal of materials generation is to produce stable, unique, and novel (S.U.N.) structures. Predicted structures...

    arxiv.org/abs/2610.40443 · PDF

  13. 13

    A Pretrained Model for Bayesian Filtering in Heterogeneous Dynamical Systems

    Ke Fan, Wen Wu, Haitao Su, Yilin Wang, Yuan Zhou, Chao Zhang

    cs.LG

    Filtering has not yet had its foundation-model moment: state estimation is still dominated either by online Bayesian filtering algorithms that require known dy- namics as inputs, or by learning-based neural filters trained from scratch for a single system or parametric family. The core challenge is structural heterogene- ity: dynamical systems differ in their governing dynamics, physical scales, and noise levels, precluding a shared...

    arxiv.org/abs/2610.40437 · PDF

  14. 14

    Uncertainty-aware Feedback Loop Diagnosis: integrating reinforcement learning and conformal prediction for reliable wafer defect classification

    Aleksandr Dekhovich, Carlas Smith, Oleg Soloviev

    cs.LG · cs.CV

    Semiconductor manufacturing is a complex, multi-step process that requires both high precision and low operating costs. Therefore, detecting defects in a high-volume setting is an important component of wafer map analysis for reliable production. However, most state-of-the-art deep learning approaches require a full scan of the surface, which hinders the development of high-throughput inspection systems. To address this problem, we propose...

    arxiv.org/abs/2610.40421 · PDF

  15. 15

    NECA: Neighbor Event Curve Augmentation for Multi-Horizon ICU Deterioration Prediction

    Chenyang Wang, Jiawei Theresa Tang, Xinran Liu, Xinyu Lu, Xulei Yang

    cs.LG · cs.AI

    Early prediction of ICU organ dysfunction events supports timely clinical monitoring and intervention, but estimating short-term organ-specific risk from early ICU records remains challenging due to irregular measurements, heterogeneous clinical variables, and the need to predict risk across multiple future horizons. Existing supervised models usually treat each patient as an isolated sample and do not explicitly use the observed event timing...

    arxiv.org/abs/2610.40420 · PDF

  16. 16

    IMPACT: Inverter-Informed Multimodal Learning for Photovoltaic Generation Forecasting

    Anushka Katiyar, Cong Feng, Jing Wang, Tristan Liu, Simon Julien, Zachary Jacobs

    cs.LG · cs.AI

    This work develops a physics-informed multimodal deep learning framework for 10- to 110-minute-ahead probabilistic photovoltaic power forecasting. The forecasting model is built on a four-branch architecture that separately encodes plant-level temporal history and inverter-level spatial cloud dynamics through a graph attention encoder with a learned adjacency, known-future solar geometry, and the current meteorological state, fused through...

    arxiv.org/abs/2610.40418 · PDF

  17. 17

    SCARL: Sequence Confidence-Aligned Reinforcement Learning

    Zhenghong Ke, Jingbo Zhou, Hua Wu

    cs.LG · cs.AI

    Reinforcement learning with verifiable rewards (RLVR) improves language-model reasoning by scoring sampled responses with a rule-based verifier and reinforcing those that pass. Where a classifier's training couples predicted probability to labels, nothing ties an RLVR policy's confidence in a response to its reward: aligned training would drive responses with the same advantage toward equal confidence, yet the advantage is blind to...

    arxiv.org/abs/2610.40407 · PDF

  18. 18

    Composing and Steering Diffusion Models with Generalized Feynman-Kac Correctors

    Wael Mattar, Daniel Freedman

    cs.LG

    Diffusion models have become the leading paradigm in generative modeling, yet many applications require sampling from distributions that are not those of any single pretrained model, but are instead defined through combinations of several models, possibly tilted toward high values of a downstream reward. Naively combining the scores of the models yields incorrect samples, while existing corrections are restricted to specific families of...

    arxiv.org/abs/2610.40383 · PDF

  19. 19

    Is It the Curriculum or Just the Easy Start? Benchmarking Unsupervised Environment Design on Quadrupeds

    Jakub Gilewicz, Dominik Galus, Piotr Wojdas

    cs.LG · cs.RO

    Unsupervised environment design (UED) methods such as PLR, ACCEL, SFL and PAIRED are compared mostly on 2D mazes, grid worlds and BipedalWalker, while terrain curricula for legged robots are hand-designed and evaluated against a few baselines. We present a benchmark that runs fourteen UED, domain-randomisation and robotics curricula under one protocol on five 3D quadrupeds in MuJoCo MJX: the closed-chain W01-TEK and the open-chain Unitree Go1...

    arxiv.org/abs/2610.40364 · PDF

  20. 20

    Your LR Schedule May Not Be Principled: Effective Learning Rate Scheduling in Weight-Normalized Training

    Qifan Yu, Xinyu Ma, Xingyan Bin, Di He

    cs.LG

    Weight-normalized (WN) training is emerging as a compelling alternative to conventional weight decay (WD), with recent studies reporting substantial pretraining loss gains. We show that these gains are driven primarily by the induced effective learning rate (ELR) trajectory rather than by normalization alone. Matching ELR trajectories largely collapses the training loss dynamics of WN and WD. Schedule design should therefore target ELR rather...

    arxiv.org/abs/2610.40362 · PDF

  21. 21

    A Unified Hessian-Guided Framework for Post-Training Quantization

    Mads Toftrup, Marco Federici, Boris van Breugel, Paul Whatmough, Markus Nagel

    cs.LG · cs.AI

    Low-bit quantization enables efficient deployment of large language models by reducing memory footprint and computational cost. Achieving high accuracy at low precision requires selecting quantization ranges, linear transformations, and weight rounding decisions. Existing approaches typically optimize these components independently using local reconstruction objectives, which fail to account for the varying impact of quantization errors on...

    arxiv.org/abs/2610.40345 · PDF

  22. 22

    Factorized Representations of Concurrent Temporal Variables in Pretrained Language Models

    Xinhe Zhang, Arnau Marin-Llobet

    cs.LG · cs.CL

    Language models often need to maintain multiple contextual variables that evolve independently within a document. Prior work has identified structured representations of individual temporal or contextual quantities, but their joint organization remains less understood. We study this question using controlled documents with independently phased language-switch and topic-change timers. Across ten pretrained checkpoints, both timers are linearly...

    arxiv.org/abs/2610.40328 · PDF

  23. 23

    How to Loop Your Transformer: Loop Scaling, Specialization, and Parallel Inference

    Chanakya Ekbote, Artidoro Pagnoni, Devendra Singh Sachan, Shruti Bhosale, Mike Lewis, Maryam Fazel-Zarandi, Shashank...

    cs.LG · cs.AI

    Looping in transformer models reuses weights by repeatedly applying the same transformer, or parts of it, making the model deeper without increasing its parameter count. Whether looping is useful depends on which constraint dominates: model size, training compute, or autoregressive inference efficiency. We study these trade-offs jointly in dense decoder-only transformers trained from scratch, varying which parts of the model are looped, how...

    arxiv.org/abs/2610.40325 · PDF

  24. 24

    Causal-prior-constrained deep learning for rapid-intensification warning of western North Pacific tropical cyclones

    Xinrui Li, Yijun Jin, Yifan Dong, Shoujuan Shu

    cs.LG · physics.ao-ph

    Rapid intensification (RI) is one of the most dangerous and unpredictable phases of tropical cyclones, and its environmental and structural drivers are difficult to identify and separate in observations. Here we introduce CausalVisionRI, a causal-prior-constrained deep-learning system for 24-h RI warning in the western North Pacific. It integrates infrared remote sensing imagery, atmospheric and oceanic fields, and an observationally...

    arxiv.org/abs/2610.40304 · PDF

  25. 25

    DolphinRouting: Cluster-Level Binary Routing for Disaggregated LLM Inference Serving

    Yishuo Yuan, Shaoyu Yang, Chunrong Fang

    cs.LG

    Prefill-decode (PD) disaggregation isolates the two phases of large language model serving, but request-level path selection must account for prefill work, cache reuse, and decode demand. We present DolphinRouting, which learns this choice from end-to-end SLO feedback under a given P/D resource allocation. Requests are clustered by raw prompt length, cache-adjusted input lengths on both worker pools, and output-length information. Offline...

    arxiv.org/abs/2610.40292 · PDF

  26. 26

    Latent Prediction Yields Cross-Subject Alignable Representations in Sensory-Evoked fMRI

    Serwan Jassim, Victoria Bosch, Daniel Anthes, Elia Bruni, Tim Kietzmann

    cs.LG · cs.AI · q-bio.NC

    Decoding sensory-evoked functional magnetic resonance imaging (fMRI) data is a central analytical tool in cognitive neuroscience. Here we ask whether self-supervised learning (SSL), which has been scarcely explored in this domain, can yield representations that support strong downstream performance. To do so, we adapt a joint embedding predictive architecture (JEPA) to train participant-specific encoders on brain data alone. The encoders...

    arxiv.org/abs/2610.40280 · PDF

  27. 27

    From MS/MS evidence to adaptive spectroscopic characterization: Reinforcement learning guided by candidate molecular structures

    Bowen Gao, Lei Zhu, Yiying Wang, Wenjie Yu

    cs.LG

    Small-molecule identification from tandem mass spectrometry (MS/MS) may require complementary measurements. Herein, we propose a structure-informed deep Q-network (SI-DQN) that uses existing MS/MS evidence to decide whether further characterization is needed, which measurement to request, and when to stop. The policy combines spectral representations and candidate rankings with score-weighted descriptors of the candidates' chemical features...

    arxiv.org/abs/2610.40264 · PDF

  28. 28

    Learned Terminal Costs for Short-Horizon Model Predictive Control of Autonomous Trucks in Interactive Highway Traffic

    Hooman Hamze, Benjamin Houshmand, Deepthi Pathare, Erik Börve, Morteza Haghir Chehreghani, Nikolce Murgovski

    cs.LG · cs.AI · cs.RO · eess.SY

    Autonomous highway driving for heavy-duty trucks is a challenging control problem. The greater mass, dimensions and intricate dynamics increase the requirements for cooperation from surrounding traffic in critical maneuvers, requiring a careful balance between safety constraints and efficient long-horizon decision making. Model Predictive Control (MPC) provides rigorous constraint satisfaction but relies on terminal cost which can limit its...

    arxiv.org/abs/2610.40257 · PDF

  29. 29

    Closing the Log Gap: Minimax-Optimal Regret for Episodic RL

    Guy Zamir, Victor Boone, Matthew Zurek, Yudong Chen

    cs.LG · stat.ML

    In this paper, we study the regret minimization problem in episodic tabular MDPs. Our algorithm achieves the first expected regret bound scaling as $\sqrt{H^3 S A K}$ for sufficiently large $K$, where $H$ is the episode length, $K$ is the number of episodes, and $S$ and $A$ are the numbers of states and actions, respectively. Our method is the first to match the minimax lower bound \emph{without extra polylog factors}. We introduce a variant...

    arxiv.org/abs/2610.40165 · PDF

  30. 30

    FARE: Factor-Aware Retrieval with Error-Guided Fusion for Retail Forecasting

    Chenghao Gu, Zhuokang Shen, Shenghao Wu, Tingxuan Zhu, Weiyi Luo, Haifeng Tang

    cs.LG · cs.AI

    Retail sales forecasting underpins inventory planning, yet promotions and calendar events reshape short-term demand. Although each factor usually has historical occurrences, the complete factor combination of a target week often has few precedents. The challenge is therefore to retrieve informative partial matches and weight them by their reliability, which varies across series. We propose FARE(Factor-Aware Retrieval with Error-Guided...

    arxiv.org/abs/2610.40160 · PDF

  31. 31

    Mode Dynamics: A Framework for Neural Network Learning

    Hossein Honarvar

    cs.LG

    We introduce Mode Dynamics, a framework that connects coordinated parameter motion during neural network learning to changes in model outputs. Starting from a recorded parameter trajectory, we decompose its updates into collective modes and map each mode to its state-dependent output effect. The framework organizes this link through three mechanisms. Decomposition identifies collective modes in parameter motion and their time-varying...

    arxiv.org/abs/2610.40143 · PDF

  32. 32

    A Deep Learning Framework for Quantile Demand Forecasting in E-commerce with Doubly Censored Data

    Ziwen Ye, Jiawen Wei, Teng Song, Chen Chen, Guangrui Ma

    cs.LG

    In recent years, a growing number of online retail companies have embraced deep learning models for demand forecasting, leveraging their scalability in processing large-scale datasets. Accurate demand forecasts enable improved planning and allow operational flexibility to adjust sales accordingly. Moreover, quantile estimation has gained widespread application as it offers valuable uncertainty quantification, thereby enhancing the robustness...

    arxiv.org/abs/2610.40138 · PDF

  33. 33

    Escaping Path Mirages in Offline Goal-Conditioned Reinforcement Learning

    Junhyeon Bae, Jaebak Hwang, Gwanwoo Choi, Minung Kim, Seungyul Han

    cs.LG · cs.AI

    Offline goal-conditioned reinforcement learning remains challenging in stochastic long-horizon settings, where compounding value estimation errors hinder reliable goal reaching. While prior methods have sought to address this challenge through various approaches, a key challenge remains path mirage, where agents overcommit to spuriously successful trajectories in offline datasets induced by stochasticity, often leading to failure on difficult...

    arxiv.org/abs/2610.40130 · PDF

  34. 34

    Does System Size Matter in Uncertainty Quantification for Machine Learning Interatomic Potentials?

    Chayaphol Lortaraprasert, Nontawat Charoenphakdee, Wenwen Li, Yong-Bin Zhuang, Yuta Tsuboi

    cs.LG · cond-mat.mtrl-sci

    Machine-learning interatomic potentials (MLIPs) commonly use uncertainty estimates to flag out-of-distribution (OOD) configurations and select structures for active learning. A key question is whether the resulting structure-level uncertainty scores remain comparable across different system sizes. A common practice is to aggregate per-atom uncertainties by their mean or maximum and compare the resulting score against a fixed threshold,...

    arxiv.org/abs/2610.40126 · PDF

  35. 35

    D-MOD: Diffusion mode estimation for accelerated MRI

    Md Kawsar Ahmed, Mathews Jacob

    cs.LG

    Diffusion models are powerful priors for accelerated MRI reconstruction, but most current methods are posterior samplers, which return a random draw from the posterior. A reproducible and high-quality reconstruction often requires averaging many samples, resulting in a high computational cost. We introduce D-MOD, a fast algorithm that instead provides a posterior mode. It uses a minorize-maximize algorithm on a lower bound of the smoothed...

    arxiv.org/abs/2610.40110 · PDF

  36. 36

    Coupled Guidance for Flow Matching

    Mateo Clémente, Léo Maxime Brunswic, Rui Heng Yang, Amir Rasouli

    cs.LG · cs.RO

    Guidance methods are essential tools for steering the generation process in diffusion models, improving the generalizability of stochastic robotic controllers and enabling high-quality controlled image synthesis. Despite strong parallels between flow-matching and diffusion, integrating guidance into flow-matching models remains quite challenging. Recent work has proposed general guidance frameworks for flow-matching, however, they are direct...

    arxiv.org/abs/2610.40109 · PDF

  37. 37

    One Vector or Many? Clustered Optimal-Transport Steering under Quantization

    Illia Makarov

    cs.LG · cs.AI · cs.CL

    Activation steering changes what a language model generates by editing its hidden states at inference time. Its most common form adds one vector, the difference of class means (DiM), to every hidden state. CHaRS (concept heterogeneity-aware representation steering) uses optimal transport instead: an entropic plan pairs the clusters of the two classes, and each hidden state moves along a mixture of the cluster displacements, weighted toward...

    arxiv.org/abs/2610.40055 · PDF

  38. 38

    FIDE: Fiber-Informed Differentiable Experimental Design for Reference-Relative Law Dynamics

    Pietro Zanotta, Ján Drgoňa

    cs.LG

    Aggregate measurements generally leave an evolving population law underdetermined, so different measurement systems can be equally adequate for a scientific task while constraining different aspects of the law. We study how to resolve this residual design freedom in baseline-preserving settings, where an existing dynamical model remains the working baseline outside quantities explicitly valued by the task. \textbf{F}iber-\textbf{I}nformed...

    arxiv.org/abs/2610.40009 · PDF

  39. 39

    Enhancing Atrial Fibrillation Detection Through Hyperparameter Optimization

    Sara Gjorgjieva, Ilinka Ivanoska, Marjan Gusev

    cs.LG

    This study explores the role of hyperparameter optimization (HPO) in enhancing the detection of Atrial Fibrillation (AF) using both machine learning and deep learning models. We evaluated a range of standard classifiers - Decision Tree, Random Forest, and XGBoost classifiers, alongside deep learning architectures including Recurrent Neural Networks, Deep Neural Networks, and Siamese Neural Networks. To fine-tune these models, we applied four...

    arxiv.org/abs/2610.40001 · PDF

  40. 40

    A physics-informed uncertainty-aware surrogate for $p$-$n$ junction diodes

    Suchita Kulkarni

    cs.LG · cond-mat.mes-hall

    We develop an uncertainty-aware physics-informed surrogate for a one-dimensional $p$-$n$ junction diode, conditioned on device length, doping and bias. Using the internal state of the device as predicted by the surrogate we develop a test-suite of quantities of interest including the terminal current, depletion width, peak field and stored charge. The formalism and the quantities are can be extended to asymmetric junction and two-dimensional...

    arxiv.org/abs/2610.39993 · PDF

  41. 41

    Observability-Aligned Evidential Masked Pretraining for Reliable VRU Motion Prediction

    Shang Gao, Franz Götz-Hahn, Konrad Doll, Bernhard Sick

    cs.LG

    Vulnerable road user (VRU) prediction must operate under partial observability and distribution shift, so reliable uncertainty matters alongside accuracy. Masked pretraining is attractive in this setting because it naturally exposes the model to missing content during self-supervision, but existing time-series masked autoencoding methods are typically deterministic and do not constrain how confidence should change with observability. We...

    arxiv.org/abs/2610.39958 · PDF

  42. 42

    When to spend privacy: optimal allocation in private learning

    Umberto Biccari, Yongcun Song

    cs.LG · cs.AI · math.OC

    Privacy accounting bounds the cumulative privacy cost of Differentially Private Stochastic Gradient Descent but does not determine how to allocate a fixed budget across iterations. We formulate the complete Gaussian noise-variance schedule as an open-loop control under a composed zero-Concentrated Differential Privacy constraint, explicitly accounting for schedule selection. For expected quadratic terminal tracking, we prove that every local...

    arxiv.org/abs/2610.39954 · PDF

  43. 43

    H$^2$R: Hierarchical Hint-Based Reward for Mathematical Reasoning via Reinforcement Learning

    He Tu, Siye Li, Hongyi Wen

    cs.LG

    Reinforcement Learning with Verifiable Rewards has shown great promise in enhancing mathematical reasoning in large language models. However, existing approaches provide limited intermediate supervision for complex, multi-step reasoning tasks. To bridge this gap, we propose \textbf{Hierarchical Hint-based Reward}, a framework that leverages the intrinsic sub-question structure of mathematical problems as structured intermediate conditioning...

    arxiv.org/abs/2610.39934 · PDF

  44. 44

    Low-Bit GDN Recurrent-State Quantization: Global Gradient-aware Allocation and Pure-Write Sliding Windows

    Qinghang Huang, Xuchu Huang, Xunzhao Yin

    cs.LG

    Linear attention stores historical information in a recurrent state of fixed size, providing a compact memory representation for long-context inference. Reducing state precision further lowers per-request storage requirements, but quantized writeback errors enter subsequent recurrences, degrade prediction quality on long-reasoning tasks, and can be accompanied by repetitive generation and excessively long outputs. We propose Global...

    arxiv.org/abs/2610.39931 · PDF

  45. 45

    Learning Calibrated Confidence for Multi-Agent Collaboration

    Chenxiao Fan, Chongming Gao, Gangyi Zhang, Yaxin Gong, Leyang Shen, Jiakai Wang, Dong Wang, Yang Liu, Haoyan Liu,...

    cs.LG · cs.AI · cs.MA

    Complex information seeking on the Web often requires collecting evidence from multiple documents and reasoning across them, as in multi-hop question answering. Multi-agent systems address such tasks by dividing work among specialized agents, where upstream agents produce intermediate answers and supporting evidence that downstream agents build upon. However, upstream answers vary in correctness, and most systems provide no quantitative...

    arxiv.org/abs/2610.39927 · PDF

  46. 46

    CovFedAvg: Local Low-Loss Curves and Federated Model Selection

    Federico Lucchetti, Marcus Völp

    cs.LG · cs.AI

    Clients observing different parts of a prediction task may learn locally equivalent models with incompatible behavior outside their observed support. We study whether redundant models permit local low-loss paths toward a compatible shared model. CovFedAvg retains local models and curve controls on clients, fits a common endpoint through aggregated gradient contributions, and selects an actual candidate model using distributed training losses....

    arxiv.org/abs/2610.39902 · PDF

  47. 47

    Data-driven Random-feature Approximation of Koopman Generators of Nonlinear Continuous-time Systems

    Ana Čukarska, Maximilian Gollwitzer, Viola Muning Li, Vladyslav Fediukov, Zahra Monfared, Felix Dietrich

    cs.LG · math.NA

    Learning continuous-time dynamical systems from data is an active area of research. The Koopman formalism is often used here, because it is a flexible approach that is informative about the system's fundamental properties. The formalism represents dynamical systems through linear operators acting on a suitable function space. A practical difficulty arising in the numerical approximation of Koopman operators is the choice of a ``dictionary'',...

    arxiv.org/abs/2610.39897 · PDF

  48. 48

    TACFormer: Transformer-Based Generative Model for Target-Conditioned De Novo PROTAC Design

    Yossra Gharbi, Rocío Mercado

    cs.LG

    Targeted protein degradation (TPD) represents a fundamental shift in drug discovery, moving beyond traditional target inhibition toward the event-driven removal of disease-causing proteins. A prominent strategy for TPD is the use of proteolysis-targeting chimeras (PROTACs), heterobifunctional molecules that selectively route a protein of interest (POI) to the ubiquitin-proteasome system for degradation. While PROTAC design still relies...

    arxiv.org/abs/2610.39891 · PDF

  49. 49

    Turing LLM Post-Training: Calibrated Distillation and Efficient Dynamic-MoE Execution

    Yue He, Jiahui Hu, Shaman Tang, Hua Zhou, Qiman Wu, Menglin Li, Yizhao Wang, Yuheng Zhang, Da Zhu, Zhou Wang, Anhua...

    cs.LG · cs.AI

    We study post-training for dynamically routed mixture-of-experts (MoE) models, focusing on integrating independently optimized specialists while keeping consolidation efficient. Our approach combines calibrated multi-teacher on-policy distillation (C-MOPD), which matches each selected teacher on a local Top-$K$ support with teacher-wise loss normalization and clipping, with an execution path that uses post-capacity bounded-width dispatch,...

    arxiv.org/abs/2610.39876 · PDF

  50. 50

    Attention, Dynamic Wave and Hybrid Sequence Mixers in Language Models

    Dmytro Babarytskyi, Oleksandr Babarytskyi

    cs.LG · cs.CL

    Large Language Models (LLMs) rely on Multi-Head Attention (MHA) for sequence modeling, but scaling to long contexts is constrained by the quadratic cost of attention, motivating sub-quadratic recurrent alternatives. This paper formalizes a Dynamic Wave recurrent layer, based on input-dependent exponential damping and cosine phase modulation, and evaluates three 10.94M-parameter configurations (Pure Transformer, Pure Wave, and Hybrid...

    arxiv.org/abs/2610.39854 · PDF

  51. 51

    DWISE: Denoising Workload-Informed Scheduling Engine

    Lie Li, Wen Li, Junxiao Shen, Jindong Gu, Guosheng Hu

    cs.LG

    Unlike autoregressive large language models (AR-LLMs), diffusion LLMs (dLLMs) generate text by iteratively denoising many tokens in parallel, offering a promising path to efficient inference. Existing serving frameworks, however, schedule dLLM requests with policies designed for AR models, namely first-come-first-served (FCFS) admission and prefill priority. We find that both policies are ill-suited to dLLMs, wasting much of their speed. FCFS...

    arxiv.org/abs/2610.39852 · PDF

  52. 52

    Surprise Alone Learns Lies: Evidence-Gated Continual Learning for LLMs from Streaming Claims

    Abdelkader Metales, Miriam Grabenheinrich

    cs.LG · cs.CL · cs.CR

    Continual learning methods for large language models increasingly decide what to learn by surprise, keeping the inputs the model finds least predictable. This rule is unsafe when the stream contains lies. A planted falsehood about something the model knows has low probability under the model's belief, so it is highly surprising by construction, and a surprise-driven learner absorbs nearly every such lie, at a rate similar to random selection...

    arxiv.org/abs/2610.39840 · PDF

  53. 53

    Exploring the Potential of Symbolic Regression in Precision Livestock Farming

    Elisabeth Mayrhuber, Maciej Oczak, Michael Iwersen, David Brunner, Viktoria Dorfer, Stephan Winkler

    cs.LG · cs.AI

    The ability to predict farrowing time in pigs is crucial for optimal farm management and ensuring piglet survival. This study investigates the potential of explainable artificial intelligence for precision livestock farming, focusing on acceleration sensor data from sows around the time of farrowing. Accurately predicting farrowing allows farmers to balance both, piglet safety by avoiding piglet crushing events and the mother sow's welfare,...

    arxiv.org/abs/2610.39839 · PDF

  54. 54

    SHPRR: An Algorithm for Pure Exploration under Constrained Regret

    Georgina Nouli, Flore Sentenac, Maximilian Schiffer

    cs.LG · cs.AI

    Best Arm Identification (BAI) conventionally measures the cost of experimentation by the number of samples collected. In many operational settings, however, the cost of exploration relative to a trusted baseline already in place is equally important. We study BAI under both a fixed sampling horizon and a regret budget. Unlike generic resources considered in constrained pure exploration, regret has a distinctive structure: sampling better arms...

    arxiv.org/abs/2610.39837 · PDF

  55. 55

    Possibility-based Inference: A Deterministic Framework for Robust and Reliable Uncertainty Quantification in Decision-Making

    Seyedfakhredin Musavishavazi, Maryam Alipour

    cs.LG

    Decision-making under uncertainty remains a key issue in Machine Learning (ML), particularly in the deployment of safety-critical systems, where reliable quantification of system behavior is essential for evaluating behavioral impacts and strengthening confidence in ML models. This contribution, influenced by fuzzy set theory and grounded in Bayesian statistics, addresses challenges related to data precision and the performance-accuracy...

    arxiv.org/abs/2610.39821 · PDF

  56. 56

    Optimal Contextual Pricing in Non-Stationary Environments

    Yiding Feng, Alireza Rezaeimoghadam

    cs.LG

    We study contextual dynamic pricing in a non-stationary environment. In each round, a seller observes a buyer's context, posts a price, and receives only binary purchase feedback. The buyer's value is linear in the context and an unobserved feature vector that may change over time, subject to a known total variation budget $V$. We measure dynamic regret against the first-best benchmark that extracts each buyer's full value. For identical...

    arxiv.org/abs/2610.39803 · PDF

  57. 57

    AI at a Turning Point: From ChatGPT through Neural Networks to Neuromorphic AI

    Volker Kempe

    cs.LG · cs.NE

    The tension between the established technologies of connectionist AI and their neuromorphic challengers is attracting growing attention, above all because of the enormous energy demand of the former and the low power consumption of the latter. Developing and running large AI models consumes gigawatt- to terawatt-hours of energy, while the human brain operates on a continuous 20 watts. Spiking neural networks (SNNs) counter this energy demand...

    arxiv.org/abs/2610.39796 · PDF

  58. 58

    Surface Conditioning for Zero-Shot Multivariate Correction in a Marine Biogeochemistry Emulator

    Gabriela Martínez Balbontín, Anastase Charantonis, Dominique Béréziat, Stefano Ciavatta

    cs.LG

    Bias correction in process-based models usually means iterative data assimilation with explicit covariance modelling. We propose a lightweight alternative based on a neural emulator of marine biogeochemistry (BGC), showing that the conditioning pathway of its autoencoder can serve as an observation injection point. The decoder is conditioned on surface variables via Feature-wise Linear Modulation (FiLM), originally designed to incorporate...

    arxiv.org/abs/2610.39777 · PDF

  59. 59

    Quantum-Inspired Convolutional Networks for High-Resolution Pseudo-Label Generation from Multimodal Earth Observation Data

    Abhishek Singh, Giovanni Cuozzo, Alexander Jacob, Claudia Notarnicola

    cs.LG · cs.CV

    Accurate land-cover mapping from multimodal Earth observation (EO) data remains a challenge in regions where high-resolution annotations are scarce or costly to obtain. This work introduces a quantum convolutional encoder-decoder network for pseudo-label generation using Sentinel-1 SAR and Sentinel-2 multispectral imagery, guided only by coarse MODIS-derived land-cover maps. The proposed framework uses quantum-inspired convolutional blocks to...

    arxiv.org/abs/2610.39773 · PDF

  60. 60

    Multi-output LSTM soft sensors for industrial anaerobic co-digestion using LSTM-beta-VAE generative data augmentation

    Rohit Murali, Benaissa Dekhici, Tao Chen, Dongda Zhang, Michael Short

    cs.LG · cs.AI · eess.SY

    Anaerobic digestion (AD) requires close monitoring of key process variables, including pH, the ratio of volatile organic acids to alkaline buffer capacity and biogas production, to maintain biological stability and prevent process failure. While mechanistic frameworks such as the Anaerobic Digestion Model No. 1 are highly parameterised, computationally expensive, and difficult to calibrate for real-time applications, data-driven Long...

    arxiv.org/abs/2610.39768 · PDF

  61. 61

    Activation Probes Are Reliable With a Handful of Positive Examples

    Riya Tyagi, Stefan Heimersheim

    cs.LG

    Efforts to monitor advanced AI for rare misalignments face a data challenge: abundant aligned examples but only a handful of misaligned ones. We test activation probes in this "few vs. thousands" regime on spam and honesty detection tasks. For our tasks, training with many negative examples is on average more positive-sample-efficient than balanced training for small numbers (1-10) of positive samples. We also find that LLM upsampling can...

    arxiv.org/abs/2610.39766 · PDF

  62. 62

    Going deep, reaching further: What can Boltzmann machines efficiently represent?

    Tobias Reinhart, Gemma De les Coves

    cs.LG · cond-mat.dis-nn · math-ph

    While universal approximation theorems theoretically underpin the representation capabilities of machine learning models, they have two shortcomings: They do not focus on efficient representations and they tend to be insensitive to depth and other heuristically important properties. In this work we show that these two shortcomings are intertwined. We prove that machine learning models which are deeper or have higher-order interactions can...

    arxiv.org/abs/2610.39731 · PDF

  63. 63

    Grounding Predictive Reliability through Masked Observability

    Shang Gao, Bernhard Sick, Franz Götz-Hahn

    cs.LG

    An uncertainty estimate is meaningful only if its semantics can be tied to observable predictive behavior. Normal-Inverse-Gamma (NIG) evidential regression provides a structured decomposition of predictive variability into data-scale and predictive-mean components, but marginal likelihood does not identify their allocation. We address this semantic ambiguity in masked representation learning. MORSE (Masked Observability for Reliable...

    arxiv.org/abs/2610.39728 · PDF

  64. 64

    Implicit Bias of (Stochastic) Gradient Descent on Deep Linear Diagonal Networks

    Wiebke Bartolomaeus, Holger Rauhut

    cs.LG · math.OC

    Modern machine learning models are often overparameterized, i.e., have more parameters than training data. This typically implies that the loss function admits multiple minimizers so that training methods (and their hyperparameter choices) have significant influence on the computed solution. We study this so-called implicit bias phenomenon in the context of training deep linear diagonal networks. Previous work has shown that the gradient flow...

    arxiv.org/abs/2610.39717 · PDF

  65. 65

    Smartphone Indoor Localization Enhanced by Hierarchical Multi-Sensor Context Recognition

    Wenhui Feng, Muhan Weng, Jianyu Liu, Xiansheng Yang, Hao Zhang, Liang Wang, Yuan Zhuang

    cs.LG · cs.RO

    Smartphone indoor localization requires low-cost, robust positioning across scene transitions and phone-use variations. Pedestrian dead reckoning (PDR) enables infrastructure-free deployment but accumulates errors from heading drift, structural transitions, and carrying-mode changes. Existing methods often treat contextual cues as a single event stream or local correction signal, limiting their ability to address distinct localization errors....

    arxiv.org/abs/2610.39691 · PDF

  66. 66

    Heterogeneous Co-Evolution Learning for Tool-Efficient Search Agents with Zero Labels

    Qin-Wen Luo, Sheng Ren, Xiang Chen, Rui Liu, Jun Fang, Naiqiang Tan, Jun Wang, Hua Chai, Sheng-Jun Huang

    cs.LG · cs.AI · cs.IR

    Deep search agents extend language models by interleaving reasoning with external retrieval. However, effective search-agent training requires addressing two challenges beyond final-answer optimization. First, the capability frontier of agents is largely determined by training questions, whereas fixed or labeled task collections cannot adapt as agents improve. Second, outcome-only reinforcement learning treats all successful trajectories...

    arxiv.org/abs/2610.39682 · PDF

  67. 67

    Event-SAMA: Language-Grounded Video Object Segmentation on Neuromorphic Event Streams

    Sergei Fedorchenko, Max Zehnder, Nikola Zubić, Rong Zou, Davide Scaramuzza

    cs.LG · cs.AI · cs.CL · cs.CV

    Event cameras offer microsecond temporal resolution, high dynamic range and no motion blur, but referring video object segmentation (RVOS) lacks event-stream datasets and models. We introduce Event-SAMA-239K, a synthetic-event conversion of the SAMA-239K grounded video-chat corpus and all additional SAMA training data: 30,650 video clips and 392,162 images. Optical-flow, FILM or saccade upsampling followed by a linear event generator...

    arxiv.org/abs/2610.39676 · PDF

  68. 68

    A New AFIB Detection Method with Deep Neural Networks

    Sara Gjorgjieva, Ana Angjelevska, Dimitar Trajanov, Marjan Gusev

    cs.LG

    Early detection of atrial fibrillation (AFIB), characterized by irregular heart rhythms, can potentially save thousands of lives annually [20]. Numerous studies have attempted to address this challenge using various algorithms and methodologies. This paper introduces a novel and robust method that enhances the precision of AFIB detection. Neural Networks (NN) are widely recognized for their ability to identify complex electrocardiogram (ECG)...

    arxiv.org/abs/2610.39665 · 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.