Machine Learning
A Unifying View of Coverage in Linear Off-Policy Evaluation
Philip Amortila, Audrey Huang, Akshay Krishnamurthy et al. (+1 more)
Off-policy evaluation (OPE) is a fundamental task in reinforcement learning (RL). In the classic setting of linear OPE, finite-sample guarantees often take the form $$ \textrm{Evaluation error} \le \textrm{poly}(C^\pi, d, 1/n,\log(1/\delta)), $$ where $d$ is the dimension of the features and $C^\pi$ is a coverage parameter that characterizes the degree to which the visited features lie in the span of the data distribution. While such guarantees are well-understood for several popular
algorithms under stronger assumptions (e.g. Bellman completeness), the understanding is lacking and fragmented in the minimal setting where only the target value function is linearly realizable in the features. Despite recent interest in tight characterizations of the statistical rate in this setting, the right notion of coverage remains unclear, and candidate definitions from prior analyses have undesirable properties and are starkly disconnected from more standard definitions in the literature. We provide a novel finite-sample analysis of a canonical
algorithm for this setting, LSTDQ. Inspired by an instrumental-variable view, we develop error bounds that depend on a novel coverage parameter, the feature-dynamics coverage, which can be interpreted as linear coverage in an induced dynamical system for feature
evolution. With further assumptions – such as Bellman-completeness – our definition successfully recovers the coverage parameters specialized to those settings, finally yielding a unified understanding for coverage in linear OPE.
Read the full abstract ▾
All authors Philip Amortila, Audrey Huang, Akshay Krishnamurthy, Nan Jiang
Machine Learning
Is Finer Better? The Limits of Microscaling Formats in Large Language Models
Andrea Fasoli, Monodeep Kar, Chi-Chun Liu et al. (+4 more)
Microscaling data formats leverage per-block tensor quantization to enable aggressive model compression with limited loss in accuracy. Unlocking their potential for efficient training and inference necessitates hardware-friendly implementations that handle
matrix multiplications in a native format and adopt efficient error-mitigation strategies. Herein, we report the emergence of a surprising behavior associated with microscaling quantization, whereas the output of a quantized model degrades as block size is decreased below a given threshold. This behavior clashes with the expectation that a smaller block size should allow for a better representation of the tensor elements. We investigate this phenomenon both experimentally and theoretically, decoupling the sources of quantization error behind it. Experimentally, we analyze the distributions of several Large
Language Models and identify the conditions driving the anomalous behavior. Theoretically, we lay down a framework showing remarkable agreement with experimental data from pretrained model distributions and ideal ones. Overall, we show that the anomaly is driven by the interplay between narrow tensor distributions and the limited dynamic range of the quantized scales. Based on these insights, we propose the use of FP8 unsigned E5M3 (UE5M3) as a novel hardware-friendly format for the scales in FP4 microscaling data types. We demonstrate that UE5M3 achieves comparable performance to the conventional FP8 unsigned E4M3 scales while obviating the need of global scaling operations on weights and activations.
Read the full abstract ▾
All authors Andrea Fasoli, Monodeep Kar, Chi-Chun Liu, Swagath Venkataramani, Viji Srinivasan, Leland Chang, Naigang Wang
Machine Learning
EVEREST: An Evidential, Tail-Aware Transformer for Rare-Event Time-Series Forecasting
Antanas Zilinskas, Robert N. Shorten and Jakub Marecek
Forecasting rare events in multivariate time-series data is challenging due to severe class imbalance, long-range dependencies, and distributional uncertainty. We introduce EVEREST, a
transformer-based architecture for probabilistic rare-event
forecasting that delivers calibrated predictions and tail-aware risk estimation, with auxiliary interpretability via
attention-based signal attribution. EVEREST integrates four components: (i) a learnable
attention bottleneck for soft aggregation of temporal dynamics; (ii) an evidential head for estimating aleatoric and epistemic uncertainty via a Normal–Inverse–Gamma distribution; (iii) an extreme-value head that models tail risk using a Generalized Pareto Distribution; and (iv) a lightweight precursor head for early-event detection. These modules are jointly optimized with a composite loss (focal loss, evidential NLL, and a tail-sensitive EVT penalty) and act only at training time; deployment uses a single classification head with no inference overhead (approximately 0.81M parameters). On a decade of space-weather data, EVEREST achieves state-of-the-art True Skill Statistic (TSS) of 0.973/0.970/0.966 at 24/48/72-hour horizons for C-class
flares. The model is compact, efficient to train on commodity hardware, and applicable to high-stakes domains such as industrial monitoring, weather, and satellite diagnostics. Limitations include reliance on fixed-length inputs and exclusion of image-based modalities, motivating future extensions to streaming and
multimodal forecasting.
Read the full abstract ▾
Machine Learning · Cross-listed from q-bio.NC
Embedding of Low-Dimensional Sensory Dynamics in Recurrent Networks: Implications for the Geometry of Neural Representation
Vikas N. O'Reilly-Shah and Alessandro Maria Selvitella
Neural population activity in sensory cortex is organized on low-dimensional
manifolds, but why such
manifolds arise and what determines their geometry remain unclear. We model cortical populations as recurrent
circuits driven by low-dimensional regular sensory dynamics (circles,
tori). Combining generalized synchronization and delay-
embedding theory, we show that contracting recurrent networks generically develop smooth internal
manifolds embedding the sensory dynamics. The dimensional requirement is modest: N>2d suffices, where d is the intrinsic sensory dimension (compatible with Whitney and Takens bounds). We prove a prediction-separation result linking representational geometry to predictive performance without assuming contraction: accurate prediction forces state separation up to a resolution set by prediction error, yielding categorical boundaries, metameric equivalence, and discrimination thresholds. Numerical experiments with trained tanh RNNs recover ring- and
torus-shaped hidden
manifolds; state separation improves sharply at the 2d+1 threshold. Training pushes networks beyond strict contraction, yet
embedding persists, indicating sufficient but not necessary conditions. These results provide a mechanistic account of why sensory
manifolds emerge in recurrent
circuits and how prediction constrains their resolution.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.SD
A Framework for Evaluating Faithfulness in Explainable AI for Machine Anomalous Sound Detection Using Frequency-Band Perturbation
Alexander Buck, Georgina Cosma, Iain Phillips et al. (+2 more)
Explainable AI (XAI) is commonly applied to anomalous sound detection (ASD) models to identify which time-frequency regions of an audio signal contribute to an anomaly decision. However, most audio explanations rely on qualitative inspection of saliency maps, leaving open the question of whether these attributions accurately reflect the spectral cues the model uses. In this work, we introduce a new quantitative framework for evaluating XAI faithfulness in machine-sound analysis by directly linking attribution relevance to model behaviour through systematic frequency-band removal. This approach provides an objective measure of whether an XAI method for machine ASD correctly identifies frequency regions that influence an ASD model's predictions. By using four widely adopted methods, namely Integrated Gradients, Occlusion, Grad-CAM and SmoothGrad, we show that XAI techniques differ in reliability, with Occlusion demonstrating the strongest
alignment with true model sensitivity and gradient-+based methods often failing to accurately capture spectral dependencies. The proposed framework offers a reproducible way to
benchmark audio explanations and enables more trustworthy interpretation of spectrogram-based ASD systems.
Read the full abstract ▾
All authors Alexander Buck, Georgina Cosma, Iain Phillips, Paul Conway, Patrick Baker
Machine Learning
Accelerated training of Gaussian processes using banded square exponential covariances
Emily C. Ehrhardt and Felipe Tobar
We propose a novel approach to computationally efficient GP training based on the observation that square-exponential (SE) covariance
matrices contain several off-diagonal entries extremely close to zero. We construct a principled procedure to eliminate those entries to produce a banded-
matrix approximation to the original covariance, whose inverse and determinant can be computed at a reduced computational cost, thus contributing to an efficient approximation to the likelihood function. We provide a theoretical analysis of the proposed method to preserve the structure of the original covariance in the 1D setting with SE kernel, and validate its computational efficiency against the variational free energy approach to sparse GPs.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.IR
Recommending Composite Items Using Multi-Level Preference Information: A Joint Interaction Modeling Approach
Xuan Bi, Yaqiong Wang, Gediminas Adomavicius et al. (+1 more)
With the advancement of machine learning and artificial intelligence technologies, recommender systems have been increasingly used across a vast variety of platforms to efficiently and effectively match users with items. As application contexts become more diverse and complex, there is a growing need for more sophisticated recommendation techniques. One example is the composite item (for example, fashion outfit) recommendation where multiple levels of user preference information might be available and relevant. In this study, we propose JIMA, a joint interaction modeling approach that uses a single model to take advantage of all data from different levels of granularity and incorporate interactions to learn the complex relationships among lower-order (atomic item) and higher-order (composite item) user preferences as well as domain expertise (e.g., on the stylistic fit). We comprehensively evaluate the proposed method and compare it with advanced baselines through multiple simulation studies as well as with real data in both offline and online settings. The results consistently demonstrate the superior performance of the proposed approach.
Read the full abstract ▾
All authors Xuan Bi, Yaqiong Wang, Gediminas Adomavicius, Shawn Curley
Machine Learning · Cross-listed from cs.CL
Haozheng Luo, Zhuolin Jiang, Md Zahid Hasan et al. (+2 more)
We propose FROST, an
attention-aware method for efficient
reasoning. Unlike traditional approaches, FROST leverages
attention weights to prune uncritical
reasoning paths, yielding shorter and more reliable
reasoning trajectories. Methodologically, we introduce the concept of
reasoning outliers and design an
attention-based mechanism to remove them. Theoretically, FROST preserves and enhances the model's
reasoning capacity while eliminating outliers at the sentence level. Empirically, we validate FROST on four
benchmarks using two strong
reasoning models (Phi-4-
Reasoning and GPT-OSS-20B), outperforming state-of-the-art methods such as TALE and ThinkLess. Notably, FROST achieves an average 69.68% reduction in
token usage and a 26.70% improvement in accuracy over the base model. Furthermore, in evaluations of
attention outlier metrics, FROST reduces the maximum infinity norm by 15.97% and the average kurtosis by 91.09% compared to the base model. Code is available at https://github.com/robinzixuan/FROST
Read the full abstract ▾
All authors Haozheng Luo, Zhuolin Jiang, Md Zahid Hasan, Yan Chen, Soumalya Sarkar
Machine Learning
Randomization Boosts KV Caching, Learning Balances Query Load: A Joint Perspective
Fangzhou Wu, Sandeep Silwal and Qiuyi Zhang
KV caching is a fundamental technique for accelerating Large
Language Model (LLM) inference by reusing key-value (KV) pairs from previous queries, but its effectiveness under limited
memory is highly sensitive to the eviction policy. The default Least Recently Used (LRU) eviction
algorithm struggles with dynamic online query arrivals, especially in multi-LLM serving scenarios, where balancing query load across workers and maximizing cache hit rate of each worker are inherently conflicting objectives. We give the first unified mathematical model that captures the core trade-offs between KV cache eviction and query routing. Our analysis reveals the theoretical limitations of existing methods and leads to principled
algorithms that integrate provably competitive randomized KV cache eviction with learning-based methods to adaptively route queries with evolving patterns, thus balancing query load and cache hit rate. Our theoretical results are validated by extensive experiments across 4
benchmarks and 3 prefix-sharing settings, demonstrating improvements of up to 6.92$\times$ in cache hit rate, 11.96$\times$ reduction in latency, 14.06$\times$ reduction in time-to-first-
token (TTFT), and 77.4% increase in throughput over the state-of-the-art methods. Our code is available at https://github.com/fzwark/KVRouting.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.CV
Anatomically-aware conformal prediction for medical image segmentation with random walks
Mélanie Gaillochet, Christian Desrosiers and Hervé Lombaert
The reliable deployment of deep learning in medical imaging requires uncertainty quantification that provides rigorous error guarantees while remaining anatomically meaningful. Conformal prediction (CP) is a powerful distribution-free framework for constructing statistically valid prediction intervals. However, standard applications in
segmentation often ignore anatomical context, resulting in fragmented, spatially incoherent, and over-segmented prediction sets that limit clinical utility. To bridge this gap, this paper proposes Random-Walk Conformal Prediction (RW-CP), a model-agnostic framework which can be added on top of any
segmentation method. RW-CP enforces spatial coherence to generate anatomically valid sets. Our method constructs a k-nearest neighbour graph from pre-trained
vision foundation model features and applies a random walk to diffuse uncertainty. The random walk
diffusion regularizes the non-conformity scores, making the prediction sets less sensitive to the conformal calibration parameter $\lambda$, ensuring more stable and continuous anatomical boundaries. RW-CP maintains rigorous marginal coverage while significantly improving
segmentation quality. Evaluations on multi-modal public
datasets show improvements of up to $35.4\%$ compared to standard CP baselines, given an allowable error rate of $\alpha=0.1$.
Read the full abstract ▾
Machine Learning
Save the Good Prefix: Precise Error Penalization via Process-Supervised RL to Enhance LLM Reasoning
Haolin Liu, Dian Yu, Sidi Lu et al. (+6 more)
Reinforcement learning (RL) has emerged as a powerful framework for improving the
reasoning capabilities of large
language models (LLMs). However, most existing RL approaches rely on sparse outcome rewards, which fail to credit correct intermediate steps in partially successful solutions. Process reward models (PRMs) offer fine-grained step-level supervision, but their scores are often noisy and difficult to evaluate. As a result, recent PRM
benchmarks focus on a more objective capability: detecting the first incorrect step in a
reasoning path. However, this evaluation target is misaligned with how PRMs are typically used in RL, where their step-wise scores are treated as raw rewards to maximize. To bridge this gap, we propose Verifiable Prefix Policy Optimization (VPPO), which uses PRMs only to localize the first error during RL. Given an incorrect rollout, VPPO partitions the trajectory into a verified correct prefix and an erroneous suffix based on the first error, rewarding the former while applying targeted penalties only after the detected mistake. This design yields stable, interpretable learning signals and improves credit assignment. Across multiple
reasoning benchmarks, VPPO consistently outperforms sparse-reward RL and prior PRM-guided baselines on both Pass@1 and Pass@K.
Read the full abstract ▾
All authors Haolin Liu, Dian Yu, Sidi Lu, Yujun Zhou, Rui Liu, Zhenwen Liang, Haitao Mi, Chen-Yu Wei, Dong Yu
Machine Learning
Attention-Enhanced Graph Filtering for False Data Injection Attack Detection and Localization
Ruslan Abdulin and Mohammad Rasoul Narimani
The increasing deployment of Internet-of-Things (IoT)-enabled measurement devices in modern power systems has expanded the cyberattack surface of the grid. As a result, this critical infrastructure is increasingly exposed to cyberattacks, including false data injection attacks (FDIAs) that compromise measurement integrity and threaten reliable system operation. Existing FDIA detection methods primarily exploit spatial correlations and network
topology using graph-based learning; however, these approaches often rely on high-dimensional representations and shallow classifiers, limiting their ability to capture local structural dependencies and global contextual relationships. Moreover, naively incorporating
Transformer architectures can result in overly deep models that struggle to model localized grid dynamics. This paper proposes a joint FDIA detection and localization framework that integrates auto-regressive moving average (ARMA) graph convolutional filters with an Encoder-Only
Transformer architecture. The ARMA-based graph filters provide robust,
topology-aware feature extraction and adaptability to abrupt spectral changes, while the
Transformer encoder leverages self-
attention to capture long-range dependencies among grid elements without sacrificing essential local context. The proposed method is evaluated using real-world load data from the New York Independent System Operator (NYISO) applied to the IEEE 14- and 300-bus systems. Numerical results demonstrate that the proposed model effectively exploits both the state and
topology of the power grid, achieving high accuracy in detecting FDIA events and localizing compromised nodes.
Read the full abstract ▾
Machine Learning
When Does Adaptation Win? Scaling Laws for Meta-Learning in Quantum Control
Nima Leclerc, Chris Miller and Nicholas Brawand
Quantum hardware suffers from intrinsic device heterogeneity and environmental drift, forcing practitioners to choose between suboptimal non-adaptive controllers or costly per-device recalibration. We derive a scaling law lower bound for meta-learning showing that the adaptation gain (expected fidelity improvement from task-specific gradient steps) saturates exponentially with gradient steps and scales linearly with task variance, providing a quantitative criterion for when adaptation justifies its overhead. Validation on
quantum gate calibration shows negligible benefits for low-variance tasks but >40% fidelity gains on two-
qubit gates under extreme out-of-distribution conditions (10$\times$ the training noise), with implications for reducing per-device calibration time on cloud
quantum processors. Further validation on classical linear-quadratic control confirms these laws emerge from general optimization geometry rather than
quantum-specific physics. We further introduce a few-shot pre-adaptation protocol that estimates the optimal adaptation budget from $N{=}3$-5 probe steps within 3-19% relative error across out-of-distribution regimes.
Read the full abstract ▾
Machine Learning
Towards Self-Optimizing Electron Microscope: Robust Tuning of Aberration Coefficients via Physics-Aware Multi-Objective Bayesian Optimization
Utkarsh Pratiush, Austin Houston, Richard Liu et al. (+2 more)
Realizing high-throughput aberration-corrected Scanning Transmission Electron Microscopy (STEM) exploration of atomic structures requires rapid tuning of multipole probe correctors while compensating for the inevitable drift of the optical column. While automated
alignment routines exist, conventional approaches rely on serial, gradient-free searches (e.g., Nelder-Mead) that are sample-inefficient and struggle to correct multiple interacting parameters simultaneously. Conversely, emerging deep learning methods offer speed but often lack the flexibility to adapt to varying sample conditions without extensive retraining. Here, we introduce a Multi-Objective
Bayesian Optimization (MOBO) framework for rapid, data-efficient aberration correction. Importantly, this framework does not prescribe a single notion of image quality; instead, it enables user-defined, physically motivated reward formulations (e.g.,
symmetry-induced objectives) and uses Pareto fronts to expose the resulting trade-offs between competing experimental priorities. By using Gaussian Process regression to model the aberration landscape probabilistically, our workflow actively selects the most informative lens settings to evaluate next, rather than performing an exhaustive blind search. We demonstrate that this active learning loop is more robust than traditional optimization
algorithms and effectively tunes focus, astigmatism, and higher-order aberrations. By balancing competing objectives, this approach enables "self-optimizing" microscopy by dynamically sustaining optimal performance during experiments.
Read the full abstract ▾
All authors Utkarsh Pratiush, Austin Houston, Richard Liu, Gerd Duscher, Sergei Kalinin
Machine Learning · Cross-listed from quant-ph
Reinforcement Learning for Quantum Technology
Marin Bukov and Florian Marquardt
Many challenges arising in
Quantum Technology can be successfully addressed using a set of machine learning
algorithms collectively known as reinforcement learning (RL), based on adaptive decision-making through interaction with the
quantum device. After a concise and intuitive introduction to RL aimed at a broad physics readership, we discuss the key ideas and core concepts in reinforcement learning with a particular focus on
quantum systems. We then survey recent progress in RL in all relevant areas. We discuss state preparation in few- and many-body
quantum systems, the design and optimization of high-fidelity
quantum gates, and the automated construction of
quantum circuits, including applications to variational
quantum eigensolvers and architecture search. We further highlight the interactive capabilities of RL
agents, emphasizing recent progress in
quantum feedback control and
quantum error correction, and briefly discuss
quantum reinforcement learning as well as applications to
quantum metrology. The review concludes with a discussion of open challenges – such as scalability, interpretability, and integration with experimental platforms – and outlines promising directions for future research. Throughout, we highlight experimental implementations that exemplify the increasing role of reinforcement learning in shaping the development of
quantum technologies.
Read the full abstract ▾
Machine Learning
Vector-Valued Distributional Reinforcement Learning Policy Evaluation: A Hilbert Space Embedding Approach
Mehrdad Mohammadi, Qi Zheng and Ruoqing Zhu
We propose Kernel
Embedding Distributional Reinforcement Learning (KE-DRL) an offline method to estimate kernel mean
embeddings of conditional multivariate return distributions from observed offline trajectories with continuous state-action inputs and vector-valued rewards. KE-DRL approximates the conditional
embedding and estimates its a finite-dictionary representation coefficients through a maximum mean discrepancy Bellman criterion. For a regular class of return distributions, we show that a Matérn
embedding and a Bellman-invariant Sobolev-moment class identifies the unique distributional Bellman fixed point and and derive a Hölder-type bound that controls Wasserstein error by the population
embedding Bellman residual. For directly observed responses, we provide finite-sample and uniform error bounds for a regularized conditional mean
embedding estimator. Simulation experiments evaluate pointwise
embedding recovery against Monte Carlo
benchmarks across multiple behavior-target policy pairs. An application to Expedia hotel-search data illustrates conditional multivariate return evaluation under two policies.
Read the full abstract ▾
Machine Learning · Cross-listed from stat.ML
Collaborative Compressors in Distributed Mean Estimation with Limited Communication Budget
Harsh Vardhan and Arya Mazumdar
Distributed high dimensional mean estimation is a common aggregation routine used often in distributed optimization methods. Most of these applications call for a communication-constrained setting where vectors, whose mean is to be estimated, have to be compressed before sharing. One could independently encode and decode these to achieve compression, but that overlooks the fact that these vectors are often close to each other. To exploit these similarities, recently Suresh et al., 2022, Jhunjhunwala et al., 2021, Jiang et al, 2023, proposed multiple correlation-aware compression schemes. However, in most cases, the correlations have to be known for these schemes to work. Moreover, a theoretical analysis of graceful degradation of these correlation-aware compression schemes with increasing dissimilarity is limited to only the $\ell_2$-error in the literature. In this paper, we propose four different collaborative compression schemes that agnostically exploit the similarities among vectors in a distributed setting. Our schemes are all simple to implement and computationally efficient, while resulting in big savings in communication. The analysis of our proposed schemes show how the $\ell_2$, $\ell_\infty$ and cosine estimation error varies with the degree of similarity among vectors.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.ET
Configurable p-Neurons Using Modular p-Bits
Saleh Bunaiyan, Mohammad Alsharif, Abdelrahman S. Abdelrahman et al. (+5 more)
Probabilistic bits (p-bits) have recently been employed in neural networks (NNs) as
stochastic neurons with sigmoidal probabilistic activation functions. Nonetheless, there remain a wealth of other probabilistic activation functions that are yet to be explored. Here we re-engineer the p-bit by decoupling its
stochastic signal path from its input data path, giving rise to a modular p-bit that enables the realization of probabilistic
neurons (p-
neurons) with a range of configurable probabilistic activation functions, including a probabilistic version of the widely used Logistic Sigmoid, Tanh and Rectified Linear Unit (ReLU) activation functions. We present spintronic (CMOS + sMTJ) designs that show wide and tunable probabilistic ranges of operation. Finally, we experimentally implement digital-CMOS versions on an FPGA, with
stochastic unit sharing, and demonstrate an order of magnitude (10x) saving in required hardware resources compared to conventional digital p-bit implementations.
Read the full abstract ▾
All authors Saleh Bunaiyan, Mohammad Alsharif, Abdelrahman S. Abdelrahman, Hesham ElSawy, Suraj S. Cheema, Suhaib A. Fahmy, Kerem Y. Camsari, Feras Al-Dirini
Machine Learning
A Few Bad Neurons: Isolating and Surgically Correcting Sycophancy
Claire O'Brien, Jessica Seto, Dristi Roy et al. (+6 more)
Behavioral
alignment in large
language models (LLMs) is often achieved through broad fine-tuning, which can result in undesired side effects like distributional shift and low interpretability. We propose a method for
alignment that identifies and updates only the
neurons most responsible for a given behavior, a targeted approach that allows for fine-tuning with significantly less data. Using sparse autoencoders (SAEs) and linear probes, we isolate the 3% of MLP
neurons most predictive of a target behavior, decode them into residual space, and fine-tune only those
neurons using gradient masking. We demonstrate this approach on the task of reducing sycophantic behavior, where our method matches or exceeds state-of-the-art performance on four
benchmarks (Syco-Bench, NLP, POLI, PHIL) using Gemma-2-2B and 9B models. Our results show that sparse,
neuron-level updates offer a scalable and precise alternative to full-model fine-tuning, remaining effective even in situations when little data is available
Read the full abstract ▾
All authors Claire O'Brien, Jessica Seto, Dristi Roy, Aditya Dwivedi, Sunishchal Dev, Kevin Zhu, Sean O'Brien, Ashwinee Panda, Ryan Lagasse
Machine Learning
FSD-CAP: Fractional Subgraph Diffusion with Class-Aware Propagation for Graph Feature Imputation
Xin Qiao, Shijie Sun, Anqi Dong et al. (+5 more)
Imputing missing node features in graphs is challenging, particularly under high missing rates. Existing methods based on latent representations or global
diffusion often fail to produce reliable estimates, and may propagate errors across the graph. We propose FSD-CAP, a two-stage framework designed to improve imputation quality under extreme sparsity. In the first stage, a graph-distance-guided subgraph expansion localizes the
diffusion process. A fractional
diffusion operator adjusts propagation sharpness based on local structure. In the second stage, imputed features are refined using class-aware propagation, which incorporates pseudo-labels and neighborhood
entropy to promote consistency. We evaluated FSD-CAP on multiple
datasets. With $99.5\%$ of features missing across five
benchmark datasets, FSD-CAP achieves average accuracies of $80.06\%$ (structural) and $81.01\%$ (uniform) in node classification, close to the $81.31\%$ achieved by a standard GCN with full features. For link prediction under the same setting, it reaches AUC scores of $91.65\%$ (structural) and $92.41\%$ (uniform), compared to $95.06\%$ for the fully observed case. Furthermore, FSD-CAP demonstrates superior performance on both large-scale and heterophily
datasets when compared to other models.
Read the full abstract ▾
All authors Xin Qiao, Shijie Sun, Anqi Dong, Cong Hua, Xia Zhao, Longfei Zhang, Guangming Zhu, Liang Zhang
Machine Learning
Bi-Level Online Provisioning and Scheduling with Switching Costs and Cross-Level Constraints
Jialei Liu, C. Emre Koksal and Ming Shi
We study a bi-level online provisioning and scheduling problem motivated by network resource allocation, where provisioning decisions are made at a slow time scale while queue-/state-dependent scheduling is performed at a fast time scale. We model this two-time-scale interaction using an upper-level online convex optimization (OCO) problem and a lower-level constrained Markov decision process (CMDP). Existing OCO typically assumes stateless decisions and thus cannot capture MDP network dynamics such as queue
evolution. Meanwhile, CMDP
algorithms typically assume a fixed constraint threshold, whereas in provisioning-and-scheduling systems, the threshold varies with online budget decisions. To address these gaps, we study bi-level OCO-CMDP learning under switching costs (budget reprovisioning/system reconfiguration) and cross-level constraints that couple budgets to scheduling decisions. Our new
algorithm solves this learning problem via several non-trivial developments, including a carefully designed dual feedback that returns the budget multiplier as sensitivity information for the upper-level update and a lower level that solves a budget-adaptive safe exploration problem via an extended occupancy-measure linear program. We establish near-optimal regret and high-probability satisfaction of the cross-level constraints.
Read the full abstract ▾
Machine Learning · Cross-listed from eess.IV
Advances in Diffusion-Based Generative Compression
Yibo Yang and Stephan Mandt
Popularized by their strong image generation performance,
diffusion and related methods for generative modeling have found widespread success in visual media applications. In particular,
diffusion methods have enabled new approaches to data compression, where realistic reconstructions can be generated at extremely low bit-rates. This article provides a unifying review of recent
diffusion-based methods for generative lossy compression, with a focus on image compression. These methods generally encode the source into an
embedding and use a
diffusion model to iteratively refine it during decoding, so that the reconstruction approximately follows the true data distribution. The
embedding can take various forms and is typically transmitted via an auxiliary
entropy model, and recent methods also explore the use of
diffusion models themselves for information transmission via channel simulation. We review representative approaches through the lens of rate-distortion-perception theory, highlighting the role of common randomness and connections to inverse problems, and identify open challenges.
Read the full abstract ▾
Machine Learning
Toward Learning POMDPs Beyond Full-Rank Actions and State Observability
Seiji Shaw, Travis Manderson, Chad Kessens et al. (+1 more)
We are interested in enabling autonomous
agents to learn and reason about systems with hidden states, such as locking mechanisms. We cast this problem as learning the parameters of a discrete Partially Observable Markov Decision Process (POMDP). The
agent begins with knowledge of the POMDP's actions and observation spaces, but not its state space, transitions, or observation models. These properties must be constructed from a sequence of actions and observations. Spectral approaches to learning models of partially observable domains, such as Predictive State Representations (PSRs), learn representations of state that are sufficient to predict future outcomes. PSR models, however, do not have explicit transition and observation system models that can be used with different reward functions to solve different planning problems. Under a mild set of rankness assumptions on the products of transition and observation
matrices, we show how PSRs learn POMDP
matrices up to a similarity transform, and this transform may be estimated via tensor decomposition methods. Our method learns observation
matrices and transition
matrices up to a partition of states, where the states in a single partition have the same observation distributions corresponding to actions whose transition
matrices are full-rank. Our numerical experiments suggest that explicit observation and transition likelihoods can be leveraged to generate new plans for different goals and reward functions after the model has been learned. We also show that learning a POMDP beyond a partition of states is impossible from sequential data by constructing two POMDPs that agree on all observation distributions but differ in their transition dynamics.
Read the full abstract ▾
All authors Seiji Shaw, Travis Manderson, Chad Kessens, Nicholas Roy
Machine Learning · Cross-listed from cs.DB
Accelerating Large-Scale Cheminformatics Using a Byte-Offset Indexing Architecture for Terabyte-Scale Data Integration
Malikussaid, Septian Caesar Floresko and Sutiyo
The integration of large-scale chemical databases represents a critical bottleneck in modern cheminformatics research, particularly for machine learning applications requiring high-quality, multi-source validated
datasets. This paper presents a case study of integrating three major public chemical repositories: PubChem (176 million compounds), ChEMBL, and eMolecules, to construct a curated
dataset for molecular property prediction. We investigate whether byte-offset indexing can practically overcome brute-force scalability limits while preserving data integrity at hundred-million scale. Our results document the progression from an intractable brute-force search
algorithm with projected 100-day runtime to a byte-offset indexing architecture achieving 3.2-hour completion - a 740-fold performance improvement through algorithmic complexity reduction from $O(N \times M)$ to $O(N + M)$. Systematic validation of 176 million database entries revealed hash collisions in InChIKey molecular identifiers, necessitating pipeline reconstruction using collision-free full InChI strings. We present performance
benchmarks, quantify trade-offs between storage overhead and scientific rigor, and compare our approach with alternative large-scale integration strategies. The resulting system successfully extracted 435,413 validated compounds and demonstrates generalizable principles for large-scale scientific data integration where uniqueness constraints exceed hash-based identifier capabilities.
Read the full abstract ▾
Machine Learning
One Global Model, Many Behaviors: Stockout-Aware Feature Engineering and Dynamic Scaling for Multi-Horizon Retail Demand Forecasting with a Cost-Aware Ordering Policy (VN2 Winner Report)
Bartosz Szabłowski
Inventory planning for retail chains requires translating demand forecasts into ordering decisions, including asymmetric shortages and holding costs. The VN2 Inventory Planning Challenge formalizes this setting as a weekly decision-making cycle with a two-week product delivery lead time, where the total cost is defined as the shortage cost plus the holding cost. This report presents the winning VN2 solution: a two-stage predict-then-optimize pipeline that combines a single global multi-horizon
forecasting model with a cost-aware ordering policy. The
forecasting model is trained in a global paradigm, jointly using all available time series. A gradient-boosted decision tree (GBDT) model implemented in CatBoost is used as the base learner. The model incorporates stockout-aware feature engineering to address censored demand during out-of-stock periods, per-series scaling to focus learning on time-series patterns rather than absolute levels, and time-based observation weights to reflect shifts in demand patterns. In the decision stage, inventory is projected to the start of the delivery week, and a target stock level is calculated that explicitly trades off shortage and holding costs. Evaluated by the official competition simulation in six rounds, the solution achieved first place by combining a strong global
forecasting model with a lightweight cost-aware policy. Although developed for the VN2 setting, the proposed approach can be extended to real-world applications and additional operational constraints.
Read the full abstract ▾
Machine Learning
GraIP: A Benchmarking Framework For Neural Graph Inverse Problems
Semih Cantürk, Andrei Manolache, Arman Mielke et al. (+5 more)
A wide range of graph learning tasks, such as structure discovery, temporal graph analysis, and combinatorial optimization, focus on inferring graph structures from data, rather than making predictions on given graphs. However, the respective methods to solve such problems are often developed in an isolated, task-specific manner and thus lack a unifying theoretical foundation. Here, we provide a stepping stone towards the formation of such a foundation and further development by introducing the Neural Graph Inverse Problem (GraIP) conceptual framework, which formalizes and reframes a broad class of graph learning tasks as inverse problems. Unlike discriminative approaches that directly predict target variables from given graph inputs, the GraIP paradigm addresses inverse problems, i.e., it relies on observational data and aims to recover the underlying graph structure by reversing the forward process, such as message passing or network dynamics, that produced the observed outputs. We demonstrate the versatility of GraIP across various graph learning tasks, including rewiring, causal discovery, and neural relational inference. We also propose
benchmark datasets and metrics for each GraIP domain considered, and characterize and empirically evaluate existing baseline methods used to solve them. Overall, our unifying perspective bridges seemingly disparate applications and provides a principled approach to structural learning in constrained and combinatorial settings while encouraging cross-pollination of existing methods across graph inverse problems.
Read the full abstract ▾
All authors Semih Cantürk, Andrei Manolache, Arman Mielke, Chendi Qian, Antoine Siraudin, Christopher Morris, Mathias Niepert, Guy Wolf
Machine Learning
ASEHybrid: When Geometry Matters Beyond Homophily in Graph Neural Networks
Shalima Binta Manir and Tim Oates
Standard message-passing graph neural networks (GNNs) often struggle on graphs with low homophily, yet homophily alone does not explain this behavior, as graphs with similar homophily levels can exhibit markedly different performance and some heterophilous graphs remain easy for vanilla GCNs. Recent work suggests that label informativeness (LI), the mutual information between labels of adjacent nodes, provides a more faithful characterization of when graph structure is useful. In this work, we develop a unified theoretical framework that connects
curvature-guided rewiring and positional geometry through the lens of label informativeness, and instantiate it in a practical geometry-aware architecture, ASEHybrid. Our analysis provides a necessary-and-sufficient characterization of when geometry-aware GNNs can improve over feature-only baselines: such gains are possible if and only if graph structure carries label-relevant information beyond node features. Theoretically, we relate adjusted homophily and label informativeness to the spectral behavior of label signals under
Laplacian smoothing, show that degree-based Forman
curvature does not increase expressivity beyond the one-dimensional Weisfeiler–Lehman test but instead reshapes information flow, and establish convergence and Lipschitz stability guarantees for a
curvature-guided rewiring process. Empirically, we instantiate ASEHybrid using Forman
curvature and
Laplacian positional encodings and conduct controlled ablations on Chameleon, Squirrel, Texas, Tolokers, and Minesweeper, observing gains precisely on label-informative heterophilous
benchmarks where graph structure provides label-relevant information beyond node features, and no meaningful improvement in high-baseline regimes.
Read the full abstract ▾
Machine Learning
How Is Uncertainty Propagated in Knowledge Distillation?
Ziyao Cui and Jian Pei
Knowledge
distillation transfers behavior from a teacher to a student model, but the process is inherently
stochastic: teacher outputs, student training, and student inference can all be random. Collapsing these uncertainties to a single point estimate can distort what is learned. We systematically study how uncertainty propagates through knowledge
distillation across three representative model classes–linear regression, feed-forward neural networks, and large
language models (LLMs)–and propose simple corrections. We distinguish inter-student uncertainty (variance across independently distilled students) from intra-student uncertainty (variance of a single student's predictive distribution), showing that standard single-response knowledge
distillation suppresses intra-student variance while leaving substantial inter-student variability. To address these mismatches, we introduce two variance-aware strategies: averaging multiple teacher responses, which reduces noise at rate $O(1/k)$, and variance-weighting, which combines teacher and student estimates via inverse-variance weighting to yield a minimum-variance
estimator. We provide formal guarantees in linear regression, validate the methods in neural networks, and demonstrate empirical gains in LLM
distillation, including reduced systematic noise and
hallucination. These results reframe knowledge
distillation as an uncertainty transformation and show that variance-aware
distillation produces more stable students that better reflect teacher uncertainty.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.SD
Enhancing Speech Emotion Recognition using Dynamic Spectral Features and Kalman Smoothing
Marouane El Hizabri, Abdelfattah Bezzaz, Ismail Hayoukane et al. (+1 more)
Speech Emotion Recognition systems often use static features like Mel-Frequency Cepstral Coefficients (MFCCs), Zero Crossing Rate (ZCR), and Root Mean Square Energy (RMSE). Because of this, they can misclassify
emotions when there is acoustic noise in vocal signals. To address this, we added dynamic features using Dynamic Spectral features (Deltas and Delta-Deltas) along with the Kalman Smoothing
algorithm. This approach reduces noise and improves
emotion classification. Since
emotion changes over time, the Kalman Smoothing filter also helped make the classifier outputs more stable. Tests on the RAVDESS
dataset showed that this method achieved a state-of-the-art accuracy of 87% and reduced misclassification between
emotions with similar acoustic features
Read the full abstract ▾
All authors Marouane El Hizabri, Abdelfattah Bezzaz, Ismail Hayoukane, Youssef Taki
Machine Learning · Cross-listed from stat.ML
Implicit Q-Learning and SARSA: Liberating Policy Control from Step-Size Calibration
Hwanwoo Kim and Eric Laber
Q-learning and SARSA are foundational reinforcement learning
algorithms whose practical success depends critically on step-size calibration. Step-sizes that are too large can cause numerical instability, while step-sizes that are too small can lead to slow progress. We propose implicit variants of Q-learning and SARSA that reformulate their iterative updates as fixed-point equations. This yields an adaptive step-size adjustment that scales inversely with feature norms, providing automatic regularization without manual tuning. Our non-asymptotic analyses demonstrate that implicit methods maintain stability over significantly broader step-size ranges. Under favorable conditions, it permits arbitrarily large step-sizes while achieving comparable convergence rates. Empirical validation across
benchmark environments spanning discrete and continuous state spaces shows that implicit Q-learning and SARSA exhibit substantially reduced sensitivity to step-size selection, achieving stable performance with step-sizes that would cause standard methods to fail.
Read the full abstract ▾