Machine Learning · Cross-listed from q-fin.ST
Adaptive Benign Overfitting (ABO): Overparameterized RLS for Online Learning in Non-stationary Time-series
Luis Ontaneda Mijares and Nick Firoozye
Overparameterized models have recently challenged conventional learning theory by exhibiting improved generalization beyond the interpolation limit, a phenomenon known as benign overfitting. This work introduces Adaptive Benign Overfitting (ABO), extending the recursive least-squares (RLS) framework to this regime through a numerically stable formulation based on orthogonal-triangular updates. A QR-based exponentially weighted RLS (QR-EWRLS)
algorithm is introduced, combining random
Fourier feature mappings with forgetting-factor regularization to enable online adaptation under non-stationary conditions. The orthogonal decomposition prevents the numerical divergence associated with covariance-form RLS while retaining adaptability to evolving data distributions. Experiments on nonlinear synthetic time series confirm that the proposed approach maintains bounded residuals and stable condition numbers while reproducing the double-descent behavior characteristic of overparameterized models. Applications to
forecasting foreign exchange and electricity demand show that ABO is highly accurate (comparable to baseline kernel methods) while achieving speed improvements of between 20 and 40 percent. The results provide a unified view linking adaptive filtering, kernel approximation, and benign overfitting within a stable online learning framework.
Read the full abstract ▾
Machine Learning
Neural Signals Generate Clinical Notes in the Wild
Jathurshan Pradeepkumar, Zheng Chen and Jimeng Sun
Generating clinical reports that summarize abnormal patterns, diagnostic findings, and clinical interpretations from long-term
EEG recordings remains labor-intensive. We present CELM, the first clinical
EEG-to-
Language foundation model capable of summarizing long-duration, variable-length
EEG recordings and performing end-to-end clinical report generation at multiple scales. CELM integrates pretrained
EEG foundation models with
language models to enable scalable
multimodal learning. We curate a large-scale clinical
EEG dataset containing 9,922 reports paired with approximately 11,000 hours of
EEG recordings from 9,048 patients to train CELM, and release the
benchmark pipeline, with automated report-structuring, to facilitate future research. Experimental results show that CELM consistently outperforms existing methods across all evaluation settings. Importantly, we further conduct human evaluation with clinical experts, demonstrating that CELM generates reports that are more clinically coherent, diagnostically reliable, and better aligned with expert interpretation. We release our model code and
benchmark construction pipeline at https://github.com/Jathurshan0330/CELM.
Read the full abstract ▾
Machine Learning
Multitask Learning for Earth Observation Data Classification with Hybrid Quantum Network
Fan Fan, Yilei Shi, Tobias Guggemos et al. (+1 more)
Quantum machine learning (QML) has gained increasing
attention as a potential solution to address the challenges of computation requirements in the future. Earth observation (EO) has entered the era of Big Data, and the computational demands for effectively analyzing large EO data with complex deep learning models have become a bottleneck. Motivated by this, we aim to leverage
quantum computing for EO data classification and explore its advantages despite the current limitations of
quantum devices. This paper presents a hybrid model that incorporates multitask learning to assist efficient data encoding and employs a location weight module with
quantum convolution operations to extract valid features for classification. The validity of our proposed model was evaluated using multiple EO
benchmarks. Additionally, we experimentally explored the generalizability of our model and investigated the factors contributing to its advantage, highlighting the potential of QML in EO data analysis.
Read the full abstract ▾
All authors Fan Fan, Yilei Shi, Tobias Guggemos, Xiao Xiang Zhu
Machine Learning · Cross-listed from eess.IV
SCENE: Semantic-aware Codec Enhancement with Neural Embeddings
Han-Yu Lin, Li-Wei Chen and Hung-Shin Lee
Compression artifacts from standard
video codecs often degrade perceptual quality. We propose a lightweight, semantic-aware pre-processing framework that enhances perceptual fidelity by selectively addressing these distortions. Our method integrates semantic
embeddings from a
vision-
language model into an efficient convolutional architecture, prioritizing the preservation of perceptually significant structures. The model is trained end-to-end with a differentiable codec proxy, enabling it to mitigate artifacts from various standard codecs without modifying the existing
video pipeline. During inference, the codec proxy is discarded, and SCENE operates as a standalone pre-processor, enabling real-time performance. Experiments on high-resolution
benchmarks show improved performance over baselines in both objective (MS-SSIM) and perceptual (VMAF) metrics, with notable gains in preserving detailed textures within salient regions. Our results show that semantic-guided, codec-aware pre-processing is an effective approach for enhancing compressed
video streams.
Read the full abstract ▾
Machine Learning
Discovering Hidden Gems in Model Repositories
Jonathan Kahana, Eliahu Horwitz and Yedid Hoshen
Public repositories host millions of fine-tuned models, yet community usage remains disproportionately concentrated on a small number of foundation checkpoints. We investigate whether this concentration reflects efficient
market selection or if superior models are systematically overlooked. Through an extensive evaluation of over 2,000 models, we show the prevalence of "hidden gems", unpopular fine-tunes that significantly outperform their popular counterparts. Notably, within the Llama-3.1-8B family, we find rarely downloaded checkpoints that improve math performance from 83.2% to 96.0% without increasing inference costs. However, discovering these models through exhaustive evaluation of every uploaded model is computationally infeasible. We therefore formulate model discovery as a Multi-Armed Bandit problem and accelerate the Sequential Halving search
algorithm by using shared query sets and aggressive elimination schedules. Our method retrieves top models with as few as 50 queries per candidate, accelerating discovery by over 50x.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.CL
Hybrid Linear Attention Done Right: Efficient Distillation and Effective Architectures for Extremely Long Contexts
Yingfa Chen, Zhen Leng Thai, Zihan Zhou et al. (+6 more)
Hybrid
Transformer architectures, which combine softmax
attention blocks and recurrent neural networks (RNNs), have shown a desirable performance-throughput tradeoff for long-context modeling, but their adoption and studies are hindered by the prohibitive cost of large-scale pre-training from scratch. Some recent studies have shown that pre-trained softmax
attention blocks can be converted into RNN blocks through parameter transfer and knowledge
distillation. However, these transfer methods require substantial amounts of training data (more than 10B
tokens), and the resulting hybrid models also exhibit poor long-context performance, which is the scenario where hybrid models enjoy significant inference speedups over
Transformer-based models. In this paper, we present
HALO (Hybrid
Attention via Layer Optimization), a pipeline for distilling
Transformer models into RNN-
attention hybrid models. We then present HypeNet, a hybrid architecture with superior length generalization enabled by a novel position encoding scheme (named HyPE) and various architectural modifications. We convert the Qwen3 series into HypeNet using
HALO, achieving performance comparable to the original
Transformer models while enjoying superior long-context performance and efficiency. The conversion requires just 2.3B
tokens, less than 0.01% of their pre-training data
Read the full abstract ▾
All authors Yingfa Chen, Zhen Leng Thai, Zihan Zhou, Zhu Zhang, Xingyu Shen, Shuo Wang, Chaojun Xiao, Xu Han, Zhiyuan Liu
Machine Learning
Late Breaking Results: Conversion of Neural Networks into Logic Flows for Edge Computing
Daniel Stein, Shaoyi Huang, Rolf Drechsler et al. (+2 more)
Neural networks have been successfully applied in various resource-constrained edge devices, where usually central processing units (CPUs) instead of graphics processing units exist due to limited power availability. State-of-the-art research still focuses on efficiently executing enormous numbers of multiply-accumulate (MAC) operations. However, CPUs themselves are not good at executing such mathematical operations on a large scale, since they are more suited to execute control flow logic, i.e., computer
algorithms. To enhance the computation efficiency of neural networks on CPUs, in this paper, we propose to convert them into logic flows for execution. Specifically, neural networks are first converted into equivalent decision trees, from which decision paths with constant leaves are then selected and compressed into logic flows. Such logic flows consist of if and else structures and a reduced number of MAC operations. Experimental results demonstrate that the latency can be reduced by up to 14.9 % on a simulated RISC-V CPU without any accuracy degradation. The code is open source at https://github.com/TUDa-HWAI/NN2Logic
Read the full abstract ▾
All authors Daniel Stein, Shaoyi Huang, Rolf Drechsler, Bing Li, Grace Li Zhang
Machine Learning · Cross-listed from cs.CL
FineInstructions: Scaling Synthetic Instructions to Pre-Training Scale
Ajay Patel, Colin Raffel and Chris Callison-Burch
Due to limited supervised training data, large
language models (LLMs) are typically pre-trained via a self-supervised "predict the next word" objective on a vast amount of unstructured text data. To make the resulting model useful to users, it is further trained on a far smaller amount of "instruction-tuning" data comprised of supervised training examples of instructions and responses. To overcome the limited amount of supervised data, we propose a procedure that can transform the knowledge in internet-scale pre-training documents into billions of synthetic instruction and answer training pairs. The resulting
dataset, called FineInstructions, uses ~18M instruction templates created from real user-written queries and
prompts. These instruction templates are matched to and instantiated with human-written source documents from unstructured pre-training corpora. With "supervised" synthetic training data generated at this scale, an LLM can be pre-trained from scratch solely with the instruction-tuning objective, which is far more in-distribution with the expected downstream usage of LLMs (responding to user
prompts). We conduct controlled
token-for-
token training experiments and find pre-training on FineInstructions outperforms standard pre-training and other proposed synthetic pre-training techniques on standard
benchmarks measuring free-form response quality. Our resources can be found at https://huggingface.co/fineinstructions .
Read the full abstract ▾
Machine Learning · Cross-listed from cs.AI
Routing the Lottery: Adaptive Subnetworks for Heterogeneous Data
Grzegorz Stefanski, Alberto Presta and Michal Byra
In
pruning, the Lottery Ticket Hypothesis posits that large networks contain sparse subnetworks, or winning tickets, that can be trained in isolation to match the performance of their dense counterparts. However, most existing approaches assume a single universal winning ticket shared across all inputs, ignoring the inherent heterogeneity of real-world data. In this work, we propose Routing the Lottery (RTL), an adaptive
pruning framework that discovers multiple specialized subnetworks, called adaptive tickets, each tailored to a class, semantic cluster, or environmental condition. Across diverse
datasets and tasks, RTL consistently outperforms single- and multi-model baselines in balanced accuracy and recall, while using up to 10 times fewer parameters than independent models and exhibiting semantically aligned. Furthermore, we identify subnetwork collapse, a performance drop under aggressive
pruning, and introduce a subnetwork similarity score that enables label-free diagnosis of oversparsification. Overall, our results recast
pruning as a mechanism for aligning model structure with data heterogeneity, paving the way toward more modular and context-aware deep learning.
Read the full abstract ▾
Machine Learning
PRISM: Distribution-free Adaptive Computation of Matrix Functions for Accelerating Neural Network Training
Shenghao Yang, Zhichao Wang, Oleg Balabanov et al. (+2 more)
Matrix functions such as square root, inverse roots, and orthogonalization play a central role in preconditioned gradient methods for neural network training. This has motivated the development of iterative
algorithms that avoid explicit eigendecompositions and rely primarily on
matrix multiplications, making them well suited for modern GPU accelerators. We present PRISM (
Polynomial-fitting and Randomized Iterative Sketching for
Matrix functions computation), a general framework for accelerating iterative
algorithms for computing
matrix functions. PRISM combines adaptive
polynomial approximation with randomized sketching: at each iteration, it fits a
polynomial surrogate to the current spectrum via a sketched least-squares problem, adapting to the instance at hand with minimal overhead. We apply PRISM to accelerate Newton-Schulz-like iterations for
matrix square roots and orthogonalization, which are core primitives in machine learning. Unlike prior methods, PRISM requires no explicit spectral bounds or singular value estimates; and it adapts automatically to the evolving spectrum. Empirically, PRISM accelerates training when integrated into Shampoo and
Muon optimizers.
Read the full abstract ▾
All authors Shenghao Yang, Zhichao Wang, Oleg Balabanov, N. Benjamin Erichson, Michael W. Mahoney
Machine Learning
StepShield: When, Not Whether to Intervene on Rogue Agents
Gloria Felicia, Zitha Sasindran, Jinfeng He et al. (+3 more)
Agent safety
benchmarks measure whether a monitor detects harm, not when. Yet timing is the difference between intervention and autopsy. We introduce StepShield, the first
benchmark that treats detection timeliness as a first-class metric. On 9,429 incident-grounded code-
agent trajectories, we define the Early Intervention Rate (EIR): the fraction of detected rogue trajectories where the alert fires within a k-step window after the divergence point, isolating timing quality from coverage. This metric exposes what we call the Forensics Trap: a pattern-based guardrail with 847 rules achieves 86% recall yet is statistically indistinguishable from random timing on EIR (0.23 vs. 0.24; p = 0.66, one-sided binomial; difference within CI), because over three-quarters of its alerts trigger on benign prefix code before any violation occurs. The 4x EIR gap between rule-based and semantic detectors is completely invisible to accuracy, recall, or F1. Our finding is structural: regex guardrails detect syntax, not intent, and therefore cannot distinguish the moment an
agent turns rogue, rendering the entire deployed class of pattern-based monitors unsuited for real-time oversight. No existing method simultaneously achieves high recall, low false-positive rate, and timely intervention, establishing step-level rogue detection as genuinely unsolved.
Read the full abstract ▾
All authors Gloria Felicia, Zitha Sasindran, Jinfeng He, Michael Eniolade, Hemant Kumar, Milan Hussain Angati
Machine Learning
Pay for Hints, Not Answers: LLM Shepherding for Cost-Efficient Inference
Ziming Dong, Hardik Sharma, Evan O'Toole et al. (+2 more)
Large
Language Models (LLMs) deliver state-of-the-art performance on complex
reasoning tasks, but their inference costs limit deployment at scale. Small
Language Models (SLMs) offer dramatic cost savings yet lag substantially in accuracy. Existing approaches - routing and cascading - treat the LLM as an all-or-nothing resource: either the query bypasses the LLM entirely, or the LLM generates a complete response at full cost. We introduce LLM Shepherding, a framework that requests only a short prefix (a hint) from the LLM and provides it to SLM. This simple mechanism is surprisingly effective for math and coding tasks: even hints comprising 10-30% of the full LLM response improve SLM accuracy significantly. Shepherding generalizes both routing and cascading, and it achieves lower cost under oracle decision-making. We develop a two-stage predictor that jointly determines whether a hint is needed and how many
tokens to request. On the widely-used mathematical
reasoning (GSM8K, CNK12) and code generation (HumanEval, MBPP)
benchmarks, Shepherding reduces costs by 42-94% relative to LLM-only inference. Compared to state-of-the-art routing and cascading baselines, shepherding delivers up to 2.8x cost reduction while matching accuracy. To our knowledge, this is the first work to exploit
token-level budget control for SLM-LLM collaboration.
Read the full abstract ▾
All authors Ziming Dong, Hardik Sharma, Evan O'Toole, Jaya Prakash Champati, Kui Wu
Machine Learning
SMOG: Scalable Meta-Learning for Multi-Objective Bayesian Optimization
Leonard Papenmeier and Petru Tighineanu
Multi-objective optimization aims to solve problems with competing objectives. Evaluating such problems is often slow or expensive, limiting the budget of evaluations. In many applications, historical data from related optimization tasks is available and can be leveraged via meta-learning to accelerate optimization.
Bayesian optimization, as a promising technique for expensive black-box problems, has been extended independently to meta-learning and multi-objective optimization, but methods that simultaneously address both settings remain largely unexplored. We propose SMOG-a scalable and modular meta-learning model based on a multi-output Gaussian process-that explicitly learns correlations between objectives. SMOG builds a structured joint Gaussian process prior across meta- and target tasks and, after conditioning on metadata, yields a closed-form prior for the target task. This construction propagates metadata uncertainty into the target surrogate in a principled way. SMOG supports hierarchical, parallel training, achieving linear scaling with the number of meta-tasks. The resulting surrogate integrates seamlessly with standard multi-objective
Bayesian optimization acquisition functions. We demonstrate that our method is consistently competitive, delivering strong data efficiency across representative
benchmarks and applications.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.SE
SWE-Replay: Efficient Test-Time Scaling for Software Engineering Agents
Yifeng Ding and Lingming Zhang
Test-time scaling has been widely adopted to enhance the capabilities of Large
Language Model (LLM)
agents in software engineering (SWE) tasks. However, the standard approach of repeatedly sampling trajectories from scratch is computationally expensive. While recent methods have attempted to mitigate costs using specialized value
agents, they can suffer from model miscalibration and fail to generalize to modern
agents that synthesize custom bash scripts as tools. In this paper, we introduce SWE-Replay, the first efficient and generalizable test-time scaling technique for modern
agents without reliance on potentially noisy value estimates. SWE-Replay optimizes the scaling process by recycling trajectories from prior trials, dynamically choosing to either explore from scratch or exploit archived experience by branching at critical intermediate steps. This selection of intermediate steps is driven by the potential and
reasoning significance of repository exploration, rather than external LLM-based quality estimates. Our evaluation shows that, on SWE-Bench Verified, SWE-Replay consistently outperforms naive scaling, reducing costs by up to 17.4% while maintaining or even improving performance by up to 3.8%. Further evaluation on SWE-Bench Pro and
Multilingual validates the generalizability of SWE-Replay, establishing it as a robust foundation for efficient test-time scaling of software engineering
agents.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.CV
EditYourself: Audio-Driven Generation and Manipulation of Talking Head Videos with Diffusion Transformers
John Flynn, Wolfgang Paier, Dimitar Dinev et al. (+5 more)
Current generative
video models excel at producing novel content from text and image
prompts, but leave a critical gap in editing existing pre-recorded
videos, where minor alterations to the spoken script require preserving motion, temporal coherence, speaker identity, and accurate lip synchronization. We introduce EditYourself, a DiT-based framework for audio-driven
video-to-
video (V2V) editing that enables transcript-based modification of talking head
videos, including the seamless addition, removal, and retiming of visually spoken content. Building on a general-purpose
video diffusion model, EditYourself augments its V2V capabilities with audio conditioning and region-aware, edit-focused training extensions. This enables precise lip synchronization and temporally coherent restructuring of existing performances via spatiotemporal inpainting, including the synthesis of realistic human motion in newly added segments, while maintaining visual fidelity and identity consistency over long durations. This work represents a foundational step toward generative
video models as practical tools for professional
video post-production.
Read the full abstract ▾
All authors John Flynn, Wolfgang Paier, Dimitar Dinev, Sam Nhut Nguyen, Hayk Poghosyan, Manuel Toribio, Sandipan Banerjee, Guy Gafni
Machine Learning
Learning Hamiltonian Flow Maps: Mean Flow Consistency for Large-Timestep Molecular Dynamics
Winfried Ripken, Michael Plainer, Gregor Lied et al. (+5 more)
Simulating the long-time
evolution of
Hamiltonian systems is limited by the small timesteps required for stable numerical integration. To overcome this constraint, we introduce a framework to learn
Hamiltonian Flow Maps by predicting the mean phase-space
evolution over a chosen time span, enabling stable large-timestep updates far beyond the stability limits of classical integrators. To this end, we impose a Mean Flow consistency condition for time-averaged
Hamiltonian dynamics. Unlike prior approaches, this allows training on independent phase-space samples without access to future states, avoiding expensive trajectory generation. Validated across diverse
Hamiltonian systems, our method in particular improves upon molecular dynamics simulations using machine-learned force fields (MLFF). Our models maintain comparable training and inference cost, but support significantly larger integration timesteps while trained directly on widely-available trajectory-free MLFF
datasets.
Read the full abstract ▾
All authors Winfried Ripken, Michael Plainer, Gregor Lied, Thorben Frank, Oliver T. Unke, Stefan Chmiela, Frank Noé, Klaus-Robert Müller
Machine Learning · Cross-listed from q-fin.CP
Alpha Discovery via Grammar-Guided Learning and Search
Han Yang, Dong Hao, Zhuohan Wang et al. (+2 more)
Automatically discovering formulaic alpha factors is a central problem in quantitative finance. Existing methods often ignore syntactic and semantic constraints, relying on exhaustive search over unstructured and unbounded spaces. We present AlphaCFG, a grammar-based framework for defining and discovering alpha factors that are syntactically valid, financially interpretable, and computationally efficient. AlphaCFG uses an alpha-oriented context-free grammar to define a tree-structured, size-controlled search space, and formulates alpha discovery as a tree-structured linguistic Markov decision process, which is then solved using a grammar-aware Monte Carlo Tree Search guided by syntax-sensitive value and policy networks. Experiments on Chinese and U.S. stock
market datasets show that AlphaCFG outperforms state-of-the-art baselines in both search efficiency and trading profitability. Beyond trading strategies, AlphaCFG serves as a general framework for symbolic factor discovery and refinement across quantitative finance, including asset pricing and portfolio construction.
Read the full abstract ▾
All authors Han Yang, Dong Hao, Zhuohan Wang, Qi Shi, Xingtong Li
Machine Learning · Cross-listed from q-fin.TR
Diverse Approaches to Optimal Execution Schedule Generation
Robert de Witt and Mikko S. Pakkanen
We present the first application of MAP-Elites, a quality-diversity
algorithm, to trade execution. Rather than searching for a single optimal policy, MAP-Elites generates a diverse portfolio of regime-specialist strategies indexed by liquidity and
volatility conditions. Individual specialists achieve 8-10% performance improvements within their behavioural niches, while other
cells show degradation, suggesting opportunities for ensemble approaches that combine improved specialists with the baseline PPO policy. Results indicate that quality-diversity methods offer promise for regime-adaptive execution, though substantial computational resources per behavioural
cell may be required for robust specialist development across all
market conditions. To ensure experimental integrity, we develop a calibrated Gymnasium environment focused on order scheduling rather than tactical placement decisions. The simulator features a transient impact model with exponential decay and square-root volume scaling, fit to 400+ U.S. equities with $R^2>0.02$ out-of-sample. Within this environment, two Proximal Policy Optimization architectures - both MLP and CNN feature extractors - demonstrate substantial improvements over industry baselines, with the CNN variant achieving 2.13 bps arrival slippage versus 5.23 bps for VWAP on 4,900 out-of-sample orders ($21B notional). These results validate both the simulation realism and provide strong single-policy baselines for quality-diversity methods.
Read the full abstract ▾
Machine Learning
Physics Informed Reconstruction of Four-Dimensional Atmospheric Wind Fields Using Multi-UAS Swarm Observations in a Synthetic Turbulent Environment
Abdullah Tasim and Wei Sun
Accurate reconstruction of atmospheric wind fields is essential for applications such as weather
forecasting, hazard prediction, and wind energy assessment, yet conventional instruments leave spatio-temporal gaps within the lower atmospheric boundary layer. Unmanned aircraft systems (UAS) provide flexible in situ measurements, but individual platforms sample wind only along their flight trajectories, limiting full wind-field recovery. This study presents a framework for reconstructing four-dimensional atmospheric wind fields using measurements obtained from a coordinated UAS swarm. A synthetic
turbulence environment and high-fidelity multirotor simulation are used to generate training and evaluation data. Local wind components are estimated from UAS dynamics using a bidirectional long short-term
memory network (Bi-LSTM) and assimilated into a physics-informed neural network (PINN) to reconstruct a continuous wind field in space and time. For local wind estimation, the bidirectional LSTM achieves root-mean-square errors (RMSE) of 0.064 and 0.062 m/s for the north and east components in low-wind conditions, increasing to 0.122 to 0.129 m/s under moderate winds and 0.271 to 0.273 m/s in high-wind conditions, while the vertical component exhibits higher error, with RMSE values of 0.029 to 0.091 m/s. The physics-informed reconstruction recovers the dominant spatial and temporal structure of the wind field up to 1000 m altitude while preserving mean flow direction and vertical shear. Under moderate wind conditions, the reconstructed mean wind field achieves an overall RMSE between 0.118 and 0.154 m/s across evaluated UAS configurations, with the lowest error obtained using a five-UAS swarm. These results demonstrate that coordinated UAS measurements enable accurate and scalable four-dimensional wind-field reconstruction without dedicated wind sensors or fixed infrastructure.
Read the full abstract ▾
Machine Learning
Learning What to Predict: Downstream-Guided Task Design for Continued Pretraining
Shuqi Ke and Giulia Fanti
Continued pretraining is optimized with fixed self-supervised tasks but selected by downstream performance, creating a coarse feedback loop in which practitioners evaluate checkpoints, change data mixtures or objectives, and restart runs, while individual updates remain blind to target capabilities. We ask whether a small set of verifiable downstream examples can provide step-level feedback without directly supervising the learner. We introduce V-pretraining, which decouples a learner trained only with a self-supervised loss from a lightweight task designer that constructs targets or views for unlabeled batches. Given the current learner and batch, V-pretraining scores a candidate construction by predicting the first-order reduction in downstream loss after the induced self-supervised update. The designer maximizes this value; the learner then applies the update with targets or views detached, so downstream labels never update learner parameters. We instantiate V-pretraining as adaptive top-K soft targets for
language modeling and learned views or masks for self-supervised
vision. Across both modalities, V-pretraining improves target capabilities without degrading generalization. Under wall-clock-matched continued pretraining, it improves GSM8K Pass@1 for Qwen models using 1,024 GSM8K examples only as feedback, including a +7.4 point single-run gain for Qwen2.5-0.5B. In
vision, it improves DINOv3 transfer to ADE20K semantic
segmentation and NYUv2 depth estimation while preserving ImageNet linear accuracy, suggesting that feedback-guided task construction can improve target capabilities without collapsing general-purpose representations.
Read the full abstract ▾
Machine Learning
Prior-Informed Flow Matching for Graph Reconstruction
Harvey Chen, Nicolas Zilberstein and Santiago Segarra
We introduce Prior-Informed Flow Matching (PIFM), a conditional flow model for graph reconstruction. Reconstructing graphs from partial observations remains a key challenge; classical
embedding methods often lack global consistency, while modern generative models struggle to incorporate structural priors. PIFM bridges this gap by integrating
embedding-based priors with continuous-time flow matching. Grounded in a permutation equivariant version of the distortion-perception theory, our method first uses a prior, such as GraphSAGE or node2vec, to form an informed initial estimate of the adjacency
matrix based on local information. It then applies rectified flow matching to refine this estimate, transporting it toward the true distribution of clean graphs and learning a global coupling. Experiments on different
datasets demonstrate that PIFM consistently enhances classical
embeddings, outperforming them and state-of-the-art generative baselines in reconstruction accuracy.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.CL
ECO: Quantized Training without Full-Precision Master Weights
Mahdi Nikdan, Amir Zandieh, Dan Alistarh et al. (+1 more)
Quantization has significantly improved the compute and
memory efficiency of Large
Language Model (LLM) training. However, existing approaches still rely on accumulating their updates in high-precision: concretely, gradient updates must be applied to a high-precision weight buffer, known as $\textit{master weights}$. This buffer introduces substantial
memory overhead, particularly for Sparse Mixture of Experts (SMoE) models, where model parameters and optimizer states dominate
memory usage. To address this, we introduce the Error-Compensating Optimizer (ECO), which eliminates master weights by applying updates directly to quantized parameters. ECO quantizes weights after each step and carefully injects the resulting quantization error into the optimizer momentum, forming an error-feedback loop with no additional
memory. We prove that, under standard assumptions and a decaying learning rate, ECO converges to a constant-radius neighborhood of the optimum, while naive master-weight removal can incur an error that is inversely proportional to the learning rate. We show empirical results for pretraining small
Transformers (30-800M), a Gemma-3 1B model, and a 2.1B parameter Sparse MoE model with FP8 quantization, and fine-tuning DeepSeek-MoE-16B in INT4 precision. Throughout, ECO matches baselines with master weights up to near-lossless accuracy, significantly shifting the static
memory vs validation loss Pareto frontier.
Read the full abstract ▾
All authors Mahdi Nikdan, Amir Zandieh, Dan Alistarh, Vahab Mirrokni
Machine Learning
Boosting CVaR Policy Optimization with Quantile Gradients
Yudong Luo and Erick Delage
Optimizing Conditional Value-at-risk (CVaR) using policy gradient (a.k.a CVaR-PG) faces significant challenges of sample inefficiency. This inefficiency stems from the fact that it focuses on tail-end performance and overlooks many sampled trajectories. We address this problem by augmenting CVaR with an expected
quantile term.
Quantile optimization admits a dynamic programming formulation that leverages all sampled data, thus improves sample efficiency. This does not alter the CVaR objective since CVaR corresponds to the expectation of
quantile over the tail. Empirical results in domains with verifiable risk-averse behavior show that our
algorithm within the Markovian policy class substantially improves upon CVaR-PG and consistently outperforms other existing methods.
Read the full abstract ▾
Machine Learning
GeoNorm: Unify Pre-Norm and Post-Norm with Geodesic Optimization
Chuanyang Zheng, Jiankai Sun, Yihang Gao et al. (+11 more)
The placement of normalization layers, specifically Pre-Norm and Post-Norm, remains an open question in
Transformer architecture design. In this work, we rethink these approaches through the lens of
manifold optimization, interpreting the outputs of the Feed-Forward Network (FFN) and
attention layers as update directions in optimization. Building on this perspective, we introduce GeoNorm, a novel method that replaces standard normalization with geodesic updates on the
manifold. Furthermore, analogous to learning rate schedules, we propose a layer-wise update decay for the FFN and
attention components. Comprehensive experiments demonstrate that GeoNorm consistently outperforms existing normalization methods in
Transformer models. Crucially, GeoNorm can be seamlessly integrated into standard
Transformer architectures, achieving performance improvements with negligible additional computational cost.
Read the full abstract ▾
All authors Chuanyang Zheng, Jiankai Sun, Yihang Gao, Chi Wang, Yuehao Wang, Jing Xiong, Liliang Ren, Bo Peng, Qingmei Wang, Xiaoran Shang, Mac Schwager, Anderson Schneider, Yuriy Nevmyvaka, Xiaodong Liu
Machine Learning
Latent Adversarial Regularization for Offline Preference Optimization
Enyi Jiang, Yibo Jacky Zhang, Yinglun Xu et al. (+3 more)
Learning from human feedback typically relies on preference optimization that constrains policy updates through
token-level regularization. However, preference optimization for
language models is particularly challenging because
token-space similarity does not imply semantic or behavioral similarity. To address this challenge, we leverage latent-space regularization for
language model preference optimization. We introduce GANPO, which achieves latent-space regularization by penalizing divergence between the internal representations of a policy model and a reference model. Given that latent representations are not associated with explicit probability densities, we adopt an
adversarial approach inspired by GANs to minimize latent-space divergence. We integrate GANPO as a regularizer into existing offline preference optimization objectives. Experiments across multiple model architectures and tasks show consistent improvements from latent-space regularization. Further, by comparing GANPO-induced inferential biases with those from
token-level regularization, we find that GANPO provides more robust structural feedback under distributional shift and noise while maintaining comparable downstream performance with minor computational overhead.
Read the full abstract ▾
All authors Enyi Jiang, Yibo Jacky Zhang, Yinglun Xu, Andreas Haupt, Nancy Amato, Sanmi Koyejo
Machine Learning
Where Do the Joules Go? Diagnosing Inference Energy Consumption
Jae-Won Chung, Ruofan Wu, Jeff J. Ma et al. (+1 more)
Energy is now a critical ML computing resource. While measuring energy consumption and observing trends is a valuable first step, accurately understanding and diagnosing why those differences occur is crucial for optimization. To that end, we begin by presenting a large-scale measurement study of inference time and energy across the generative AI landscape with 46 models, 7 tasks, and 1,858 different configurations on NVIDIA H100 and B200 GPUs. Our empirical findings span order-of-magnitude variations: LLM task type can lead to 25$\times$ energy differences,
video generation sometimes consumes more than 100$\times$ the energy of images, and GPU utilization differences can result in 3–5$\times$ energy differences. Based on our observations, we present a framework for
reasoning about the underlying mechanisms that govern time and energy consumption. The essence is that time and energy are determined by latent metrics like
memory and utilization, which are in turn affected by various factors across the
algorithm, software, and hardware layers. Our framework also extends directly to throughput per watt, a critical metric for power-constrained datacenters.
Read the full abstract ▾
All authors Jae-Won Chung, Ruofan Wu, Jeff J. Ma, Mosharaf Chowdhury
Machine Learning
Quantifying the Uncertainty of Foundation Models with Singular Value Ensembles
Mehmet Ozgur Turkoglu, Dominik J. Mühlematter, Alexander Becker et al. (+2 more)
Foundation models have become a dominant paradigm in machine learning, achieving remarkable performance across diverse tasks through large-scale pretraining. However, they often yield overconfident, uncalibrated predictions. The standard approach to quantifying epistemic uncertainty are ensembles of multiple independently trained models. But their computational cost scales linearly with ensemble size, making them impractical for large foundation models. We propose Singular Value Ensemble (SVE), a parameter-efficient implicit ensembling method. SVE builds on a simple, but powerful core assumption: namely, that the singular vectors of the weight
matrices correspond to meaningful directions in the representation space. If the singular vectors are indeed meaningful (orthogonal) "knowledge directions", then a model ensemble can be obtained by modulating only how strongly each direction contributes to the output. Rather than learning new parameters for each ensemble member, we freeze the singular vectors and only train per-member singular values that rescale the contribution of each direction in that shared knowledge basis. Ensemble diversity emerges naturally during joint training as
stochastic initialization and random batch sampling cause different members to converge to different combinations of the same underlying knowledge. SVE performs comparable to an explicit ensemble, while increasing the parameter count of the base model by <1%, making principled uncertainty estimation accessible in resource-constrained settings. We validate SVE on NLP and
vision tasks with various different backbones and show that it improves calibration while maintaining predictive accuracy.
Read the full abstract ▾
All authors Mehmet Ozgur Turkoglu, Dominik J. Mühlematter, Alexander Becker, Konrad Schindler, Helge Aasen
Machine Learning · Cross-listed from cs.MA
Learning to Communicate Across Modalities: Perceptual Heterogeneity in Multi-Agent Systems
Naomi Pitzer and Daniela Mihai
Emergent communication offers insight into how
agents develop shared structured representations, yet most research assumes homogeneous modalities or aligned representational spaces, overlooking the perceptual heterogeneity of real-world settings. We study a heterogeneous multi-step binary communication game where
agents differ in modality and lack perceptual grounding. Despite perceptual misalignment,
multimodal systems converge to class-consistent messages grounded in perceptual input. Unimodal systems communicate more efficiently, using fewer bits and achieving lower classification
entropy, while
multimodal agents require greater information exchange and exhibit higher uncertainty. Bit perturbation experiments provide strong evidence that meaning is encoded in a distributional rather than compositional manner, as each bit's contribution depends on its surrounding pattern. Finally, interoperability analyses show that systems trained in different perceptual worlds fail to directly communicate, but limited fine-tuning enables successful cross-system communication. This work positions emergent communication as a framework for studying how
agents adapt and transfer representations across heterogeneous modalities, opening new directions for both theory and experimentation.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.CL
Leviathan: Decoupling Input and Output Representations in Language Models
Reza T. Batley and Sourav Saha
Modern
language models use a single
matrix for input
embedding and output projection. This couples two distinct objectives:
token representation and discrimination over a vocabulary. This work introduces Leviathan, a
Transformer architecture that replaces the input
embedding matrix with learned
embedding vectorization (LEV), a compact continuous mapping from
token indices to
embeddings. Leviathan's output head remains untied for a parameter increase of as low as 0.2%. Under controlled comparisons with identical
Transformer backbones, Leviathan consistently improves
language modeling performance over standard tied-
embedding baselines across a 200M-1.2B parameter regime on The Pile with gains that grow during training. At 1.2B scale, Leviathan reduces validation perplexity by 9%, requires $2.1\times$ fewer training
tokens to reach the tied baseline's final loss, and improves on all six downstream
benchmarks evaluated, including a 30% reduction in LAMBADA perplexity. Frequency-stratified analysis reveals gains to be concentrated in rare
tokens, where continuous parameterization reduces perplexity by 81%, falling to near zero for the most frequent.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.AI
Optimizing Agentic Workflows using Meta-tools
Sami Abuzakuk, Anne-Marie Kermarrec, Rishi Sharma et al. (+2 more)
Agentic AI enables LLM to dynamically reason, plan, and interact with tools to solve complex tasks. However, agentic workflows often require many iterative
reasoning steps and tool invocations, leading to significant operational expense, end-to-end latency and failures due to
hallucinations. This work introduces
Agent Workflow Optimization (AWO), a framework that identifies and optimizes redundant tool execution patterns to improve the efficiency and robustness of agentic workflows. AWO analyzes existing workflow traces to discover recurring sequences of tool calls and transforms them into meta-tools, which are deterministic, composite tools that bundle multiple
agent actions into a single invocation. Meta-tools bypass unnecessary intermediate LLM
reasoning steps and reduce operational cost while also shortening execution paths, leading to fewer failures. Experiments on two agentic AI
benchmarks show that AWO reduces the number of LLM calls up to 11.9% while also increasing the task success rate by up to 4.2 percent points.
Read the full abstract ▾
All authors Sami Abuzakuk, Anne-Marie Kermarrec, Rishi Sharma, Rasmus Moorits Veski, Martijn de Vos