Machine Learning
Can Microcanonical Langevin Dynamics Leverage Mini-Batch Gradient Noise?
Emanuel Sommer, Kangning Diao, Jakob Robnik et al. (+2 more)
Scaling inference methods such as Markov chain Monte Carlo to high-dimensional models remains a central challenge in
Bayesian deep learning. A promising recent proposal, microcanonical Langevin Monte Carlo, has shown state-of-the-art performance across a wide range of problems. However, its reliance on full-
dataset gradients makes it prohibitively expensive for large-scale problems. This paper addresses a fundamental question: Can microcanonical dynamics effectively leverage mini-batch gradient noise? We provide the first systematic study of this problem, establishing a novel continuous-time theoretical analysis of
stochastic-gradient microcanonical dynamics. We reveal two critical failure modes: a theoretically derived bias due to anisotropic gradient noise and numerical instabilities in complex high-dimensional posteriors. To tackle these issues, we propose a principled gradient noise preconditioning scheme shown to significantly reduce this bias and develop a novel, energy-variance-based adaptive tuner that automates step size selection and dynamically informs numerical guardrails. The resulting
algorithm is a robust and scalable microcanonical Monte Carlo sampler that achieves state-of-the-art performance on challenging high-dimensional inference tasks like
Bayesian neural networks. Combined with recent ensemble techniques, our work unlocks a new class of
stochastic microcanonical Langevin ensemble (SMILE) samplers for large-scale
Bayesian inference.
Read the full abstract ▾
All authors Emanuel Sommer, Kangning Diao, Jakob Robnik, Uros Seljak, David Rügamer
Machine Learning
Adaptive Uncertainty-Aware Tree Search for Robust Reasoning
Zeen Song, Zihao Ma, Wenwen Qiang et al. (+2 more)
Inference-time
reasoning scaling has significantly advanced the capabilities of Large
Language Models (LLMs) in complex problem-solving. A prevalent approach involves external search guided by Process Reward Models (PRMs). However, a fundamental limitation of this framework is the epistemic uncertainty of PRMs when evaluating
reasoning paths that deviate from their training distribution. In this work, we conduct a systematic analysis of this challenge. We first provide empirical evidence that PRMs exhibit high uncertainty and unreliable scoring on out-of-distribution (OOD) samples. We then establish a theoretical framework proving that while standard search incurs linear regret accumulation, an uncertainty-aware strategy can achieve sublinear regret. Motivated by these findings, we propose Uncertainty-Aware Tree Search (UATS), a unified method that estimates uncertainty via Monte Carlo Dropout and dynamically allocates compute budget using a reinforcement learning-based controller. Extensive experiments demonstrate that our approach effectively mitigates the impact of OOD errors.
Read the full abstract ▾
All authors Zeen Song, Zihao Ma, Wenwen Qiang, Changwen Zheng, Gang Hua
Machine Learning · Cross-listed from cs.MA
Prism: Spectral Parameter Sharing for Multi-Agent Reinforcement Learning
Kyungbeom Kim, Seungwon Oh and Kyung-Joong Kim
Parameter sharing is a key strategy in multi-
agent reinforcement learning (MARL) for improving scalability, yet conventional fully shared architectures often collapse into homogeneous behaviors. Recent methods introduce diversity through clustering,
pruning, or masking, but typically compromise resource efficiency. We propose Prism, a parameter sharing framework that induces inter-
agent diversity by representing shared networks in the spectral domain via singular value decomposition (SVD). All
agents share the singular vector directions while learning distinct spectral masks on singular values. This mechanism encourages inter-
agent diversity and preserves scalability. Extensive experiments on both homogeneous (LBF, SMACv2) and heterogeneous (MaMuJoCo)
benchmarks show that Prism achieves competitive performance with superior resource efficiency.
Read the full abstract ▾
Machine Learning
Towards Generalizable Reasoning: Group Causal Counterfactual Policy Optimization for LLM Reasoning
Jingyao Wang, Peizheng Guo, Wenwen Qiang et al. (+4 more)
Large
language models (LLMs) excel at complex tasks with advances in
reasoning capabilities. However, existing reward mechanisms remain tightly coupled to final correctness and pay little
attention to the underlying
reasoning process: trajectories with sound
reasoning but wrong answers receive low credit, while lucky guesses with flawed logic may be highly rewarded, affecting
reasoning generalization. From a causal perspective, we interpret multi-candidate
reasoning for a fixed question as a family of counterfactual experiments with theoretical supports. Building on this, we propose Group Causal Counterfactual Policy Optimization to explicitly train LLMs to learn generalizable
reasoning patterns. It proposes an episodic causal counterfactual reward that jointly captures (i) robustness, encouraging the answer distribution induced by a
reasoning step to remain stable under counterfactual perturbations; and (ii) effectiveness, enforcing sufficient variability so that the learned
reasoning strategy can transfer across questions. We then construct
token-level advantages from this reward and optimize the policy, encouraging LLMs to favor
reasoning patterns that are process-valid and counterfactually robust. Extensive experiments on diverse
benchmarks demonstrate its advantages.
Read the full abstract ▾
All authors Jingyao Wang, Peizheng Guo, Wenwen Qiang, Jiahuan Zhou, Huijie Guo, Changwen Zheng, Hui Xiong
Machine Learning · Cross-listed from cs.CL
Revisiting the Shape Convention of Transformer Language Models
Feng-Ting Liao, Guan-Ting Yi, Tzu-Quan Lin et al. (+2 more)
The architectural shape of dense
Transformers has remained remarkably stable: narrow-wide-narrow feed-forward networks (FFNs) consume most non-
embedding parameters. Motivated by theoretical and empirical evidences that residual wide-narrow-wide (hourglass) MLPs remain expressive despite bottlenecks, we revisit whether this architectural convention is necessary for dense
language models. We study Hourglass
Transformers, which replace the conventional FFN with residual stacks of hourglass sub-MLPs and use hourglass
attention to decouple residual-stream width from
attention width. This exposes a practical depth-width trade-off: compressing the FFN intermediate dimension allows wider hidden states and fewer layers at matched parameter budgets. Across model scales from 113M to 8B parameters, Hourglass
Transformers achieve
language-modeling and downstream performance comparable to conventional
Transformers, while improving training compute efficiency by $8.7\%$ at matched average downstream accuracy across the 906M, 3B, and 8B scales. After long-context extension, the 8B Hourglass model also outperforms its matched conventional baseline across 4k-64k context lengths. At 64k context, the reduced
attention layer count lowers both computation and KV-cache requirements, yielding up to $1.93\times$ faster
token decoding and $50\%$ lower KV-cache
memory at the 1B scale. These results identify hourglass structures as a practical architecture-efficiency alternative for compute- and latency-conscious
Transformer design.
Read the full abstract ▾
All authors Feng-Ting Liao, Guan-Ting Yi, Tzu-Quan Lin, Meng-Hsi Chen, Da-shan Shiu
Machine Learning · Cross-listed from cs.CL
Daisuke Oba, Hiroki Furuta and Naoaki Okazaki
Masked
diffusion language models generate text through iterative masked-
token filling, but terminal-only rewards on final completions provide coarse credit assignment for the intermediate filling decisions that shape the generation process. We propose
Diffusion-State Policy Optimization (DiSPO), a plug-in credit-assignment layer that directly optimizes intermediate filling decisions. At selected intermediate masked states, DiSPO branches by resampling the currently masked positions from rollout-cached logits, scores the resulting completions, and updates only the newly filled
tokens, requiring no additional multi-step
diffusion rollouts or optimizer steps. We formalize a fixed-state objective for branched completions and derive a policy-gradient
estimator that reuses the same rollouts as terminal-feedback policy optimization. Experiments on LLaDA-8B-Instruct show that DiSPO consistently improves terminal-feedback baselines, including diffu-GRPO and SPG, on math and planning
benchmarks under matched rollout compute and optimizer steps, supporting its use as a general plug-in for masked
diffusion policy optimization. Our project page is available at https://daioba.github.io/dispo .
Read the full abstract ▾
Machine Learning
Achieving Better Local Regret Bound for Online Non-Convex Bilevel Optimization
Tingkai Jia, Haiguang Wang and Cheng Chen
Online bilevel optimization (OBO) has emerged as a powerful framework for many machine learning problems. Prior works have developed several
algorithms that minimize the standard bilevel local regret or the window-averaged bilevel local regret of the OBO problem, but the optimality of existing regret bounds remains unclear. In this work, we establish optimal regret bounds for both settings. For standard bilevel local regret, we propose an
algorithm with adaptive iteration strategy that achieves the optimal regret $\Omega(1+V_T)$ with at most $O(T\log T)$ total inner-level gradient evaluations. We further develop a fully single-loop
algorithm whose regret bound includes an additional gradient-variation terms. For the window-averaged bilevel local regret, we design an
algorithm that captures linear environmental variation through a novel window-based analysis and achieves the optimal regret $\Omega(T/W^2)$. The
algorithm also supports an efficient single-loop structure, achieving an $O(T/W)$ regret bound with $O(WT)$ total gradient evaluations. Experiments validate our theoretical findings and demonstrate the practical effectiveness of the proposed methods.
Read the full abstract ▾
Machine Learning
The Window Dilemma: Why Concept Drift Detection is Ill-Posed
Brandon Gower-Winter, Misja Groen and Georg Krempl
Non-stationarity of an underlying data generating process that leads to distributional changes over time is a key characteristic of Data Streams. This phenomenon, commonly referred to as Concept Drift, has been intensively studied, and Concept Drift Detectors have been established as a class of methods for detecting such changes (drifts). For the most part, Drift Detectors compare regions (windows) of the data stream and detect drift if those windows are sufficiently dissimilar. In this work, we introduce the Window Dilemma, an observation that perceived drift is a product of windowing and not necessarily the underlying data generating process. Additionally, we highlight that drift detection is ill-posed, primarily because verification of drift events are implausible in practice. We demonstrate these contributions first by an illustrative example, followed by empirical comparisons of drift detectors against a variety of alternative adaptation strategies. Our main finding is that traditional batch learning techniques often perform better than their drift-aware counterparts further bringing into question the purpose of detectors in Stream Classification.
Read the full abstract ▾
Machine Learning
On the Plasticity and Stability for Post-Training Large Language Models
Wenwen Qiang, Ziyin Gu, Jiahuan Zhou et al. (+4 more)
Training stability remains a critical bottleneck for Group Relative Policy Optimization (GRPO), often manifesting as a trade-off between
reasoning plasticity and general capability retention. We identify a root cause as the
geometric conflict between plasticity and stability gradients, which leads to destructive interference. Crucially, we argue that deterministic projection methods are suboptimal for GRPO as they overlook the intrinsic stochasticity of group-based gradient estimates. To address this, we propose Probabilistic Conflict Resolution (PCR), a
Bayesian framework that models gradients as random variables. PCR dynamically arbitrates conflicts via an uncertainty-aware “soft projection” mechanism, optimizing the signal-to-noise ratio. Extensive experiments demonstrate that PCR significantly smooths the training trajectory and achieves superior performance in various
reasoning tasks.
Read the full abstract ▾
All authors Wenwen Qiang, Ziyin Gu, Jiahuan Zhou, Jie Hu, Jingyao Wang, Changwen Zheng, Hui Xiong
Machine Learning
BrokenBind: Universal Modality Exploration beyond Dataset Boundaries
Zhuo Huang, Runnan Chen, Bo Han et al. (+3 more)
Multi-modal learning combines various modalities to provide a comprehensive understanding of real-world problems. A common strategy is to directly bind different modalities together in a specific joint
embedding space. However, the capability of existing methods is restricted within the modalities presented in the given
dataset, thus they are biased when generalizing to unpresented modalities in downstream tasks. As a result, due to such inflexibility, the viability of previous methods is seriously hindered by the cost of acquiring multi-modal
datasets. In this paper, we introduce BrokenBind, which focuses on binding modalities that are presented from different
datasets. To achieve this, BrokenBind simultaneously leverages multiple
datasets containing the modalities of interest and one shared modality. Though the two
datasets do not correspond to each other due to distribution mismatch, we can capture their relationship to generate pseudo
embeddings to fill in the missing modalities of interest, enabling flexible and generalized multi-modal learning. Under our framework, any two modalities can be bound together, free from the
dataset limitation, to achieve universal modality exploration. Further, to reveal the capability of our method, we study intensified scenarios where more than two
datasets are needed for modality binding and show the effectiveness of BrokenBind in low-data regimes. Through extensive evaluation, we carefully justify the superiority of BrokenBind compared to well-known multi-modal baseline methods.
Read the full abstract ▾
All authors Zhuo Huang, Runnan Chen, Bo Han, Gang Niu, Masashi Sugiyama, Tongliang Liu
Machine Learning
Principle-Evolvable Scientific Discovery via Uncertainty Minimization
Yingming Pu, Tao Lin and Hongyu Chen
Large
Language Model (LLM)-based scientific
agents have accelerated scientific discovery, yet they often suffer from significant inefficiencies due to adherence to fixed initial priors. Existing approaches predominantly operate within a static hypothesis space, which restricts the discovery of novel phenomena, resulting in computational waste when baseline theories fail. To address this, we propose shifting the focus from searching hypotheses to evolving the underlying scientific principles. We present PiEvo, a principle-evolvable framework that treats scientific discovery as
Bayesian optimization over an expanding principle space. By integrating Information-Directed Hypothesis Selection via Gaussian Process and an anomaly-driven augmentation mechanism, PiEvo enables
agents to autonomously refine their theoretical worldview. Evaluation across four
benchmarks demonstrates that PiEvo (1) achieves an average solution quality of up to 90.81%~93.15%, representing a 29.7%~31.1% improvement over the state-of-the-art, (2) attains an 83.3% speedup in convergence step via significantly reduced sample complexity by optimizing the compact principle space, and (3) maintains robust performance across diverse scientific domains and LLM backbones. Code is publicly available at \hyperlink{https://github.com/amair-lab/PiEvo}{github.com/amair-lab/PiEvo}.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.CL
CORE: Comprehensive Ontological Relation Evaluation for Large Language Models
Satyam Dwivedi, Sanjukta Ghosh, Shivam Dwivedi et al. (+7 more)
Large
Language Models (LLMs) perform well on many
reasoning benchmarks, yet existing evaluations rarely assess their ability to distinguish between meaningful semantic relations and genuine unrelatedness. We introduce CORE (Comprehensive Ontological Relation Evaluation), a
dataset of 225K multiple-choice questions spanning 74 disciplines, together with a general-domain open-source
benchmark of 203 rigorously validated questions (Cohen's Kappa = 1.0) covering 24 semantic relation types with equal representation of unrelated pairs. A human baseline from 1,000+ participants achieves 92.6% accuracy (95.1% on unrelated pairs). In contrast, 29 state-of-the-art LLMs achieve 48.25-70.9% overall accuracy, with near-ceiling performance on related pairs (86.5-100%) but severe degradation on unrelated pairs (0-41.35%), despite assigning similar confidence (92-94%). Expected Calibration Error increases 2-4x on unrelated pairs, and a mean semantic collapse rate of 37.6% indicates systematic generation of spurious relations. On the CORE 225K MCQs
dataset, accuracy further drops to approximately 2%, highlighting substantial challenges in domain-specific semantic
reasoning. We identify unrelatedness
reasoning as a critical, under-evaluated frontier for LLM evaluation and safety.
Read the full abstract ▾
All authors Satyam Dwivedi, Sanjukta Ghosh, Shivam Dwivedi, Nishi Kumari, Anil Thakur, Anurag Purushottam, Deepak Alok, Praveen Gatla, Manjuprasad B, Bipasha Patgiri
Machine Learning
Is Gradient Ascent Really Necessary? Memorize to Forget for Machine Unlearning
Zhuo Huang, Qizhou Wang, Ziming Hong et al. (+3 more)
For ethical and safe AI, machine unlearning rises as a critical topic aiming to protect sensitive, private, and copyrighted knowledge from misuse. To achieve this goal, it is common to conduct gradient ascent (GA) to reverse the training on undesired data. However, such a reversal is prone to catastrophic collapse, which leads to serious performance degradation in general tasks. As a solution, we propose model extrapolation as an alternative to GA, which reaches the counterpart direction in the hypothesis space from one model given another reference model. Therefore, we leverage the original model as the reference, further train it to memorize undesired data while keeping prediction consistency on the rest retained data, to obtain a memorization model. Counterfactual as it might sound, a forget model can be obtained via extrapolation from the memorization model to the reference model. Hence, we avoid directly acquiring the forget model using GA, but proceed with gradient descent for the memorization model, which successfully stabilizes the machine unlearning process. Our model extrapolation is simple and efficient to implement, and it can also effectively converge throughout training to achieve improved unlearning performance.
Read the full abstract ▾
All authors Zhuo Huang, Qizhou Wang, Ziming Hong, Shanshan Ye, Bo Han, Tongliang Liu
Machine Learning
Reclaiming First Principles: A Differentiable Framework for Conceptual Hydrologic Models
Jasper A. Vrugt, Jonathan M. Frame and Ethan Bollman
Conceptual hydrologic models remain the cornerstone of rainfall-runoff modeling, yet their calibration is often slow and numerically fragile. Most gradient-based parameter estimation methods rely on finite-difference approximations or automatic differentiation frameworks (e.g., JAX, PyTorch and TensorFlow), which are computationally demanding and introduce truncation errors, solver instabilities, and substantial overhead. These limitations are particularly acute for the ODE systems of conceptual watershed models. Here we introduce a fully analytic and computationally efficient framework for differentiable hydrologic modeling based on exact parameter sensitivities. By augmenting the governing ODE system with sensitivity equations, we jointly evolve the model states and the Jacobian
matrix with respect to all parameters. This Jacobian then provides fully analytic gradient vectors for any differentiable loss function. These include classical objective functions such as the sum of absolute and squared residuals, widely used hydrologic performance metrics such as the Nash-Sutcliffe and Kling-Gupta efficiencies, robust loss functions that down-weight extreme events, and hydrograph-based functionals such as flow-duration and recession curves. The analytic sensitivities eliminate the step-size dependence and noise inherent to numerical differentiation, while avoiding the instability of adjoint methods and the overhead of modern machine-learning autodiff toolchains. The resulting gradients are deterministic, physically interpretable, and straightforward to embed in gradient-based optimizers. Overall, this work enables rapid, stable, and transparent gradient-based calibration of conceptual hydrologic models, unlocking the full potential of differentiable modeling without reliance on external, opaque, or CPU-intensive automatic-differentiation libraries.
Read the full abstract ▾
Machine Learning
Beyond Code Contributions: How Network Position, Temporal Bursts, and Code Review Activities Shape Contributor Influence in Large-Scale Open Source Ecosystems
S M Rakib Ul Karim, Wenyi Lu and Sean Goggins
Open source software (OSS) projects rely on complex networks of contributors whose interactions drive innovation and sustainability. This study presents a comprehensive analysis of OSS contributor networks using advanced graph neural networks and temporal network analysis on data spanning 25 years from the Cloud Native Computing Foundation ecosystem, encompassing sandbox, incubating, and graduated projects. Our analysis of thousands of contributors across hundreds of repositories reveals that OSS networks exhibit strong power-law distributions in influence, with the top 1% of contributors controlling a substantial portion of network influence. Using GPU-accelerated PageRank, betweenness centrality, and custom LSTM models, we identify five distinct contributor roles: Core, Bridge, Connector, Regular, and Peripheral, each with unique network positions and structural importance. Statistical analysis reveals significant correlations between specific action types (commits, pull requests, issues) and contributor influence, with multiple regression models explaining substantial variance in influence metrics. Temporal analysis shows that network density, clustering coefficients, and modularity exhibit statistically significant temporal trends, with distinct regime changes coinciding with major project milestones. Structural integrity simulations show that Bridge contributors, despite representing a small fraction of the network, have a disproportionate impact on network cohesion when removed. Our findings provide empirical evidence for strategic contributor retention policies and offer actionable insights into community health metrics.
Read the full abstract ▾
Machine Learning
Adaptive Protein Tokenization
Rohit Dilip, Ayush Varshney and David Van Valen
Tokenization is a promising path to multi-modal models capable of jointly understanding
protein sequences, structure, and function. Existing
protein structure tokenizers create
tokens by pooling information from local neighborhoods, an approach that limits their performance on generative and representation tasks. In this work, we present a method for global tokenization of
protein structures in which successive
tokens contribute increasing levels of detail to a global representation. This change resolves several issues with generative models based on local
protein tokenization: it mitigates error accumulation, provides
embeddings without sequence-reduction operations, and allows task-specific adaptation of a tokenized sequence's information content. We validate our method on reconstruction, generative, and representation tasks and demonstrate that it matches or outperforms existing models based on local
protein structure tokenizers. We show how adaptive
tokens enable inference criteria based on information content, which boosts designability. We validate representations generated from our tokenizer on CATH classification tasks and demonstrate that non-linear probing on our tokenized sequences outperforms equivalent probing on representations from other tokenizers. Finally, we demonstrate how our method supports zero-shot
protein shrinking and affinity maturation.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.CL
Stopping Computation for Converged Tokens in Masked Diffusion-LM Decoding
Daisuke Oba, Danushka Bollegala, Masahiro Kaneko et al. (+1 more)
Masked
Diffusion Language Models generate sequences via iterative sampling that progressively unmasks
tokens. However, they still recompute the
attention and feed-forward blocks for every
token position at every step – even when many unmasked
tokens are essentially fixed, resulting in substantial waste in compute. We propose SureLock: when the posterior at an unmasked position has stabilized across steps (our sure condition), we lock that position – thereafter skipping its query projection and feed-forward sublayers – while caching its
attention keys and values so other positions can continue to attend to it. This reduces the dominant per-iteration computational cost from $O(N^2d)$ to $O(MNd)$ where $N$ is the sequence length, $M$ is the number of unlocked
token positions, and $d$ is the model dimension. In practice, $M$ decreases as the iteration progresses, yielding substantial savings. On LLaDA-8B, SureLock reduces algorithmic FLOPs by 30–50% relative to the same sampler without locking, while maintaining comparable generation quality. We also provide a theoretical analysis to justify the design rationale of SureLock: monitoring only the local KL at the lock step suffices to bound the deviation in final
token probabilities. Our project page is available at https://daioba.github.io/surelock .
Read the full abstract ▾
All authors Daisuke Oba, Danushka Bollegala, Masahiro Kaneko, Naoaki Okazaki
Machine Learning
DAH-Net: A Dual-Attention Hybrid Network for Interpretable and Robust EEG-Based Emotion Recognition
S M Rakib UI Karim, Diponkor Bala, Wenyi Lu et al. (+2 more)
EEG-based
emotion recognition supports affective
brain-computer interfaces and mental health monitoring yet remains challenged by signal complexity, subject variability, and limited interpretability. We propose DAH-Net, a dual-
attention hybrid network integrating 1D-CNN, BiLSTM, and dual multi-head
attention (16+8 heads) for three-class
EEG emotion classification. Evaluated on 2,479 samples with 988
EEG features, DAH-Net achieves 99.19% held-out test accuracy with a 0.81% train-test gap, outperforming RF (96.17%), SVM (96.77%), MLP (97.18%), and
Transformer (98.19%) baselines. Friedman testing (ḩi}2 = 28.54, p < 0.001) and post-hoc Wilcoxon comparisons confirm statistical significance. Feature-level analysis using Random Forest importance, SHAP attribution, and feature category isolation shows that covariance features achieve near-baseline standalone accuracy (94.96%), while
eigenvalue features show limited standalone performance (84.07%) but provide compact complementary information. The compact architecture (3.33M parameters, approximately 13.3MB using 32-bit weights) suggests potential for future lightweight
EEG-based affective computing, pending subject-independent and external validation.
Read the full abstract ▾
All authors S M Rakib UI Karim, Diponkor Bala, Wenyi Lu, Rownak Ara Rasul, Sean Goggins
Machine Learning
Near-Optimal Regret for Distributed Adversarial Bandits: A Black-Box Approach
Hao Qiu, Mengxiao Zhang and Nicolò Cesa-Bianchi
We study distributed
adversarial bandits, where $N$
agents cooperate to minimize the global average loss while observing only their own local losses. We show that the minimax regret for this problem is $\tilde{\Theta}(\sqrt{(\rho^{-1/2}+K/N)T})$, where $T$ is the horizon, $K$ is the number of actions, and $\rho$ is the spectral gap of the communication
matrix. Our
algorithm, based on a novel black-box reduction to bandits with delayed feedback, requires
agents to communicate only through gossip. It achieves an upper bound that significantly improves over the previous best bound $\tilde{O}(\rho^{-1/3}(KT)^{2/3})$ of Yi and Vojnovic (2023). We complement this result with a matching lower bound, showing that the problem's difficulty decomposes into a communication cost $\rho^{-1/4}\sqrt{T}$ and a bandit cost $\sqrt{KT/N}$. We further demonstrate the versatility of our approach by deriving first-order and best-of-both-worlds bounds in the distributed
adversarial setting. Finally, we extend our framework to distributed linear bandits in $R^d$, obtaining a regret bound of $\tilde{O}(\sqrt{(\rho^{-1/2}+1/N)dT})$, achieved with only $O(d)$ communication cost per
agent and per round via a volumetric spanner.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.CR
Empirical Analysis of Adversarial Robustness and Explainability Drift in Cybersecurity Classifiers
Mona Rajhans and Vishal Khawarey
Machine learning (ML) models are increasingly deployed in cybersecurity applications such as phishing detection and network intrusion prevention. However, these models remain vulnerable to
adversarial perturbations small, deliberate input modifications that can degrade detection accuracy and compromise interpretability. This paper presents an empirical study of
adversarial robustness and explainability drift across two cybersecurity domains phishing URL classification and network intrusion detection. We evaluate the impact of L (infinity) bounded Fast Gradient Sign Method (FGSM) and Projected Gradient Descent (PGD) perturbations on model accuracy and introduce a quantitative metric, the Robustness Index (RI), defined as the area under the accuracy perturbation curve. Gradient based feature sensitivity and SHAP based attribution drift analyses reveal which input features are most susceptible to
adversarial manipulation. Experiments on the Phishing Websites and UNSW NB15
datasets show consistent robustness trends, with
adversarial training improving RI by up to 9 percent while maintaining clean-data accuracy. These findings highlight the coupling between robustness and interpretability degradation and underscore the importance of quantitative evaluation in the design of trustworthy, AI-driven cybersecurity systems.
Read the full abstract ▾
Machine Learning
Generating High-quality Privacy-preserving Synthetic Data
David Yavo, Richard Khoury, Christophe Pere et al. (+1 more)
Synthetic tabular data enables sharing and analysis of sensitive records, but its practical deployment requires balancing distributional fidelity, downstream utility, and
privacy protection. We study a simple, model agnostic post processing framework that can be applied on top of any synthetic data generator to improve this trade off. First, a mode patching step repairs categories that are missing or severely underrepresented in the synthetic data, while largely preserving learned dependencies. Second, a k nearest neighbor filter replaces synthetic records that lie too close to real data points, enforcing a minimum distance between real and synthetic samples. We instantiate this framework for two neural generative models for tabular data, a feed forward generator and a variational autoencoder, and evaluate it on three public
datasets covering credit card transactions, cardiovascular health, and census based income. We assess marginal and joint distributional similarity, the performance of models trained on synthetic data and evaluated on real data, and several empirical
privacy indicators, including nearest neighbor distances and attribute inference attacks. With moderate thresholds between 0.2 and 0.35, the post processing reduces divergence between real and synthetic categorical distributions by up to 36 percent and improves a combined measure of pairwise dependence preservation by 10 to 14 percent, while keeping downstream predictive performance within about 1 percent of the unprocessed baseline. At the same time, distance based
privacy indicators improve and the success rate of attribute inference attacks remains largely unchanged. These results provide practical guidance for selecting thresholds and applying post hoc repairs to improve the quality and empirical
privacy of synthetic tabular data, while complementing approaches that provide formal differential
privacy guarantees.
Read the full abstract ▾
All authors David Yavo, Richard Khoury, Christophe Pere, Sadoune Ait Kaci Azzou
Machine Learning
Uniform Spectral Growth and Convergence of Muon in LoRA-Style Matrix Factorization
Changmin Kang, Jihun Yun, Baekrok Shin et al. (+2 more)
Spectral gradient descent (SpecGD) orthogonalizes the
matrix parameter updates and has inspired practical optimizers such as
Muon. They often perform well in large
language model (LLM) training, but their dynamics remain poorly understood. In the low-rank adaptation (LoRA) setting, where weight updates are parameterized as a product of two low-rank factors, we find a distinctive spectral phenomenon under
Muon in LoRA fine-tuning of LLMs: singular values of the LoRA product show near-uniform growth across the spectrum, despite orthogonalization being performed on the two factors separately. Motivated by this observation, we analyze spectral gradient flow (SpecGF)-a continuous-time analogue of SpecGD-in a simplified LoRA-style
matrix factorization setting and prove "equal-rate" dynamics: all singular values grow at equal rates up to small deviations. Consequently, smaller singular values attain their target values earlier than larger ones, sharply contrasting with the largest-first stepwise learning observed in standard gradient flow. Moreover, we prove that SpecGF in our setting converges to global minima from almost all initializations, provided the factor norms remain bounded; with $\ell_2$ regularization, we obtain global convergence. Lastly, we corroborate our theory with experiments in the same setting.
Read the full abstract ▾
All authors Changmin Kang, Jihun Yun, Baekrok Shin, Yeseul Cho, Chulhee Yun
Machine Learning · Cross-listed from quant-ph
HyQuRP: Hybrid quantum-classical neural network with rotational and permutational equivariance
Semin Park and Chae-Yeun Park
Group-equivariant
quantum machine learning has emerged as a promising paradigm by incorporating
symmetry into
quantum models. However, constructing models simultaneously equivariant to both rotational and permutational
symmetries in a principled manner remains a bottleneck. In this work, we develop a general framework for dual-equivariant gates under rotations and permutations and analyze the dimension of the resulting gate space using group representation theory. Based on this, we introduce HyQuRP, a hybrid
quantum-classical neural network with dual equivariance. On 3D point cloud classification
benchmarks in the sparse-point regime, HyQuRP outperforms strong classical and
quantum baselines. For example, when six subsampled points are used, HyQuRP ($\sim$1.5K parameters) achieves 76.13% accuracy on the 5-class ModelNet
benchmark, compared with 72.54%, 71.09%, and 71.03% for Tensor Field Network, PointNet, and PointMamba with similar parameter counts. These results highlight HyQuRP's strong data efficiency and suggest the potential of equivariant
quantum machine learning approaches in
symmetry-sensitive tasks.
Read the full abstract ▾
Machine Learning · Cross-listed from math.FA
A Multiplicative Neural Network Architecture: Locality and Regularity of Approximation
Hee-Sun Choi and Beom-Seok Han
We introduce a multiplicative neural network architecture in which multiplicative interactions constitute the fundamental representation, rather than appearing as auxiliary components within an additive model. We establish a universal approximation
theorem for this architecture and analyze its approximation properties in terms of locality and regularity in Bessel potential spaces. To complement the theoretical results, we conduct numerical experiments on representative targets exhibiting sharp transition layers or pointwise loss of higher-order regularity. The experiments focus on the spatial structure of approximation errors and on regularity-sensitive quantities, in particular, the convergence of Zygmund-type seminorms. The results show that the proposed multiplicative architecture yields residual error structures that are more tightly aligned with regions of reduced regularity and exhibit more stable convergence in regularity-sensitive metrics. These results demonstrate that adopting a multiplicative representation format has concrete implications for the localization and regularity behavior of neural network approximations, providing a direct connection between architectural design and analytical properties of the approximating functions.
Read the full abstract ▾
Machine Learning · Cross-listed from eess.SY
Advances in Battery Energy Storage Management: Control and Economic Synergies
Venkata Rajesh Chundru, Shreshta Rajakumar Deshpande and Stanislav A Gankov
The existing literature on Battery Energy Storage Systems (BESS) predominantly focuses on two main areas: control system design aimed at achieving grid stability and the techno-economic analysis of BESS dispatch on power grid. However, with the increasing incorporation of ancillary services into power grids, a more comprehensive approach to energy management systems is required. Such an approach should not only optimize revenue generation from BESS but also ensure the safe, efficient, and reliable operation of lithium-ion batteries. This research seeks to bridge this gap by exploring literature that addresses both the economic and operational dimensions of BESS. Specifically, it examines how economic aspects of grid duty cycles can align with control schemes deployed in BESS systems. This
alignment, or synergy, could be instrumental in creating robust digital twins virtual representations of BESS systems that enhance both grid stability and revenue potential. The literature review is organized into five key categories: (1) ancillary services for BESS, exploring support functions that BESS can provide to power grids; (2) control systems developed for real-time BESS power flow management, ensuring smooth operations under dynamic grid conditions; (3) optimization
algorithms for BESS dispatch, focusing on efficient energy allocation strategies; (4) techno-economic analyses of BESS and battery systems to assess their financial viability; and (5) digital twin technologies for real-world BESS deployments, enabling advanced predictive maintenance and performance optimization. This review will identify potential synergies, research gaps, and emerging trends, paving the way for future innovations in BESS management and deployment strategies.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.GT
Envy-Free Allocation of Indivisible Goods via Noisy Queries
Zihan Li, Yan Hao Ling, Jonathan Scarlett et al. (+1 more)
We introduce a problem of fairly allocating indivisible goods (items) in which the
agents' valuations cannot be observed directly, but instead can only be accessed via noisy queries. In the two-
agent setting with Gaussian noise and bounded valuations, we derive upper and lower bounds on the required number of queries for finding an envy-free allocation in terms of the number of items, $m$, and the negative-envy of the optimal allocation, $\Delta$. In particular, when $\Delta$ is not too small (namely, $\Delta \gg m^{1/4}$), we establish that the optimal number of queries scales as $\frac{\sqrt m }{(\Delta / m)^2} = \frac{m^{2.5}}{\Delta^2}$ up to logarithmic factors. Our upper bound is based on non-adaptive queries and a simple thresholding-based allocation
algorithm that runs in
polynomial time, while our lower bound holds even under adaptive queries and arbitrary computation time.
Read the full abstract ▾
All authors Zihan Li, Yan Hao Ling, Jonathan Scarlett, Warut Suksompong
Machine Learning
Training Data Selection with Gradient Orthogonality for Efficient Domain Adaptation
Xiyang Zhang, Yuanhe Tian, Hongzhi Wang et al. (+1 more)
Fine-tuning large
language models (LLMs) for specialized domains often necessitates a trade-off between acquiring domain expertise and retaining general
reasoning capabilities, a phenomenon known as catastrophic forgetting. Existing remedies face a dichotomy: gradient surgery methods offer
geometric safety but incur prohibitive computational costs via online projections, while efficient data selection approaches reduce overhead but remain blind to conflict-inducing gradient directions. In this paper, we propose Orthogonal Gradient Selection (OGS), a data-centric method that harmonizes domain performance, general capability retention, and training efficiency. OGS shifts the
geometric insights of gradient projection from the optimizer to the data selection stage by treating data selection as a constrained decision-making process. By leveraging a lightweight Navigator model and reinforcement learning techniques, OGS dynamically identifies training samples whose gradients are orthogonal to a general-knowledge anchor. This approach ensures naturally safe updates for target models without modifying the optimizer or incurring runtime projection costs. Experiments across medical, legal, and financial domains demonstrate that OGS achieves excellent results, significantly improving domain performance and training efficiency while maintaining or even enhancing performance on general tasks such as GSM8K.
Read the full abstract ▾
All authors Xiyang Zhang, Yuanhe Tian, Hongzhi Wang, Yan Song
Machine Learning
LLM-SAA: LLM-persona Generated Distributions for Decision-making
Jackie Baek, Yunhan Chen, Ziyu Chi et al. (+1 more)
LLMs can generate a wealth of data, ranging from simulated personas imitating human valuations and preferences, to demand forecasts based on world knowledge. But how well do such LLM-generated distributions support downstream decision-making? For example, when pricing a new product, a firm could
prompt an LLM to simulate how much consumers are willing to pay based on a product description, but how useful is the resulting distribution for optimizing the price? We refer to this approach as LLM-SAA, in which an LLM is used to construct an estimated distribution and the decision is then optimized under that distribution. In this paper, we study metrics to evaluate the quality of these LLM-generated distributions, based on the decisions they induce. Taking three canonical decision-making problems (assortment optimization, pricing, and newsvendor) as examples, we find that LLM-generated distributions are practically useful, especially in low-data regimes. We also show that decision-agnostic metrics such as Wasserstein distance can be misleading when evaluating these distributions for decision-making.
Read the full abstract ▾
All authors Jackie Baek, Yunhan Chen, Ziyu Chi, Will Ma
Machine Learning
Enhance and Reuse: A Dual-Mechanism Approach to Boost Deep Forest for Label Distribution Learning
Jia-Le Xu, Shen-Huan Lyu, Yu-Nian Wang et al. (+4 more)
Label distribution learning (LDL) requires the learner to predict the degree of correlation between each sample and each label. To achieve this, a crucial task during learning is to leverage the correlation among labels. Deep Forest (DF) is a deep learning framework based on tree ensembles, whose training phase does not rely on backpropagation. DF performs in-model feature transform using the prediction of each layer and achieves competitive performance on many tasks. However, its exploration in the field of LDL is still in its infancy. The few existing methods that apply DF to the field of LDL do not have effective ways to utilize the correlation among labels. Therefore, we propose a method named Enhanced and Reused Feature Deep Forest (ERDF). It mainly contains two mechanisms: feature enhancement exploiting label correlation and measure-aware feature reuse. The first one is to utilize the correlation among labels to enhance the original features, enabling the samples to acquire more comprehensive information for the task of LDL. The second one performs a reuse operation on the features of samples that perform worse than the previous layer on the validation set, in order to ensure the stability of the training process. This kind of Enhance-Reuse pattern not only enables samples to enrich their features but also validates the effectiveness of their new features and conducts a reuse process to prevent the noise from spreading further. Experiments show that our method outperforms other comparison
algorithms on six evaluation metrics.
Read the full abstract ▾
All authors Jia-Le Xu, Shen-Huan Lyu, Yu-Nian Wang, Ning Chen, Zhihao Qu, Bin Tang, Baoliu Ye
Machine Learning
Adversarial Learning in Games with Bandit Feedback: Logarithmic Pure-Strategy Maximin Regret
Shinji Ito, Haipeng Luo, Arnab Maiti et al. (+2 more)
Learning to play zero-sum games is a fundamental problem in game theory and machine learning. While significant progress has been made in minimizing external regret in the self-play settings or with full-information feedback, real-world applications often force learners to play against unknown, arbitrary opponents and restrict learners to bandit feedback where only the payoff of the realized action is observable. In such challenging settings, it is well-known that $\Omega(\sqrt{T})$ external regret is unavoidable (where T is the number of rounds). To overcome this barrier, we investigate
adversarial learning in zero-sum games under bandit feedback, aiming to minimize the deficit against the maximin pure strategy – a metric we term Pure-Strategy Maximin Regret. We analyze this problem under two bandit feedback models: uninformed (only the realized reward is revealed) and informed (both the reward and the opponent's action are revealed). For uninformed bandit learning of normal-form games, we show that the Tsallis-INF
algorithm achieves $O(c \log T)$ instance-dependent regret with a game-dependent parameter $c$. Crucially, we prove an information-theoretic lower bound showing that the dependence on c is necessary. To overcome this hardness, we turn to the informed setting and introduce Maximin-UCB, which obtains another regret bound of the form $O(c' \log T)$ for a different game-dependent parameter $c'$ that could potentially be much smaller than $c$. Finally, we generalize both results to bilinear games over an arbitrary, large action set, proposing Tsallis-FTRL-SPM and Maximin-LinUCB for the uninformed and informed setting respectively and establishing similar game-dependent logarithmic regret bounds.
Read the full abstract ▾
All authors Shinji Ito, Haipeng Luo, Arnab Maiti, Taira Tsuchiya, Yue Wu