Machine Learning
Reward Redistribution for CVaR MDPs using a Bellman Operator on L-infinity
Aneri Muni, Vincent Taboga, Esther Derman et al. (+2 more)
Tail-end risk measures such as static conditional value-at-risk (CVaR) are used in safety-critical applications to prevent rare, yet catastrophic events. Unlike risk-neutral objectives, the static CVaR of the return depends on entire trajectories without admitting a recursive Bellman decomposition in the underlying Markov decision process. A classical resolution relies on state augmentation with a continuous variable. However, unless restricted to a specialized class of admissible value functions, this formulation induces sparse rewards and degenerate fixed points. In this work, we propose a novel formulation of the static CVaR objective based on augmentation. Our alternative approach leads to a Bellman operator with: (1) dense per-step rewards; (2) contracting properties on the full space of bounded value functions. Building on this theoretical foundation, we develop risk-averse value iteration and model-free Q-learning
algorithms that rely on discretized augmented states. We further provide convergence guarantees and approximation error bounds due to discretization. Empirical results demonstrate that our
algorithms successfully learn CVaR-sensitive policies and achieve effective performance-safety trade-offs.
Read the full abstract ▾
All authors Aneri Muni, Vincent Taboga, Esther Derman, Pierre-Luc Bacon, Erick Delage
Machine Learning
Reasoning Cache: Continual Improvement Over Long Horizons via Short-Horizon RL
Ian Wu, Yuxiao Qu, Amrith Setlur et al. (+1 more)
Large
Language Models (LLMs) that can continually improve beyond their training budgets are able to solve increasingly difficult problems by adapting at test time, a property we refer to as extrapolation. However, standard reinforcement learning (RL) operates over fixed problem distributions and training budgets, which limits extrapolation amidst distribution shift at test time. To address this, we introduce RC, an iterative decoding
algorithm that replaces standard autoregressive decoding during both training and inference. RC exploits an asymmetry between the response generation and summarization capabilities of LLMs to construct
reasoning chains that consistently improve across iterations. Models trained to use RC can extrapolate and continually improve over
reasoning horizons more than an order of magnitude longer than those seen during training. Empirically, training a 4B model with RC using a 16k-
token training budget improves performance on HMMT 2025 from 40% to nearly 70% with 0.5m
tokens at test time, outperforming both comparably sized models and many larger
reasoning LLMs. Finally, we also show that models trained with RC can more effectively leverage existing scaffolds to further scale test-time performance, due to the improved summary-conditioned generation abilities learned through training.
Read the full abstract ▾
All authors Ian Wu, Yuxiao Qu, Amrith Setlur, Aviral Kumar
Machine Learning
UniGeM: Unifying Data Mixing and Selection via Geometric Exploration and Mining
Changhao Wang, Yunfei Yu, Xinhao Yao et al. (+5 more)
The scaling of Large
Language Models (LLMs) is increasingly limited by data quality. Most methods handle data mixing and sample selection separately, which can break the structure in code corpora. We introduce UniGeM, a framework that unifies mixing and selection by treating data curation as a
manifold approximation problem without training proxy models or relying on external reference
datasets. UniGeM operates hierarchically: Macro-Exploration learns mixing weights with stability-based clustering; Micro-Mining filters high-quality instances by their
geometric distribution to ensure logical consistency. Validated by training 8B and 16B MoE models on 100B
tokens, UniGeM achieves \textbf{2.0$\times$ data efficiency} over a random baseline and further improves overall performance compared to SOTA methods in
reasoning-heavy evaluations and
multilingual generalization.
Read the full abstract ▾
All authors Changhao Wang, Yunfei Yu, Xinhao Yao, Jiaolong Yang, Riccardo Cantoro, Chaobo Li, Qing Cui, Jun Zhou
Machine Learning
Andre He, Sean Welleck and Daniel Fried
Discrete
diffusion models have recently become competitive with autoregressive models for
language modeling, even outperforming them on
reasoning tasks requiring planning and global coherence, but they require more computation at inference time. We trace this trade-off to a key mechanism:
diffusion models are trained to jointly predict a distribution over all unknown
tokens, including those that will not actually be decoded in the current step. Ablating this joint prediction yields faster inference but degrades performance, revealing that accurate prediction at the decoded position relies on joint
reasoning about the distribution of undecoded
tokens. We interpret these as latent
tokens and introduce a method for modulating their number, demonstrating empirically that this enables a smooth tradeoff between inference speed and sample quality. Furthermore, we demonstrate that latent
tokens can be introduced into autoregressive models through an auxiliary multi-
token prediction objective, yielding substantial improvements on the same
reasoning tasks where they have traditionally struggled. Our results suggest that latent
tokens, while arising naturally in
diffusion, represent a general mechanism for improving performance on tasks requiring global coherence or lookahead.
Read the full abstract ▾
Machine Learning
Decision-oriented benchmarking to transform AI weather forecast access: Application to the Indian monsoon
Rajat Masiwal, Colin Aitken, Adam Marchakitus et al. (+9 more)
Artificial intelligence weather prediction (AIWP) models now often outperform traditional physics-based models on common metrics while requiring orders-of-magnitude less computing resources and time. Open-access AIWP models thus hold promise as transformational tools for helping low- and middle-income populations make decisions in the face of high-impact weather shocks. Yet, current approaches to evaluating AIWP models focus mainly on aggregated meteorological metrics without considering local stakeholders' needs in decision-oriented, operational frameworks. Here, we introduce such a framework that connects meteorology, AI, and social sciences. As an example, we apply it to the 150-year-old problem of Indian monsoon
forecasting, focusing on benefits to rain-fed agriculture, which is highly susceptible to
climate change. AIWP models skillfully predict an agriculturally relevant onset index at regional scales weeks in advance when evaluated out-of-sample using deterministic and probabilistic metrics. This framework informed a government-led effort in 2025 to send 38 million Indian farmers AI-based monsoon onset forecasts, which captured an unusual weeks-long pause in monsoon progression. This decision-oriented benchmarking framework provides a key component of a blueprint for harnessing the power of AIWP models to help large vulnerable populations adapt to weather shocks in the face of
climate variability and change.
Read the full abstract ▾
All authors Rajat Masiwal, Colin Aitken, Adam Marchakitus, Mayank Gupta, Katherine Kowal, Hamid A. Pahlavan, Tyler Yang, Y. Qiang Sun, Michael Kremer, Amir Jina, William R. Boos, Pedram Hassanzadeh
Machine Learning · Cross-listed from eess.AS
Conditional Flow Matching for Visually-Guided Acoustic Highlighting
Hugo Malard, Gael Le Lan, Daniel Wong et al. (+3 more)
Visually-guided acoustic highlighting seeks to rebalance audio in
alignment with the accompanying
video, creating a coherent audio-visual experience. While visual saliency and enhancement have been widely studied, acoustic highlighting remains underexplored, often leading to misalignment between visual and auditory focus. Existing approaches use discriminative models, which struggle with the inherent ambiguity in audio remixing, where no natural one-to-one mapping exists between poorly-balanced and well-balanced audio mixes. To address this limitation, we reframe this task as a generative problem and introduce a Conditional Flow Matching (CFM) framework. A key challenge in iterative flow-based generation is that early prediction errors – in selecting the correct source to enhance – compound over steps and push trajectories off-
manifold. To address this, we introduce a rollout loss that penalizes drift at the final step, encouraging self-correcting trajectories and stabilizing long-range flow integration. We further propose a conditioning module that fuses audio and visual cues before vector field regression, enabling explicit cross-modal source selection. Extensive quantitative and qualitative evaluations show that our method consistently surpasses the previous state-of-the-art discriminative approach, establishing that visually-guided audio remixing is best addressed through generative modeling.
Read the full abstract ▾
All authors Hugo Malard, Gael Le Lan, Daniel Wong, David Lou Alon, Yi-Chiao Wu, Sanjeel Parekh
Machine Learning
Soft Sensor for Bottom-Hole Pressure Estimation in Petroleum Wells Using Long Short-Term Memory and Transfer Learning
M. A. Fernandes, E. Gildin and M. A. Sampaio
Monitoring bottom-hole variables in petroleum wells is essential for production optimization, safety, and emissions reduction. Permanent Downhole Gauges (PDGs) provide real-time pressure data but face reliability and cost issues. We propose a machine learning-based soft sensor to estimate flowing Bottom-Hole Pressure (BHP) using wellhead and topside measurements. A Long Short-Term
Memory (LSTM) model is introduced and compared with Multi-Layer Perceptron (MLP) and Ridge Regression. We also pioneer Transfer Learning for adapting models across operational environments. Tested on real offshore
datasets from Brazil's Pre-salt basin, the methodology achieved Mean Absolute Percentage Error (MAPE) consistently below 2%, outperforming
benchmarks. This work offers a cost-effective, accurate alternative to physical sensors, with broad applicability across diverse reservoir and flow conditions.
Read the full abstract ▾
Machine Learning
Fast-MWEM: Private Data Release in Sublinear Time
Themistoklis Haris, Steve Choi and Mutiraj Laksanawisit
The Multiplicative Weights Exponential Mechanism (MWEM) is a fundamental iterative framework for private data analysis, with broad applications such as answering $m$ linear queries, or privately solving systems of $m$ linear constraints. However, a critical bottleneck hindering its scalability is the $\Theta(m)$ time complexity required to execute the exponential mechanism in each iteration. We introduce a modification to the MWEM framework that improves the per-iteration runtime dependency to $\Theta(\sqrt{m})$ in expectation. This is done via a lazy sampling approach to the Report-Noisy-Max mechanism, which we implement efficiently using Gumbel noise and a $k$-Nearest Neighbor data structure. This allows for the rapid selection of the approximate score in the exponential mechanism without an exhaustive linear scan. We apply our accelerated framework to the problems of private linear query release and solving Linear Programs (LPs) under neighboring constraint conditions and low-sensitivity assumptions. Experimental evaluation confirms that our method provides a substantial runtime improvement over classic MWEM.
Read the full abstract ▾
Machine Learning · Cross-listed from stat.ML
Efficient Generative Prediction for EHR Foundation Models: The SCOPE and REACH Estimators
Luke Solo, Matthew B.A. McDermott, William F. Parker et al. (+3 more)
Generative foundation models trained on tokenized electronic health record (EHR) timelines show promise for clinical outcome prediction via Monte Carlo sampling of simulated future trajectories. However, this approach suffers from three coupled limitations: sparse estimate distributions that poorly differentiate patient risk levels, extreme computational cost, and high sampling variance. We propose two new
estimators that leverage next-
token probability distributions underutilized by standard Monte Carlo: the Sum of Conditional Outcome Probability
Estimator (SCOPE) and Risk Estimation from Anticipated Conditional Hazards (REACH). We prove both are unbiased, that REACH guarantees variance reduction over Monte Carlo for any model and outcome, and that REACH is a Rao-Blackwellization of any naive importance sampling scheme that preserves the non-outcome
token distribution. Empirically, across $11$ clinically important outcomes in MIMIC-IV and the UChicago health system, SCOPE and REACH match $100$-sample Monte Carlo accuracy with median
token reductions of $2.5\times$ to $3.4\times$ and reductions exceeding $80\times$ for the rarest outcomes, with calibration preserved throughout. Because SCOPE reuses a single sampled pool across an arbitrary number of outcomes at no marginal generation cost while REACH provides a per-task variance guarantee, the two
estimators are complementary in deployment and together meaningfully reduce the inference budget required for generative EHR foundation models, particularly for rare, high-impact outcomes in healthcare.
Read the full abstract ▾
All authors Luke Solo, Matthew B.A. McDermott, William F. Parker, Bashar Ramadan, Michael C. Burkhart, Brett K. Beaulieu-Jones
Machine Learning
Efficient Training of Boltzmann Generators Using Off-Policy Log-Dispersion Regularization
Henrik Schopmans, Christopher von Klitzing and Pascal Friederich
Sampling from unnormalized probability densities is a central challenge in computational science. Boltzmann generators are generative models that enable independent sampling from the Boltzmann distribution of physical systems at a given temperature. However, their practical success depends on data-efficient training, as both simulation data and target energy evaluations are costly. To this end, we propose off-policy log-dispersion regularization (LDR), a novel regularization framework that builds on a generalization of the log-variance objective. We apply LDR in the off-policy setting in combination with standard data-based training objectives, without requiring additional on-policy samples. LDR acts as a shape regularizer of the energy landscape by leveraging additional information in the form of target energy labels. The proposed regularization framework is broadly applicable, supporting unbiased or biased simulation
datasets as well as purely variational training without access to target samples. Across all
benchmarks, LDR improves both final performance and data efficiency, with sample efficiency gains of up to one order of magnitude.
Read the full abstract ▾
Machine Learning · Cross-listed from eess.SP
VR-VFL: Joint Rate and Client Selection for Vehicular Federated Learning Under Imperfect CSI
Metehan Karatas, Subhrakanti Dey, Christian Rohner et al. (+1 more)
Federated learning in vehicular edge networks faces major challenges in efficient resource allocation, largely due to high vehicle mobility and the presence of imperfect channel state information. Many existing methods oversimplify these realities, often assuming fixed communication rounds or ideal channel conditions, which limits their effectiveness in real-world scenarios. To address this, we propose variable rate vehicular
federated learning (VR-VFL), a novel
federated learning method designed specifically for vehicular networks under imperfect channel state information. VR-VFL combines dynamic client selection with adaptive transmission rate selection, while also allowing round times to flex in response to changing wireless conditions. At its core, VR-VFL is built on a bi-objective optimization framework that strikes a balance between improving learning convergence and minimizing the time required to complete each round. By accounting for both the challenges of mobility and realistic wireless constraints, VR-VFL offers a more practical and efficient approach to
federated learning in vehicular edge networks. Simulation results show that the proposed VR-VFL scheme achieves convergence approximately 40% faster than other methods in the literature.
Read the full abstract ▾
All authors Metehan Karatas, Subhrakanti Dey, Christian Rohner, Jose Mairton Barros da Silva Jr
Machine Learning
Anytime Pretraining: Horizon-Free Learning-Rate Schedules with Weight Averaging
Alexandru Meterez, Pranav Ajit Nair, Depen Morwani et al. (+2 more)
Large
language models are increasingly trained in continual or open-ended settings, where the total training horizon is not known in advance. Despite this, most existing pretraining recipes are not anytime: they rely on horizon-dependent learning rate schedules and extensive tuning under a fixed compute budget. In this work, we provide a theoretical analysis demonstrating the existence of anytime learning schedules for overparameterized linear regression, and we highlight the central role of weight averaging - also known as model merging - in achieving the minimax convergence rates of
stochastic gradient descent. We show that these anytime schedules polynomially decay with time, with the decay rate determined by the source and capacity conditions of the problem. Empirically, we evaluate 150M and 300M parameter
language models trained for up to 32x Chinchilla scale, comparing constant and $1/\sqrt{t}$ schedules with weight averaging against a well-tuned cosine schedule. Across the full training range, the anytime schedules achieve comparable final loss to cosine decay. Taken together, our results suggest that weight averaging combined with simple, horizon-free step sizes offers a practical and effective anytime alternative to cosine learning rate schedules for large
language model pretraining.
Read the full abstract ▾
All authors Alexandru Meterez, Pranav Ajit Nair, Depen Morwani, Cengiz Pehlevan, Sham Kakade
Machine Learning
Data-Driven Graph Filters via Adaptive Spectral Shaping
Dylan Sandfelder, Mihai Cucuringu and Xiaowen Dong
We introduce Adaptive Spectral Shaping, a data-driven framework for graph filtering that learns a reusable baseline spectral kernel and modulates it with a small set of Gaussian factors. The resulting multi-peak, multi-scale responses allocate energy to heterogeneous regions of the
Laplacian spectrum while remaining interpretable via explicit centers and bandwidths. To scale, we implement filters with Chebyshev
polynomial expansions, avoiding eigendecompositions. We further propose Transferable Adaptive Spectral Shaping (TASS): the baseline kernel is learned on source graphs and, on a target graph, kept fixed while only the shaping parameters are adapted, enabling few-shot transfer under matched compute. Across controlled synthetic
benchmarks spanning graph families and signal regimes, Adaptive Spectral Shaping reduces reconstruction error relative to fixed-prototype wavelets and learned linear banks, and TASS yields consistent positive transfer. The framework provides compact spectral modules that plug into graph signal processing pipelines and graph neural networks, combining scalability, interpretability, and cross-graph generalization.
Read the full abstract ▾
Machine Learning
Conflict-Resolving and Sharpness-Aware Minimization for Generalized Knowledge Editing with Multiple Updates
Duy Nguyen, Hanqi Xiao, Archiki Prasad et al. (+3 more)
Large
language models (LLMs) rely on internal knowledge to solve many downstream tasks, making it crucial to keep them up to date. Since full retraining is expensive, prior work has explored efficient alternatives such as model editing and parameter-efficient fine-tuning. However, these approaches often break down in practice due to poor generalization across inputs, limited stability, and knowledge conflict. To address these limitations, we propose the CoRSA (Conflict-Resolving and Sharpness-Aware Minimization) training framework, a parameter-efficient, holistic approach for knowledge editing with multiple updates. CoRSA tackles multiple challenges simultaneously: it improves generalization to different input forms and enhances stability across multiple updates by minimizing loss
curvature, and resolves conflicts by maximizing the margin between new and prior knowledge. Across three widely used fact editing
benchmarks, CoRSA achieves significant gains in generalization, outperforming baselines with average absolute improvements of 12.42% over LoRA and 10% over model editing methods. With multiple updates, it maintains high update efficacy while reducing catastrophic forgetting by 27.82% compared to LoRA. CoRSA also generalizes to the code domain, outperforming the strongest baseline by 5.48% Pass@5 in update efficacy.
Read the full abstract ▾
All authors Duy Nguyen, Hanqi Xiao, Archiki Prasad, Elias Stengel-Eskin, Hyunji Lee, Mohit Bansal
Machine Learning
LLM-Inspired Pretrain-Then-Finetune for Small-Data, Large-Scale Optimization
Zishi Zhang, Jinhui Han, Ming Hu et al. (+1 more)
We consider small-data, large-scale decision problems in which a firm must make many operational decisions simultaneously (e.g., across a large product portfolio) while observing only a few, potentially noisy, data points per instance. Inspired by the success of large
language models (LLMs), we propose a pretrain-then-finetune approach built on a designed
Transformer model to address this challenge. The model is first pretrained on large-scale, domain-informed synthetic data that encode managerial knowledge and structural features of the decision environment, and is then fine-tuned on real observations. This new pipeline offers two complementary advantages: pretraining injects domain knowledge into the learning process and enables the training of high-capacity models using abundant synthetic data, while finetuning adapts the pretrained model to the operational environment and improves
alignment with the true data-generating regime. While we have leveraged the
Transformer's state-of-the-art representational capacity, particularly its
attention mechanism, to efficiently extract cross-task structure, our approach is not an off-the-shelf application. Instead, it relies on problem-specific architectural design and a tailored training procedure to match the decision setting. Theoretically, we develop the first comprehensive error analysis regarding
Transformer learning in relevant contexts, establishing nonasymptotic guarantees that validate the method's effectiveness. Critically, our analysis reveals how pretraining and fine-tuning jointly determine performance, with the dominant contribution governed by whichever is more favorable. In particular, finetuning exhibits an economies-of-scale effect, whereby transfer learning becomes increasingly effective as the number of instances grows.
Read the full abstract ▾
All authors Zishi Zhang, Jinhui Han, Ming Hu, Yijie Peng
Machine Learning
QuAIL: Quality-Aware Inertial Learning for Robust Training under Data Corruption
Mattia Sabella, Alberto Archetti, Pietro Pinoli et al. (+2 more)
Tabular machine learning systems are frequently trained on data affected by non-uniform corruption, including noisy measurements, missing entries, and feature-specific biases. In practice, these defects are often documented only through column-level reliability indicators rather than instance-wise quality annotations, limiting the applicability of many robustness and cleaning techniques. We present QuAIL, a quality-informed training mechanism that incorporates feature reliability priors directly into the learning process. QuAIL augments existing models with a learnable feature-modulation layer whose updates are selectively constrained by a quality-dependent proximal regularizer, thereby inducing controlled adaptation across features of varying trustworthiness. This stabilizes optimization under structured corruption without explicit data repair or sample-level reweighting. Empirical evaluation across 50 classification and regression
datasets demonstrates that QuAIL consistently improves average performance over neural baselines under both random and value-dependent corruption, with especially robust behavior in low-data and systematically biased settings. These results suggest that incorporating feature reliability information directly into optimization dynamics is a practical and effective approach for resilient tabular learning.
Read the full abstract ▾
All authors Mattia Sabella, Alberto Archetti, Pietro Pinoli, Matteo Matteucci, Cinzia Cappiello
Machine Learning
Universal One-third Time Scaling in Learning Peaked Distributions
Yizhou Liu, Ziming Liu, Cengiz Pehlevan et al. (+1 more)
Training large
language models (LLMs) is computationally expensive, partly because the loss exhibits slow power-law convergence whose origin remains debatable. Through systematic analysis of toy models and empirical evaluation of LLMs, we show that this behavior can arise intrinsically from the use of softmax and cross-
entropy. When learning peaked probability distributions, e.g., next-
token distributions, these components generically yield power-law vanishing losses and gradients, regardless of many microscopic details, creating a fundamental optimization bottleneck. This ultimately leads to power-law time scaling of the loss with a universal exponent of $1/3$. Our results provide a mechanistic explanation for observed neural scaling and suggest new directions for improving LLM training efficiency.
Read the full abstract ▾
All authors Yizhou Liu, Ziming Liu, Cengiz Pehlevan, Jeff Gore
Machine Learning · Cross-listed from stat.ML
Improved Analysis of the Accelerated Noisy Power Method with Applications to Decentralized PCA
Pierre Aguié, Mathieu Even and Laurent Massoulié
We analyze the Accelerated Noisy Power Method, an
algorithm for Principal Component Analysis in the setting where only inexact
matrix-vector products are available, which can arise for instance in decentralized PCA. While previous works have established that acceleration can improve convergence rates compared to the standard Noisy Power Method, these guarantees require overly restrictive upper bounds on the magnitude of the perturbations, limiting their practical applicability. We provide an improved analysis of this
algorithm, which preserves the accelerated convergence rate under much milder conditions on the perturbations. We show that our new analysis is worst-case optimal, in the sense that the convergence rate cannot be improved, and that the noise conditions we derive cannot be relaxed without sacrificing convergence guarantees. We demonstrate the practical relevance of our results by deriving an accelerated
algorithm for decentralized PCA, which has similar communication costs to non-accelerated methods. To our knowledge, this is the first decentralized
algorithm for PCA with provably accelerated convergence.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.CL
Neural Attention Search Linear: Towards Adaptive Token-Level Hybrid Attention Models
Difan Deng, Andreas Bentzen Winje, Lukas Fehring et al. (+1 more)
The quadratic computational complexity of softmax
transformers has become a bottleneck in long-context scenarios. In contrast, linear
attention model families provide a promising direction towards a more efficient sequential model. These linear
attention models compress past KV values into a single hidden state, thereby efficiently reducing complexity during both training and inference. However, their expressivity remains limited by the size of their hidden state. Previous work proposed interleaving softmax and linear
attention layers to reduce computational complexity while preserving expressivity. Nevertheless, the efficiency of these models remains bottlenecked by their softmax
attention layers. In this paper, we propose Neural
Attention Search Linear (NAtS-L), a framework that applies both linear
attention and softmax
attention operations within the same layer on different
tokens. NAtS-L automatically determines whether a
token can be handled by a linear
attention model, i.e.,
tokens that have only short-term impact and can be encoded into fixed-size hidden states, or require softmax
attention, i.e.,
tokens that contain information related to long-term
retrieval and need to be preserved for future queries. By searching for optimal Gated DeltaNet and softmax
attention combinations across
tokens, we show that NAtS-L provides a strong yet efficient
token-level hybrid architecture.
Read the full abstract ▾
All authors Difan Deng, Andreas Bentzen Winje, Lukas Fehring, Marius Lindauer
Machine Learning
ContraLog: Log File Anomaly Detection with Contrastive Learning and Masked Language Modeling
Simon Dietz, Kai Klede, An Nguyen et al. (+1 more)
Log files record computational events that reflect system state and behavior, making them a primary source of operational insights in modern computer systems. Automated anomaly detection on logs is therefore critical, yet most established methods rely on log parsers that collapse messages into discrete templates, discarding variable values and semantic content. We propose ContraLog, a parser-free and self-supervised method that reframes log anomaly detection as predicting continuous message
embeddings rather than discrete template IDs. ContraLog combines a message encoder that produces rich
embeddings for individual log messages with a sequence encoder to model temporal dependencies within sequences. The model is trained with a combination of masked
language modeling and contrastive learning to predict masked message
embeddings based on the surrounding context. Experiments on the HDFS, BGL, and Thunderbird
benchmark datasets empirically demonstrate effectiveness on complex
datasets with diverse log messages. Additionally, we find that message
embeddings generated by ContraLog carry meaningful information and are predictive of anomalies even without sequence context. These results highlight
embedding-level prediction as an approach for log anomaly detection, with potential applicability to other event sequences.
Read the full abstract ▾
All authors Simon Dietz, Kai Klede, An Nguyen, Bjoern M Eskofier
Machine Learning
Equilibrium Propagation for Non-Conservative Systems
Antonino Emanuele Scurria, Dimitri Vanden Abeele, Bortolo Matteo Mognetti et al. (+1 more)
Equilibrium Propagation (EP) is a physics-inspired learning
algorithm that uses stationary states of a dynamical system both for inference and learning. In its original formulation it is limited to conservative systems, $\textit{i.e.}$ to dynamics which derive from an energy function. Given their applications, it is important to extend EP to non-conservative systems, $\textit{i.e.}$ systems with non-reciprocal interactions. Previous attempts to generalize EP to such systems failed to compute the exact gradient of the cost function. Here we propose a framework that extends EP to arbitrary non-conservative systems, including feedforward networks. We keep the key property of
equilibrium propagation, namely the use of stationary states both for inference and learning. However, we modify the dynamics in the learning phase by a term proportional to the non-reciprocal part of the interaction so as to obtain the exact gradient of the cost function. This
algorithm can also be derived using a variational formulation that generates the learning dynamics through an energy function defined over an augmented state space. Numerical experiments show that this
algorithm achieves better performance and learns faster than previous proposals.
Read the full abstract ▾
All authors Antonino Emanuele Scurria, Dimitri Vanden Abeele, Bortolo Matteo Mognetti, Serge Massar
Machine Learning · Cross-listed from cs.CV
Efficient Sequential Neural Network with Spatial-Temporal Attention and Linear LSTM for Robust Lane Detection Using Multi-Frame Images
Sandeep Patil, Yongqi Dong, Haneen Farah et al. (+1 more)
Lane detection is a crucial perception task for all levels of automated vehicles (AVs) and Advanced Driver Assistance Systems, particularly in mixed-traffic environments where AVs must interact with human-driven vehicles (HDVs) and challenging traffic scenarios. Current methods lack versatility in delivering accurate, robust, and real-time compatible lane detection, especially
vision-based methods often neglect critical regions of the image and their spatial-temporal (ST) salience, leading to poor performance in difficult circumstances such as serious occlusion and dazzle lighting. This study introduces a novel sequential neural network model with a spatial-temporal
attention mechanism to focus on key features of lane lines and exploit salient ST correlations among continuous image frames. The proposed model, built on a standard encoder-decoder structure and common neural network backbones, is trained and evaluated on three large-scale open-source
datasets. Extensive experiments demonstrate the strength and robustness of the proposed model, outperforming state-of-the-art methods in various testing scenarios. Furthermore, with the ST
attention mechanism, the developed sequential neural network models exhibit fewer parameters and reduced Multiply-Accumulate Operations (MACs) compared to baseline sequential models, highlighting their computational efficiency. Relevant data, code, and models are released at https://doi.org/10.4121/4619cab6-ae4a-40d5-af77-582a77f3d821.
Read the full abstract ▾
All authors Sandeep Patil, Yongqi Dong, Haneen Farah, Hans Hellendoorn
Machine Learning · Cross-listed from cs.AI
Mitigating Conversational Inertia in Multi-Turn Agents
Yang Wan, Zheng Cao, Zhenhao Zhang et al. (+4 more)
Large
language models excel as few-shot learners when provided with appropriate demonstrations, yet this strength becomes problematic in multiturn
agent scenarios, where LLMs erroneously mimic their own previous responses as few-shot examples. Through
attention analysis, we identify conversational inertia, a phenomenon where models exhibit strong diagonal
attention to previous responses, which is associated with imitation bias that constrains exploration. This reveals a tension when transforming few-shot LLMs into
agents: longer context enriches environmental feedback for exploitation, yet also amplifies conversational inertia that undermines exploration. Our key insight is that for identical states, actions generated with longer contexts exhibit stronger inertia than those with shorter contexts, enabling construction of preference pairs without environment rewards. Based on this, we propose Context Preference Learning to calibrate model preferences to favor low-inertia responses over highinertia ones. We further provide context management strategies at inference time to balance exploration and exploitation. Experimental results across eight agentic environments and one deep research scenario validate that our framework reduces conversational inertia and achieves performance improvements.
Read the full abstract ▾
All authors Yang Wan, Zheng Cao, Zhenhao Zhang, Zhengwen Zeng, Shuheng Shen, Changhua Meng, Linchao Zhu
Machine Learning
Sequential Group Composition: A Window into the Mechanics of Deep Learning
Giovanni Luca Marchetti, Daniel Kunin, Adele Myers et al. (+2 more)
How do neural networks trained over sequences acquire the ability to perform structured operations, such as arithmetic,
geometric, and algorithmic computation? To gain insight into this question, we introduce the sequential group composition task. In this task, networks receive a sequence of elements from a finite group encoded in a real vector space and must predict their cumulative product. This task can be order-sensitive and cannot be solved by a linear model. Our analysis isolates the roles of the group structure, encoding statistics, and sequence length in shaping learning. We prove that two-layer networks from vanishing initialization learn this task one irreducible representation of the group at a time in an order determined by the
Fourier statistics of the encoding. To perfectly learn the task, these networks require a hidden width exponential in the sequence length $k$. In contrast, we construct deeper architectures that exploit associativity to dramatically improve this scaling: recurrent neural networks can compose elements sequentially in $k$ steps, while multilayer networks can compose adjacent pairs in parallel in $\log k$ layers. Overall, the sequential group composition task offers a tractable window into the mechanics of deep learning.
Read the full abstract ▾
All authors Giovanni Luca Marchetti, Daniel Kunin, Adele Myers, Francisco Acosta, Nina Miolane
Machine Learning
Reinforcement Fine-Tuning for History-Aware Dense Retriever in RAG
Yicheng Zhang, Zhen Qin, Zhaomin Wu et al. (+2 more)
Retrieval-augmented generation (RAG) enables large
language models (LLMs) to produce evidence-based responses, and its performance hinges on the matching between the retriever and LLMs. Retriever optimization has emerged as an efficient alternative to fine-tuning LLMs. However, existing solutions suffer from objective mismatch between retriever optimization and the goal of RAG pipeline. Reinforcement learning (RL) provides a promising solution to address this limitation, yet applying RL to retriever optimization introduces two fundamental challenges: 1) the deterministic
retrieval is incompatible with RL formulations, and 2) state aliasing arises from query-only
retrieval in multi-hop
reasoning. To address these challenges, we replace deterministic
retrieval with
stochastic sampling and formulate RAG as a Markov decision process, making retriever optimizable by RL. Further, we incorporate
retrieval history into the state at each
retrieval step to mitigate state aliasing. Extensive experiments across diverse RAG pipelines,
datasets, and retriever scales demonstrate consistent improvements of our approach in RAG performance.
Read the full abstract ▾
All authors Yicheng Zhang, Zhen Qin, Zhaomin Wu, Wenqi Zhang, Shuiguang Deng
Machine Learning
CTTVAE: Latent Space Structuring for Conditional Tabular Data Generation on Imbalanced Datasets
Milosh Devic, Jordan Gierschendorf and David Garson
Generating synthetic tabular data under severe class imbalance is essential for domains where rare but high-impact events drive decision-making. However, most generative models either overlook minority groups or fail to produce samples that are useful for downstream learning. We introduce CTTVAE, a Conditional
Transformer-based Tabular Variational Autoencoder equipped with two complementary mechanisms: (i) a class-aware triplet margin loss that restructures the latent space for sharper intra-class compactness and inter-class separation, and (ii) a training-by-sampling strategy that adaptively increases exposure to underrepresented groups. Together, these components form CTTVAE+TBS, a framework that consistently yields more representative and utility-aligned samples without destabilizing training. Across six real-world
benchmarks, CTTVAE+TBS achieves the strongest downstream utility on minority classes, often surpassing models trained on the original imbalanced data while maintaining competitive fidelity and bridging the gap for
privacy for interpolation-based sampling methods and deep generative methods. Ablation studies further confirm that both latent structuring and targeted sampling contribute to these gains. By explicitly prioritizing downstream performance in rare categories, CTTVAE+TBS provides a robust and interpretable solution for conditional tabular data generation, with direct applicability to industries such as healthcare, fraud detection, and predictive maintenance where even small gains in minority cases can be critical.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.CL
TRE: Encouraging Exploration in the Trust Region
Chao Huang, Yujing Lu, Quangang Li et al. (+8 more)
Entropy regularization is a standard technique in reinforcement learning (RL) to enhance exploration, yet it yields negligible effects or even degrades performance in Large
Language Models (LLMs). We attribute this failure to the cumulative tail risk inherent to LLMs with massive vocabularies and long generation horizons. In such environments, standard global
entropy maximization indiscriminately dilutes probability mass into the vast tail of invalid
tokens rather than focusing on plausible candidates, thereby disrupting coherent
reasoning. To address this, we propose Trust Region
Entropy (TRE), a method that encourages exploration strictly within the model's trust region. Extensive experiments across mathematical
reasoning (MATH), combinatorial search (Countdown), and preference
alignment (HH) tasks demonstrate that TRE consistently outperforms vanilla PPO, standard
entropy regularization, and other exploration baselines. Our code is available at https://github.com/WhyChaos/TRE-Encouraging-Exploration-in-the-Trust-Region.
Read the full abstract ▾
All authors Chao Huang, Yujing Lu, Quangang Li, Shenghe Wang, Yan Wang, Yueyang Zhang, Long Xia, Jiashu Zhao, Zhiyuan Sun, Daiting Shi, Tingwen Liu
Machine Learning
Ultra Fast PDE Solving via Physics Guided Few-step Diffusion
Cindy Xiangrui Kong, Yueqi Wang, Haoyang Zheng et al. (+2 more)
Diffusion-based models have demonstrated impressive accuracy and generalization in solving partial differential equations (PDEs). However, their practical utility still suffers from high sampling costs and insufficient physical consistency, mainly due to many-step iterative sampling and insufficient physics guidance. To address these issues, we propose Phys-Instruct, a physics-guided
distillation framework that compresses a pre-trained
diffusion PDE solver into a few-step generator while explicitly enforcing PDE consistency through
distillation guidance. We reformulate the training objective as a constrained problem with PDE residual, and derive a score-function identity that leads to a practical physics-guided generator update. Across five PDE
benchmarks, Phys-Instruct achieves orders-of-magnitude faster inference while reducing the PDE Error by factors of $2.4$ to $15.5$, compared with the corresponding 200-step EDM teachers. Moreover, the resulting unconditional student model functions as a compact prior, enabling efficient and physically consistent inference for various downstream conditional tasks. Our results indicate that Phys-Instruct is an effective and efficient framework for ultra-fast PDE solving powered by generative models.
Read the full abstract ▾
All authors Cindy Xiangrui Kong, Yueqi Wang, Haoyang Zheng, Weijian Luo, Guang Lin
Machine Learning
Quantization-Aware Regularizers for Deep Neural Networks Compression
Dario Malchiodi, Mattia Ferraretto and Marco Frasca
Deep Neural Networks reached state-of-the-art performance across numerous domains, but this progress has come at the cost of increasingly large and over-parameterized models, posing serious challenges for deployment on resource-constrained devices. As a result, model compression has become essential, and – among compression techniques – weight quantization is largely used and particularly effective, yet it typically introduces a non-negligible accuracy drop. However, it is usually applied to already trained models, without influencing how the parameter space is explored during the learning phase. In contrast, we introduce per-layer regularization terms that drive weights to naturally form clusters during training, integrating quantization awareness directly into the optimization process. This reduces the accuracy loss typically associated with quantization methods while preserving their compression potential. Furthermore, in our framework quantization representatives become network parameters, marking, to the best of our knowledge, the first approach to embed quantization parameters directly into the backpropagation procedure. Experiments on CIFAR-10 with AlexNet and VGG16 models confirm the effectiveness of the proposed strategy.
Read the full abstract ▾
Machine Learning · Cross-listed from stat.ME
Simulation-Based Inference via Regression Projection and Batched Discrepancies
Arya Farahi, Jonah Rose and Paul Torrey
We analyze a lightweight simulation-based inference method that infers simulator parameters using only a regression-based projection of the observed data. After fitting a surrogate linear regression once, the procedure simulates small batches at the proposed parameter values and assigns kernel weights based on the resulting batch-residual discrepancy, producing a self-normalized pseudo-posterior that is simple, parallelizable, and requires access only to the fitted regression coefficients rather than raw observations. We formalize the construction as an importance-sampling approximation to a population target that averages over simulator randomness, prove consistency as the number of parameter draws grows, and establish stability in estimating the surrogate regression from finite samples. We then characterize the asymptotic concentration as the batch size increases and the bandwidth shrinks, showing that the pseudo-posterior concentrates on an identified set determined by the chosen projection, thereby clarifying when the method yields point versus set identification. Experiments on a tractable nonlinear model and on a cosmological calibration task using the DREAMS simulation suite illustrate the computational advantages of regression-based projections and the identifiability limitations arising from low-information summaries.
Read the full abstract ▾