Machine Learning
Towards Robust Universal Perturbation Attacks: A Float-Coded, Penalty-Driven Evolutionary Approach
Shiqi Wang, Mahdi Khosravy, Neeraj Gupta et al. (+1 more)
Universal
adversarial perturbations (UAPs) have garnered significant
attention due to their ability to undermine deep neural networks across multiple inputs using a single noise pattern. Evolutionary
algorithms offer a promising approach to generating such perturbations due to their ability to navigate non-convex, gradient-free landscapes. In this work, we introduce a float-coded, penalty-driven single-objective evolutionary framework for UAP generation that achieves lower visibility perturbations while enhancing attack success rates. Our approach leverages continuous gene representations aligned with contemporary deep learning scales, incorporates dynamic evolutionary operators with adaptive scheduling, and utilizes a modular PyTorch implementation for seamless integration with modern architectures. Additionally, we ensure the universality of the generated perturbations by testing across diverse models and by periodically switching batches to prevent overfitting. Experimental results on the ImageNet
dataset demonstrate that our framework consistently produces perturbations with smaller norms, higher misclassification effectiveness, and faster convergence compared to existing evolutionary-based methods. These findings highlight the robustness and scalability of our approach for universal
adversarial attacks across various deep learning architectures.
Read the full abstract ▾
All authors Shiqi Wang, Mahdi Khosravy, Neeraj Gupta, Olaf Witkowski
Machine Learning · Cross-listed from cs.FL
Learning Deterministic Finite-State Machines from the Prefixes of a Single String is NP-Complete
Radu Cosmin Dumitru, Ryo Yoshinaka and Ayumi Shinohara
It is well known that computing a minimum deterministic finite automaton consistent with a given set of positive and negative examples is NP-hard. Previous work has identified conditions on the input sample under which the problem becomes tractable or remains hard. In this paper, we study the computational complexity of the case where the input sample is prefix-closed. This formulation is equivalent to computing a minimum Moore machine consistent with observations along its runs. We show that the problem is NP-hard to approximate when the sample set consists of all prefixes of binary strings. Furthermore, we show that the problem remains NP-hard as a decision problem even when the sample set consists of the prefixes of a single binary string. Our argument also extends to the corresponding problem for Mealy machines.
Read the full abstract ▾
Machine Learning · Cross-listed from physics.space-ph
Deterministic and probabilistic neural surrogates of global hybrid-Vlasov simulations
Daniel Holmberg, Ivan Zaitsev, Markku Alho et al. (+5 more)
Hybrid-Vlasov simulations resolve ion-kinetic effects in the
solar wind-magnetosphere interaction, but even 5D (2D + 3V) configurations are computationally expensive. We show that graph-based machine learning emulators can learn the spatiotemporal
evolution of electromagnetic fields and lower-order moments of the ion velocity distribution function in near-Earth space from four 5D Vlasiator runs, each driven by steady
solar wind conditions. The upstream ion number density is systematically varied between the runs, while the grid spacing is held constant, to scan the ratio of ion inertial length to grid size. Using a graph neural network (GNN) operating on the 2D spatial simulation grid comprising 670k
cells, we demonstrate that both a deterministic
forecasting model (Graph-FM) and a probabilistic ensemble
forecasting model (Graph-EFM) based on a latent variable formulation produce accurate predictions of future
plasma states. A divergence penalty is incorporated to encourage divergence-freeness in the
magnetic fields. For the probabilistic model, a continuous ranked probability score objective is added to improve the calibration of the ensemble forecasts. In terms of wall time per output step, the trained emulators run over two orders of magnitude faster on a single GPU than the Vlasiator simulations on 100 CPUs. Most forecasted fields have Pearson correlations above 0.95 at 50 seconds lead time. Fields that exhibit degenerate (near-zero) distributions in the 5D setting are more challenging for the emulator to keep well correlated. The ensemble forecasts remain underdispersive, with spread-skill ratios of approximately 0.2-0.3, and thus provide spatially structured relative uncertainty estimates. Overall, these results demonstrate that GNNs provide a viable framework for rapid ensemble generation in hybrid-Vlasov modeling and highlight promising directions for future work.
Read the full abstract ▾
All authors Daniel Holmberg, Ivan Zaitsev, Markku Alho, Ioanna Bouri, Fanni Franssila, Haewon Jeong, Minna Palmroth, Teemu Roos
Machine Learning
What Trace Powers Reveal About Log-Determinants: Closed-Form Estimators, Certificates, and Failure Modes
Piyush Sao
Computing $\log\det(A)$ for large symmetric positive definite
matrices arises in Gaussian process inference and
Bayesian model comparison. Standard methods combine
matrix-vector products with
polynomial approximations. We study a different model: access to trace powers $p_k = \tr(A^k)$, natural when
matrix powers are available. Classical moment-based approximations Taylor-expand $\log(\lambda)$ around the arithmetic mean. This requires $|\lambda - \AM| < \AM$ and diverges when $\kappa > 4$. We work instead with the moment-generating function $M(t) = \E[X^t]$ for normalized
eigenvalues $X = \lambda/\AM$. Since $M'(0) = \E[\log X]$, the log-determinant becomes $\log\det(A) = n(\log \AM + M'(0))$ – the problem reduces to estimating a derivative at $t = 0$. Trace powers give $M(k)$ at positive integers, but interpolating $M(t)$ directly is ill-conditioned due to exponential growth. The transform $K(t) = \log M(t)$ compresses this range. Normalization by $\AM$ ensures $K(0) = K(1) = 0$. With these anchors fixed, we interpolate $K$ through $m+1$ consecutive integers and differentiate to estimate $K'(0)$. However, this local interpolation cannot capture arbitrary spectral features. We prove a fundamental limit: no continuous
estimator using finitely many positive moments can be uniformly accurate over unbounded conditioning. Positive moments downweight the spectral tail; $K'(0) = \E[\log X]$ is tail-sensitive. This motivates guaranteed bounds. From the same traces we derive upper bounds on $(\det A)^{1/n}$. Given a spectral floor $r \leq \lambda_{\min}$, we obtain moment-constrained lower bounds, yielding a provable interval for $\log\det(A)$. A gap diagnostic indicates when to trust the point estimate and when to report bounds. All
estimators and bounds cost $O(m)$, independent of $n$. For $m \in \{4, \ldots, 8\}$, this is effectively constant time.
Read the full abstract ▾
Machine Learning · Cross-listed from eess.SY
HERMES: A Unified Open-Source Framework for Realtime Multimodal Physiological Sensing, Edge AI, and Intervention in Closed-Loop Smart Healthcare Applications
Maxim Yudayev, Juha Carlon, Diwas Lamsal et al. (+2 more)
Intelligent assistive technologies are increasingly recognized as critical daily-use enablers for people with disabilities and age-related functional decline. Longitudinal studies, curation of quality
datasets, live monitoring in activities of daily living, and intelligent intervention devices, share the largely unsolved need in reliable high-throughput
multimodal sensing and processing. Streaming large heterogeneous data from distributed sensors, historically closed-source environments, and limited prior works on realtime closed-loop AI methodologies, inhibit such applications. To accelerate the emergence of clinical deployments, we deliver HERMES - an open-source high-performance Python framework for continuous
multimodal sensing and AI processing at the edge. It enables synchronized data collection, and realtime streaming inference with user PyTorch models, on commodity computing devices. HERMES is applicable to fixed-lab and free-living environments, of distributed commercial and custom sensors. It is the first work to offer a holistic methodology that bridges cross-disciplinary gaps in real-world implementation strategies, and guides downstream AI model development. Its application on the closed-loop intelligent prosthesis use case illustrates the process of suitable AI model development from the generated constraints and trade-offs. Validation on the use case, with 4 synchronized hosts cooperatively capturing 18 wearable and off-body modalities, demonstrates performance and relevance of HERMES to the trajectory of the intelligent healthcare domain.
Read the full abstract ▾
All authors Maxim Yudayev, Juha Carlon, Diwas Lamsal, Vayalet Stefanova, Benjamin Filtjens
Machine Learning
Beyond Softmax and Entropy: Convergence Rates of Policy Gradients with f-SoftArgmax Parameterization & Coupled Regularization
Safwan Labbi, Daniil Tiapkin, Paul Mangold et al. (+1 more)
Policy gradient methods are known to be highly sensitive to the choice of policy parameterization. In particular, the widely used softmax parameterization can induce ill-conditioned optimization landscapes and lead to exponentially slow convergence. Although this can be mitigated by preconditioning, this solution is often computationally expensive. Instead, we propose replacing the softmax with an alternative family of policy parameterizations based on the generalized f-softargmax. We further advocate coupling this parameterization with a regularizer induced by the same f-divergence, which improves the optimization landscape and ensures that the resulting regularized objective satisfies a Polyak-Lojasiewicz inequality. Leveraging this structure, we establish the first explicit non-asymptotic last-iterate convergence guarantees for
stochastic policy gradient methods for finite MDPs without any form of preconditioning. We also derive sample-complexity bounds for the unregularized problem and show that f-PG, with Tsallis divergences achieves
polynomial sample complexity in contrast to the exponential complexity incurred by the standard softmax parameterization.
Read the full abstract ▾
All authors Safwan Labbi, Daniil Tiapkin, Paul Mangold, Eric Moulines
Machine Learning · Cross-listed from physics.chem-ph
onepot CORE – an enumerated chemical space to streamline drug discovery, enabled by automated small molecule synthesis and AI
Andrei S. Tyrin, Brandon Wang, Manuel Muñoz et al. (+2 more)
The design-make-test-analyze cycle in early-stage drug discovery remains constrained primarily by the "make" step: small-molecule synthesis is slow, costly, and difficult to scale or automate across diverse chemotypes. Enumerated chemical spaces aim to reduce this bottleneck by predefining synthesizable regions of chemical space from available building blocks and reliable reactions, yet existing commercial spaces are still limited by long turnaround times, narrow reaction scope, and substantial manual decision-making in route selection and execution. Here we present the first version of onepot CORE, an enumerated chemical space containing 3.4B molecules and corresponding on-demand synthesis product enabled by an automated synthesis platform and an AI chemist, Phil, that designs, executes, and analyzes experiments. onepot CORE is constructed by (i) selecting a reaction set commonly used in medicinal chemistry, (ii) sourcing and curating building blocks from supplier catalogs, (iii) enumerating candidate products, and (iv) applying ML-based feasibility assessment to prioritize compounds for robust execution. In the current release, the space is supported by seven reactions. We describe an end-to-end workflow - from route selection and automated
liquid handling through workup and purification. We further report validation across operational metrics (success rate, timelines, purity, and identity), including NMR confirmation for a representative set of synthesized compounds and assay suitability demonstrated using a series of DPP4 inhibitors. Collectively, onepot CORE illustrates a path toward faster, more reliable access to diverse small molecules, supporting accelerated discovery in pharmaceuticals and beyond.
Read the full abstract ▾
All authors Andrei S. Tyrin, Brandon Wang, Manuel Muñoz, Samuel H. Foxman, Daniil A. Boiko
Machine Learning · Cross-listed from cs.SD
SSVD-O: Parameter-Efficient Fine-Tuning with Structured SVD for Speech Recognition
Pu Wang, Shinji Watanabe and Hugo Van hamme
Parameter-efficient fine-tuning (PEFT) is a scalable approach for adapting large
speech foundation models to new domains. While methods such as LoRA and its state-of-the-art variants reduce adaptation costs, they typically allocate parameters uniformly across model subspaces, which limits their efficiency and scalability in
speech applications. Building on our prior work, this paper introduces SSVD-Outer (SSVD-O), an extension of the structured SVD-guided (SSVD) fine-tuning method. SSVD-O combines input acoustic feature space-associated inner transformations with output semantic feature space-associated outer transformations to enable scalable and balanced adaptation. We conduct the first systematic analysis of parameter budget allocation across model subspaces in PEFT for automatic
speech recognition (ASR), and investigate the trade-off between learning and forgetting under constrained resources. SSVD-O is benchmarked against LoRA, DoRA, PiSSA, and SSVD on domain-shifted ASR tasks, including child
speech and regional accents, across model scales from 0.1B to 2B within the ESPnet framework. Experimental results show that SSVD-O consistently narrows the performance gap to full fine-tuning while improving generalization and mitigating catastrophic forgetting.
Read the full abstract ▾
Machine Learning
Dissecting Linear Recurrent Models: How Different Gating Strategies Drive Selectivity and Generalization
Younes Bouhadjar, Maxime Fabre, Felix Schmidt et al. (+1 more)
Linear recurrent neural networks have emerged as efficient alternatives to the original
Transformer's softmax
attention mechanism, thanks to their highly parallelizable training and constant
memory and computation requirements at inference. Iterative refinements of these models have introduced an increasing number of architectural mechanisms, leading to increased complexity and computational costs. Nevertheless, systematic direct comparisons among these models remain limited. Existing
benchmark tasks are either too simplistic to reveal substantial differences or excessively resource-intensive for experimentation. In this work, we propose a refined taxonomy of linear recurrent models and introduce SelectivBench, a set of lightweight and customizable synthetic
benchmark tasks for systematically evaluating sequence models. SelectivBench specifically evaluates selectivity in sequence models at small to medium scale, such as the capacity to focus on relevant inputs while ignoring context-based distractors. It employs rule-based grammars to generate sequences with adjustable complexity, incorporating irregular gaps that intentionally violate transition rules. Evaluations of linear recurrent models on SelectivBench reveal performance patterns consistent with results from large-scale
language tasks. Our analysis clarifies the roles of essential architectural features: gating and rapid forgetting mechanisms facilitate recall, in-state channel mixing is unnecessary for selectivity, but critical for generalization, and softmax
attention remains dominant due to its
memory capacity scaling with sequence length. Our
benchmark enables targeted, efficient exploration of linear recurrent models and provides a controlled setting for studying behaviors observed in large-scale evaluations. Code is available at https://github.com/symseqbench/selectivbench
Read the full abstract ▾
All authors Younes Bouhadjar, Maxime Fabre, Felix Schmidt, Emre Neftci
Machine Learning · Cross-listed from stat.ML
A Theory of Diversity for Random Matrices with Applications to In-Context Learning of Schrödinger Equations
Frank Cole, Yulong Lu and Shaurya Sehgal
We address the following question: given a collection $\{\mathbf{A}^{(1)}, \dots, \mathbf{A}^{(N)}\}$ of independent $d \times d$ random
matrices drawn from a common distribution $\mathbb{P}$, what is the probability that the centralizer of $\{\mathbf{A}^{(1)}, \dots, \mathbf{A}^{(N)}\}$ is trivial? We provide lower bounds on this probability in terms of the sample size $N$ and the dimension $d$ for several families of random
matrices which arise from the discretization of linear Schrödinger operators with random potentials. When combined with recent work on machine learning theory, our results provide guarantees on the generalization ability of
transformer-based neural networks for in-context learning of Schrödinger equations.
Read the full abstract ▾
Machine Learning
Life, Machine Learning, and the Search for Habitability: Predicting Biosignature Fluxes for the Habitable Worlds Observatory
Mark Moussa, Amber V. Young, Brianna Isola et al. (+4 more)
Future direct-imaging flagship missions, such as NASA's Habitable Worlds Observatory (HWO), face critical decisions in prioritizing observations due to extremely stringent time and resource constraints. In this paper, we introduce two advanced machine-learning architectures tailored for predicting biosignature species fluxes from exoplanetary reflected-light spectra: a
Bayesian Convolutional Neural Network (BCNN) and our novel model architecture, the Spectral Query Adaptive
Transformer (SQuAT). The BCNN robustly quantifies both epistemic and aleatoric uncertainties, offering reliable predictions under diverse observational conditions, whereas SQuAT employs query-driven
attention mechanisms to enhance interpretability by explicitly associating spectral features with specific biosignature species. We demonstrate that both models achieve comparably high predictive accuracy on an augmented
dataset spanning a wide range of exoplanetary conditions, while highlighting their distinct advantages in uncertainty quantification and spectral interpretability. These capabilities position our methods as promising tools for accelerating target triage, optimizing observation schedules, and maximizing scientific return for upcoming flagship missions such as HWO.
Read the full abstract ▾
All authors Mark Moussa, Amber V. Young, Brianna Isola, Vasuda Trehan, Michael D. Himes, Nicholas Wogan, Giada Arney
Machine Learning
Press Start to Charge: Videogaming the Online Centralized Charging Scheduling Problem
Alireza Ghahtarani, Martin Cousineau, Amir-massoud Farahmand et al. (+1 more)
We study the online centralized charging scheduling problem (OCCSP). In this problem, a central authority must decide, in real time, when to charge dynamically arriving electric vehicles (EVs), subject to capacity limits, with the objective of balancing load across a finite planning horizon. To solve the problem, we first gamify it; that is, we model it as a game where charging blocks are placed within temporal and capacity constraints on a grid. We design heuristic policies, train learning
agents with expert demonstrations, and improve them using
Dataset Aggregation (DAgger). From a theoretical standpoint, we show that gamification reduces model complexity and yields tighter generalization bounds than vector-based formulations. Experiments across multiple EV arrival patterns confirm that gamified learning enhances load balancing. In particular, the image-to-movement model trained with DAgger consistently outperforms heuristic baselines, vector-based approaches, and supervised learning
agents, while also demonstrating robustness in sensitivity analyses. These operational gains translate into tangible economic value. In a real-world case study for the Greater Montréal Area (Québec, Canada) using utility cost data, the proposed methods lower system costs by tens of millions of dollars per year over the prevailing practice and show clear potential to delay costly grid upgrades.
Read the full abstract ▾
All authors Alireza Ghahtarani, Martin Cousineau, Amir-massoud Farahmand, Jorge E. Mendoza
Machine Learning
Approximating splits for decision trees quickly in sparse data streams
Nikolaj Tatti
Decision trees are one of the most popular classifiers in the machine learning literature. While the most common decision tree learning
algorithms treat data as a batch, numerous
algorithms have been proposed to construct decision trees from a data stream. A standard training strategy involves augmenting the current tree by changing a leaf node into a split. Here we typically maintain counters in each leaf which allow us to determine the optimal split, and whether the split should be done. In this paper we focus on how to speed up the search for the optimal split when dealing with sparse binary features and a binary class. We focus on finding splits that have the approximately optimal information gain or Gini index. In both cases finding the optimal split can be done in $O(d)$ time, where $d$ is the number of features. We propose an
algorithm that yields $(1 + \alpha)$ approximation when using conditional
entropy in amortized $O(\alpha^{-1}(1 + m\log d) \log \log n)$ time, where $m$ is the number of 1s in a data point, and $n$ is the number of data points. Similarly, for Gini index, we achieve $(1 + \alpha)$ approximation in amortized $O(\alpha^{-1} + m \log d)$ time. Our approach is beneficial for sparse data where $m \ll d$. In our experiments we find almost-optimal splits efficiently, faster than the baseline, overperforming the theoretical approximation guarantees.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.SE
Improved Bug Localization with AI Agents Leveraging Hypothesis and Dynamic Cognition
Asif Mohammed Samir and Mohammad Masudur Rahman
Software bugs cost technology providers (e.g., AT&T) billions annually and cause developers to spend roughly 50% of their time on bug resolution. Traditional methods for bug localization often analyze the suspiciousness of code components (e.g., methods, documents) in isolation, overlooking their connections with other components in the codebase. Recent advances in Large
Language Models (LLMs) and agentic AI techniques have shown strong potential for code understanding, but still lack causal
reasoning during code exploration and struggle to manage growing context effectively, limiting their capability. In this paper, we present a novel agentic technique for bug localization – CogniGent – that overcomes the limitations above by leveraging multiple AI
agents capable of causal
reasoning, call-graph-based root cause analysis and context engineering. It emulates developers-inspired debugging practices (a.k.a., dynamic cognitive debugging) and conducts hypothesis testing to support bug localization. We evaluate CogniGent on a curated
dataset of 591 bug reports using three widely adopted performance metrics and compare it against six established baselines from the literature. Experimental results show that our technique consistently outperformed existing traditional and LLM-based techniques, achieving MAP improvements of 23.33-38.57% at the document and method levels. Similar gains were observed in MRR, with increases of 25.14-53.74% at both granularity levels. Statistical significance tests also confirm the superiority of our technique. By addressing the
reasoning, dependency, and context limitations, CogniGent advances the state of bug localization, bridging human-like cognition with agentic automation for improved performance.
Read the full abstract ▾
Machine Learning
Learning Relativistic Geodesics and Chaotic Dynamics via Stabilized Lagrangian Neural Networks
Abdullah Umut Hamzaogullari and Arkadas Ozakin
Lagrangian Neural Networks (LNNs) can learn arbitrary Lagrangians from trajectory data, but their unusual optimization objective leads to significant training instabilities that limit their application to complex systems. We propose several improvements that address these fundamental challenges, namely, a Hessian regularization scheme that penalizes unphysical signatures in the Lagrangian's second derivatives with respect to velocities, preventing the network from learning unstable dynamics, activation functions that are better suited to the problem of learning Lagrangians, and a physics-aware coordinate scaling that improves stability. We systematically evaluate these techniques alongside previously proposed methods for improving stability. Our improved architecture successfully trains on systems of unprecedented complexity, including triple pendulums, and achieved 96.6% lower validation loss value and 90.68% better stability than baseline LNNs in double pendulum systems. With the improved framework, we show that our LNNs can learn Lagrangians representing geodesic motion in both non-relativistic and general relativistic settings. To deal with the relativistic setting, we extended our regularization to penalize violations of Lorentzian signatures, which allowed us to predict a geodesic Lagrangian under AdS\textsubscript{4} spacetime metric directly from trajectory data, which to our knowledge has not been done in the literature before. This opens new possibilities for automated discovery of
geometric structures in physics, including extraction of spacetime metric tensor components from geodesic trajectories. While our approach inherits some limitations of the original LNN framework, particularly the requirement for invertible Hessians, it significantly expands the practical applicability of LNNs for scientific discovery tasks.
Read the full abstract ▾
Machine Learning
Cooperative Multi-agent RL with Communication Constraints
Nuoya Xiong and Aarti Singh
Cooperative MARL often assumes frequent access to global information in a data buffer, such as team rewards or other
agents' actions, which is typically unrealistic in decentralized MARL systems due to high communication costs. When communication is limited,
agents must rely on outdated information to estimate gradients and update their policies. A common approach to handle missing data is called importance sampling, in which we reweigh old data from a base policy to estimate gradients for the current policy. However, it quickly becomes unstable when the communication is limited (i.e. missing data probability is high), so that the base policy in importance sampling is outdated. To address this issue, we propose a technique called base policy prediction, which utilizes old gradients to predict the policy update and collect samples for a sequence of base policies, which reduces the gap between the base policy and the current policy. This approach enables effective learning with significantly fewer communication rounds, since the samples of predicted base policies could be collected within one communication round. Theoretically, we show that our
algorithm converges to an $\varepsilon$-Nash
equilibrium in potential games with only $O(\varepsilon^{-3/4})$ communication rounds and $O(poly(\max_i |A_i|)\varepsilon^{-11/4})$ samples, improving existing state-of-the-art results in communication cost, as well as sample complexity without the exponential dependence on the joint action space size. We also extend these results to general Markov Cooperative Games to find an
agent-wise local maximum. Empirically, we test the base policy prediction
algorithm in both simulated games and MAPPO for complex environments.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.CV
CoLR-Det: Collaborative Latent Restoration for Small Object Detection in Low-Resolution Remote Sensing Images
Ruo Qi, Linhui Dai, Yusong Qin et al. (+2 more)
Low-resolution remote sensing small object detection is limited by both missing visual details and the ambiguity of how details serve detection. Existing super-resolution-assisted detectors generally follow a restoration-first paradigm to explicitly enhance inputs before detection, which implicitly assumes visual fidelity benefits recognition. Yet super-resolution favors dense texture and edge recovery, while object detection relies on sparse instance-level semantics, making restoration amplify visually plausible but semantically irrelevant background textures. To tackle this issue, we propose CoLR-Det, a Collaborative Latent-Restoration-Assisted Small Object Detection framework that treats super-resolution supervision as detection-oriented latent regularization rather than explicit image-level enhancement. Instead of reconstructing high-resolution images for inference, CoLR-Det uses a training-only restoration branch to impose auxiliary reconstruction constraints on shared multiscale representations, and the inference pathway remains purely detection-driven. We further design a saliency-guided object-preserving
token routing mechanism, which prioritizes high-saliency
tokens for
attention-based refinement while retaining information of bypassed
tokens. Besides, a detection-prioritized two-stage optimization strategy is developed: it first builds stable object-level semantics before introducing restoration supervision, and assigns a smaller learning rate to the SR decoder to keep its updates conservative and reduce perturbations in collaborative training. With this design, CoLR-Det transforms restoration from an explicit visual enhancement operator into an implicit semantic regularizer. Experiments on resolution-degraded NWPU VHR-10-Split, DOTAv1.5-Split and HRSSD-Split show that CoLR-Det outperforms state-of-the-art methods, with code available at https://github.com/qiruo-ya/CoLR-Det.
Read the full abstract ▾
All authors Ruo Qi, Linhui Dai, Yusong Qin, Chaolei Yang, Yanshan Li
Machine Learning
Semidefinite Programming for Quantum Channel Learning
Mikhail Gennadievich Belov, Victor Victorovich Dubov, Vadim Konstantinovich Ivanov et al. (+3 more)
The problem of reconstructing a
quantum channel from a sample of classical data is considered. When the total fidelity can be represented as a ratio of two quadratic forms (e.g., in the case of mapping a mixed state to a pure state, projective operators,
unitary learning, and others), Semidefinite Programming (SDP) can be applied to solve the fidelity optimization problem with respect to the Choi
matrix. A remarkable feature of SDP is that the optimization is convex, which allows the problem to be efficiently solved by a variety of numerical
algorithms. We have tested several commercially available SDP solvers, all of which allowed for the reconstruction of
quantum channels of different forms. A notable feature is that the Kraus rank of the obtained
quantum channel typically comprises less than a few percent of its maximal possible value. This suggests that a relatively small Kraus rank
quantum channel is typically sufficient to describe experimentally observed classical data. The theory was also applied to the problem of reconstructing projective operators from data. Finally, we discuss a classical computational model based on
quantum channel transformation, performed and calculated on a classical computer, possibly hardware-optimized.
Read the full abstract ▾
All authors Mikhail Gennadievich Belov, Victor Victorovich Dubov, Vadim Konstantinovich Ivanov, Alexander Yurievich Maslov, Olga Vladimirovna Proshina, Vladislav Gennadievich Malyshkin
Machine Learning · Cross-listed from cs.AI
Failure Modes in Multi-Hop QA: The Weakest Link Effect and the Recognition Bottleneck
Meiru Zhang, Zaiqiao Meng and Nigel Collier
Despite scaling to massive context windows, Large
Language Models (LLMs) struggle with multi-hop
reasoning due to inherent position bias, which causes them to overlook information at certain positions. Whether these failures stem from an inability to locate evidence (recognition failure) or integrate it (synthesis failure) is unclear. We introduce Multi-Focus
Attention Instruction (MFAI), a semantic probe to disentangle these mechanisms by explicitly steering
attention towards selected positions. Across 5 LLMs on two multi-hop QA tasks (MuSiQue and NeoQA), we identify the "Weakest Link Effect": in our 18-document, 3-bucket setting, multi-hop
reasoning performance collapses to the level of the least visible evidence, governed by absolute position rather than the linear distance between facts. While matched MFAI resolves recognition bottlenecks, improving accuracy by up to 11.49% in low-visibility positions, misleading MFAI yields divergent effects modulated by task
topology: entity-centric tasks with vertical
reasoning chains are vulnerable, whereas event-centric tasks with horizontal evidence structures are more resilient. Finally, we demonstrate that thinking models utilizing System-2
reasoning effectively locate and integrate the required information, matching gold-only baselines even in noisy, long-context settings. Supplementary experiments on 2WikiMultiHopQA, extended 3-4 hop counts, and a 32B model confirm these findings generalize across
datasets,
reasoning depths, and model scales.
Read the full abstract ▾
Machine Learning · Cross-listed from quant-ph
A Mixture of Experts Vision Transformer for High-Fidelity Surface Code Decoding
Hoang Viet Nguyen, Manh Hung Nguyen, Hoang Ta et al. (+2 more)
Quantum error correction is a key ingredient for large scale
quantum computation, protecting logical information from physical noise by encoding it into many physical
qubits. Topological stabilizer codes are particularly appealing due to their
geometric locality and practical relevance. In these codes, stabilizer measurements yield a syndrome that must be decoded into a recovery operation, making decoding a central bottleneck for scalable real time operation. Existing decoders are commonly classified into two categories. Classical algorithmic decoders provide strong and well established baselines, but may incur substantial computational overhead at large code distances or under stringent latency constraints. Machine learning based decoders offer fast GPU inference and flexible function approximation, yet many approaches do not explicitly exploit the
lattice geometry and local structure of topological codes, which can limit performance. In this work, we propose QuantumSMoE, a
quantum vision transformer based decoder that incorporates code structure through plus shaped
embeddings and adaptive masking to capture local interactions and
lattice connectivity, and improves scalability via a mixture of experts layer with a novel auxiliary loss. Experiments on the toric code demonstrate that QuantumSMoE outperforms state-of-the-art machine learning decoders as well as widely used classical baselines.
Read the full abstract ▾
All authors Hoang Viet Nguyen, Manh Hung Nguyen, Hoang Ta, Van Khu Vu, Yeow Meng Chee
Machine Learning
Patch-Level Tokenization with CNN Encoders and Attention for Improved Transformer Time-Series Forecasting
Saurish Nagrath, Saroj Kumar Panigrahy and Soubhagya Sankar Barpanda
Transformer-based models have shown strong performance in time-series
forecasting by leveraging self-
attention to model long-range temporal dependencies. However, their effectiveness depends critically on the quality and structure of input representations derived from raw multivariate time-series data, particularly as sequence length and data scale increase. This paper proposes a two-stage
forecasting framework that explicitly separates local temporal representation learning from global dependency modelling. In the proposed approach, a convolutional neural network operates on fixed-length temporal patches to extract short-range temporal dynamics and non-linear feature interactions, producing compact patch-level
token embeddings.
Token-level self-
attention is applied during representation learning to refine these
embeddings, after which a
Transformer encoder models inter-patch temporal dependencies to generate forecasts. The method is evaluated on a synthetic multivariate time-series
dataset with controlled static and dynamic factors, using an extended sequence length and a larger number of samples. Experimental results demonstrate that the proposed framework consistently outperforms a convolutional baseline under increased temporal context and remains competitive with a strong patch-based
Transformer model. These findings indicate that structured patch-level tokenization provides a scalable and effective representation for multivariate time-series
forecasting, particularly when longer input sequences are considered.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.CR
TrojanPraise: Jailbreak LLMs via Benign Fine-Tuning
Zhixin Xie, Xurui Song and Jun Luo
The demand of customized large
language models (LLMs) has led to commercial LLMs offering black-box fine-tuning APIs, yet this convenience introduces a critical security loophole: attackers could jailbreak the LLMs by fine-tuning them with malicious data. Though this security issue has recently been exposed, the feasibility of such attacks is questionable as malicious training
dataset is believed to be detectable by moderation models such as Llama-Guard-3. In this paper, we propose TrojanPraise, a novel finetuning-based attack exploiting benign and thus filter-approved data. Basically, TrojanPraise fine-tunes the model to associate a crafted word (e.g., "bruaf") with harmless connotations, then uses this word to praise harmful concepts, subtly shifting the LLM from refusal to compliance. To explain the attack, we decouple the LLM's internal representation of a query into two dimensions of knowledge and attitude. We demonstrate that successful jailbreak requires shifting the attitude while avoiding knowledge shift, a distortion in the model's understanding of the concept. To validate this attack, we conduct experiments on five opensource LLMs and two commercial LLMs under strict black-box settings. Results show that TrojanPraise achieves a maximum attack success rate of 95.88% while evading moderation.
Read the full abstract ▾
Machine Learning
Constraint-Aware Neurosymbolic Uncertainty Quantification with Bayesian Deep Learning for Scientific Discovery
Shahnawaz Alam, Mohammed Mudassir Uddin and Mohammed Kaif Pasha
Scientific Artificial Intelligence (AI) applications require models that deliver trustworthy uncertainty estimates while respecting domain constraints. Existing uncertainty quantification methods lack mechanisms to incorporate symbolic scientific knowledge, while neurosymbolic approaches operate deterministically without principled uncertainty modeling. We introduce the Constraint-Aware Neurosymbolic Uncertainty Framework (CANUF), unifying
Bayesian deep learning with differentiable symbolic
reasoning. The architecture comprises three components: automated constraint extraction from scientific literature, probabilistic neural backbone with variational inference, and differentiable constraint satisfaction layer ensuring physical consistency. Experiments on Materials Project (140,000+ materials), QM9 molecular properties, and
climate benchmarks show CANUF reduces Expected Calibration Error by 34.7% versus
Bayesian neural networks while maintaining 99.2% constraint satisfaction. Ablations reveal constraint-guided recalibration contributes 18.3% performance gain, with constraint extraction achieving 91.4% precision. CANUF provides the first end-to-end differentiable pipeline simultaneously addressing uncertainty quantification, constraint satisfaction, and interpretable explanations for scientific predictions.
Read the full abstract ▾
Machine Learning · Cross-listed from eess.AS
Purification Before Fusion: Toward Mask-Free Speech Enhancement for Robust Audio-Visual Speech Recognition
Linzhi Wu, Xingyu Zhang, Hao Yuan et al. (+5 more)
Audio-visual
speech recognition (AVSR) typically improves recognition accuracy in noisy environments by integrating noise-immune visual cues with audio signals. Nevertheless, high-noise audio inputs are prone to introducing adverse interference into the feature fusion process. To mitigate this, recent AVSR methods often adopt mask-based strategies to filter audio noise during feature interaction and fusion, yet such methods risk discarding semantically relevant information alongside noise. In this work, we propose an end-to-end noise-robust AVSR framework coupled with
speech enhancement, eliminating the need for explicit noise mask generation. This framework leverages a Conformer-based bottleneck fusion module to implicitly refine noisy audio features with
video assistance. By reducing modality redundancy and enhancing inter-modal interactions, our method preserves
speech semantic integrity to achieve robust recognition performance. Experimental evaluations on the public LRS3
benchmark suggest that our method outperforms prior advanced mask-based baselines under noisy conditions.
Read the full abstract ▾
All authors Linzhi Wu, Xingyu Zhang, Hao Yuan, Yakun Zhang, Changyan Zheng, Liang Xie, Tiejun Liu, Erwei Yin
Machine Learning · Cross-listed from eess.SP
Temporal Data and Short-Time Averages Improve Multiphase Mass Flow Metering
Amanda Nyholm, Yessica Arellano, Jinyu Liu et al. (+2 more)
Reliable flow measurements are essential in many industries, but current instruments often fail to accurately estimate multiphase flows, which are frequently encountered in real-world operations. Combining machine learning (ML)
algorithms with accurate single-phase flowmeters has therefore received extensive research
attention in recent years. The Coriolis mass flowmeter is a widely used single-phase meter that provides direct mass flow measurements, which ML models can be trained to correct, thereby reducing measurement errors in multiphase conditions. This paper demonstrates that preserving temporal information significantly improves model performance in such scenarios. We compare a multilayer perceptron, a windowed multilayer perceptron, and a convolutional neural network (CNN) on three-phase air-water-oil flow data from 342 experiments. Whereas prior work typically compresses each experiment into a single averaged sample, we instead compute short-time averages from within each experiment and train models that preserve temporal information at several downsampling intervals. The CNN performed best at 0.25 Hz with approximately 95 % of relative errors below 13 %, a normalized root mean squared error of 0.03, and a mean absolute percentage error of approximately 4.3 %, clearly outperforming the best single-averaged model and demonstrating that short-time averaging within individual experiments is preferable. Results are consistent across multiple data splits and random seeds, demonstrating robustness.
Read the full abstract ▾
All authors Amanda Nyholm, Yessica Arellano, Jinyu Liu, Damian Krakowiak, Pierluigi Salvo Rossi
Machine Learning
Graph Attention Networks with Physical Constraints for Anomaly Detection
Mohammadhossein Homaei, Iman Khazrak, Ruben Molano et al. (+2 more)
Water distribution systems (WDSs) face increasing cyber-physical risks, which make reliable anomaly detection essential. Many data-driven models ignore network
topology and are hard to interpret, while model-based ones depend strongly on parameter accuracy. This work proposes a hydraulic-aware graph
attention network using normalized conservation law violations as features. It combines mass and energy balance residuals with graph
attention and bidirectional LSTM to learn spatio-temporal patterns. A multi-scale module aggregates detection scores from node to network level. On the BATADAL
dataset, it reaches $F1=0.979$, showing $3.3$pp gain and high robustness under $15\%$ parameter noise.
Read the full abstract ▾
All authors Mohammadhossein Homaei, Iman Khazrak, Ruben Molano, Andres Caro, Mar Avila
Machine Learning
Orthogonalized Policy Optimization:Policy Optimization as Orthogonal Projection in Hilbert Space
Wang Zixian
We propose Orthogonalized Policy Optimization (OPO), a principled framework for large
language model
alignment derived from optimization in the
Hilbert function space L2(pi_k). Lifting policy updates from the probability simplex into L2(pi_k) transforms the nonlinear normalization constraint into a linear orthogonality condition <v, 1>_{pi_k} = 0 on the density fluctuation field v = pi/pi_k - 1. By the
Hilbert projection
theorem, the unique closed-form update is v_
star = (omega_alpha - E[omega_alpha]) / mu, where the subtracted mean acts as a chemical potential enforcing probability conservation. This interpretation reveals advantage z-score normalization as a conservation-law projection rather than a variance-reduction heuristic. OPO cleanly decouples sampling geometry, controlled by the escort exponent alpha, from optimization geometry, governed by the stiffness parameter mu, a separation not attainable under KL-based objectives. The same update can also be derived as a Euclidean mirror-descent step and as the linear-response law of near-
equilibrium statistical mechanics, establishing its structural uniqueness within ratio geometry. Structurally, OPO induces constant
curvature, non-saturating linear gradient dynamics, and an intrinsic chi-square trust region. Experiments on MATH
benchmarks show that the
Hilbert projection formulation prevents gradient saturation typical of KL-constrained methods. By sustaining non-vanishing gradients in high-confidence regimes, OPO avoids premature plateaus and achieves stronger long-horizon training rewards and improved out-of-distribution generalization compared to clipping-based baselines.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.CR
De-Anonymization at Scale via Tournament-Style Attribution
Lirui Zhang and Huishuai Zhang
As LLMs rapidly advance and enter real-world use, their
privacy implications are increasingly important. We study an authorship de-anonymization threat: using LLMs to link anonymous documents to their authors, potentially compromising settings such as double-blind peer review. We propose De-Anonymization at Scale (DAS), a large
language model-based method for attributing authorship among tens of thousands of candidate texts. DAS uses a sequential progression strategy: it randomly partitions the candidate corpus into fixed-size groups,
prompts an LLM to select the text most likely written by the same author as a query text, and iteratively re-queries the surviving candidates to produce a ranked top-k list. To make this practical at scale, DAS adds a dense-
retrieval prefilter to shrink the search space and a majority-voting style aggregation over multiple independent runs to improve robustness and ranking precision. Experiments on anonymized review data show DAS can recover same-author texts from pools of tens of thousands with accuracy well above chance, demonstrating a realistic
privacy risk for anonymous platforms. On standard authorship
benchmarks (Enron emails and blog posts), DAS also improves both accuracy and scalability over prior approaches, highlighting a new LLM-enabled de-anonymization vulnerability.
Read the full abstract ▾
Machine Learning
Explainable Machine Learning for Pediatric Dental Risk Stratification Using Socio-Demographic Determinants
Manasi Kanade, Abhi Thakkar and Gabriela Fernandes
Background: Pediatric dental disease remains one of the most prevalent and inequitable chronic health conditions worldwide. Although strong epidemiological evidence links oral health outcomes to socio-economic and demographic determinants, most artificial intelligence (AI) applications in dentistry rely on image-based diagnosis and black-box prediction models, limiting transparency and ethical applicability in pediatric populations. Objective: This study aimed to develop and evaluate an explainable machine learning framework for pediatric dental risk stratification that prioritizes interpretability, calibration, and ethical deployment over maximal predictive accuracy. Methods: A supervised machine learning model was trained using population-level pediatric data including age, income-to-poverty ratio, race/ethnicity, gender, and medical history. Model performance was assessed using receiver operating characteristic (ROC) analysis and calibration curves. Explainability was achieved using SHapley Additive exPlanations (SHAP) to provide global and individual-level interpretation of predictions. Results: The model achieved modest discrimination (AUC = 0.61) with conservative calibration, underestimating risk at higher probability levels. SHAP analysis identified age and income-to-poverty ratio as the strongest contributors to predicted risk, followed by race/ethnicity and gender. Conclusion: Explainable machine learning enables transparent, prevention-oriented pediatric dental risk stratification and supports population screening and equitable resource allocation rather than diagnostic decision-making.
Read the full abstract ▾
Machine Learning
Beyond the Dirac Delta: Mitigating Diversity Collapse in Reinforcement Fine-Tuning for Versatile Image Generation
Jinmei Liu, Haoru Li, Zhenhong Sun et al. (+6 more)
Reinforcement learning (RL) has emerged as a paradigm for fine-tuning large-scale generative models, such as
diffusion and flow models, to align with complex human preferences and user-specified tasks. A fundamental limitation remains the curse of diversity collapse, where the objective formulation and optimization landscape inherently collapse the policy to a Dirac delta distribution. To address this challenge, we propose DRIFT (DiveRsity-Incentivized Reinforcement Fine-Tuning for Versatile Image Generation), an innovative framework that systematically incentivizes output diversity throughout the on-policy fine-tuning process, reconciling strong task
alignment with high generation diversity to enhance versatility essential for applications that demand diverse candidate generations. We approach the problem across three representative perspectives: i) sampling a reward-concentrated subset that filters out reward outliers to prevent premature collapse; ii) prompting with
stochastic variations to expand the conditioning space, and iii) optimization of the intra-group diversity with a potential-based reward shaping mechanism. Experimental results show that DRIFT exhibits clear Pareto dominance in task
alignment and generation diversity, achieving 3.88%$\sim$81.42% higher diversity at matched
alignment and 14.38%$\sim$56.45% higher
alignment at matched diversity. Our code is available at \textcolor{magenta}{\href{https://github.com/NJU-RL/DRIFT}{https://github.com/NJU-RL/DRIFT}}.
Read the full abstract ▾
All authors Jinmei Liu, Haoru Li, Zhenhong Sun, Chaofeng Chen, Yatao Bian, Bo Wang, Daoyi Dong, Chunlin Chen, Zhi Wang