Machine Learning
A Methodology for Thermal Limit Bias Predictability Through Artificial Intelligence
Anirudh Tunga, Michael J. Mueterthies and Jonathan Nistor
Nuclear power plant operators face significant challenges due to unpredictable deviations between offline and online thermal limits, a phenomenon known as thermal limit bias, which leads to conservative design margins, increased fuel costs, and operational inefficiencies. This work presents a deep learning based methodology to predict and correct this bias for Boiling Water Reactors (BWRs), focusing on the Maximum Fraction of Limiting Power Density (MFLPD) metric used to track the Linear Heat Generation Rate (LHGR) limit. The proposed model employs a fully convolutional encoder decoder architecture, incorporating a feature fusion network to predict corrected MFLPD values closer to online measurements. Evaluated across five independent fuel cycles, the model reduces the mean nodal array error by 74 percent, the mean absolute deviation in limiting values by 72 percent, and the maximum bias by 52 percent compared to offline methods. These results demonstrate the model's potential to meaningfully improve fuel cycle economics and operational planning, and a commercial variant has been deployed at multiple operating BWRs.
Read the full abstract ▾
Machine Learning · Cross-listed from eess.IV
LUMINA: A Multi-Vendor Mammography Benchmark with Energy Harmonization Protocol
Hongyi Pan, Gorkem Durak, Halil Ertugrul Aktas et al. (+9 more)
Publicly available full-field digital mammography (FFDM)
datasets remain limited in size, clinical annotations, and vendor diversity, hindering the development of robust models. We introduce LUMINA, a curated, multi-vendor FFDM
dataset that explicitly encodes acquisition energy and vendor metadata to capture clinically relevant appearance variations often overlooked in existing
benchmarks. This
dataset contains 1824 images from 468 patients (960 benign, 864 malignant), with pathology-confirmed labels, BI-RADS assessments, and breast-density annotations. LUMINA spans six acquisition systems and includes both high- and low-energy imaging styles, enabling systematic analysis of vendor- and energy-induced domain shifts. To address these variations, we propose a foreground-only pixel-space
alignment method (”energy harmonization”) that maps images to a low-energy reference while preserving lesion morphology. We
benchmark CNN and
transformer models on three clinically relevant tasks: diagnosis (benign vs. malignant), BI-RADS classification, and density estimation. Two-view models consistently outperform single-view models. EfficientNet-B0 achieves an AUC of 93.54% for diagnosis, while Swin-T achieves the best macro-AUC of 89.43% for density prediction. Harmonization improves performance across architectures and produces more localized Grad-CAM responses. Overall, LUMINA provides (1) a vendor-diverse
benchmark and (2) a model-agnostic harmonization framework for reliable and deployable mammography AI.
Read the full abstract ▾
All authors Hongyi Pan, Gorkem Durak, Halil Ertugrul Aktas, Andrea M. Bejar, Baver Tutun, Emre Uysal, Ezgi Bulbul, Mehmet Fatih Dogan, Berrin Erok, Berna Akkus Yildirim, Sukru Mehmet Erturk, Ulas Bagci
Machine Learning
Anterior's Approach to Fairness Evaluation of Automated Prior Authorization System
Sai P. Selvaraj, Khadija Mahmoud and Anuj Iravane
Increasing staffing constraints and turnaround-time pressures in Prior authorization (PA) have led to increasing automation of decision systems to support PA review. Evaluating
fairness in such systems poses unique challenges because legitimate clinical guidelines and medical necessity criteria often differ across demographic groups, making parity in approval rates an inappropriate
fairness metric. We propose a
fairness evaluation framework for prior authorization models based on model error rates rather than approval outcomes. Using 7,166 human-reviewed cases spanning 27 medical necessity guidelines, we assessed consistency in sex, age, race/ethnicity, and socioeconomic status. Our evaluation combined error-rate comparisons, tolerance-band analysis with a predefined $\pm$5 percentage-point margin, statistical power evaluation, and protocol-controlled logistic regression. Across most demographics, model error rates were consistent, and confidence intervals fell within the predefined tolerance band, indicating no meaningful performance differences. For race/ethnicity, point estimates remain small, but subgroup sample sizes were limited, resulting in wide confidence intervals and underpowered tests, with inconclusive evidence within the
dataset we explored. These findings illustrate a rigorous and regulator-aligned approach to
fairness evaluation in administrative healthcare AI systems.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.MA
EcoFair-CH-MARL: Scalable Constrained Hierarchical Multi-Agent RL with Real-Time Emission Budgets and Fairness Guarantees
Saad Alqithami
Global decarbonisation targets and tightening
market pressures demand maritime logistics solutions that are simultaneously efficient, sustainable, and equitable. We introduce EcoFair-CH-MARL, a constrained hierarchical multi-
agent reinforcement learning framework that unifies three innovations: (i) a primal-dual budget layer that provably bounds cumulative emissions under
stochastic weather and demand; (ii) a
fairness-aware reward
transformer with dynamically scheduled penalties that enforces max-min cost equity across heterogeneous fleets; and (iii) a two-tier policy architecture that decouples strategic routing from real-time vessel control, enabling linear scaling in
agent count. New theoretical results establish O(\sqrt{T}) regret for both constraint violations and
fairness loss. Experiments on a high-fidelity maritime digital twin (16 ports, 50 vessels) driven by automatic identification system traces, plus an energy-grid case study, show up to 15% lower emissions, 12% higher through-put, and a 45% fair-cost improvement over state-of-the-art hierarchical and constrained MARL baselines. In addition, EcoFair-CH-MARL achieves stronger equity (lower Gini and higher min-max welfare) than
fairness-specific MARL baselines (e.g., SOTO, FEN), and its modular design is compatible with both policy- and value-based learners. EcoFair-CH-MARL therefore advances the feasibility of large-scale, regulation-compliant, and socially responsible multi-
agent coordination in safety-critical domains.
Read the full abstract ▾
Machine Learning
Proactive Routing to Interpretable Surrogates with Distribution-Free Safety Guarantees
Iqtedar Uddin, Mazin Khider and André Bauer
Model routing determines whether to use an accurate black-box model or a simpler surrogate that approximates it at lower cost or greater interpretability. In deployment settings, practitioners often wish to restrict surrogate use to inputs where its degradation relative to a reference model is controlled. We study proactive (input-based) routing, in which a lightweight gate selects the model before either runs, enabling distribution-free control of the fraction of routed inputs whose degradation exceeds a tolerance {\tau}. The gate is trained to distinguish safe from unsafe inputs, and a routing threshold is chosen via Clopper-Pearson conformal calibration on a held-out set, guaranteeing that the routed-set violation rate is at most {\alpha} with probability 1-{\delta}. We derive a feasibility condition linking safe routing to the base safe rate {\pi} and risk budget {\alpha}, along with sufficient AUC thresholds ensuring that feasible routing exists. Across 35 OpenML
datasets and multiple black-box model families, gate-based conformal routing maintains controlled violation while achieving substantially higher coverage than regression conformal and naive baselines. We further show that probabilistic calibration primarily affects routing efficiency rather than distribution-free validity.
Read the full abstract ▾
Machine Learning
Delightful Policy Gradient
Ian Osband
Standard policy gradients weight each sampled action by advantage alone, regardless of how likely that action was under the current policy. This creates two pathologies: within a single decision context (e.g. one image or
prompt), a rare negative-advantage action can disproportionately distort the update direction; across many such contexts in a batch, the expected gradient over-allocates budget to contexts the policy already handles well. We introduce the Delightful Policy Gradient (DG), which gates each term with a sigmoid of delight, the product of advantage and action surprisal (negative log-probability). For $K$-armed bandits, DG provably improves directional accuracy in a single context and, across multiple contexts, shifts the expected gradient strictly closer to the supervised cross-
entropy oracle. This second effect is not variance reduction: it persists even with infinite samples. Empirically, DG outperforms REINFORCE, PPO, and advantage-weighted baselines across MNIST,
transformer sequence modeling, and continuous control, with larger gains on harder tasks.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.RO
Tactile Modality Fusion for Vision-Language-Action Models
Charlotte Morissette, Amin Abyaneh, Wei-Di Chang et al. (+5 more)
We propose TacFiLM, a lightweight modality-fusion approach that integrates visual-tactile signals into
vision-
language-action (VLA) models. While advances in VLAs have introduced
robot policies that are both generalizable and semantically grounded, these models mainly rely on
vision-based perception.
Vision alone, however, cannot capture the complex interaction dynamics that occur during contact-rich manipulation, including contact forces, surface friction, compliance, and shear. While recent attempts to integrate tactile signals into VLA models often increase complexity through
token concatenation or large-scale pretraining, the heavy computational demands of behaviour models necessitate lightweight fusion strategies. To address these challenges, TacFiLM outlines a post-training finetuning approach that conditions intermediate visual features on pretrained tactile representations using feature-wise linear modulation (FiLM). Experimental results on insertion and drawer opening tasks demonstrate consistent improvements in success rate, direct task performance, completion time, and force stability across both in-distribution and out-of-distribution tasks. Together, these results support our method as an effective approach to integrating tactile signals into VLA models, improving contact-rich manipulation behaviours. Project page: https://charliem7.github.io/projects/TacFilm/
Read the full abstract ▾
All authors Charlotte Morissette, Amin Abyaneh, Wei-Di Chang, Anas Houssaini, David Meger, Hsiu-Chin Lin, Jonathan Tremblay, Gregory Dudek
Machine Learning · Cross-listed from cs.CL
PA3: Policy-Aware Agent Alignment through Chain-of-Thought
Shubhashis Roy Dipta, Daniel Bis, Kun Zhou et al. (+4 more)
Conversational assistants powered by large
language models (LLMs) excel at tool-use tasks but struggle with adhering to complex, business-specific rules. While models can reason over business rules provided in context, including all policies for every query introduces high latency and wastes compute. Furthermore, these lengthy
prompts lead to long contexts, harming overall performance due to the 'needle-in-a-haystack' problem. To address these challenges, we propose a multi-stage
alignment method that teaches models to recall and apply relevant business policies during chain-of-thought
reasoning at inference time, without including the full business policy in-context. Furthermore, we introduce a novel Policy Recall reward based on the Jaccard score and a
Hallucination Penalty for GRPO training. Altogether, our best model outperforms the baseline by 16 points and surpasses comparable in-context baselines of similar model size by 3 points, while using 40% fewer words.
Read the full abstract ▾
All authors Shubhashis Roy Dipta, Daniel Bis, Kun Zhou, Lichao Wang, Benjamin Z. Yao, Chenlei Guo, Ruhi Sarikaya
Machine Learning · Cross-listed from math.ST
$K-$means with learned metrics
Pablo Groisman, Matthieu Jonckheere, Jordan Serres et al. (+1 more)
We study the Fréchet $k-$means of a metric measure space when both the measure and the distance are unknown and have to be estimated. We prove a general result that states that the $k-$means are continuous with respect to the measured Gromov-Hausdorff
topology. In this situation, we also prove a stability result for the Voronoi clusters they determine. We do not assume uniqueness of the set of $k-$means, but when it is unique, the results are stronger. This framework provides a unified approach to proving consistency for a wide range of metric learning procedures. As concrete applications, we obtain new consistency results for several important
estimators that were previously unestablished, even when $k=1$. These include $k-$means based on: (i) Isomap and Fermat geodesic distances on
manifolds, (ii) difussion distances, (iii) Wasserstein distances computed with respect to learned ground metrics. Finally, we consider applications beyond the statistical inference paradigm like (iv) first passage percolation and (v) discrete approximations of length spaces.
Read the full abstract ▾
All authors Pablo Groisman, Matthieu Jonckheere, Jordan Serres, Mariela Sued
Machine Learning
A Loss Landscape Visualization Framework for Interpreting Reinforcement Learning: An ADHDP Case Study
Jingyi Liu, Jian Guo and Eberhard Gill
Reinforcement learning
algorithms have been widely used in dynamic and control systems. However, interpreting their internal learning behavior remains a challenge. In the authors' previous work, a critic match loss landscape visualization method was proposed to study critic training. This study extends that method into a framework which provides a multi-perspective view of the learning dynamics, clarifying how value estimation, policy optimization, and temporal-difference (TD) signals interact during training. The proposed framework includes four complementary components; a three-dimensional reconstruction of the critic match loss surface that shows how TD targets shape the optimization geometry; an actor loss landscape under a frozen critic that reveals how the policy exploits that geometry; a trajectory combining time, Bellman error, and policy weights that indicates how updates move across the surface; and a state-TD map that identifies the state regions that drive those updates. The Action-Dependent Heuristic Dynamic Programming (ADHDP)
algorithm for spacecraft attitude control is used as a case study. The framework is applied to compare several ADHDP variants and shows how training stabilizers and target updates change the optimization landscape and affect learning stability. Therefore, the proposed framework provides a systematic and interpretable tool for analyzing reinforcement learning behavior across algorithmic designs.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.AI
Scaling the Explanation of Multi-Class Bayesian Network Classifiers
Yaofang Zhang and Adnan Darwiche
We propose a new
algorithm for compiling
Bayesian network classifier (BNC) into class formulas. Class formulas are logical formulas that represent a classifier's input-output behavior, and are crucial in the recent line of work that uses logical
reasoning to explain the decisions made by classifiers. Compared to prior work on compiling class formulas of BNCs, our proposed
algorithm is not restricted to binary classifiers, shows significant improvement in compilation time, and outputs class formulas as negation normal form (NNF)
circuits that are OR-decomposable, which is an important property when computing explanations of classifiers.
Read the full abstract ▾
Machine Learning
A Multi-Scale Graph Learning Framework with Temporal Consistency Constraints for Financial Fraud Detection in Transaction Networks under Non-Stationary Conditions
Yiming Lei, Qiannan Shen and Junhao Song
Financial fraud detection in transaction networks involves modeling sparse anomalies, dynamic patterns, and severe class imbalance in the presence of temporal drift in the data. In real-world transaction systems, a suspicious transaction is rarely isolated: rather, legitimate and suspicious transactions are often connected through accounts, intermediaries or through temporal transaction sequences. Attribute-based or randomly partitioned learning pipelines are therefore insufficient to detect relationally structured fraud. STC-MixHop, a graph-based framework combining spatial multi-resolution propagation with lightweight temporal consistency modeling for anomaly and fraud detection in dynamic transaction networks. It integrates three components: a MixHop-inspired multi-scale neighborhood
diffusion encoder a multi-scale neighborhood
diffusion MixHop-based encoder for learning structural patterns; a spatial-temporal
attention module coupling current and preceding graph snapshots to stabilize representations; and a temporally informed self-supervised pretraining strategy exploiting unlabeled transaction interactions to improve representation quality. We evaluate the framework primarily on the PaySim
dataset under strict chronological splits, supplementing the analysis with Porto Seguro and FEMA data to probe cross-domain component behavior. Results show that STC-MixHop is competitive among graph methods and achieves strong screening-oriented recall under highly imbalanced conditions. The experiments also reveal an important boundary condition: when node attributes are highly informative, tabular baselines remain difficult to outperform. Graph structure contributes most clearly where hidden relational dependencies are operationally important. These findings support a stability-focused view of graph learning for financial fraud detection.
Read the full abstract ▾
Machine Learning
FlashHead: Efficient Drop-In Replacement for the Classification Head in Language Model Inference
Wilhelm Tranheden, Shahnawaz Ahmed, Devdatt Dubhashi et al. (+2 more)
Language models are increasingly adopting smaller architectures optimized for consumer devices. In this setting, inference efficiency is the primary constraint. Meanwhile, vocabulary sizes continue to grow rapidly, making the classification head a critical bottleneck that accounts for up to 60% of model parameters, and 50% of inference compute. We introduce FlashHead, the first efficient drop-in replacement for the dense classification head that is training-free and hardware-friendly. FlashHead builds on principles from information
retrieval, reframing that computation at the output head as a
retrieval problem rather than a dense classification over the full vocabulary. FlashHead introduces four key innovations: (1) a balanced clustering scheme that structures vocabulary partitions into compact hardware-efficient tensors, (2) extending multiprobe
retrieval to
language model heads, enabling thousands of clusters to be scored in parallel, (3) a novel inference-time sampling mechanism that extends
retrieval beyond top
tokens, enabling probabilistic sampling across the full vocabulary, and (4) selective quantization, enabling effective low-bit computation in the head. Experiments on Llama-3.2, Gemma-3, and Qwen-3 show that FlashHead delivers model-level inference speedups of up to 1.75x which maintaining output accuracy compared to the original head. By overcoming the classification head bottleneck, FlashHead establishes a new
benchmark for efficient inference and removes a key barrier to developing smaller, capable models for consumer hardware.
Read the full abstract ▾
All authors Wilhelm Tranheden, Shahnawaz Ahmed, Devdatt Dubhashi, Jonna Matthiesen, Hannes von Essen
Machine Learning
Adapting Critic Match Loss Landscape Visualization to Off-policy Reinforcement Learning
Jingyi Liu, Jian Guo and Eberhard Gill
This work extends an established critic match loss landscape visualization method from online to off-policy reinforcement learning (RL), aiming to reveal the optimization geometry behind critic learning. Off-policy RL differs from stepwise online actor-critic learning in its replay-based data flow and target computation. Based on these two structural differences, the critic match loss landscape visualization method is adapted to the Soft Actor-Critic (SAC)
algorithm by aligning the loss evaluation with its batch-based data flow and target computation, using a fixed replay batch and precomputed critic targets from the selected policy. Critic parameters recorded during training are projected onto a principal component plane, where the critic match loss is evaluated to form a 3-D landscape with an overlaid 2-D optimization path. Applied to a spacecraft attitude control problem, the resulting landscapes are analyzed both qualitatively and quantitatively using sharpness, basin area, and local anisotropy metrics, together with temporal landscape snapshots. Comparisons between convergent SAC, divergent SAC, and divergent Action-Dependent Heuristic Dynamic Programming (ADHDP) cases reveal distinct
geometric patterns and optimization behaviors under different algorithmic structures. The results demonstrate that the adapted critic match loss visualization framework serves as a
geometric diagnostic tool for analyzing critic optimization dynamics in replay-based off-policy RL-based control problems.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.AI
SuperLocalMemory V3: Information-Geometric Foundations for Zero-LLM Enterprise Agent Memory
Varun Pratap Bhardwaj
Persistent
memory is a central capability for AI
agents, yet the mathematical foundations of
memory retrieval, lifecycle management, and consistency remain unexplored. Current systems employ cosine similarity for
retrieval, heuristic decay for salience, and provide no formal contradiction detection. We establish information-
geometric foundations through three contributions. First, a
retrieval metric derived from the Fisher information structure of diagonal Gaussian families, satisfying Riemannian metric axioms, invariant under sufficient statistics, and computable in O(d) time. Second,
memory lifecycle formulated as Riemannian Langevin dynamics with proven existence and uniqueness of the stationary distribution via the Fokker-Planck equation, replacing hand-tuned decay with principled convergence guarantees. Third, a cellular sheaf model where non-trivial first
cohomology classes correspond precisely to irreconcilable contradictions across
memory contexts. On the LoCoMo
benchmark, the mathematical layers yield +12.7 percentage points over engineering baselines across six conversations, reaching +19.9 pp on the most challenging dialogues. A four-channel
retrieval architecture achieves 75% accuracy without cloud dependency. Cloud-augmented results reach 87.7%. A zero-LLM configuration satisfies EU AI Act data sovereignty requirements by architectural design. To our knowledge, this is the first work establishing information-
geometric, sheaf-theoretic, and
stochastic-dynamical foundations for AI
agent memory systems.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.AR
Machine Learning-Driven Intelligent Memory System Design: From On-Chip Caches to Storage
Rahul Bera, Rakesh Nadig and Onur Mutlu
Despite the data-rich environment in which
memory systems of modern computing platforms operate, many state-of-the-art architectural policies employed in the
memory system rely on static, human-designed heuristics that fail to truly adapt to the workload and system behavior via principled learning methodologies. In this article, we propose a fundamentally different design approach: using lightweight and practical machine learning (ML) methods to enable adaptive, data-driven control throughout the
memory hierarchy. We present three ML-guided architectural policies: (1) Pythia, a reinforcement learning-based data prefetcher for on-chip caches, (2) Hermes, a perceptron learning-based off-chip predictor for multi-level cache hierarchies, and (3) Sibyl, a reinforcement learning-based data placement policy for hybrid storage systems. Our evaluation shows that Pythia, Hermes, and Sibyl significantly outperform the best-prior human-designed policies, while incurring modest hardware overheads. Collectively, this article demonstrates that integrating adaptive learning into
memory subsystems can lead to intelligent, self-optimizing architectures that unlock performance and efficiency gains beyond what is possible with traditional human-designed approaches.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.CV
Medical Image Spatial Grounding with Semantic Sampling
Andrew Seohwan Yu, Mohsen Hariri, Kunio Nakamura et al. (+3 more)
Vision language models (VLMs) have shown significant promise in visual grounding for images as well as
videos. In medical imaging research, VLMs represent a bridge between object detection and
segmentation, and report understanding and generation. However, spatial grounding of anatomical structures in the three-dimensional space of medical images poses many unique challenges. In this study, we examine image modalities, slice directions, and coordinate systems as differentiating factors for
vision components of VLMs, and the use of anatomical, directional, and relational terminology as factors for the
language components. We then demonstrate that visual and textual prompting systems such as labels, bounding boxes, and mask overlays have varying effects on the spatial grounding ability of VLMs. To enable measurement and reproducibility, we introduce MIS-Ground, a
benchmark that comprehensively tests a VLM for vulnerabilities against specific modes of Medical Image Spatial Grounding. We release MIS-Ground to the public at github.com/asy51/mis-ground. In addition, we present MIS-SemSam, a low-cost, inference-time, and model-agnostic optimization of VLMs that improves their spatial grounding ability with the use of Semantic Sampling. We find that MIS-SemSam improves the accuracy of Qwen3-VL-32B on MIS-Ground by 13.06%.
Read the full abstract ▾
All authors Andrew Seohwan Yu, Mohsen Hariri, Kunio Nakamura, Mingrui Yang, Xiaojuan Li, Vipin Chaudhary
Machine Learning · Cross-listed from stat.ML
Power-Law Spectrum of the Random Feature Model
Elliot Paquette, Ke Liang Xiao and Yizhe Zhu
Scaling laws for neural networks, in which the loss decays as a power-law in the number of parameters, data, and compute, depend fundamentally on the spectral structure of the data covariance, with power-law
eigenvalue decay appearing ubiquitously in
vision and
language tasks. A central question is whether this spectral structure is preserved or destroyed when data passes through the basic building block of a neural network: a random linear projection followed by a nonlinear activation. We study this question for the random feature model: given data $x \sim N(0,H)\in \mathbb{R}^v$ where $H$ has $\alpha$-power-law spectrum ($\lambda_j(H ) \asymp j^{-\alpha}$, $\alpha > 1$), a Gaussian sketch
matrix $W \in \mathbb{R}^{v\times d}$, and an entrywise monomial $f(y) = y^{p}$, we characterize the
eigenvalues of the population random-feature covariance $\mathbb{E}_{x }[\frac{1}{d}f(W^\top x )^{\otimes 2}]$. We prove matching upper and lower bounds: for all $1 \leq j \leq c_1 d \log^{-(p+1)}(d)$, the $j$-th
eigenvalue is of order $\left(\log^{p-1}(j+1)/j\right)^{\alpha}$. For $ c_1 d \log^{-(p+1)}(d)\leq j\leq d$, the $j$-th
eigenvalue is of order $j^{-\alpha}$ up to a polylog factor. That is, the power-law exponent $\alpha$ is inherited exactly from the input covariance, modified only by a logarithmic correction that depends on the monomial degree $p$. The proof combines a dyadic head-tail decomposition with Wick chaos expansions for higher-order monomials and random
matrix concentration inequalities.
Read the full abstract ▾
Machine Learning · Cross-listed from quant-ph
IQP Born Machines under Data-dependent and Agnostic Initialization Strategies
Sacha Lerch, Joseph Bowles, Ricard Puig et al. (+3 more)
Quantum circuit Born machines based on instantaneous
quantum polynomial-time (IQP)
circuits are natural candidates for
quantum generative modeling, both because of their probabilistic structure and because IQP sampling is provably classically hard in certain regimes. Recent proposals focus on training IQP-QCBMs using Maximum Mean Discrepancy (MMD) losses built from low-body Pauli-$Z$ correlators, but the effect of initialization on the resulting optimization landscape remains poorly understood. In this work, we address this by first proving that the MMD loss landscape suffers from barren plateaus for random full-angle-range initializations of IQP
circuits. We then establish lower bounds on the loss variance for identity and an unbiased data-agnostic initialization. We then additionally consider a data-dependent initialization that is better aligned with the target distribution and, under suitable assumptions, yields provable gradients and generally converges quicker to a good minimum (as indicated by our training of
circuits with 150
qubits on genomic data). Finally, as a by-product, the developed variance lower bound framework is applicable to a general class of non-linear losses, offering a broader toolset for analyzing warm-starts in
quantum machine learning.
Read the full abstract ▾
All authors Sacha Lerch, Joseph Bowles, Ricard Puig, Erik Armengol, Zoë Holmes, Supanut Thanasilp
Machine Learning
CausalEvolve: Towards Open-Ended Discovery with Causal Scratchpad
Yongqiang Chen, Chenxi Liu, Zhenhao Chen et al. (+3 more)
Evolve-based
agent such as AlphaEvolve is one of the notable successes in using Large
Language Models (LLMs) to build AI Scientists. These
agents tackle open-ended scientific problems by iteratively improving and evolving programs, leveraging the prior knowledge and
reasoning capabilities of LLMs. Despite the success, existing evolve-based
agents lack targeted guidance for
evolution and effective mechanisms for organizing and utilizing knowledge acquired from past evolutionary experience. Consequently, they suffer from decreasing
evolution efficiency and exhibit oscillatory behavior when approaching known performance boundaries. To mitigate the gap, we develop CausalEvolve, equipped with a causal scratchpad that leverages LLMs to identify and reason about guiding factors for
evolution. At the beginning, CausalEvolve first identifies outcome-level factors that offer complementary inspirations in improving the target objective. During the
evolution, CausalEvolve also inspects surprise patterns during the
evolution and abductive
reasoning to hypothesize new factors, which in turn offer novel directions. Through comprehensive experiments, we show that CausalEvolve effectively improves the evolutionary efficiency and discovers better solutions in 4 challenging open-ended scientific tasks.
Read the full abstract ▾
All authors Yongqiang Chen, Chenxi Liu, Zhenhao Chen, Tongliang Liu, Bo Han, Kun Zhang
Machine Learning · Cross-listed from cond-mat.dis-nn
Rigorous Asymptotics for First-Order Algorithms Through the Dynamical Cavity Method
Yatin Dandi, David Gamarnik, Francisco Pernice et al. (+1 more)
Dynamical Mean Field Theory (DMFT) provides an asymptotic description of the dynamics of macroscopic observables in certain disordered systems. Originally pioneered in the context of
spin glasses by Sompolinsky and Zippelius (1982), it has since been used to derive asymptotic dynamical equations for a wide range of models in physics, high-dimensional statistics and machine learning. One of the main tools used by physicists to obtain these equations is the dynamical cavity method, which has remained largely non-rigorous. In contrast, existing mathematical formalizations have relied on alternative approaches, including Gaussian conditioning, large deviations over paths, or
Fourier analysis. In this work, we formalize the dynamical cavity method and use it to give a new proof of the DMFT equations for General First Order Methods, a broad class of dynamics encompassing
algorithms such as Gradient Descent and Approximate Message Passing.
Read the full abstract ▾
All authors Yatin Dandi, David Gamarnik, Francisco Pernice, Lenka Zdeborová
Machine Learning
Learning to Order: Task Sequencing as In-Context Optimization
Jan Kobiolka, Christian Frey, Arlind Kadra et al. (+2 more)
Task sequencing (TS) is one of the core open problems in Deep Learning, arising in a plethora of real-world domains, from robotic assembly lines to autonomous driving. Unfortunately, prior work has not convincingly demonstrated the generalization ability of meta-learned TS methods to solve new TS problems, given few initial demonstrations. In this paper, we demonstrate that deep neural networks can meta-learn over an infinite prior of synthetically generated TS problems and achieve a few-shot generalization. We meta-learn a
transformer-based architecture over
datasets of sequencing trajectories generated from a prior distribution that samples sequencing problems as paths in directed graphs. In a large-scale experiment, we provide ample empirical evidence that our meta-learned models discover optimal task sequences significantly quicker than non-meta-learned baselines.
Read the full abstract ▾
All authors Jan Kobiolka, Christian Frey, Arlind Kadra, Gresa Shala, Josif Grabocka
Machine Learning · Cross-listed from cs.CV
ASAP: Attention-Shift-Aware Pruning for Efficient LVLM Inference
Surendra Pathak and Bo Han
While Large
Vision-
Language Models (LVLMs) demonstrate exceptional multi-modal capabilities, the quadratic computational cost of processing high-resolution visual
tokens remains a critical bottleneck. Though recent
token reduction strategies attempt to accelerate inference, such methods inadequately exploit
attention values and fail to address
token redundancy. More critically, they overlook the “
attention shift” phenomenon inherent in LVLMs, which skews
token attention scores. In this work, we propose ASAP, a novel training-free, KV-Cache-compatible
pruning recipe that comprehensively addresses these limitations. First, we mitigate the
attention shift by utilizing a dynamic bidirectional soft
attention mask, ensuring the selection of genuinely informative
tokens rather than naive
attention-based selection. Second, we posit that high semantic redundancy within the
token set degrades performance. We therefore introduce a weighted soft merging component that merges semantically similar
tokens, preserving only the most feature-dense visual patches for subsequent layers. ASAP achieves virtually lossless compression of visual context, retaining 99.02% of the original LLaVA-NeXT-7B performance while aggressively slashing computational FLOPs by ~80%.
Read the full abstract ▾
Machine Learning
Visualizing Critic Match Loss Landscapes for Interpretation of Online Reinforcement Learning Control Algorithms
Jingyi Liu, Jian Guo and Eberhard Gill
Reinforcement learning has proven its power on various occasions. However, its performance is not always guaranteed when system dynamics change. Instead, it largely relies on users' empirical experience. For reinforcement learning
algorithms with an actor-critic structure, the critic neural network reflects the approximation and optimization process in the RL
algorithm. Analyzing the performance of the critic neural network helps to understand the mechanism of the
algorithm. To support systematic interpretation of such
algorithms in dynamic control problems, this work proposes a critic match loss landscape visualization method for online reinforcement learning. The method constructs a loss landscape by projecting recorded critic parameter trajectories onto a low-dimensional linear subspace. The critic match loss is evaluated over the projected parameter grid using fixed reference state samples and temporal-difference targets. This yields a three-dimensional loss surface together with a two-dimensional optimization path that characterizes critic learning behavior. To extend analysis beyond visual inspection, quantitative landscape indices and a normalized system performance index are introduced, enabling structured comparison across different training outcomes. The approach is demonstrated using the Action-Dependent Heuristic Dynamic Programming
algorithm on cart-pole and spacecraft attitude control tasks. Comparative analyses across projection methods and training stages reveal distinct landscape characteristics associated with stable convergence and unstable learning. The proposed framework enables both qualitative and quantitative interpretation of critic optimization behavior in online reinforcement learning.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.AI
Learning to Forget: Sleep-Inspired Memory Consolidation for Resolving Proactive Interference in Large Language Models
Ying Xie
Large
language models (LLMs) suffer from proactive interference (PI): outdated information in the context window disrupts
retrieval of current values. This interference degrades
retrieval accuracy log-linearly as stale associations accumulate, a bottleneck that persists regardless of context length and resists
prompt-engineering mitigations. Biological
brains resolve an analogous challenge through sleep-dependent
memory consolidation: synaptic downscaling, selective replay, and targeted forgetting. We propose SleepGate, a biologically inspired framework that augments
transformer-based LLMs with a learned sleep cycle over the key-value (KV) cache. SleepGate introduces three mechanisms: (1) a conflict-aware temporal tagger detecting when new entries supersede old ones; (2) a lightweight forgetting gate trained to selectively evict or compress stale cache entries; and (3) a consolidation module that merges surviving entries into compact summaries. These components activate periodically during inference in sleep micro-cycles, governed by an adaptive
entropy-based trigger. We formalize a dual-phase training objective jointly optimizing
language modeling during the wake phase and post-consolidation
retrieval during the sleep phase. Theoretical analysis shows SleepGate reduces the interference horizon from O(n) to O(log n). In experiments with a small-scale
transformer (4 layers, 793K parameters), SleepGate achieves 99.5%
retrieval accuracy at PI depth 5 and 97.0% at depth 10, while all five baselines – full KV cache, sliding window, H2O, StreamingLLM, and decay-only ablation – remain below 18%. Our framework offers an architecture-level solution that
prompt engineering cannot address.
Read the full abstract ▾
Machine Learning
Excited Pfaffians: Generalized Neural Wave Functions Across Structure and State
Nicholas Gao, Till Grutschus, Frank Noé et al. (+1 more)
Neural-network wave functions in Variational Monte Carlo (VMC) have achieved great success in accurately representing both ground and excited states. However, achieving sufficient numerical accuracy in state overlaps requires increasing the number of Monte Carlo samples, and consequently the computational cost, with the number of states. We present a nearly constant sample-size approach, Multi-State Importance Sampling (MSIS), that leverages samples from all states to estimate pairwise overlap. To efficiently evaluate all states for all samples, we introduce Excited Pfaffians. Inspired by Hartree-Fock, this architecture represents many states within a single neural network. Excited Pfaffians also serve as generalized wave functions, allowing a single model to represent multi-state potential energy surfaces. On the carbon dimer, we match the $O(N_s^4)$-scaling natural excited states while training $>200\times$ faster and modeling 50% more states. Our favorable scaling enables us to be the first to use neural networks to find all distinct energy levels of the beryllium atom. Finally, we demonstrate that a single wave function can represent excited states across various molecules.
Read the full abstract ▾
All authors Nicholas Gao, Till Grutschus, Frank Noé, Stephan Günnemann
Machine Learning
High-Probability Bounds for SGD under the Polyak-Lojasiewicz Condition with Markovian Noise
Avik Kar, Siddharth Chandak, Rahul Singh et al. (+3 more)
We present the first uniform-in-time high-probability bound for SGD under the PL condition, where the gradient noise contains both Markovian and martingale difference components. This significantly broadens the scope of finite-time guarantees, as the PL condition arises in many machine learning and deep learning models while Markovian noise naturally arises in decentralized optimization and online system identification problems. We further allow the magnitude of noise to grow with the function value, enabling the analysis of many practical sampling strategies. In addition to the high-probability guarantee, we establish a matching $1/k$ decay rate for the expected suboptimality. Our proof technique relies on the Poisson equation to handle the Markovian noise and a probabilistic induction argument to address the lack of almost-sure bounds on the objective. Finally, we demonstrate the applicability of our framework by analyzing three practical optimization problems:
token-based decentralized linear regression, supervised learning with subsampling for
privacy amplification, and online system identification.
Read the full abstract ▾
All authors Avik Kar, Siddharth Chandak, Rahul Singh, Eric Moulines, Shalabh Bhatnagar, Nicholas Bambos
Machine Learning
Trust-Region Noise Search for Black-Box Alignment of Diffusion and Flow Models
Niklas Schweiger, Daniel Cremers and Karnik Ram
Optimizing the noise samples of
diffusion and flow models is an increasingly popular approach to align these models to target rewards at inference time. However, we observe that these approaches are usually restricted to differentiable or cheap reward models, the formulation of the underlying pretrained generative model, or are
memory/compute inefficient. We instead propose a simple trust-region based search
algorithm (TRS) which treats the pre-trained generative and reward models as a black-box and only optimizes the source noise. Our approach achieves a good balance between global exploration and local exploitation, and is versatile and easily adaptable to various generative settings and reward models with minimal hyperparameter tuning. We evaluate TRS across text-to-image, molecule and
protein design tasks, and obtain significantly improved output samples over the base generative models and other inference-time
alignment approaches which optimize the source noise sample, or even the entire reverse-time sampling noise trajectories in the case of
diffusion models. Our source code is publicly available.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.CV
Refining 3D Medical Segmentation with Verbal Instruction
Kangxian Xie, Jiancheng Yang, Nandor Pinter et al. (+3 more)
Accurate 3D anatomical
segmentation is essential for clinical diagnosis and
surgical planning. However, automated models frequently generate suboptimal shape predictions due to factors such as limited and imbalanced training data, inadequate labeling quality, and distribution shifts between training and deployment settings. A natural solution is to iteratively refine the predicted shape based on the radiologists' verbal instructions. However, this is hindered by the scarcity of paired data that explicitly links erroneous shapes to corresponding corrective instructions. As an initial step toward addressing this limitation, we introduce CoWTalk, a
benchmark comprising 3D arterial anatomies with controllable synthesized anatomical errors and their corresponding repairing instructions. Building on this
benchmark, we further propose an iterative refinement model that represents 3D shapes as vector sets and interacts with textual instructions to progressively update the target shape. Experimental results demonstrate that our method achieves significant improvements over corrupted inputs and competitive baselines, highlighting the feasibility of
language-driven clinician-in-the-loop refinement for 3D medical shapes modeling.
Read the full abstract ▾
All authors Kangxian Xie, Jiancheng Yang, Nandor Pinter, Chao Wu, Behzad Bozorgtabar, Mingchen Gao
Machine Learning · Cross-listed from cs.CV
Fine-tuning MLLMs Without Forgetting Is Easier Than You Think
He Li, Yuhui Zhang, Xiaohan Wang et al. (+2 more)
The paper demonstrate that simple adjustments of the fine-tuning recipes of
multimodal large
language models (MLLM) are sufficient to mitigate catastrophic forgetting. On visual question answering, we design a 2x2 experimental framework to assess model performance across in-distribution and out-of-distribution image and text inputs. Our results show that appropriate regularization, such as constraining the number of trainable parameters or adopting a low learning rate, effectively prevents forgetting when dealing with out-of-distribution images. However, we uncover a distinct form of forgetting in settings with in-distribution images and out-of-distribution text. We attribute this forgetting as task-specific overfitting and address this issue by introducing a data-hybrid training strategy that combines
datasets and tasks. Finally, we demonstrate that this approach naturally extends to continual learning, outperforming existing methods with complex auxiliary mechanisms. In general, our findings challenge the prevailing assumptions by highlighting the inherent robustness of MLLMs and providing practical guidelines for adapting them while preserving their general capabilities.
Read the full abstract ▾
All authors He Li, Yuhui Zhang, Xiaohan Wang, Kaifeng Lyu, Serena Yeung-Levy