Machine Learning · Cross-listed from cs.CV
Beyond Closed-Pool Video Retrieval: A Benchmark and Agent Framework for Real-World Video Search and Moment Localization
Tao Yu, Yujia Yang, Haopeng Jin et al. (+17 more)
Traditional
video retrieval benchmarks focus on matching precise descriptions to closed
video pools, failing to reflect real-world searches characterized by fuzzy, multi-dimensional
memories on the open web. We present RVMS-Bench, a comprehensive system for evaluating real-world
video memory search. It consists of 1,440 samples spanning 20 diverse categories and four duration groups, sourced from real-world open-web
videos. RVMS-Bench utilizes a hierarchical description framework encompassing Global Impression, Key Moment, Temporal Context, and Auditory
Memory to mimic realistic multi-dimensional search cues, with all samples strictly verified via a human-in-the-loop protocol. We further propose RACLO, an agentic framework that employs abductive
reasoning to simulate the human “Recall-Search-Verify” cognitive process, effectively addressing the challenge of searching for
videos via fuzzy
memories in the real world. Experiments reveal that existing MLLMs still demonstrate insufficient capabilities in real-world
Video Retrieval and Moment Localization based on fuzzy
memories. We believe this work will facilitate the advancement of
video retrieval robustness in real-world unstructured scenarios.
Read the full abstract ▾
All authors Tao Yu, Yujia Yang, Haopeng Jin, Junhao Gong, Xinlong Chen, Yuxuan Zhou, Shanbin Zhang, Jiabing Yang, Xinming Wang, Hongzhu Yi, Ping Nie, Kai Zou, Zhang Zhang, Yan Huang, Liang Wang, Yeshani, Ruiwen Tao, Jin Ma, Haijin Liang, Jinwen Luo
Machine Learning · Cross-listed from q-bio.GN
STRAND: Sequence-Conditioned Transport for Single-Cell Perturbations
Boyang Fu, Sameer Gabbita, George Dasoulas et al. (+5 more)
Prediction of the transcriptional response of a
cell to a genetic perturbation is a central problem in the computational modeling of gene regulation. Perturbations of the same gene can produce different transcriptional responses depending on the targeted locus, such as an alternative transcription start site or a distal regulatory element, and gene-level perturbation models represent these distinct interventions with a single gene identifier. We introduce STRAND, a generative model that encodes the regulatory DNA sequence at the perturbation locus and uses this encoding to parameterize a conditional transport process from control to perturbed single-
cell states. Sequence conditioning enables zero-shot prediction for perturbation targets absent from training and supports locus-resolved inputs at 128 bp model resolution within a 524 kb sequence window. On CRISPRi screens in K562, Jurkat, and RPE1
cells, STRAND achieves the best average rank on few-shot and unseen-gene
benchmarks, with gains of up to 33% in perturbation discrimination, and improves transfer to held-out
cell lines by up to 0.12 in $\Delta$Pearson. Ablation studies attribute these gains to sequence conditioning and to conditional transport. At the locus level, STRAND distinguishes alternative transcription start sites and validated regulatory elements that gene-identifier models represent as a single perturbation. STRAND is available at https://github.com/mims-harvard/STRAND.
Read the full abstract ▾
All authors Boyang Fu, Sameer Gabbita, George Dasoulas, Xiang Lin, Shanghua Gao, Xiaorui Su, Soumya Ghosh, Marinka Zitnik
Machine Learning
Biases in the Blind Spot: Detecting What LLMs Fail to Mention
Iván Arcuschin, David Chanin, Adrià Garriga-Alonso et al. (+1 more)
Large
Language Models (LLMs) often provide chain-of-thought (CoT)
reasoning traces that appear plausible, but may hide internal biases. We call these unverbalized biases. Monitoring models via their stated
reasoning is therefore unreliable, and existing bias evaluations typically require predefined categories and hand-crafted
datasets. In this work, we introduce a fully automated, black-box pipeline for detecting task-specific unverbalized biases. Given a task
dataset, the pipeline uses LLM autoraters to generate candidate bias concepts. It then tests each concept on progressively larger input samples by generating positive and negative variations, and applies statistical techniques for multiple testing and early stopping. A concept is flagged as an unverbalized bias if it yields statistically significant performance differences while not being cited as justification in the model's CoTs. We evaluate our pipeline across seven LLMs on three decision tasks (hiring, loan approval, and university admissions). Our technique automatically discovers previously unknown biases in these models (e.g., Spanish fluency, English proficiency, writing formality). In the same run, the pipeline also validates biases that were manually identified by prior work (gender, race, religion, ethnicity). More broadly, our proposed approach provides a practical, scalable path to automatic, more efficient, and broader task-specific unverbalized bias discovery.
Read the full abstract ▾
All authors Iván Arcuschin, David Chanin, Adrià Garriga-Alonso, Oana-Maria Camburu
Machine Learning · Cross-listed from cs.CV
Olaf-World: Orienting Latent Actions for Video World Modeling
Yuxin Jiang, Yuchao Gu, Ivor W. Tsang et al. (+1 more)
Scaling action-controllable world models is limited by the scarcity of action labels. While latent action learning promises to extract control interfaces from unlabeled
video, learned latents often fail to transfer across contexts: they entangle scene-specific cues and lack a shared coordinate system. This occurs because standard objectives operate only within each clip, providing no mechanism to align action semantics across contexts. Our key insight is that although actions are unobserved, their semantic effects are observable and can serve as a shared reference. We introduce Seq$\Delta$-REPA, a sequence-level control-effect
alignment objective that anchors integrated latent action to temporal feature differences from a frozen, self-supervised
video encoder. Building on this, we present Olaf-World, a pipeline that pretrains action-conditioned
video world models from large-scale passive
video. Extensive experiments demonstrate that our method learns a more structured latent action space, leading to stronger zero-shot action transfer and more data-efficient adaptation to new control interfaces than state-of-the-art baselines.
Read the full abstract ▾
All authors Yuxin Jiang, Yuchao Gu, Ivor W. Tsang, Mike Zheng Shou
Machine Learning
Towards Explainable Federated Learning: Understanding the Impact of Differential Privacy
Júlio Oliveira, Rodrigo Ferreira, André Riker et al. (+2 more)
Data
privacy and eXplainable Artificial Intelligence (XAI) are two important aspects for modern Machine Learning systems. To enhance data
privacy, recent machine learning models have been designed as a
Federated Learning (FL) system. On top of that, additional
privacy layers can be added, via Differential
Privacy (DP). On the other hand, to improve explainability, ML must consider more interpretable approaches with reduced number of features and less complex internal architecture. In this context, this paper aims to achieve a machine learning (ML) model that combines enhanced data
privacy with explainability. So, we propose a FL solution, called
Federated EXplainable Trees with Differential
Privacy (FEXT-DP), that: (i) is based on Decision Trees, since they are lightweight and have superior explainability than neural networks-based FL systems; (ii) provides additional layer of data
privacy protection applying Differential
Privacy (DP) to the Tree-Based model. However, there is a side effect adding DP: it harms the explainability of the system. So, this paper also presents the impact of DP protection on the explainability of the ML model, analyzing the obtained results for SHAP (SHapley Additive exPlanations) and Mean Decrease in
Impurity (MDI).
Read the full abstract ▾
All authors Júlio Oliveira, Rodrigo Ferreira, André Riker, Glaucio H. S. Carvalho, Eirini Eleni Tsilopoulou
Machine Learning
Learning on the Manifold: Unlocking Standard Diffusion Transformers with Representation Encoders
Amandeep Kumar and Vishal M. Patel
Leveraging representation encoders for generative modeling offers a path for efficient, high-fidelity synthesis. However, standard
diffusion transformers fail to converge on these representations directly. While recent work attributes this to a capacity bottleneck proposing computationally expensive width scaling of
diffusion transformers we demonstrate that the failure is fundamentally
geometric. We identify
Geometric Interference as the root cause: standard Euclidean flow matching forces probability paths through the low-density interior of the hyperspherical feature space of representation encoders, rather than following the
manifold surface. To resolve this, we propose Riemannian Flow Matching with Jacobi Regularization (RJF). By constraining the generative process to the
manifold geodesics and correcting for
curvature-induced error propagation, RJF enables standard
Diffusion Transformer architectures to converge without width scaling. Our method RJF enables the standard DiT-B architecture (131M parameters) to converge effectively, achieving an FID of 3.37 where prior methods fail to converge. Code: https://github.com/amandpkr/RJF
Read the full abstract ▾
Machine Learning
Step-resolved data attribution for looped transformers
Georgios Kaissis, David Mildenberger, Juan Felipe Gomez et al. (+2 more)
We study how individual training examples shape the internal computation of looped
transformers, where a shared block is applied for $\tau$ recurrent iterations to enable latent
reasoning. Existing training-data influence
estimators such as TracIn yield a single scalar score that aggregates over all loop iterations, obscuring when during the recurrent computation a training example matters. We introduce Step-Decomposed Influence (SDI), which decomposes TracIn into a length-$\tau$ influence trajectory by unrolling the recurrent computation graph and attributing influence to specific loop iterations. To make SDI practical at
transformer scale, we propose a TensorSketch implementation that never materialises per-example gradients. Experiments on looped GPT-style models and algorithmic
reasoning tasks show that SDI scales excellently, matches full-gradient baselines with low error and supports a broad range of data attribution and interpretability tasks with per-step insights into the latent
reasoning process.
Read the full abstract ▾
All authors Georgios Kaissis, David Mildenberger, Juan Felipe Gomez, Martin J. Menten, Eleni Triantafillou
Machine Learning · Cross-listed from cs.CV
Causality in Video Diffusers is Separable from Denoising
Xingjian Bai, Guande He, Zhengqi Li et al. (+3 more)
Causality – referring to temporal, uni-directional cause-effect relationships between components – underlies many complex generative processes, including
videos,
language, and
robot trajectories. Current causal
diffusion models entangle temporal
reasoning with iterative denoising, applying causal
attention across all layers, at every denoising step, and over the entire context. In this paper, we show that the causal
reasoning in these models is separable from the multi-step denoising process. Through systematic probing of autoregressive
video diffusers, we uncover two key regularities: (1) early layers produce highly similar features across denoising steps, indicating redundant computation along the
diffusion trajectory; and (2) deeper layers exhibit sparse cross-frame
attention and primarily perform intra-frame rendering. Motivated by these findings, we introduce Separable Causal
Diffusion (SCD), a new architecture that explicitly decouples once-per-frame temporal
reasoning, via a causal
transformer encoder, from multi-step frame-wise rendering, via a lightweight
diffusion decoder. Extensive experiments on both pretraining and post-training tasks across synthetic and real
benchmarks show that SCD significantly improves throughput and per-frame latency while matching or surpassing the generation quality of strong causal
diffusion baselines.
Read the full abstract ▾
All authors Xingjian Bai, Guande He, Zhengqi Li, Eli Shechtman, Xun Huang, Zongze Wu
Machine Learning · Cross-listed from cs.AI
Agent World Model: Infinity Synthetic Environments for Agentic Reinforcement Learning
Zhaoyang Wang, Canwen Xu, Boyi Liu et al. (+5 more)
Recent advances in large
language model (LLM) have empowered autonomous
agents to perform multi-turn interactions with tools and environments. However, scaling such
agent training is limited by the lack of diverse and reliable environments. In this paper, we propose
Agent World Model (AWM), a fully synthetic environment generation pipeline. Using this pipeline, we scale to 1,000 environments covering everyday scenarios, in which
agents can interact with rich toolsets and obtain high-quality observations. Notably, these environments are code-driven and backed by databases, providing more reliable and consistent state transitions than environments simulated by LLMs. Moreover, they enable more efficient
agent interaction compared with collecting trajectories from realistic environments. To demonstrate the effectiveness of this resource, we perform large-scale reinforcement learning for multi-turn tool-use
agents. Thanks to the fully executable environments and accessible database states, we can also design reliable reward functions. Experiments on three
benchmarks show that training exclusively in synthetic environments, rather than
benchmark-specific ones, yields strong out-of-distribution generalization. The code is available at https://github.com/Snowflake-Labs/
agent-world-model.
Read the full abstract ▾
All authors Zhaoyang Wang, Canwen Xu, Boyi Liu, Yite Wang, Siwei Han, Zhewei Yao, Huaxiu Yao, Yuxiong He
Machine Learning
Features as Rewards: Scalable Supervision for Open-Ended Tasks via Interpretability
Aaditya Vikram Prasad, Connor Watts, Jack Merullo et al. (+4 more)
Language models trained on large-scale
datasets have been shown to learn features that encode abstract concepts such as factuality or intent. Such features are traditionally used for test-time monitoring or steering. We present an alternative affordance: features as scalable supervision for open-ended tasks. We consider the case of
hallucination-reduction as a desirable, yet open-ended behavior and design a reinforcement learning (RL) pipeline, titled RLFR (Reinforcement Learning from Feature Rewards), that uses features as reward functions. Grounded in a novel probing framework that identifies candidate hallucinated claims, our pipeline teaches a model to intervene and correct its completions when it is uncertain of their factuality. Furthermore, the pipeline enables scalable test-time compute, guided once more by our reward features. This end-to-end process operationalized on Gemma-3-12B-IT results in a policy that is 58% less likely to hallucinate compared to the original model (when run in tandem with our probing harness), while preserving performance on standard
benchmarks. Taken together, by grounding supervision in the
language of features, this paper introduces a novel paradigm in the use of interpretability for learning open-ended tasks.
Read the full abstract ▾
All authors Aaditya Vikram Prasad, Connor Watts, Jack Merullo, Dhruvil Gala, Owen Lewis, Thomas McGrath, Ekdeep Singh Lubana
Machine Learning
Vendi Novelty Scores for Out-of-Distribution Detection
Amey P. Pasarkar and Adji Bousso Dieng
Out-of-distribution (OOD) detection is critical for the safe deployment of machine learning systems. Existing post-hoc detectors typically rely on model confidence scores or likelihood estimates in feature space, often under restrictive distributional assumptions. In this work, we introduce a third paradigm and formulate OOD detection from a diversity perspective. We propose the Vendi Novelty Score (VNS), an OOD detector based on the Vendi Scores (VS), a family of similarity-based diversity metrics. VNS quantifies how much a test sample increases the VS of the in-distribution feature set, providing a principled notion of novelty that does not require density modeling. VNS is linear-time, non-parametric, and naturally combines class-conditional (local) and
dataset-level (global) novelty signals. Across multiple image classification
benchmarks and network architectures, VNS achieves state-of-the-art OOD detection performance. Remarkably, VNS retains this performance when computed using only 1% of the training data, enabling deployment in
memory- or access-constrained settings.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.SD
Evaluating Disentangled Representations for Controllable Music Generation
Laura Ibáñez-Martínez, Chukwuemeka Nkama, Andrea Poltronieri et al. (+2 more)
Recent approaches in music generation rely on disentangled representations, often labeled as structure and timbre or local and global, to enable controllable synthesis. Yet the underlying properties of these
embeddings remain underexplored. In this work, we evaluate such disentangled representations in a set of music audio models for controllable generation using a probing-based framework that goes beyond standard downstream tasks. The selected models reflect diverse unsupervised disentanglement strategies, including inductive biases, data augmentations,
adversarial objectives, and staged training procedures. We further isolate specific strategies to analyze their effect. Our analysis spans four key axes: informativeness, equivariance, invariance, and disentanglement, which are assessed across
datasets, tasks, and controlled transformations. Our findings reveal inconsistencies between intended and actual semantics of the
embeddings, suggesting that current strategies fall short of producing truly disentangled representations, and prompting a re-examination of how controllability is approached in music generation.
Read the full abstract ▾
All authors Laura Ibáñez-Martínez, Chukwuemeka Nkama, Andrea Poltronieri, Xavier Serra, Martín Rocamora
Machine Learning
WildCat: Near-Linear Attention in Theory and Practice
Tobias Schröder and Lester Mackey
We introduce WildCat, a high-accuracy, low-cost approach to compressing the
attention mechanism in neural networks. While
attention is a staple of modern network architectures, it is also notoriously expensive to deploy due to resource requirements that scale quadratically with the input sequence length $n$. WildCat avoids these quadratic costs by only attending over a small weighted coreset. Crucially, we select the coreset using a fast but spectrally-accurate subsampling
algorithm – randomly pivoted Cholesky – and weight the elements optimally to minimise reconstruction error. Remarkably, given bounded inputs, WildCat approximates exact
attention with super-
polynomial $O(n^{-\sqrt{\log(\log(n))}})$ error decay while running in near-linear $O(n^{1+o(1)})$ time. In contrast, prior practical approximations either lack error guarantees or require quadratic runtime to guarantee such high fidelity. We couple this advance with a GPU-optimized PyTorch implementation and a suite of
benchmark experiments demonstrating the benefits of WildCat for image generation, image classification, and
language model KV cache compression.
Read the full abstract ▾
Machine Learning
Long Chain-of-Thought Compression via Fine-Grained Group Policy Optimization
Xinchen Han, Hossam Afifi, Michel Marot et al. (+2 more)
Large
Language Models (LLMs) often generate unnecessarily verbose Chain-of-Thought (CoT)
reasoning that increases computational costs and latency without proportional performance gains. In this paper, we propose Fine-grained Group policy Optimization (FGO), a Reinforcement Learning (RL)
algorithm that refines group responses by subdividing them and assigning appropriate weights based on length and
entropy, thereby enabling effective CoT compression. Meanwhile, as an enhanced variant of Group Relative Policy Optimization (GRPO), FGO successfully addresses two major limitations of the GRPO: inefficient data utilization and
entropy collapse. We evaluate FGO on multiple
reasoning LLMs and
benchmarks, including MATH500, AIME24, AMC23, and Minerva. Experimental results show that FGO achieves efficient CoT compression without degrading performance, and simultaneously resolves the key limitations of GRPO. Code: https://github.com/Mr-XcHan/FGO.
Read the full abstract ▾
All authors Xinchen Han, Hossam Afifi, Michel Marot, Xilu Wang, Lu Yin
Machine Learning · Cross-listed from cs.CV
Conformal Prediction Sets for Instance Segmentation
Kerri Lu, Dan M. Kluger, Stephen Bates et al. (+1 more)
Current instance
segmentation models achieve high performance on average predictions, but lack principled uncertainty quantification: their outputs are not calibrated, and there is no guarantee that a predicted mask is close to the ground truth. To address this limitation, we introduce a conformal prediction
algorithm to generate adaptive confidence sets for instance
segmentation. Given an image and a pixel coordinate query, our
algorithm generates a confidence set of instance predictions for that pixel, with a provable guarantee for the probability that at least one of the predictions has high Intersection-Over-Union (IoU) with the true object instance mask. We apply our
algorithm to instance
segmentation examples in agricultural field delineation,
cell segmentation, and vehicle detection. Empirically, we find that our prediction sets vary in size based on query difficulty and attain the target coverage, outperforming baselines (naive best parameter and morphological dilation-based methods). We provide versions of the
algorithm with asymptotic and finite sample guarantees. Our work is the first to capture structural uncertainty in instance
segmentation by constructing confidence sets of diverse
segmentation predictions.
Read the full abstract ▾
All authors Kerri Lu, Dan M. Kluger, Stephen Bates, Sherrie Wang
Machine Learning
Optimistic World Models: Efficient Exploration in Model-Based Deep Reinforcement Learning
Akshay Mete, Shahid Aamir Sheikh, Tzu-Hsiang Lin et al. (+2 more)
Efficient exploration remains a central challenge in reinforcement learning (RL), particularly in sparse-reward environments. We introduce Optimistic World Models (OWMs), a principled and scalable framework for optimistic exploration that brings classical reward-biased maximum likelihood estimation (RBMLE) from adaptive control into deep RL. In contrast to upper confidence bound (UCB)-style exploration methods, OWMs incorporate optimism directly into model learning by augmentation with an optimistic dynamics loss that biases imagined transitions toward higher-reward outcomes. This fully gradient-based loss requires neither uncertainty estimates nor constrained optimization. Our approach is plug-and-play with existing world model frameworks, preserving scalability while requiring only minimal modifications to standard training procedures. We instantiate OWMs within two state-of-the-art world model architectures, leading to Optimistic DreamerV3 and Optimistic STORM, which demonstrate significant improvements in sample efficiency and cumulative return compared to their baseline counterparts.
Read the full abstract ▾
All authors Akshay Mete, Shahid Aamir Sheikh, Tzu-Hsiang Lin, Dileep Kalathil, P. R. Kumar
Machine Learning
Effectiveness of Binary Autoencoders for QUBO-Based Optimization Problems
Tetsuro Abe, Masashi Yamashita and Shu Tanaka
In black-box combinatorial optimization, objective evaluations are often expensive, so high quality solutions must be found under a limited budget. Factorization machine with
quantum annealing (FMQA) builds a quadratic surrogate model from evaluated samples and optimizes it on an Ising machine. However, FMQA requires binary decision variables, and for nonbinary structures such as integer permutations, the choice of binary encoding strongly affects search efficiency. If the encoding fails to reflect the original neighborhood structure, small Hamming moves may not correspond to meaningful modifications in the original solution space, and constrained problems can yield many infeasible candidates that waste evaluations. Recent work combines FMQA with a binary autoencoder (bAE) that learns a compact binary latent code from feasible solutions, yet the mechanism behind its performance gains is unclear. Using a small traveling salesman problem as an interpretable testbed, we show that the bAE reconstructs feasible tours accurately and, compared with manually designed encodings at similar compression, better aligns tour distances with latent Hamming distances, yields smoother neighborhoods under small bit flips, and produces fewer local optima. These
geometric properties explain why bAE+FMQA improves the approximation ratio faster while maintaining feasibility throughout optimization, and they provide guidance for designing latent representations for black-box optimization.
Read the full abstract ▾
Machine Learning
Graph Learning Should Move Beyond Restrictive Views of Spectral and Message-Passing GNNs
Antonis Vasileiou, Juan Cervino, Pascal Frossard et al. (+7 more)
Graph neural networks (GNNs) are commonly divided into message-passing neural networks (MPNNs) and spectral GNNs, reflecting two largely separate research traditions in machine learning and signal processing. While MPNNs have a precise definition, there is no widely accepted criterion for what makes a mapping a spectral GNN. Most existing work restricts spectral GNNs to layered architectures based on linear spectral filters. Under this restriction, we show that spectral and spatial GNNs have largely equivalent expressive power. To promote progress in the field, we propose a precise definition of spectral GNNs based on eigenbasis
symmetries, in contrast to the definition of MPNNs via neighborhood permutation
symmetries. We further argue that the two perspectives offer complementary strengths. MPNNs provide a natural
language for discrete structure and expressivity analysis through tools from logic and graph isomorphism, while the spectral perspective offers principled tools for understanding smoothing, bottlenecks, stability, and community structure. Overall, we argue that progress in graph learning will be accelerated by clarifying the similarities and differences between these perspectives and by moving toward a unified theoretical framework.
Read the full abstract ▾
All authors Antonis Vasileiou, Juan Cervino, Pascal Frossard, Charilaos I. Kanatsoulis, Christopher Morris, Michael T. Schaub, Pierre Vandergheynst, Zhiyang Wang, Guy Wolf, Ron Levie
Machine Learning
ADORA: Training Reasoning Models with Dynamic Advantage Estimation on Reinforcement Learning
Qingnan Ren, Shiting Huang, Zhen Fang et al. (+4 more)
Reinforcement learning has become a cornerstone technique for developing
reasoning models in complex tasks, ranging from mathematical problem-solving to imaginary
reasoning. The optimization of these models typically relies on policy gradient methods, whose efficacy hinges on the accurate estimation of an advantage function. However, prevailing methods typically employ static advantage estimation, a practice that leads to inefficient credit assignment by neglecting the dynamic utility of training samples over time. This limitation results in suboptimal policy updates, which in turn manifest as slower convergence rates and increased learning instability, as models fail to adapt to evolving sample utilities effectively. To address this problem, we introduce ADORA (Advantage Dynamics via Online Rollout Adaptation), a novel framework for policy optimization. ADORA dynamically adjusts the advantage function's weighting by adaptively categorizing training data into temporarily advantageous and disadvantageous samples, based on their evolving utility during online model rollouts. This tailored data differentiation strategy allows ADORA to be seamlessly integrated into existing policy optimization
algorithms without significant architectural modifications, enabling the policy to prioritize learning from more informative experiences and thereby achieve more efficient policy updates. Extensive evaluations across diverse model families and varying data scales demonstrate that ADORA is a robust and efficient framework. It significantly enhances long
reasoning in both
geometric and mathematical tasks, consistently achieving notable performance gains without requiring sensitive hyperparameter tuning.
Read the full abstract ▾
All authors Qingnan Ren, Shiting Huang, Zhen Fang, Zehui Chen, Lin Chen, Lijun Li, Feng Zhao
Machine Learning
A Task-Centric Theory for Iterative Self-Improvement with Easy-to-Hard Curricula
Chenruo Liu, Yijun Dong, Yiqiu Shen et al. (+1 more)
Iterative self-improvement fine-tunes an autoregressive large
language model (LLM) on reward-verified outputs generated by the LLM itself. In contrast to the empirical success of self-improvement, the theoretical foundation of this generative, iterative procedure in a practical, finite-sample setting remains limited. We make progress toward this goal by modeling each round of self-improvement as maximum-likelihood fine-tuning on a reward-filtered distribution and deriving finite-sample guarantees for the expected reward. Our analysis reveals an explicit feedback loop where better models accept more data per iteration, supporting sustained self-improvement while explaining eventual saturation of such improvement. Adopting a task-centric view by considering
reasoning tasks with multiple difficulty levels, we further prove quantifiable conditions on model initialization, task difficulty, and sample budget where easy-to-hard curricula provably achieve better guarantees than training on fixed mixtures of tasks. Our analyses are validated through Monte-Carlo simulations and experiments spanning a synthetic graph-based
reasoning task and multiple standard mathematical
reasoning benchmarks.
Read the full abstract ▾
All authors Chenruo Liu, Yijun Dong, Yiqiu Shen, Qi Lei
Machine Learning
Answer First, Reason Later: Aligning Search Relevance via Mode-Balanced Reinforcement Learning
Shijie Zhang, Xiang Guo, Rujun Guo et al. (+4 more)
Building a search relevance model that achieves both low latency and high performance is a long-standing challenge in the search industry. To satisfy the millisecond-level response requirements of online systems while retaining the interpretable
reasoning traces of Large
Language Models (LLMs), we propose a novel Answer-First, Reason Later (AFRL) paradigm. This paradigm requires the model to output the definitive relevance score in the very first
token, followed by a structured logical explanation. Inspired by the success of
reasoning models, we adopt a "Supervised Fine-Tuning (SFT) + Reinforcement Learning (RL)" pipeline to achieve AFRL. However, directly applying existing RL training often leads to mode collapse in the search relevance task, where the model forgets complex long-tail rules in pursuit of high rewards. From an information theory perspective: RL inherently minimizes the Reverse KL divergence, which tends to seek probability peaks (mode-seeking) and is prone to "reward hacking." On the other hand, SFT minimizes the Forward KL divergence, forcing the model to cover the data distribution (mode-covering) and effectively anchoring expert rules. Based on this insight, we propose a Mode-Balanced Optimization strategy, incorporating an SFT auxiliary loss into Stepwise-GRPO training to balance these two properties. Furthermore, we construct an automated instruction
evolution system and a multi-stage curriculum to ensure expert-level data quality. Extensive experiments demonstrate that our 32B teacher model achieves state-of-the-art performance. Moreover, the AFRL architecture enables efficient knowledge
distillation, successfully transferring expert-level logic to a 0.6B model, thereby reconciling
reasoning depth with deployment latency.
Read the full abstract ▾
All authors Shijie Zhang, Xiang Guo, Rujun Guo, Shaoyu Liu, Xiaozhao Wang, Guanjun Jiang, Kevin Zhang
Machine Learning
Empirical Stability Analysis of Kolmogorov-Arnold Networks in Hard-Constrained Recurrent Physics-Informed Discovery
Enzo Nicolas Spotorno, Josafat Leal Filho and Antonio Augusto Medeiros Frohlich
We investigate the integration of Kolmogorov-Arnold Networks (KANs) into hard-constrained recurrent physics-informed architectures (HRPINN) to evaluate the fidelity of learned residual
manifolds in oscillatory systems. Motivated by the Kolmogorov-Arnold representation
theorem and preliminary gray-box results, we hypothesized that KANs would enable efficient recovery of unknown terms compared to MLPs. Through initial sensitivity analysis on configuration sensitivity, parameter scale, and training paradigm, we found that while small KANs are competitive on univariate
polynomial residuals (Duffing), they exhibit severe hyperparameter fragility, instability in deeper configurations, and consistent failure on multiplicative terms (Van der Pol), generally outperformed by standard MLPs. These empirical challenges highlight limitations of the additive inductive bias in the original KAN formulation for state coupling and provide preliminary empirical evidence of inductive bias limitations for future hybrid modeling.
Read the full abstract ▾
Machine Learning
Infusion: Shaping Model Behavior by Editing Training Data via Influence Functions
J Rosser, Robert Kirk, Edward Grefenstette et al. (+2 more)
Influence functions are commonly used to attribute model behavior to training documents. We explore the reverse: crafting training data that induces model behavior. Our framework, Infusion, uses scalable influence-function approximations to compute small perturbations to training documents that induce targeted changes in model behavior through parameter shifts. We evaluate Infusion on data poisoning tasks across
vision and
language domains. On CIFAR-10, we show that making subtle edits via Infusion to just 0.2% (100/45,000) of the training documents can be competitive with the baseline of inserting a small number of explicit behavior examples. We also find that Infusion transfers across architectures (ResNet $\leftrightarrow$ CNN), suggesting a single poisoned corpus can affect multiple independently trained models. In preliminary
language experiments, we characterize when our approach increases the probability of target behaviors and when it fails, finding it most effective at amplifying behaviors the model has already learned. Taken together, these results show that small, subtle edits to training data can systematically shape model behavior, underscoring the importance of training data interpretability for adversaries and defenders alike. We provide the code here: https://github.com/jrosseruk/infusion.
Read the full abstract ▾
All authors J Rosser, Robert Kirk, Edward Grefenstette, Jakob Foerster, Laura Ruis
Machine Learning
Online Monitoring Framework for Automotive Time Series Data using JEPA Embeddings
Alexander Fertig, Karthikeyan Chandra Sekaran, Lakshman Balasubramanian et al. (+1 more)
As autonomous vehicles are rolled out, measures must be taken to ensure their safe operation. In order to supervise a system that is already in operation, monitoring frameworks are frequently employed. These run continuously online in the background, supervising the system status and recording anomalies. This work proposes an online monitoring framework to detect anomalies in object state representations. Thereby, a key challenge is creating a framework for anomaly detection without anomaly labels, which are usually unavailable for unknown anomalies. To address this issue, this work applies a self-supervised
embedding method to translate object data into a latent representation space. For this, a JEPA-based self-supervised prediction task is constructed, allowing training without anomaly labels and the creation of rich object
embeddings. The resulting expressive JEPA
embeddings serve as input for established anomaly detection methods, in order to identify anomalies within object state representations. This framework is particularly useful for applications in real-world environments, where new or unknown anomalies may occur during operation for which there are no labels available. Experiments performed on the publicly available, real-world nuScenes
dataset illustrate the framework's capabilities.
Read the full abstract ▾
All authors Alexander Fertig, Karthikeyan Chandra Sekaran, Lakshman Balasubramanian, Michael Botsch
Machine Learning · Cross-listed from cs.CV
Coupled Inference in Diffusion Models for Semantic Decomposition
Calvin Yeung, Ali Zakeri, Zhuowen Zou et al. (+1 more)
Many visual scenes can be described as compositions of latent factors. Effective recognition,
reasoning, and editing often require not only forming such compositional representations, but also solving the decomposition problem. One popular choice for constructing these representations is through the binding operation. Resonator networks, which can be understood as coupled Hopfield networks, were proposed as a way to perform decomposition on such bound representations. Recent works have shown notable similarities between Hopfield networks and
diffusion models. Motivated by these observations, we introduce a framework for semantic decomposition using coupled inference in
diffusion models. Our method frames semantic decomposition as an inverse problem and couples the
diffusion processes using a reconstruction-driven guidance term that encourages the composition of factor estimates to match the bound vector. We also introduce a novel iterative sampling scheme that improves the performance of our model. Finally, we show that
attention-based resonator networks are a special case of our framework. Empirically, we demonstrate that our coupled inference framework outperforms resonator networks across a range of synthetic semantic decomposition tasks.
Read the full abstract ▾
All authors Calvin Yeung, Ali Zakeri, Zhuowen Zou, Mohsen Imani
Machine Learning
Supervised Metric Regularization Through Alternating Optimization for Multi-Regime Physics-Informed Neural Networks
Enzo Nicolas Spotorno, Josafat Ribeiro Leal and Antonio Augusto Frohlich
Standard Physics-Informed Neural Networks (PINNs) often face challenges when modeling parameterized dynamical systems with sharp regime transitions, such as bifurcations. In these scenarios, the continuous mapping from parameters to solutions can result in spectral bias or "mode collapse", where the network averages distinct physical behaviors. We propose a
Topology-Aware PINN (TAPINN) that aims to mitigate this challenge by structuring the latent space via Supervised Metric Regularization. Unlike standard parametric PINNs that map physical parameters directly to solutions, our method conditions the solver on a latent state optimized to reflect the metric-based separation between regimes, showing ~49% lower physics residual (0.082 vs. 0.160). We train this architecture using a phase-based Alternating Optimization (AO) schedule to manage gradient conflicts between the metric and physics objectives. Preliminary experiments on the Duffing Oscillator demonstrate that while standard baselines suffer from spectral bias and high-capacity Hypernetworks overfit (memorizing data while violating physics), our approach achieves stable convergence with 2.18x lower gradient variance than a multi-output Sobolev Error baseline, and 5x fewer parameters than a hypernetwork-based alternative.
Read the full abstract ▾
Machine Learning
Causal Multi-Task Demand Learning
Varun Gupta and Vijay Kamble
We study multi-task demand learning for retail pricing, where firms seek to estimate heterogeneous linear price-response functions across many decision contexts. Each context has rich
covariates but limited price variation, motivating transfer across tasks. However, such transfer is complicated by endogeneity: prices may be arbitrarily correlated with unobserved task-level demand determinants. We propose a meta-learning framework that identifies the conditional mean of task-specific causal demand parameters despite this confounding, provided each task contains at least two distinct, locally exogenous price points. The key is to carefully design the information available to the learner. We condition on the full price history to address cross-task confounding, but withhold the demand outcomes associated with two locally exogenous price points to preserve identifiability. These withheld outcomes provide supervision through a randomized query. We establish that this information design is maximally uniformly valid for the squared-loss objective: any refinement of the conditioning set that reveals information about the withheld outcomes or the query index admits a data-generating process under which the objective no longer identifies the conditional mean causal target. Synthetic experiments demonstrate improved estimation of causal demand parameters under strong confounding, while retail experiments show improved held-out demand prediction relative to standard transfer-learning baselines.
Read the full abstract ▾
Machine Learning
Drug Release Modeling using Physics-Informed Neural Networks
Daanish Aleem Qureshi, Khemraj Shukla and Vikas Srivastava
Accurate modeling of drug release is essential for designing and developing controlled-release systems. Classical models (Fick, Higuchi, Peppas) rely on simplifying assumptions that limit their accuracy in complex geometries and release mechanisms. Here, we propose a novel approach using Physics-Informed Neural Networks (PINNs) and
Bayesian PINNs (BPINNs) for predicting release from planar, 1D-wrinkled, and 2D-crumpled films. This approach uniquely integrates Fick's
diffusion law with limited experimental data to enable accurate long-term predictions from short-term measurements, and is systematically benchmarked against classical drug release models. We embedded Fick's second law into PINN as loss with 10,000 Latin-hypercube collocation points and utilized previously published experimental
datasets to assess drug release performance through mean absolute error (MAE) and root mean square error (RMSE), considering noisy conditions and limited-data scenarios. Our approach reduced mean error by up to 40% relative to classical baselines across all film types. The PINN formulation achieved RMSE <0.05 utilizing only the first 6% of the release time data (reducing 94% of release time required for the experiments) for the planar film. For wrinkled and crumpled films, the PINN reached RMSE <0.05 in 33% of the release time data. BPINNs provide tighter and more reliable uncertainty quantification under noise. By combining physical laws with experimental data, the proposed framework yields highly accurate long-term release predictions from short-term measurements, offering a practical route for accelerated characterization and more efficient early-stage drug release system formulation.
Read the full abstract ▾
Machine Learning · Cross-listed from math.ST
Statistical-Computational Trade-offs in Learning Multi-Index Models via Harmonic Analysis
Hugo Latourelle-Vigeant and Theodor Misiakiewicz
We study the problem of learning multi-index models (MIMs), where the label depends on the input $\boldsymbol{x} \in \mathbb{R}^d$ only through an unknown $\mathsf{s}$-dimensional projection $\boldsymbol{W}_*^\mathsf{T} \boldsymbol{x} \in \mathbb{R}^\mathsf{s}$. Exploiting the equivariance of this problem under the orthogonal group $\mathcal{O}_d$, we obtain a sharp harmonic-analytic characterization of the learning complexity for MIMs with spherically symmetric inputs – which refines and generalizes previous Gaussian-specific analyses. Specifically, we derive statistical and computational complexity lower bounds within the Statistical Query (SQ) and Low-Degree
Polynomial (LDP) frameworks. These bounds decompose naturally across spherical harmonic subspaces. Guided by this decomposition, we construct a family of spectral
algorithms based on harmonic tensor unfolding that sequentially recover the latent directions and (nearly) achieve these SQ and LDP lower bounds. Depending on the choice of harmonic degree sequence, these
estimators can realize a broad range of trade-offs between sample and runtime complexity. From a technical standpoint, our results build on the semisimple decomposition of the $\mathcal{O}_d$-action on $L^2 (\mathbb{S}^{d-1})$ and the intertwining isomorphism between spherical harmonics and traceless symmetric tensors.
Read the full abstract ▾
Machine Learning · Cross-listed from stat.ML
The Catastrophic Failure of The k-Means Algorithm in High Dimensions, and How Hartigan's Algorithm Avoids It
Roy R. Lederman, David Silva-Sánchez, Ziling Chen et al. (+3 more)
Lloyd's k-means
algorithm is one of the most widely used clustering methods. We prove that in high-dimensional, high-noise settings, the
algorithm exhibits catastrophic failure: with high probability, essentially every partition of the data is a fixed point. Consequently, Lloyd's
algorithm simply returns its initial partition - even when the underlying clusters are trivially recoverable by other methods. In contrast, we prove that Hartigan's k-means
algorithm does not exhibit this pathology. Our results show the stark difference between these
algorithms and offer a theoretical explanation for the empirical difficulties often observed with k-means in high dimensions.
Read the full abstract ▾
All authors Roy R. Lederman, David Silva-Sánchez, Ziling Chen, Gilles Mordant, Amnon Balanov, Tamir Bendory