Machine Learning
Learn Hard Problems During RL with Reference Guided Fine-tuning
Yangzhen Wu, Shanda Li, Zixin Wen et al. (+5 more)
Reinforcement learning (RL) for mathematical
reasoning can suffer from reward sparsity: for challenging problems, LLM fails to sample any correct trajectories, preventing RL from receiving meaningful positive feedback. At the same time, there often exist human-written reference solutions along with the problem (e.g., problems from AoPS), but directly fine-tuning on these solutions offers no benefit because models often cannot imitate human proofs that lie outside their own
reasoning distribution. We introduce Reference-Guided Fine-Tuning (ReGFT), a simple and effective method that utilizes human-written reference solutions to synthesize positive trajectories on hard problems and train on them before RL. For each problem, we provide the model with a partial reference solution and let it generate its own
reasoning trace, ensuring the resulting trajectories remain in the model's
reasoning space while still benefiting from reference guidance. Fine-tuning on these reference-guided trajectories increases the number of solvable problems and produces a checkpoint that receives more positive rewards during RL. Across three
benchmarks (AIME24, AIME25, BeyondAIME), ReGFT consistently improves supervised accuracy, accelerates DAPO training, and raises the final performance plateau of RL. Our results show that ReGFT effectively overcomes reward sparsity and unlocks stronger RL-based mathematical
reasoning.
Read the full abstract ▾
All authors Yangzhen Wu, Shanda Li, Zixin Wen, Xin Zhou, Ameet Talwalkar, Yiming Yang, Wenhao Huang, Tianle Cai
Machine Learning · Cross-listed from cs.CL
Frédéric Berdoz, Yann Billeter, Yann Vonlanthen et al. (+1 more)
Opinion modeling aims to capture individual or group political preferences, enabling applications such as digital democracies, where models could help shape fairer and more popular policies. Given their versatility, strong generalization capabilities, and demonstrated success across diverse text-to-text applications, large
language models (LLMs) are natural candidates for this task. However, due to their statistical nature and limited causal understanding, they tend to produce biased opinions when prompted naively. In this work, we study whether
reasoning can improve opinion
alignment. Motivated by the recent advancement in mathematical
reasoning enabled by reinforcement learning (RL), we train models to produce profile-consistent answers through structured
reasoning. We evaluate our approach on three
datasets covering U.S., European, and Swiss politics. Results indicate that
reasoning enhances opinion modeling and is competitive with strong baselines, but does not fully remove bias, highlighting the need for additional mechanisms to build faithful political digital twins using LLMs. By releasing both our method and
datasets, we establish a solid baseline to support future research on LLM opinion
alignment.
Read the full abstract ▾
All authors Frédéric Berdoz, Yann Billeter, Yann Vonlanthen, Roger Wattenhofer
Machine Learning · Cross-listed from cs.MA
Can AI Agents Agree?
Frédéric Berdoz, Leonardo Rugli and Roger Wattenhofer
Large
language models are increasingly deployed as cooperating
agents, yet their behavior in
adversarial consensus settings has not been systematically studied. We evaluate LLM-based
agents on a Byzantine consensus game over scalar values using a synchronous all-to-all simulation. We test consensus in a no-stake setting where
agents have no preferences over the final value, so evaluation focuses on agreement rather than value optimality. Across hundreds of simulations spanning model sizes, group sizes, and Byzantine fractions, we find that valid agreement is not reliable even in benign settings and degrades as group size grows. Introducing a small number of Byzantine
agents further reduces success. Failures are dominated by loss of liveness, such as timeouts and stalled convergence, rather than subtle value corruption. Overall, the results suggest that reliable agreement is not yet a dependable emergent capability of current LLM-
agent groups even in no-stake settings, raising caution for deployments that rely on robust coordination.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.AI
Evaluating Agents Across Runtime Contracts: When Mismatch Costs Efficiency or Quality
Victor May, Van Khue Nguyen, Aaditya Salgarkar et al. (+3 more)
In CodeAct,
language-model
agents write Python that calls tools and use execution feedback to choose actions. Persistent runtimes preserve Python variables between actions; stateless runtimes clear them without resetting task progress. Training traces demonstrate task-solving strategies and runtime-specific ways to store and recover intermediate results. We study runtime transfer: whether
agents trained under one contract remain effective under the other, a dependence that fixed-runtime evaluations can conceal. Across three tasks requiring a working record built from tool feedback, we fine-tune separate Qwen3-8B
agents per task and runtime on instance-paired persistent and stateless traces and evaluate all four training-deployment combinations. We vary the per-turn tool-call cap: how many calls one Python action may execute. In our primary task,
agents inspect hidden item attributes and select a high-value subset under a weight limit. At 80 calls per turn, a persistent-trained
agent deployed statelessly scores 0.61 of optimal value against 0.77 under matched persistent deployment, but uses 4.4 times as many
tokens rebuilding its record. Tightening the cap to 25 reduces mismatched quality to 0.07 while matched quality remains 0.66. Trace replay shows that the cap interrupts inspection, the reset erases the partial record, and rebuilding consumes calls needed for progress. The widening gap replicates across training seeds, a second rollout, and two additional base models. Across the settings studied, cap tightening produces a mismatch-specific collapse only where interruptions are frequent and matched execution resumes while mismatched execution restarts. Evaluations of trace-fine-tuned
agents should specify episode limits, test runtime transfer across caps, and report cost alongside quality; otherwise, the same mismatch may appear as redundant computation or near-total quality loss.
Read the full abstract ▾
All authors Victor May, Van Khue Nguyen, Aaditya Salgarkar, Yishan Wang, Diganta Misra, Huu Nguyen
Machine Learning
Subliminal Signals in Preference Labels
Isotta Magistrali, Frédéric Berdoz, Sam Dauncey et al. (+1 more)
As AI systems approach superhuman capabilities, scalable oversight increasingly relies on LLM-as-a-judge frameworks where models evaluate and guide each other's training. A core assumption is that binary preference labels provide only semantic supervision about response quality. We challenge this assumption by demonstrating that preference labels can function as a covert communication channel. We show that even when a neutral student model generates semantically unbiased completions, a biased judge can transmit unintended behavioral traits through preference assignments, which even strengthen across iterative
alignment rounds. Our findings suggest that robust oversight in superalignment settings requires mechanisms that can detect and mitigate subliminal preference transmission, particularly when judges may pursue unintended objectives.
Read the full abstract ▾
All authors Isotta Magistrali, Frédéric Berdoz, Sam Dauncey, Roger Wattenhofer
Machine Learning
Operator Learning Using Weak Supervision from Walk-on-Spheres
Hrishikesh Viswanath, Hong Chul Nam, Xi Deng et al. (+3 more)
Training neural PDE solvers is often bottlenecked by expensive data generation or unstable physics-informed neural network (PINN) involving challenging optimization landscapes due to higher-order derivatives. To tackle this issue, we propose an alternative approach using Monte Carlo approaches to estimate the solution to the PDE as a
stochastic process for weak supervision during training. Leveraging the Walk-on-Spheres method, we introduce a learning scheme called Walk-on-Spheres Neural Operator (WoS-NO) which uses weak supervision from WoS to train any given neural operator. We propose to amortize the cost of Monte Carlo walks across the distribution of PDE instances using
stochastic representations from the WoS
algorithm to generate cheap, noisy, estimates of the PDE solution during training. This is formulated into a data-free physics-informed objective where a neural operator is trained to regress against these weak supervisions, allowing the operator to learn a generalized solution map for an entire family of PDEs. This strategy does not require expensive pre-computed
datasets, avoids computing higher-order derivatives for loss functions that are
memory-intensive and unstable, and demonstrates zero-shot generalization to novel PDE parameters and domains. Experiments show that for the same number of training steps, our method exhibits up to 8.75$\times$ improvement in $L_2$-error compared to standard physics-informed training schemes, up to 6.31$\times$ improvement in training speed, and reductions of up to 2.97$\times$ in GPU
memory consumption. We present the code at https://github.com/neuraloperator/WoS-NO
Read the full abstract ▾
All authors Hrishikesh Viswanath, Hong Chul Nam, Xi Deng, Julius Berner, Anima Anandkumar, Aniket Bera
Machine Learning · Cross-listed from stat.ML
A Basin-Selection Perspective on Grokking via Singular Learning Theory
Ben Cullen, Sergio Estan-Ruiz, Riya Danait et al. (+1 more)
Grokking, the abrupt transition from memorization to generalisation after extended training, suggests the presence of competing solution basins with distinct statistical properties. We study this phenomenon through the lens of Singular Learning Theory (SLT), a
Bayesian framework that characterizes the geometry of the loss landscape. The key measure is the local learning coefficient (LLC) which quantifies the local degeneracy of the loss surface. SLT links lower-LLC basins to higher posterior mass concentration and lower expected generalisation error. Leveraging SLT, we develop a basin-selection perspective on grokking in quadratic networks: LLC ranks competing near-zero-loss basins by statistical preference, while the training-time transition between them is governed by optimisation dynamics. In this view, grokking corresponds to a transition from a higher-LLC (memorising) basin to a lower-LLC (generalising) basin that dominates the posterior. To support this, we derive analytic formulas for the LLC in shallow quadratic networks under both lazy and feature learning regimes. Empirically, we demonstrate that LLC trajectories estimated from training data track the onset of generalisation and provide an informative probe of the optimisation path.
Read the full abstract ▾
All authors Ben Cullen, Sergio Estan-Ruiz, Riya Danait, Jiayi Li
Machine Learning
Scaling of learning time for high dimensional inputs
Carlos Stein Brito
Representation learning from complex data typically involves models with a large number of parameters, which in turn require large amounts of data samples. In neural network models, model complexity grows with the number of inputs to each
neuron, with a trade-off between model expressivity and learning time. A precise characterization of this trade-off would help explain the connectivity and learning times observed in artificial and biological networks. We present a theoretical analysis of how learning time depends on input dimensionality for a Hebbian learning model performing independent component analysis. Based on the geometry of high-dimensional spaces, we show that the learning dynamics reduce to a unidimensional problem, with learning times dependent only on initial conditions. For higher input dimensions, initial parameters have smaller learning gradients and larger learning times. We find that learning times have supralinear scaling, becoming quickly prohibitive for high input dimensions. These results reveal a fundamental limitation for learning in high dimensions and help elucidate how the optimal design of neural networks depends on data complexity. Our approach outlines a new framework for analyzing learning dynamics and model complexity in neural network models.
Read the full abstract ▾
Machine Learning
PARWiS: Winner determination under shoestring budgets using active pairwise comparisons
Shailendra Bhandari
Determining a winner among a set of items using active pairwise comparisons under a limited budget is a challenging problem in preference-based learning. The goal of this study is to implement and evaluate the PARWiS
algorithm, which shows spectral ranking and disruptive pair selection to identify the best item under shoestring budgets. This work have extended the PARWiS with a contextual variant (Contextual PARWiS) and a reinforcement learning-based variant (RL PARWiS), comparing them against baselines, including Double Thompson Sampling and a random selection strategy. This evaluation spans synthetic and real-world
datasets (Jester and MovieLens), using budgets of 40, 60, and 80 comparisons for 20 items. The performance is measured through recovery fraction, true rank of reported winner, reported rank of true winner, and cumulative regret, alongside the separation metric \(\Delta_{1,2}\). Results show that PARWiS and RL PARWiS outperform baselines across all
datasets, particularly in the Jester
dataset with a higher \(\Delta_{1,2}\), while performance gaps narrow in the more challenging MovieLens
dataset with a smaller \(\Delta_{1,2}\). Contextual PARWiS shows comparable performance to PARWiS, indicating that contextual features may require further tuning to provide significant benefits.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.CV
TripleSumm: Adaptive Triple-Modality Fusion for Video Summarization
Sumin Kim, Hyemin Jeong, Mingu Kang et al. (+3 more)
The exponential growth of
video content necessitates effective
video summarization to efficiently extract key information from long
videos. However, current approaches struggle to fully comprehend complex
videos, primarily because they employ static or modality-agnostic fusion strategies. These methods fail to account for the dynamic, frame-dependent variations in modality saliency inherent in
video data. To overcome these limitations, we propose TripleSumm, a novel architecture that adaptively weights and fuses the contributions of visual, text, and audio modalities at the frame level. Furthermore, a significant bottleneck for research into
multimodal video summarization has been the lack of comprehensive
benchmarks. Addressing this bottleneck, we introduce MoSu (Most Replayed
Multimodal Video Summarization), the first large-scale
benchmark that provides all three modalities. Extensive experiments demonstrate that TripleSumm achieves state-of-the-art performance, outperforming existing methods by a significant margin on four
benchmarks, including MoSu. Our code and
dataset are available at https://github.com/smkim37/TripleSumm.
Read the full abstract ▾
All authors Sumin Kim, Hyemin Jeong, Mingu Kang, Yejin Kim, Yoori Oh, Joonseok Lee
Machine Learning
SphUnc: Hyperspherical Uncertainty Decomposition and Causal Identification via Information Geometry
Rong Fu, Chunlei Meng, Jinshuo Liu et al. (+8 more)
Reliable decision-making in complex multi-
agent systems requires calibrated predictions and interpretable uncertainty. We introduce SphUnc, a unified framework combining hyperspherical representation learning with structural causal modeling. The model maps features to unit hypersphere latents using von Mises-Fisher distributions, decomposing uncertainty into epistemic and aleatoric components through information-
geometric fusion. A structural causal model on spherical latents enables directed influence identification and interventional
reasoning via sample-based simulation. Empirical evaluations on social and affective
benchmarks demonstrate improved accuracy, better calibration, and interpretable causal signals, establishing a
geometric-causal foundation for uncertainty-aware
reasoning in multi-
agent settings with higher-order interactions.
Read the full abstract ▾
All authors Rong Fu, Chunlei Meng, Jinshuo Liu, Dianyu Zhao, Yongtai Liu, Yibo Meng, Xiaowen Ma, Wangyu Wu, Yangchen Zeng, Shuaishuai Cao, Simon Fong
Machine Learning
Demystifying Group Relative Policy Optimization: Its Policy Gradient is a U-Statistic
Hongyi Zhou, Kai Ye, Erhan Xu et al. (+4 more)
Group relative policy optimization (GRPO), a core methodological component of DeepSeekMath and DeepSeek-R1, has emerged as a cornerstone for scaling
reasoning capabilities of large
language models. Despite its widespread adoption and the proliferation of follow-up works, the theoretical properties of GRPO remain less studied. This paper provides a unified framework to understand GRPO through the lens of classical U-statistics. We demonstrate that the GRPO policy gradient is inherently a U-statistic, allowing us to characterize its mean squared error (MSE), derive the finite-sample error bound and asymptotic distribution of the suboptimality gap for its learned policy. Our findings reveal that GRPO is asymptotically equivalent to an oracle policy gradient
algorithm – one with access to a value function that quantifies the goodness of its learning policy at each training iteration – and achieves asymptotically optimal performance within a broad class of policy gradient
algorithms. Furthermore, we establish a universal scaling law that offers principled guidance for selecting the optimal group size. Empirical experiments further validate our theoretical findings, demonstrating that the optimal group size is universal, and verify the oracle property of GRPO.
Read the full abstract ▾
All authors Hongyi Zhou, Kai Ye, Erhan Xu, Jin Zhu, Ying Yang, Shijin Gong, Chengchun Shi
Machine Learning
A Decomposition Framework for Certifiably Optimal Orthogonal Sparse PCA
Difei Cheng and Qiao Hu
Sparse Principal Component Analysis (SPCA) is an important technique for high-dimensional data analysis, improving interpretability by imposing sparsity on principal components. However, existing methods often fail to simultaneously guarantee sparsity, orthogonality, and optimality of the principal components. To address this challenge, this work introduces a novel Sparse Principal Component Analysis (SPCA)
algorithm called GS-SPCA (SPCA with Gram-Schmidt Orthogonalization), which simultaneously enforces sparsity, orthogonality, and optimality. However, the original GS-SPCA
algorithm is computationally expensive due to the inherent $\ell_0$-norm constraint. To address this issue, we propose two acceleration strategies: First, we combine Branch-and-Bound with the GS-SPCA
algorithm. By incorporating this strategy, we are able to obtain $\varepsilon$-optimal solutions with a trade-off between precision and efficiency, significantly improving computational speed. Second, we propose a decomposition framework for efficiently solving multiple principal components. This framework approximates the covariance
matrix using a block-diagonal
matrix through a thresholding method, reducing the original SPCA problem to a set of block-wise subproblems on approximately block-diagonal
matrices.
Read the full abstract ▾
Machine Learning
A Deep Learning Framework for Heat Demand Forecasting using Time-Frequency Representations of Decomposed Features
Adithya Ramachandran, Satyaki Chatterjee, Thorkil Flensmark B. Neergaard et al. (+3 more)
District Heating Systems are essential infrastructure for delivering heat to consumers across a geographic region sustainably, yet efficient management relies on optimizing diverse energy sources, such as wood, gas, electricity, and
solar, in response to fluctuating demand. Aligning supply with demand is critical not only for ensuring reliable heat distribution but also for minimizing carbon emissions and extending infrastructure lifespan through lower operating temperatures. However, accurate multi-step
forecasting to support these goals remains challenging due to complex, non-linear usage patterns and external dependencies. In this work, we propose a novel deep learning framework for day-ahead heat demand prediction that leverages time-frequency representations of historical data. By applying Continuous Wavelet Transform to decomposed demand and external meteorological factors, our approach enables Convolutional Neural Networks to learn hierarchical temporal features that are often inaccessible to standard time domain models. We systematically evaluate this method against statistical baselines, state-of-the-art
Transformers, and emerging foundation models using multi-year data from three distinct Danish districts, a Danish city, and a German city. The results show a significant advancement, reducing the Mean Absolute Error by 36% to 43% compared to the strongest baselines, achieving
forecasting accuracy of up to 95% across annual test
datasets. Qualitative and statistical analyses further confirm the accuracy and robustness by reliably tracking volatile demand peaks where others fail. This work contributes both a high-performance
forecasting architecture and critical insights into optimal feature composition, offering a validated solution for modern energy applications.
Read the full abstract ▾
All authors Adithya Ramachandran, Satyaki Chatterjee, Thorkil Flensmark B. Neergaard, Maximilian Oberndoerfer, Andreas Maier, Siming Bayer
Machine Learning · Cross-listed from physics.flu-dyn
Structure-preserving Randomized Neural Networks for Incompressible Magnetohydrodynamics Equations
Yunlong Li, Fei Wang and Lingxiao Li
The incompressible magnetohydrodynamic (MHD) equations are fundamental in many scientific and engineering applications. However, their strong nonlinearity and dual divergence-free constraints make them highly challenging for conventional numerical solvers. To overcome these difficulties, we propose a Structure-Preserving Randomized Neural Network (SP-RaNN) that automatically and exactly satisfies the divergence-free conditions. Unlike deep neural network (DNN) approaches that rely on expensive nonlinear and nonconvex optimization, SP-RaNN reformulates the training process into a linear least-squares system, thereby eliminating nonconvex optimization. The method linearizes the governing equations through Picard or Newton iterations, discretizes them at collocation points within the domain and on the boundaries using finite-difference schemes, and solves the resulting linear system via a linear least-squares procedure. By design, SP-RaNN preserves the intrinsic mathematical structure of the equations within a unified space-time framework, ensuring both stability and accuracy. Numerical experiments on the Navier-Stokes, Maxwell, and MHD equations demonstrate that SP-RaNN achieves higher accuracy, faster convergence, and exact enforcement of divergence-free constraints compared with both traditional numerical methods and DNN-based approaches. This structure-preserving framework provides an efficient and reliable tool for solving complex PDE systems while rigorously maintaining their underlying physical laws.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.CV
Differential privacy representation geometry for medical image analysis
Soroosh Tayebi Arasteh, Marziyeh Mohammadi, Sven Nebelung et al. (+1 more)
Differential
privacy (DP)'s effect in medical imaging is typically evaluated only through end-to-end performance, leaving the mechanism of
privacy-induced utility loss unclear. We introduce Differential
Privacy Representation Geometry for Medical Imaging (DP-RGMI), a framework that interprets DP as a structured transformation of representation space and decomposes performance degradation into encoder geometry and task-head utilization. Geometry is quantified by representation displacement from initialization and spectral effective dimension, while utilization is measured as the gap between linear-probe and end-to-end utility. Across over 594,000 images from four chest X-ray
datasets and multiple pretrained initializations, we show that DP is consistently associated with a utilization gap even when linear separability is largely preserved. At the same time, displacement and spectral dimension exhibit non-monotonic, initialization- and
dataset-dependent reshaping, indicating that DP alters representation anisotropy rather than uniformly collapsing features. Correlation analysis reveals that the association between end-to-end performance and utilization is robust across
datasets but can vary by initialization, while
geometric quantities capture additional prior- and
dataset-conditioned variation. These findings position DP-RGMI as a reproducible framework for diagnosing
privacy-induced failure modes and informing
privacy model selection.
Read the full abstract ▾
All authors Soroosh Tayebi Arasteh, Marziyeh Mohammadi, Sven Nebelung, Daniel Truhn
Machine Learning
Understanding LoRA as Knowledge Memory: An Empirical Analysis
Seungju Back, Dongwoo Lee, Naun Kang et al. (+4 more)
Continuous knowledge updating for pre-trained large
language models (LLMs) is increasingly necessary yet remains challenging. Although inference-time methods like In-Context Learning (ICL) and
Retrieval-Augmented Generation (RAG) are popular, they face constraints in context budgets, costs, and
retrieval fragmentation. Departing from these context-dependent paradigms, this work investigates a parametric approach using Low-Rank Adaptation (LoRA) as a modular knowledge
memory. Although few recent works examine this concept, the fundamental mechanics governing its capacity and composability remain largely unexplored. We bridge this gap through the first systematic empirical study mapping the design space of LoRA-based
memory, ranging from characterizing storage capacity and optimizing internalization to scaling multi-module systems and evaluating long-context
reasoning. Rather than proposing a single architecture, we provide practical guidance on the operational boundaries of LoRA
memory. Overall, our findings position LoRA as the complementary axis of
memory alongside RAG and ICL, offering distinct advantages.
Read the full abstract ▾
All authors Seungju Back, Dongwoo Lee, Naun Kang, Taehee Lee, S. K. Hong, Youngjune Gwon, Sungjin Ahn
Machine Learning · Cross-listed from cs.CV
Yifu Qiu, Paul-Ambroise Duquenne and Holger Schwenk
We introduce V-SONAR, a
vision-
language embedding space extended from the text-only
embedding space SONAR (Omnilingual
Embeddings Team et al., 2026), which supports 1500 text
languages and 177
speech languages. To construct V-SONAR, we propose a post-hoc
alignment pipeline that maps the representations of an existing
vision encoder into the SONAR space. We thoroughly evaluate V-SONAR and show that its
embeddings achieve competitive performance on text-to-
video retrieval. Equipped with the OMNISONAR text decoder, V-SONAR further surpasses state-of-the-art
vision-
language models on
video captioning tasks, including DREAM-1K (BLEU 23.9 vs. 19.6) and PE-
VIDEO (BLEU 39.0 vs. 30.0). Leveraging V-SONAR, we first demonstrate that the Large Concept Model (LCM; LCM team et al. 2024) operating in SONAR and trained with English text only, can perform both single- and multi-visual concept understanding in a zero-shot manner. Finally, we introduce V-LCM, which extends the LCM with
vision-
language instruction tuning. V-LCM encodes
vision and
language inputs into an unified sequence of latent
embeddings via V-SONAR and SONAR, and it is trained with the same latent
diffusion objective for next-
embedding prediction as in LCM's text-only pre-training. Experiments on a large-scale
multilingual and -modal instruction-tuning data mixture highlight the potential of V-LCM: V-LCM matches state-of-the-art
vision-
language models on tasks covering image/
video captioning and question answering, while significantly outperforming them across 61 rich- to low-resource
languages out of all 62 tested
languages.
Read the full abstract ▾
Machine Learning · Cross-listed from math.NA
Adaptive-Growth Randomized Neural Networks for Level-Set Computation of Multivalued Nonlinear First-Order PDEs with Hyperbolic Characteristics
Haoning Dang, Shi Jin and Fei Wang
This paper proposes an Adaptive-Growth Randomized Neural Network (AG-RaNN) method for computing multivalued solutions of nonlinear first-order PDEs with
hyperbolic characteristics, including quasilinear
hyperbolic balance laws and Hamilton–Jacobi equations. Such solutions arise in
geometric optics, seismic waves, semiclassical limit of
quantum dynamics and high frequency limit of linear waves, and differ markedly from the viscosity or entropic solutions. The main computational challenges lie in that the solutions are no longer functions, and become union of multiple branches, after the formation of singularities. Level-set formulations offer a systematic alternative by
embedding the nonlinear dynamics into linear transport equations posed in an augmented phase space, at the price of substantially increased dimensionality. To alleviate this computational burden, we combine AG-RaNN with an adaptive collocation strategy that concentrates samples in a tubular neighborhood of the zero level set, together with a layer-growth mechanism that progressively enriches the randomized feature space. Under standard regularity assumptions on the transport field and the characteristic flow, we establish a convergence result for the AG-RaNN approximation of the level-set equations. Numerical experiments demonstrate that the proposed method can efficiently recover multivalued structures and resolve nonsmooth features in high-dimensional settings.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.AI
The Alien Space of Science: Sampling Coherent but Cognitively Unavailable Research Directions
Alejandro H. Artiles, Martin Weiss, Levin Brinkmann et al. (+6 more)
Scientific discovery is constrained not only by what is true, but by what is cognitively available to researchers. Many directions are coherent in light of the literature yet unlikely to be proposed because no existing community combines the relevant concepts, methods, and intuitions. Modern
language models inherit this bias, recombining high-density regions of the literature when prompted for novel ideas. We target the complementary region, the alien space of science: directions that are scientifically plausible but unlikely under the distribution of existing researchers. Our method decomposes papers into conceptual units and clusters them into a vocabulary of idea atoms. A coherence model scores whether atom combinations form viable research directions, while an availability model scores whether any existing author community is positioned to produce them. We rank combinations to maximize coherence while minimizing availability. On 16,068 peer-reviewed LLM papers from NeurIPS, ICLR, ICML, and major NLP venues, the sampler produces more diverse research portfolios than frontier LLM baselines, including batch-prompted variants that see their entire output, while matching or exceeding their per-idea quality under blind human, LLM, and downstream experimental evaluation. In temporal validation, all components use only pre-2025 data. Selecting less than 1% of the candidate space recovers 2025 combinations at 35.9 times chance; weighting unavailability increases recovery of strictly novel combinations to 3.24 times chance. By separating scientific plausibility from community availability, our framework points toward AI ideation that complements rather than merely accelerates human science, expanding exploration into coherent directions the community may overlook.
Read the full abstract ▾
All authors Alejandro H. Artiles, Martin Weiss, Levin Brinkmann, Iyad Rahwan, Bernhard Schölkopf, Christopher Pal, Hugo Larochelle, Anirudh Goyal, Nasim Rahaman
Machine Learning · Cross-listed from cs.CL
CARD: Towards Conditional Design of Multi-agent Topological Structures
Tongtong Wu, Yanming Li, Ziye Tang et al. (+5 more)
Large
language model (LLM)-based multi-
agent systems have shown strong capabilities in tasks such as code generation and collaborative
reasoning. However, the effectiveness and robustness of these systems critically depend on their communication
topology, which is often fixed or statically learned, ignoring real-world dynamics such as model upgrades, API (or tool) changes, or knowledge source variability. To address this limitation, we propose CARD (Conditional Agentic Graph Designer), a conditional graph-generation framework that instantiates AMACP, a protocol for adaptive multi-
agent communication. CARD explicitly incorporates dynamic environmental signals into graph construction, enabling
topology adaptation at both training and runtime. Through a conditional variational graph encoder and environment-aware optimization, CARD produces communication structures that are both effective and resilient to shifts in model capability or resource availability. Empirical results on HumanEval, MATH, and MMLU demonstrate that CARD consistently outperforms static and
prompt-based baselines, achieving higher accuracy and robustness across diverse conditions. The source code is available at: https://github.com/Warma10032/CARD.
Read the full abstract ▾
All authors Tongtong Wu, Yanming Li, Ziye Tang, Chen Jiang, Linhao Luo, Guilin Qi, Shirui Pan, Gholamreza Haffari
Machine Learning · Cross-listed from physics.flu-dyn
Super-resolution of turbulent reacting flows on complex meshes using graph neural networks
Priyabrat Dash, Konduri Aditya, Christos E. Frouzakis et al. (+1 more)
State-of-the-art deep learning models have been extensively utilized to reconstruct small-scale structures from coarse-grained data in turbulent flows. However, their application has predominantly been restricted to structured uniform meshes, limiting their applicability to data associated with complex geometries that are typically simulated on structured non-uniform or unstructured meshes. Machine learning (ML) models based on graph neural networks (GNNs), known for their ability to process unstructured data, offer a promising alternative. In this study, we leverage the inherent flexibility of GNNs featuring message passing layers to develop a methodology for reconstructing unresolved small-scale structures from low-resolution data on complex meshes. The accuracy of the proposed approach is demonstrated using two cases: a reacting channel flow on a structured non-uniform mesh, and a reacting hydrogen fueled internal combustion (IC) engine featuring an unstructured mesh. Evaluation of results based on visual agreement, statistical metrics, and cumulative error reduction indicates the effectiveness of the method in accurately reconstructing fine-scale features. Overall, this study provides a pathway for integrating data-driven small-scale reconstruction and subgrid-scale modeling to enhance the accuracy of coarse-grained simulations on complex meshes.
Read the full abstract ▾
All authors Priyabrat Dash, Konduri Aditya, Christos E. Frouzakis, Mathis Bode
Machine Learning · Cross-listed from cs.CV
LLaDA-o: An Effective and Length-Adaptive Omni Diffusion Model
Zebin You, Xiaolu Zhang, Jun Zhou et al. (+2 more)
We present LLaDA-o, an effective and length-adaptive omni
diffusion model for
multimodal understanding and generation. LLaDA-o is built on a Mixture of
Diffusion (MoD) framework that decouples discrete masked
diffusion for text understanding and continuous
diffusion for visual generation, while coupling them through a shared, simple, and efficient
attention backbone that reduces redundant computation for fixed conditions. Building on MoD, we further introduce a data-centric length adaptation strategy that enables flexible-length decoding in
multimodal settings without architectural changes. Extensive experiments show that LLaDA-o achieves state-of-the-art performance among omni-
diffusion models on
multimodal understanding and generation
benchmarks, and reaches 87.04 on DPG-Bench for text-to-image generation, supporting the effectiveness of unified omni
diffusion modeling. Code is available at https://github.com/ML-GSAI/LLaDA-o.
Read the full abstract ▾
All authors Zebin You, Xiaolu Zhang, Jun Zhou, Chongxuan Li, Ji-Rong Wen
Machine Learning
A level-wise training scheme for learning neural multigrid smoothers with application to integral equations
Lingfeng Li, Yin King Chu, Raymond Chan et al. (+1 more)
Convolution-type integral equations commonly occur in signal processing and image processing. Discretizing these equations yields large and ill-conditioned linear systems. While the classic multigrid method is effective for solving linear systems derived from partial differential equations (PDE) problems, it fails to solve integral equations because its smoothers, which are implemented as conventional relaxation methods, are ineffective in reducing high-frequency components in the errors. We propose a novel neural multigrid scheme where learned neural operators replace classical smoothers. Unlike classical smoothers, these operators are trained offline. Once trained, the neural smoothers generalize to new right-hand-side vectors without retraining, making it an efficient solver. We design level-wise loss functions incorporating spectral filtering to emulate the multigrid frequency decomposition principle, ensuring each operator focuses on solving distinct high-frequency spectral bands. Although we focus on integral equations, the framework is generalizable to all kinds of problems, including PDE problems. Our experiments demonstrate superior efficiency over classical solvers and robust convergence across varying problem sizes and regularization weights.
Read the full abstract ▾
All authors Lingfeng Li, Yin King Chu, Raymond Chan, Justin Wan
Machine Learning · Cross-listed from cs.CR
Turning Black Box into White Box: Dataset Distillation Leaks
Huajie Chen, Tianqing Zhu, Yuchen Zhong et al. (+7 more)
Dataset distillation compresses a large real
dataset into a small synthetic one, enabling models trained on the synthetic data to achieve performance comparable to those trained on the real data. Although synthetic
datasets are assumed to be
privacy-preserving, we show that existing
distillation methods can cause severe
privacy leakage because synthetic
datasets implicitly encode the weight trajectories of the distilled model, they become over-informative and exploitable by adversaries. To expose this risk, we introduce the Information Revelation Attack (IRA) against state-of-the-art
distillation techniques. Experiments show that IRA accurately predicts both the
distillation algorithm and model architecture, and can successfully infer membership and recover sensitive samples from the real
dataset.
Read the full abstract ▾
All authors Huajie Chen, Tianqing Zhu, Yuchen Zhong, Yang Zhang, Shang Wang, Feng He, Lefeng Zhang, Jialiang Shen, Minghao Wang, Wanlei Zhou
Machine Learning
No More Maybe-Arrows: Resolving Causal Uncertainty by Breaking Symmetries
Tingrui Huang and Devendra Singh Dhami
The recent works on causal discovery have followed a similar trend of learning partial ancestral graphs (PAGs) since observational data constrain the true causal directed acyclic graph (DAG) only up to a Markov equivalence class. This limits their application in the majority of downstream tasks, as uncertainty in causal relations remains unresolved. We propose a new refinement framework, CausalSAGE, for converting PAGs to DAGs while respecting the underlying causal relations. The framework expands discrete variables into state-level representations, constrains the search space using structural knowledge and soft priors, and applies a unified differentiable objective for joint optimization. The final DAG is obtained by aggregating the optimized structures and enforcing acyclicity when necessary. Our experimental evaluations show that the obtained DAGs preserve the underlying causal relations while also being efficient to obtain.
Read the full abstract ▾
Machine Learning
Evaluating GFlowNet from partial episodes for stable and flexible policy-based training
Puhua Niu, Shili Wu and Xiaoning Qian
Generative Flow Networks (GFlowNets) were developed to learn policies for efficiently sampling combinatorial candidates by interpreting their generative processes as trajectories in directed acyclic graphs. In the value-based training workflow, the objective is to enforce the balance over partial episodes between the flows of the learned policy and the estimated flows of the desired policy, implicitly encouraging policy divergence minimization. The policy-based strategy alternates between estimating the policy divergence and updating the policy, but reliable estimation of the divergence under directed acyclic graphs remains a major challenge. This work bridges the two perspectives by showing that flow balance also yields a principled policy evaluator that measures the divergence, and an evaluation balance objective over partial episodes is proposed for learning the evaluator. As demonstrated on both synthetic and real-world tasks, evaluation balance not only strengthens the reliability of policy-based training but also broadens its flexibility by seamlessly supporting parameterized backward policies and enabling the integration of offline data-collection techniques.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.CL
Thoth: Mid-Training Bridges LLMs to Time Series Understanding
Jiafeng Lin, Yuxuan Wang, Jialong Wu et al. (+3 more)
Large
Language Models (LLMs) have demonstrated remarkable success in general-purpose
reasoning. However, they still struggle to understand and reason about time series data, which limits their effectiveness in decision-making scenarios that depend on temporal dynamics. In this paper, we propose Thoth, the first family of mid-trained LLMs with general-purpose time series understanding capabilities. As a pivotal intermediate stage, mid-training achieves task- and domain-agnostic
alignment between time series and natural
language, for which we construct Book-of-Thoth, a high-quality, time-series-centric mid-training corpus. Book-of-Thoth enables both time-series-to-text and text-to-time-series generation, equipping LLMs with a foundational grasp of temporal patterns. To better evaluate advanced
reasoning capabilities, we further present
KnoTS, a novel
benchmark of knowledge-intensive time series understanding, designed for joint
reasoning over temporal patterns and domain knowledge. Extensive experiments demonstrate that mid-training with Book-of-Thoth enables Thoth to significantly outperform its base model and advanced LLMs across a range of time series question answering
benchmarks. Moreover, Thoth exhibits superior capabilities when fine-tuned under data scarcity, underscoring the effectiveness of mid-training for time series understanding. Code is available at: https://github.com/thuml/Thoth.
Read the full abstract ▾
All authors Jiafeng Lin, Yuxuan Wang, Jialong Wu, Huakun Luo, Zhongyi Pei, Jianmin Wang
Machine Learning
Fed-ADE: Adaptive Learning Rate for Federated Post-adaptation under Distribution Shift
Heewon Park, Mugon Joe, Miru Kim et al. (+2 more)
Federated learning (FL) in post-deployment settings must adapt to non-stationary data streams across heterogeneous clients without access to ground-truth labels. A major challenge is learning rate selection under client-specific, time-varying distribution shifts, where fixed learning rates often lead to underfitting or divergence. We propose Fed-ADE (
Federated Adaptation with Distribution Shift Estimation), an unsupervised
federated adaptation framework that leverages lightweight
estimators of distribution dynamics. Specifically, Fed-ADE employs uncertainty dynamics estimation to capture changes in predictive uncertainty and representation dynamics estimation to detect
covariate-level feature drift, combining them into a per-client, per-timestep adaptive learning rate. We provide theoretical analyses showing that our dynamics estimation approximates the underlying distribution shift and yields dynamic regret and convergence guarantees. Experiments on image and text
benchmarks under diverse distribution shifts (label and
covariate) demonstrate consistent improvements over strong baselines. These results highlight that distribution shift-aware adaptation enables effective and robust
federated post-adaptation under real-world non-stationarity.
Read the full abstract ▾
All authors Heewon Park, Mugon Joe, Miru Kim, Kyungjin Im, Minhae Kwon
Machine Learning · Cross-listed from cs.CV
Reparameterized Tensor Ring Functional Decomposition for Multi-Dimensional Data Recovery
Yangyang Xu, Junbo Ke, You-Wei Wen et al. (+1 more)
Tensor Ring (TR) decomposition is a powerful tool for high-order data modeling, but is inherently restricted to discrete forms defined on fixed meshgrids. In this work, we propose a TR functional decomposition for both meshgrid and non-meshgrid data, where factors are parameterized by Implicit Neural Representations (INRs). However, optimizing this continuous framework to capture fine-scale details is intrinsically difficult. Through a frequency-domain analysis, we demonstrate that the spectral structure of TR factors determines the frequency composition of the reconstructed tensor and limits the high-frequency modeling capacity. To mitigate this, we propose a reparameterized TR functional decomposition, in which each TR factor is a structured combination of a learnable latent tensor and a fixed basis. This reparameterization is theoretically shown to improve the training dynamics of TR factor learning. We further derive a principled initialization scheme for the fixed basis and prove the Lipschitz continuity of our proposed model. Extensive experiments on image inpainting, denoising, super-resolution, and point cloud recovery demonstrate that our method achieves consistently superior performance over existing approaches. Code is available at https://github.com/YangyangXu2002/RepTRFD.
Read the full abstract ▾
All authors Yangyang Xu, Junbo Ke, You-Wei Wen, Chao Wang