Machine Learning
The Geometric Mechanics of Contrastive Representation Learning: Alignment Potentials, Entropic Dispersion, and Cross-modal Divergence
Yichao Cai, Zhen Zhang, Yuhang Liu et al. (+1 more)
While InfoNCE underlies modern contrastive learning, its
geometric mechanisms remain under-characterized beyond the canonical
alignment–uniformity decomposition. We develop a measure-theoretic framework in which representation measures evolve on a fixed
embedding manifold. In the large-batch limit, we prove value and gradient consistency, linking the
stochastic objective to explicit deterministic energy landscapes and revealing a
geometric bifurcation between unimodal and symmetric
multimodal regimes. In the unimodal case, the intrinsic energy is strictly convex and admits a unique Gibbs
equilibrium, showing that
entropy acts as a tie-breaker within the aligned basin. In the
multimodal case, the intrinsic geometry becomes cross-coupled and contains a persistent negative symmetric divergence term: each modality's marginal reshapes the effective landscape of the other, allowing strong pairwise
alignment to coexist with a persistent modality gap. Controlled synthetic experiments and analyses of pretrained CLIP representations support these predictions. Overall, our results shift the analytical lens from pointwise discrimination to population geometry, showing that pairwise
alignment alone is insufficient to control cross-modal marginal structure.
Read the full abstract ▾
All authors Yichao Cai, Zhen Zhang, Yuhang Liu, Javen Qinfeng Shi
Machine Learning
Intersectional Fairness via Mixed-Integer Optimization
Jiří Němeček, Mark Kozdoba, Illia Kryvoviaz et al. (+2 more)
The deployment of Artificial Intelligence in high-risk domains, such as finance and healthcare, necessitates models that are both fair and transparent. While regulatory frameworks, including the EU's AI Act, mandate bias mitigation, they are deliberately vague about the definition of bias. In line with existing research, we argue that true
fairness requires addressing bias at the intersections of protected groups. We propose a unified framework that leverages Mixed-Integer Optimization (MIO) to train intersectionally fair and intrinsically interpretable classifiers. We prove the equivalence of two measures of intersectional
fairness (MSD and SPSF) in detecting the most unfair subgroup and empirically demonstrate that our MIO-based
algorithm improves performance in finding bias. We train high-performing, interpretable classifiers that bound intersectional bias below an acceptable threshold, offering a robust solution for regulated industries and beyond.
Read the full abstract ▾
All authors Jiří Němeček, Mark Kozdoba, Illia Kryvoviaz, Tomáš Pevný, Jakub Mareček
Machine Learning
From Atoms to Chains: Divergence-Guided Reasoning Curriculum for Unlabeled LLM Domain Adaptation
Yongqi Wang, Xiaofeng Ji, Jie Wang et al. (+6 more)
Adapting Large
Language Models (LLMs) to specialized domains without human-annotated data is a crucial yet formidable challenge. Widely adopted knowledge
distillation methods often devolve into coarse-grained mimicry, where the student model inefficiently targets its own weaknesses and risks inheriting the teacher's
reasoning flaws. This exposes a critical pedagogical dilemma: how to devise a reliable curriculum when the teacher itself is not an infallible expert. Our work resolves this by capitalizing on a key insight: while LLMs may exhibit fallibility in complex, holistic
reasoning, they often exhibit high fidelity on focused, atomic sub-problems. Based on this, we propose Divergence-Guided
Reasoning Curriculum (DGRC), which constructs a learning path from atomic knowledge to
reasoning chains by dynamically deriving two complementary curricula from disagreements in
reasoning pathways. When a student and teacher produce conflicting results, DGRC directs the teacher to perform a diagnostic analysis: it analyzes both
reasoning paths to formulate atomic queries that target the specific points of divergence, and then self-answers these queries to create high-confidence atomic question-answer pairs. These pairs then serve a dual purpose: (1) providing an atomic curriculum to rectify the student's knowledge gaps, and (2) serving as factual criteria to filter the teacher's original
reasoning chains, yielding a verified CoT curriculum that teaches the student how to integrate atomic knowledge into complete
reasoning paths. Experiments across the medical and legal domains on student models of various sizes demonstrate the effectiveness of our DGRC framework. Notably, our method achieves a 7.76% relative improvement for the 1.5B student model in the medical domain over strong unlabeled baseline.
Read the full abstract ▾
All authors Yongqi Wang, Xiaofeng Ji, Jie Wang, Qingbin Li, Xiao Xiong, Zheming Yang, Jian Xu, Minghui Qiu, Xinxiao Wu
Machine Learning · Cross-listed from cond-mat.stat-mech
Learning the Intrinsic Dimensionality of Fermi-Pasta-Ulam-Tsingou Trajectories: A Nonlinear Approach using a Deep Autoencoder Model
Gionni Marchetti
We address the intrinsic dimensionality (ID) of high-dimensional trajectories, comprising $n_s = 4\,000\,000$ data points, of the
Fermi-Pasta-Ulam-Tsingou (FPUT) $\beta$ model with $N = 32$ oscillators. To this end, a deep autoencoder (DAE) is used to infer the ID in the weakly nonlinear regime where energy recurrences are observed ($\beta \lesssim 1$). We find that the trajectories lie on a nonlinear Riemannian
manifold of dimension $m^{\ast} = 2$ embedded in a $64$-dimensional phase space. By contrast, principal component analysis (PCA) together with the Participation Ratio (PR) method provides only a reasonable upper bound on the ID for each value of $\beta$. Our DAE further reveals that the ID increases to $m^{\ast} = 3$ at $\beta = 1.1$, coinciding with a
symmetry-breaking (SB) phenomenon characteristic of the $\beta$ model, in which additional energy modes with even wave numbers $k = 2, 4$ become excited. Notably, the SB phenomenon cannot be detected by the linear approach provided by PCA.
Read the full abstract ▾
Machine Learning
AROMMA: Unifying Olfactory Embeddings for Single Molecules and Mixtures
Dayoung Kang, JongWon Kim, Jiho Park et al. (+3 more)
Public olfaction
datasets are small and fragmented across single molecules and mixtures, limiting learning of generalizable odor representations. Recent works either learn single-molecule
embeddings or address mixtures via similarity or pairwise label prediction, leaving representations separate and unaligned. In this work, we propose AROMMA, a framework that learns a unified
embedding space for single molecules and two-molecule mixtures. Each molecule is encoded by a chemical foundation model and the mixtures are composed by an
attention-based aggregator, ensuring both permutation invariance and asymmetric molecular interactions. We further align odor descriptor sets using knowledge
distillation and class-aware pseudo-labeling to enrich missing mixture annotations. AROMMA achieves state-of-the-art performance in both single-molecule and molecule-pair
datasets, with up to 19.1% AUROC improvement, demonstrating a robust generalization in two domains.
Read the full abstract ▾
All authors Dayoung Kang, JongWon Kim, Jiho Park, Keonseock Lee, Ji-Woong Choi, Jinhyun So
Machine Learning · Cross-listed from hep-lat
Generalizable Equivariant Diffusion Models for Non-Abelian Lattice Gauge Theory
Gert Aarts, Diaa E. Habibi, Andreas Ipp et al. (+5 more)
We demonstrate that gauge equivariant
diffusion models can accurately model the physics of non-Abelian
lattice gauge theory using the Metropolis-adjusted annealed Langevin
algorithm (MAALA), as exemplified by computations in two-dimensional U(2) and SU(2) gauge theories. Our network architecture is based on
lattice gauge equivariant convolutional neural networks (L-CNNs), which respect local and global
symmetries on the
lattice. Models are trained on a single ensemble generated using a traditional Monte Carlo method. By studying Wilson loops of various size as well as the topological susceptibility, we find that the
diffusion approach generalizes remarkably well to larger inverse couplings and
lattice sizes with negligible loss of accuracy while retaining moderately high acceptance rates.
Read the full abstract ▾
All authors Gert Aarts, Diaa E. Habibi, Andreas Ipp, David I. Müller, Thomas R. Ranner, Lingxiao Wang, Wei Wang, Qianteng Zhu
Machine Learning
Scale-Consistent State-Space Dynamics via Fractal of Stationary Transformations
Geunhyeok Yu and Hyoseok Hwang
Recent deep learning models increasingly rely on depth without structural guarantees on the validity of intermediate representations, rendering early stopping and adaptive computation ill-posed. We address this limitation by formulating a structural requirement for state-space model's scale-consistent latent dynamics across iterative refinement, and derive Fractal of Stationary Transformations (FROST), which enforces a self-similar representation
manifold through a fractal inductive bias. Under this geometry, intermediate states correspond to different resolutions of a shared representation, and we provide a
geometric analysis establishing contraction and stable convergence across iterations. As a consequence of this scale-consistent structure, halting naturally admits a ranking-based formulation driven by intrinsic feature quality rather than extrinsic objectives. Controlled experiments on ImageNet-100 empirically verify the predicted scale-consistent behavior, showing that adaptive efficiency emerges from the aligned latent geometry.
Read the full abstract ▾
Machine Learning
GenCP: Towards Generative Modeling Paradigm of Coupled Physics
Tianrun Gao, Haoren Zheng, Wenhao Deng et al. (+5 more)
Real-world physical systems are inherently complex, often involving the coupling of multiple physics, making their simulation both highly valuable and challenging. Many mainstream approaches face challenges when dealing with decoupled data. Besides, they also suffer from low efficiency and fidelity in strongly coupled spatio-temporal physical systems. Here we propose GenCP, a novel and elegant generative paradigm for coupled multiphysics simulation. By formulating coupled-physics modeling as a probability modeling problem, our key innovation is to integrate probability density
evolution in generative modeling with iterative multiphysics coupling, thereby enabling training on data from decoupled simulation and inferring coupled physics during sampling. We also utilize operator-splitting theory in the space of probability
evolution to establish error controllability guarantees for this "conditional-to-joint" sampling scheme. We evaluate our paradigm on a synthetic setting and three challenging multi-physics scenarios to demonstrate both principled insight and superior application performance of GenCP. Code is available at this repo: github.com/AI4Science-WestlakeU/GenCP.
Read the full abstract ▾
All authors Tianrun Gao, Haoren Zheng, Wenhao Deng, Haodong Feng, Tao Zhang, Ruiqi Feng, Qianyi Chen, Tailin Wu
Machine Learning · Cross-listed from cs.AI
Benchmarks Saturate When The Model Gets Smarter Than The Judge
Marthe Ballon, Andres Algaba, Brecht F. Verbeken et al. (+1 more)
Benchmarks are important tools to track progress in the development of Large
Language Models (LLMs), yet inaccuracies in
datasets and evaluation methods consistently undermine their effectiveness. Here, we present Omni-MATH-2, a manually revised version of the Omni-MATH
dataset comprising a clean, exact-answer subset ($n{=}4181$) and a tagged, non-standard subset ($n{=}247$). Each problem was audited to ensure LaTeX compilability, solvability and verifiability, which involved adding missing figures or information, labeling problems requiring a proof, estimation or image, and removing clutter. This process significantly reduces
dataset-induced noise, thereby providing a more precise assessment of model performance. The annotated
dataset also allows us to evaluate judge-induced noise by comparing GPT-5 mini with the original Omni-Judge, revealing substantial discrepancies between judges on both the clean and tagged problem subsets. Expert annotations reveal that Omni-Judge is wrong in $96.4\%$ of the judge disagreements, indicating its inability to differentiate between models' abilities, even well before saturation of the
benchmark occurs. As problems become more challenging, we find that increasingly competent judges become essential in order to prevent judge errors from masking genuine differences between models. Finally, neither judge identifies the present failure modes for the subset of tagged problems, demonstrating that
dataset quality and judge reliability are both critical to develop accurate
benchmarks of model performance.
Read the full abstract ▾
All authors Marthe Ballon, Andres Algaba, Brecht F. Verbeken, Vincent Ginis
Machine Learning · Cross-listed from cs.CV
Mocap Anywhere: Towards Pairwise-Distance based Motion Capture in the Wild (for the Wild)
Ofir Abramovich, Ariel Shamir and Andreas Aristidou
We introduce a novel motion capture system that reconstructs full-body 3D motion using only sparse pairwise distance (PWD) measurements from body-mounted(UWB) sensors. Using time-of-flight ranging between wireless nodes, our method eliminates the need for external cameras, enabling robust operation in uncontrolled and outdoor environments. Unlike traditional optical or inertial systems, our approach is shape-invariant and resilient to environmental constraints such as lighting and
magnetic interference. At the core of our system is Wild-Poser (WiP for short), a compact, real-time
Transformer-based architecture that directly predicts 3D joint positions from noisy or corrupted PWD measurements, which can later be used for joint rotation reconstruction via learned methods. WiP generalizes across subjects of varying morphologies, including non-human species, without requiring individual body measurements or shape fitting. Operating in real time, WiP achieves low joint position error and demonstrates accurate 3D motion reconstruction for both human and animal subjects in-the-wild. Our empirical analysis highlights its potential for scalable, low-cost, and general purpose motion capture in real-world settings.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.CV
Cortex-Grounded Diffusion Models for Brain Image Generation
Fabian Bongratz, Yitong Li, Sama Elbaroudy et al. (+1 more)
Synthetic neuroimaging data can mitigate critical limitations of real-world
datasets, including the scarcity of rare phenotypes, domain shifts across scanners, and insufficient longitudinal coverage. However, existing generative models largely rely on weak conditioning signals, such as labels or text, which lack anatomical grounding and often produce biologically implausible outputs. To this end, we introduce Cor2Vox, a cortex-grounded generative framework for
brain magnetic resonance image (MRI) synthesis that ties image generation to continuous structural priors of the cerebral cortex. It leverages high-resolution cortical surfaces to guide a 3D shape-to-image Brownian bridge
diffusion process, enabling topologically faithful synthesis and precise control over underlying anatomies. To support the generation of new, realistic
brain shapes, we developed a large-scale statistical shape model of cortical morphology derived from over 33,000 UK Biobank scans. We validated the fidelity of Cor2Vox based on traditional image quality metrics, advanced cortical surface reconstruction, and whole-
brain segmentation quality, outperforming many baseline methods. Across three applications, namely (i) anatomically consistent synthesis, (ii) simulation of progressive gray matter atrophy, and (iii) harmonization of in-house frontotemporal dementia scans with public
datasets, Cor2Vox preserved fine-grained cortical morphology at the sub-voxel level, exhibiting remarkable robustness to variations in cortical geometry and disease phenotype without retraining.
Read the full abstract ▾
All authors Fabian Bongratz, Yitong Li, Sama Elbaroudy, Christian Wachinger
Machine Learning
LLM-VA: Resolving the Jailbreak-Overrefusal Trade-off via Vector Alignment
Haonan Zhang, Dongxia Wang, Yi Liu et al. (+2 more)
Safety-aligned LLMs suffer from two failure modes: jailbreak (answering harmful inputs) and over-refusal (declining benign queries). Existing vector steering methods adjust the magnitude of answer vectors, but this creates a fundamental trade-off – reducing jailbreak increases over-refusal and vice versa. We identify the root cause: LLMs encode the decision to answer (answer vector $v_a$) and the judgment of input safety (benign vector $v_b$) as nearly orthogonal directions, treating them as independent processes. We propose LLM-VA, which aligns $v_a$ with $v_b$ through closed-form weight updates, making the model's willingness to answer causally dependent on its safety assessment – without fine-tuning or architectural changes. Our method identifies vectors at each layer using SVMs, selects safety-relevant layers, and iteratively aligns vectors via minimum-norm weight modifications. Experiments on 12 LLMs demonstrate that LLM-VA achieves 11.45% higher F1 than the best baseline while preserving 95.92% utility, and automatically adapts to each model's safety bias without manual tuning. Code and models are available at https://hotbento.github.io/LLM-VA-Web/.
Read the full abstract ▾
All authors Haonan Zhang, Dongxia Wang, Yi Liu, Kexin Chen, Wenhai Wang
Machine Learning · Cross-listed from cs.NE
Online Regime-aware Calibration for Black-box Social Simulators via Posterior-assisted Evolutionary Dynamic Optimization
Peng Yang, Zhenhua Yang, Boquan Jiang et al. (+3 more)
Evolutionary dynamic optimization (EDO) commonly assumes that environmental changes can be detected from fitness variations and handled through random re-initialization, historical solutions, or learned transition patterns. Online calibration of black-box simulators introduces a different setting, where the dynamic objective is induced by sequential observations and a changing calibration window, rather than being controlled by explicit variables. Fitness variations therefore cannot be directly attributed to regime changes, while the unknown relationship between successive regimes limits conventional adaptation. We formulate this setting as an observation-driven dynamic optimization problem and propose PosEDO, which augments fitness-based EDO with an observation-conditioned parameter-space signal. PosEDO learns this signal online as a posterior distribution over simulator parameters from parameter-trajectory pairs generated during evolutionary evaluation, using posterior shifts for change detection and posterior samples for population adaptation. The new evaluation records are further utilized for online posterior updating without additional simulator calls. Experiments on nonstationary economic and financial simulators show that PosEDO improves calibration accuracy, optimization performance, and change-detection quality over representative EDO baselines.
Read the full abstract ▾
All authors Peng Yang, Zhenhua Yang, Boquan Jiang, Chenkai Wang, Ke Tang, Xin Yao
Machine Learning
Time-to-Injury Forecasting in Elite Female Football: A DeepHit Survival Approach
Victoria Catterall, Cise Midoglu and Stephen Lynch
Injury occurrence in football poses significant challenges for athletes and teams, carrying personal, competitive, and financial consequences. While machine learning has been applied to injury prediction before, existing approaches often rely on static pre-season data and binary outcomes, limiting their real-world utility. This study investigates the feasibility of using a DeepHit neural network to forecast time-to-injury from longitudinal athlete monitoring data, while providing interpretable predictions. The analysis utilised the publicly available SoccerMon
dataset, containing two seasons of training, match, and wellness records from elite female footballers. Data was pre-processed through cleaning, feature engineering, and the application of three imputation strategies. Baseline models (Random Forest, XGBoost, Logistic Regression) were optimised via grid search for benchmarking, while the DeepHit model, implemented with a multilayer perceptron backbone, was evaluated using chronological and leave-one-player-out (LOPO) validation. DeepHit achieved a concordance index of 0.762, outperforming baseline models and delivering individualised, time-varying risk estimates. Shapley Additive Explanations (SHAP) identified clinically relevant predictors consistent with established risk factors, enhancing interpretability. Overall, this study provides a novel proof of concept: survival modelling with DeepHit shows strong potential to advance injury
forecasting in football, offering accurate, explainable, and actionable insights for injury prevention across competitive levels.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.LO
On the Expressiveness of State Space Models via Temporal Logics
Eric Alsmann, Lowejatan Noori and Martin Lange
We investigate the expressive power of state space models (SSM), which have recently emerged as a potential alternative to
transformer architectures in large
language models. Building on recent work, we analyse SSM expressiveness through fragments and extensions of linear temporal logic over finite traces. Our results show that the expressive capabilities of SSM vary substantially depending on the underlying gating mechanism. We further distinguish between SSM operating over fixed-width arithmetic (quantised models), whose expressive power remains within regular
languages, and SSM with unbounded precision, which can capture counting properties and non-regular
languages. In addition, we provide a systematic comparison between these different SSM variants and known results on
transformers, thereby clarifying how the two architectures relate in terms of expressive power.
Read the full abstract ▾
Machine Learning
APC-RL: Exceeding Data-Driven Behavior Priors with Adaptive Policy Composition
Finn Rietz, Pedro Zuidberg dos Martires and Johannes Andreas Stork
Incorporating demonstration data into reinforcement learning (RL) can greatly accelerate learning, but existing approaches often assume demonstrations are optimal and fully aligned with the target task. In practice, demonstrations are frequently sparse, suboptimal, or misaligned, which can degrade performance when these demonstrations are integrated into RL. We propose Adaptive Policy Composition (APC), a hierarchical model that adaptively composes multiple data-driven Normalizing Flow (NF) priors. Instead of enforcing strict adherence to the priors, APC estimates each prior's applicability to the target task while leveraging them for exploration. Moreover, APC either refines useful priors, or sidesteps misaligned ones when necessary to optimize downstream reward. Across diverse
benchmarks, APC accelerates learning when demonstrations are aligned, remains robust under severe misalignment, and leverages suboptimal demonstrations to bootstrap exploration while avoiding performance degradation caused by overly strict adherence to suboptimal demonstrations.
Read the full abstract ▾
Machine Learning
Fixed Aggregation Features Can Rival GNNs
Celia Rubio-Madrigal and Rebekka Burkholz
Graph neural networks (GNNs) are widely believed to excel at node representation learning through trainable neighborhood aggregations. We challenge this view by introducing Fixed Aggregation Features (FAFs), a training-free approach that transforms graph learning tasks into tabular problems. This simple shift enables the use of well-established tabular methods, offering strong interpretability and the flexibility to deploy diverse classifiers. Across 14
benchmarks, well-tuned multilayer perceptrons trained on FAFs rival or outperform state-of-the-art GNNs and graph
transformers on 12 tasks – often using only mean aggregation. The only exceptions are the Roman Empire and Minesweeper
datasets, which typically require unusually deep GNNs. To explain the theoretical possibility of non-trainable aggregations, we connect our findings to Kolmogorov-Arnold representations and discuss when mean aggregation can be sufficient. In conclusion, our results call for (i) richer
benchmarks benefiting from learning diverse neighborhood aggregations, (ii) strong tabular baselines as standard, and (iii) employing and advancing tabular models for graph data to gain new insights into related tasks.
Read the full abstract ▾
Machine Learning
From Internal Diagnosis to External Auditing: A VLM-Driven Paradigm for Data-Free Online Backdoor Defense
Binyan Xu, Fan Yang, Xilin Dai et al. (+2 more)
Deep Neural Networks remain inherently vulnerable to
backdoor attacks. Traditional test-time defenses largely operate under the paradigm of internal diagnosis methods like model repairing or input robustness, yet these approaches are often fragile under advanced attacks as they remain entangled with the victim model's corrupted parameters. We propose a paradigm shift from Internal Diagnosis to External Semantic
Auditing, arguing that effective defense requires decoupling safety from the victim model via an independent, semantically grounded auditor. To this end, we present a framework harnessing Universal
Vision-
Language Models (VLMs) as evolving semantic gatekeepers. We introduce PRISM (Prototype Refinement & Inspection via Statistical Monitoring), which overcomes the domain gap of general VLMs through two key mechanisms: a Hybrid VLM Teacher that dynamically refines visual prototypes online, and an Adaptive Router powered by statistical margin monitoring to calibrate gating thresholds in real-time. Extensive evaluation across 17
datasets and 11 attack types demonstrates that PRISM achieves state-of-the-art performance, suppressing Attack Success Rate to <1% on CIFAR-10 while improving clean accuracy, establishing a new standard for model-agnostic, externalized security.
Read the full abstract ▾
All authors Binyan Xu, Fan Yang, Xilin Dai, Di Tang, Kehuan Zhang
Machine Learning
OSIRIS: Bridging Analog Circuit Design and Machine Learning with Scalable Dataset Generation
Giuseppe Chiari, Michele Piccoli and Davide Zoni
The automation of analog integrated
circuit (IC) design remains a longstanding challenge, primarily due to the intricate interdependencies among physical layout, parasitic effects, and
circuit-level performance. These interactions impose complex constraints that are difficult to accurately capture and optimize using conventional design methodologies. Although recent advances in machine learning (ML) have shown promise in automating specific stages of the analog design flow, the development of holistic, end-to-end frameworks that integrate these stages and iteratively refine layouts using post-layout, parasitic-aware performance feedback is still in its early stages. Furthermore, progress in this direction is hindered by the limited availability of open, high-quality
datasets tailored to the analog domain, restricting both the benchmarking and the generalizability of ML-based techniques. To address these limitations, we present OSIRIS, a scalable
dataset generation pipeline for analog IC design. OSIRIS systematically explores the design space of analog
circuits while producing comprehensive performance metrics and metadata, thereby enabling ML-driven research in electronic design automation (EDA). In addition, we release a
dataset consisting of 87,100
circuit variations generated with OSIRIS, accompanied by a reinforcement learning (RL)-based baseline method that exploits OSIRIS for analog design optimization.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.RO
Task-Centric Policy Optimization from Misaligned Motion Priors
Ziang Zheng, Kai Feng, Yi Nie et al. (+1 more)
Humanoid control often leverages motion priors from human demonstrations to encourage natural behaviors. However, such demonstrations are frequently suboptimal or misaligned with robotic tasks due to embodiment differences, retargeting errors, and task-irrelevant variations, causing naïve imitation to degrade task performance. Conversely, task-only reinforcement learning admits many task-optimal solutions, often resulting in unnatural or unstable motions. This exposes a fundamental limitation of linear reward mixing in
adversarial imitation learning. We propose Task-Centric Motion Priors (TCMP), a task-priority
adversarial imitation framework that treats imitation as a conditional regularizer rather than a co-equal objective. TCMP maximizes task improvement while incorporating imitation signals only when they are compatible with task progress, yielding an adaptive, geometry-aware update that preserves task-feasible descent and suppresses harmful imitation under misalignment. We provide theoretical analysis of gradient conflict and task-priority stationary points, and validate our claims through
humanoid control experiments demonstrating robust task performance with consistent motion style under noisy demonstrations.
Read the full abstract ▾
All authors Ziang Zheng, Kai Feng, Yi Nie, Shentao Qin
Machine Learning · Cross-listed from cs.AI
RPO:Reinforcement Fine-Tuning with Partial Reasoning Optimization
Hongzhu Yi, Xinming Wang, Zhenghao zhang et al. (+12 more)
Within the domain of large
language models, reinforcement fine-tuning
algorithms necessitate the generation of a complete
reasoning trajectory beginning from the input query, which incurs significant computational overhead during the rollout phase of training. To address this issue, we analyze the impact of different segments of the
reasoning path on the correctness of the final result and, based on these insights, propose Reinforcement Fine-Tuning with Partial
Reasoning Optimization (RPO), a plug-and-play reinforcement fine-tuning
algorithm. Unlike traditional reinforcement fine-tuning
algorithms that generate full
reasoning paths, RPO trains the model by generating suffixes of the
reasoning path using experience cache. During the rollout phase of training, RPO reduces
token generation in this phase by approximately 95%, greatly lowering the theoretical time overhead. Compared with full-path reinforcement fine-tuning
algorithms, RPO reduces the training time of the 1.5B model by 90% and the 7B model by 72%. At the same time, it can be integrated with typical
algorithms such as GRPO and DAPO, enabling them to achieve training acceleration while maintaining performance comparable to the original
algorithms. Our code is open-sourced at https://github.com/yhz5613813/RPO.
Read the full abstract ▾
All authors Hongzhu Yi, Xinming Wang, Zhenghao zhang, Tianyu Zong, Yuanxiang Wang, Jun Xie, Tao Yu, Haopeng Jin, Kaixin Xu, Feng Chen, Jiahuan Chen, Yujia Yang, Zhenyu Guan, Bingkang Shi, Jungang Xu
Machine Learning · Cross-listed from math.OC
Improved Convergence Rates of Muon Optimizer for Nonconvex Optimization
Shuntaro Nagashima and Hideaki Iiduka
The
Muon optimizer has recently attracted
attention due to its orthogonalized first-order updates, and a deeper theoretical understanding of its convergence behavior is essential for guiding practical applications; however, existing convergence guarantees are either coarse or obtained under restrictive analytical settings. In this work, we establish sharper convergence guarantees for the
Muon optimizer through a direct and simplified analysis that does not rely on restrictive assumptions on the update rule. Our results improve upon existing bounds by achieving faster convergence rates while covering a broader class of problem settings. These findings provide a more accurate theoretical characterization of
Muon and offer insights applicable to a broader class of orthogonalized first-order methods.
Read the full abstract ▾
Machine Learning
SEAFormer: A Spatial Proximity and Edge-Aware Transformer for Real-World Vehicle Routing Problems
Saeed Nasehi Basharzad, Farhana Choudhury and Egemen Tanin
Real-world Vehicle Routing Problems (RWVRPs) require solving complex, sequence-dependent challenges at scale with constraints such as delivery time window, replenishment or recharging stops, asymmetric travel cost, etc. While recent neural methods achieve strong results on large-scale classical VRP
benchmarks, they struggle to address RWVRPs because their strategies overlook sequence dependencies and underutilize edge-level information, which are precisely the characteristics that define the complexity of RWVRPs. We present SEAFormer, a novel
transformer that incorporates both node-level and edge-level information in decision-making through two key innovations. First, our Clustered Proximity
Attention (CPA) exploits locality-aware clustering to reduce the complexity of
attention from $O(n^2)$ to $O(n)$ while preserving global perspective, allowing SEAFormer to efficiently train on large instances. Second, our lightweight edge-aware module captures pairwise features through residual fusion, enabling effective incorporation of edge-based information and faster convergence. Extensive experiments across four RWVRP variants with various scales demonstrate that SEAFormer achieves superior results over state-of-the-art methods. Notably, SEAFormer is the first neural method to solve 1,000+ node RWVRPs effectively, while also achieving superior performance on classic VRPs, making it a versatile solution for both research
benchmarks and real-world applications.
Read the full abstract ▾
Machine Learning
DSP-Reg: Domain-Sensitive Parameter Regularization for Robust Domain Generalization
Xudong Han, Senkang Hu, Yihang Tao et al. (+4 more)
Domain Generalization (DG) is a critical area that focuses on developing models capable of performing well on data from unseen distributions, which is essential for real-world applications. Existing approaches primarily concentrate on learning domain-invariant features, which assume that a model robust to variations in the source domains will generalize well to unseen target domains. However, these approaches neglect a deeper analysis at the parameter level, which makes the model hard to explicitly differentiate between parameters sensitive to domain shifts and those robust, potentially hindering its overall ability to generalize. In order to address these limitations, we first build a covariance-based parameter sensitivity analysis framework to quantify the sensitivity of each parameter in a model to domain shifts. By computing the covariance of parameter gradients across multiple source domains, we can identify parameters that are more susceptible to domain variations, which serves as our theoretical foundation. Based on this, we propose Domain-Sensitive Parameter Regularization (DSP-Reg), a principled framework that guides model optimization by a soft regularization technique that encourages the model to rely more on domain-invariant parameters while suppressing those that are domain-specific. This approach provides a more granular control over the model's learning process, leading to improved robustness and generalization to unseen domains. Extensive experiments on
benchmarks, such as PACS, VLCS, OfficeHome, and DomainNet, demonstrate that DSP-Reg outperforms state-of-the-art approaches, achieving an average accuracy of 66.7% and surpassing all baselines.
Read the full abstract ▾
All authors Xudong Han, Senkang Hu, Yihang Tao, Yu Guo, Philip Birch, Sam Tak Wu Kwong, Yuguang Fang
Machine Learning · Cross-listed from cs.SE
High-quality data augmentation for code comment classification
Thomas Borsani, Andrea Rosani and Giuseppe Di Fatta
Code comments serve a crucial role in software development for documenting functionality, clarifying design choices, and assisting with issue tracking. They capture developers' insights about the surrounding source code, serving as an essential resource for both human comprehension and automated analysis. Nevertheless, since comments are in natural
language, they present challenges for machine-based code understanding. To address this, recent studies have applied natural
language processing (NLP) and deep learning techniques to classify comments according to developers' intentions. However, existing
datasets for this task suffer from size limitations and class imbalance, as they rely on manual annotations and may not accurately represent the distribution of comments in real-world codebases. To overcome this issue, we introduce new synthetic oversampling and augmentation techniques based on high-quality data generation to enhance the NLBSE'26 challenge
datasets. Our Synthetic Quality Oversampling Technique and Augmentation Technique (Q-SYNTH) yield promising results, improving the base classifier by $2.56\%$.
Read the full abstract ▾
Machine Learning · Cross-listed from math.OC
Optimal Asynchronous Stochastic Nonconvex Optimization under Heavy-Tailed Noise
Yidong Wu and Luo Luo
This paper considers the problem of asynchronous
stochastic nonconvex optimization with heavy-tailed gradient noise and arbitrarily heterogeneous computation times across workers. We propose an asynchronous normalized
stochastic gradient descent
algorithm with momentum. The analysis show that our method achieves the optimal time complexity under the assumption of bounded $p$th-order central moment with $p\in(1,2]$. We also provide numerical experiments to show the effectiveness of proposed method.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.RO
Teaching Machine Learning Fundamentals with LEGO Robotics
Viacheslav Sydora, Guner Dilsad Er and Michael Muehlebach
This paper presents the web-based platform Machine Learning with Bricks and an accompanying two-day course designed to teach machine learning concepts to students aged 12 to 17 through programming-free robotics activities. Machine Learning with Bricks is an open source platform and combines interactive visualizations with LEGO robotics to teach three core
algorithms: KNN, linear regression, and Q-learning. Students learn by collecting data, training models, and interacting with
robots via a web-based interface. Pre- and post-surveys with 14 students indicate statistically significant improvements in self-reported understanding of machine learning
algorithms, changes in AI-related terminology toward more technical
language, high platform usability, and increased motivation for continued learning. This work suggests that tangible, visualization-based approaches can make machine learning concepts accessible and engaging for young learners while maintaining technical depth. The platform is freely available at https://learning-and-dynamics.github.io/ml-with-bricks/, with
video tutorials guiding students through the experiments at https://youtube.com/playlist?list=PLx1grFu4zAcwfKKJZ1Ux4LwRqaePCOA2J.
Read the full abstract ▾
Machine Learning
Selective Steering: Norm-Preserving Control Through Discriminative Layer Selection
Quy-Anh Dang and Chris Ngo
Despite significant progress in
alignment, large
language models (LLMs) remain vulnerable to
adversarial attacks that elicit harmful behaviors. Activation steering techniques offer a promising inference-time intervention approach, but existing methods suffer from critical limitations: activation addition requires careful coefficient tuning and is sensitive to layer-specific norm variations, while directional ablation provides only binary control. Recent work on Angular Steering introduces continuous control via rotation in a 2D subspace, but its practical implementation violates norm preservation, causing distribution shift and generation collapse, particularly in models below 7B parameters. We propose Selective Steering, which addresses these limitations through two key innovations: (1) a mathematically rigorous norm-preserving rotation formulation that maintains activation distribution integrity, and (2) discriminative layer selection that applies steering only where feature representations exhibit opposite-signed class
alignment. Experiments across nine models demonstrate that Selective Steering achieves 5.5x higher attack success rates than prior methods while maintaining zero perplexity violations and approximately 100% capability retention on standard
benchmarks. Our approach provides a principled, efficient framework for controllable and stable LLM behavior modification. Code: https://github.com/knoveleng/steering
Read the full abstract ▾
Machine Learning · Cross-listed from cs.CR
CHEHAB RL: Learning to Optimize Fully Homomorphic Encryption Computations
Bilel Sefsaf, Abderraouf Dandani, Abdessamed Seddiki et al. (+4 more)
Fully Homomorphic Encryption (FHE) enables computations directly on encrypted data, but its high computational cost remains a significant barrier. Writing efficient FHE code is a complex task requiring cryptographic expertise, and finding the optimal sequence of program transformations is often intractable. In this paper, we propose CHEHAB RL, a novel framework that leverages deep reinforcement learning (RL) to automate FHE code optimization. Instead of relying on predefined heuristics or combinatorial search, our method trains an RL
agent to learn an effective policy for applying a sequence of rewriting rules to automatically vectorize scalar FHE code while reducing instruction latency and noise growth. The proposed approach supports the optimization of both structured and unstructured code. To train the
agent, we synthesize a diverse
dataset of computations using a large
language model (LLM). We integrate our proposed approach into the CHEHAB FHE compiler and evaluate it on a suite of
benchmarks, comparing its performance against Coyote, a state-of-the-art vectorizing FHE compiler. The results show that our approach generates code that is $5.3\times$ faster in execution, accumulates $2.54\times$ less noise, while the compilation process itself is $27.9\times$ faster than Coyote (
geometric means).
Read the full abstract ▾
All authors Bilel Sefsaf, Abderraouf Dandani, Abdessamed Seddiki, Arab Mohammed, Eduardo Chielle, Michail Maniatakos, Riyadh Baghdadi
Machine Learning
GraphSB: Boosting Imbalanced Node Classification on Graphs through Structural Balance
Zhixiao Wang, Chaofan Zhu, Qihan Feng et al. (+3 more)
Imbalanced node classification is a critical challenge in graph learning, where most existing methods typically utilize Graph Neural Networks (GNNs) to learn node representations. These methods can be broadly categorized into the data-level and the
algorithm-level. The former aims to synthesize minority-class nodes to mitigate quantity imbalance, while the latter tries to optimize the learning process to highlight minority classes. However, neither of them addresses the inherently imbalanced graph structure, which is a fundamental factor that incurs majority-class dominance and minority-class assimilation in GNNs. Our theoretical analysis further supports this critical insight. Therefore, we propose GraphSB (Graph Structural Balance), a novel framework that incorporates Structural Balance as a key strategy to address the underlying imbalanced graph structure before node synthesis. Structural Balance performs a two-stage structure optimization: Structure Enhancement that mines hard samples near decision boundaries through dual-view analysis and enhances connectivity for minority classes through adaptive augmentation, and Relation
Diffusion that propagates the enhanced minority context while simultaneously capturing higher-order structural dependencies. Thus, GraphSB balances structural distribution before node synthesis, enabling more effective learning in GNNs. Extensive experiments demonstrate that GraphSB significantly outperforms the state-of-the-art methods. More importantly, the proposed Structural Balance can be seamlessly integrated into state-of-the-art methods as a simple plug-and-play module, increasing their accuracy by an average of 4.57%.
Read the full abstract ▾
All authors Zhixiao Wang, Chaofan Zhu, Qihan Feng, Jian Zhang, Xiaobin Rui, Philip S Yu