Machine Learning
Vib2ECG: A Co-Located Chest-Lead SCG-ECG Dataset and Benchmark for ECG Reconstruction
Guorui Lu, Xiaohui Cai, Todor Stefanov et al. (+1 more)
Twelve-lead electrocardiography (ECG) is essential for cardiovascular diagnosis, but its long-term acquisition in daily life is constrained by complex and costly hardware. Recent efforts have explored reconstructing ECG from low-cost cardiac vibrational signals such as seismocardiography (SCG), with prior studies primarily focusing on limb leads, while clinical diagnosis requires multi-lead ECG, including chest leads. In this work, we propose Vib2ECG, a
dataset of synchronized, co-located ECG and chest-wall vibration recordings, which includes complete twelve-lead ECGs and vibrational signals acquired by inertial measurement units (IMUs) at the six standard precordial electrode sites (V1-V6) from 17 subjects. Based on this
dataset, we also provide a
benchmark. Experimental results demonstrate the feasibility of reconstructing electrical cardiac signals at variable locations from vibrational signals using a lightweight 364K-parameter U-Net. Furthermore, we observe a
hallucination phenomenon in the model, where ECG waveforms are generated in regions where no corresponding electrical activity is present. We analyze the causes of this phenomenon and propose potential directions for mitigation. This study demonstrates the feasibility of mobile-device-friendly ECG monitoring through chest-lead ECG prediction from low-cost vibrational signals acquired using IMU sensors. It expands the application of cardiac vibrational signals and provides new insights into the spatial relationship between cardiac electrical and mechanical activities with spatial location variation.
Read the full abstract ▾
All authors Guorui Lu, Xiaohui Cai, Todor Stefanov, Qinyu Chen
Machine Learning
Building Trust in PINNs: Error Estimation through Finite Difference Methods
Aleksander Krasowski, René P. Klausen, Aycan Celik et al. (+3 more)
Physics-informed neural networks (PINNs) constitute a flexible deep learning approach for solving partial differential equations (PDEs), which model phenomena ranging from heat conduction to
quantum mechanical systems. Despite their flexibility, PINNs offer limited insight into how their predictions deviate from the true solution, hindering trust in their prediction quality. We propose a lightweight post-hoc method that addresses this gap by producing pointwise error estimates for PINN predictions, which offer a natural form of explanation for such models, identifying not just whether a prediction is wrong, but where and by how much. For linear partial differential equations, the error between a PINN approximation and the true solution satisfies the same differential operator as the original problem, but driven by the PINN's PDE residual as its source term. We solve this error equation numerically using finite difference methods requiring no knowledge of the true solution. Evaluated on several
benchmark PDEs, our method yields accurate error maps at low computational cost, enabling targeted and interpretable validation of PINNs.
Read the full abstract ▾
All authors Aleksander Krasowski, René P. Klausen, Aycan Celik, Sebastian Lapuschkin, Wojciech Samek, Jonas Naujoks
Machine Learning
Not All Invariants Are Equal: Curating Training Data to Accelerate Program Verification with SLMs
Ido Pinto, Yizhak Yisrael Elboher, Haoze Wu et al. (+2 more)
The synthesis of inductive loop invariants remains a critical bottleneck in automated program verification. While Large
Language Models (LLMs) show promise in mitigating this issue, they often fail on complex programs, producing invariants that are invalid or computationally ineffective. Although fine-tuning is a natural strategy to address these limitations, obtaining high-quality training data remains an open challenge. We first formalize the properties required for a high-quality training invariant, and then present Wonda, a rigorous data curation pipeline that extracts such invariants from raw verifier output via AST-based normalization followed by LLM-driven semantic rewriting and augmentation with provable quality guarantees. Fine-tuning Small
Language Models (SLMs) on Wonda-curated data yields consistent gains across the Qwen3, Llama-3.1, and Mistral families: the 4B and 8B Qwen3 models nearly double invariant correctness and double speedup rates, while Llama-3.1-8B triples both. On the challenging InvBench suite, the same 4B model outperforms an off-the-shelf model 20x its size and matches the end-to-end verification time of GPT-OSS-120B, while a 14B Qwen3 model matches that of the frontier model GPT-5.2, all without test-time compute overhead. Our code is publicly available on GitHub.
Read the full abstract ▾
All authors Ido Pinto, Yizhak Yisrael Elboher, Haoze Wu, Nina Narodytska, Guy Katz
Machine Learning
Federated Learning of Binary Neural Networks: Enabling Low-Cost Inference
Nitin Priyadarshini Shankar, Soham Lahiri, Sheetal Kalyani et al. (+1 more)
Federated Learning (FL) enables distributed clients to jointly train a global model without sharing their raw data. However, deploying the resulting deep neural networks on resource-constrained edge devices remains challenging due to their inference-time computational and
memory requirements. Binary Neural Networks (BNNs) offer substantial efficiency gains by representing weights and activations using a single bit, but achieving competitive accuracy under such aggressive quantization remains difficult. Rotation-aware binarization reduces quantization errors by aligning real-valued weights with their binary representations. Despite its effectiveness in centralized learning, applying rotation-aware binarization in FL is non-trivial due to discrepancies between local and global models, particularly under heterogeneous client data distributions. To address this challenge, we propose FedBNN, a
federated rotation-aware binarization framework that leverages global model information to guide local binarization while incorporating locally learned rotation information into server-side construction of the global binary model. Experiments across multiple
benchmark datasets, model architectures, and degrees of data heterogeneity demonstrate that the proposed integrated methodology achieves accuracy competitive with full-precision
federated models while generally outperforming existing
federated binary learning approaches. Overall, FedBNN enables accurate binary inference in heterogeneous
federated settings, with savings of up to $58\times$ in FLOPs and $32\times$ in
memory over full-precision models, offering a practical balance between predictive performance and deployment efficiency on resource-constrained edge devices.
Read the full abstract ▾
All authors Nitin Priyadarshini Shankar, Soham Lahiri, Sheetal Kalyani, Saurav Prakash
Machine Learning
Seeking SOTA: Time-Series Forecasting Must Adopt Taxonomy-Specific Evaluation to Dispel Illusory Gains
Raeid Saqur, Christoph Bergmeir, Blanka Horvath et al. (+3 more)
We argue that the current practice of evaluating AI/ML time-series
forecasting models, predominantly on
benchmarks characterized by strong, persistent periodicities and seasonalities, obscures real progress by overlooking the performance of efficient classical methods. We demonstrate that these "standard"
datasets often exhibit dominant autocorrelation patterns and seasonal cycles that can be effectively captured by simpler linear or statistical models, rendering complex deep learning architectures frequently no more performant than their classical counterparts for these specific data characteristics, and raising questions as to whether any marginal improvements justify the significant increase in computational overhead and model complexity. We call on the community to (I) retire or substantially augment current
benchmarks with
datasets exhibiting a wider spectrum of non-stationarities, such as structural breaks, time-varying
volatility, and concept drift, and less predictable dynamics drawn from diverse real-world domains, and (II) require every deep learning submission to include robust classical and simple baselines, appropriately chosen for the specific characteristics of the downstream tasks' time series. By doing so, we will help ensure that reported gains reflect genuine scientific methodological advances rather than artifacts of
benchmark selection favoring models adept at learning repetitive patterns.
Read the full abstract ▾
All authors Raeid Saqur, Christoph Bergmeir, Blanka Horvath, Daniel Schmidt, Frank Rudzicz, Terry Lyons
Machine Learning · Cross-listed from cs.AI
Understanding Reasoning in LLMs through Strategic Information Allocation under Uncertainty
Jeonghye Kim, Xufang Luo, Minbeom Kim et al. (+3 more)
LLMs often exhibit Aha moments such as self-correction after
tokens like "Wait," yet the underlying mechanism remains unclear. Standard LLMs collapse mainly through silent divergence, where trajectories drift from the correct answer yet remain locally coherent, so no explicit error triggers reactive self-correction. We introduce an information-theoretic framework that separates
reasoning into procedural advancement and epistemic verbalization, the
token-level externalization of uncertainty, and prove that sporadic verbalization restores convergence toward the correct answer even without explicit error triggers. Empirically, a minimal doubt cue recovers failed trajectories, and small-scale SFT suffices to instill or suppress this capability, suggesting that strong
reasoning hinges less on an extraordinary inner mechanism than on the linguistic habit of externalizing uncertainty. Our framework recasts
reasoning as strategic information allocation under uncertainty, offering a new lens for understanding and advancing LLM
reasoning.
Read the full abstract ▾
All authors Jeonghye Kim, Xufang Luo, Minbeom Kim, Sangmook Lee, Dongsheng Li, Yuqing Yang
Machine Learning
Grokking as a Variance-Limited Phase Transition: Spectral Gating and the Epsilon-Stability Threshold
Pratyush Acharya and Habish Dhakal
Standard optimization theories struggle to explain grokking, where generalization occurs long after training convergence. While
geometric studies attribute this to slow drift, they often overlook the interaction between the optimizer's noise structure and landscape
curvature. This work analyzes AdamW dynamics on modular arithmetic tasks, revealing a “Spectral Gating” mechanism that regulates the transition from memorization to generalization. We find that AdamW operates as a variance-gated
stochastic system. Grokking is constrained by a stability condition: the generalizing solution resides in a sharp basin ($\lambda_{max}^H$) initially inaccessible under low-variance regimes. The “delayed” phase represents the accumulation of gradient variance required to lift the effective stability ceiling, permitting entry into this sharp
manifold. Our ablation studies identify three complexity regimes: (1) Capacity Collapse ($P < 23$), where rank-deficiency prevents structural learning; (2) The Variance-Limited Regime ($P \approx 41$), where generalization waits for the spectral gate to open; and (3) Stability Override ($P > 67$), where memorization becomes dimensionally unstable. Furthermore, we challenge the "Flat Minima" hypothesis for algorithmic tasks, showing that isotropic noise injection fails to induce grokking. Generalization requires the anisotropic rectification unique to adaptive optimizers, which directs noise into the tangent space of the solution
manifold.
Read the full abstract ▾
Machine Learning
TabKD: Tabular Knowledge Distillation through Interaction Diversity of Learned Feature Bins
Shovon Niverd Pereira, Krishna Khadka and Yu Lei
Data-free knowledge
distillation enables model compression without original training data, critical for
privacy-sensitive tabular domains. However, existing methods does not perform well on tabular data because they do not explicitly address feature interactions, the fundamental way tabular models encode predictive knowledge. We identify interaction diversity, systematic coverage of feature combinations, as an essential requirement for effective tabular
distillation. To operationalize this insight, we propose TabKD, which learns adaptive feature bins aligned with teacher decision boundaries, then generates synthetic queries that maximize pairwise interaction coverage. Across 4
benchmark datasets and 4 teacher architectures, TabKD achieves highest student-teacher agreement in 14 out of 16 configurations, outperforming 5 state-of-the-art baselines. We further show that interaction coverage strongly correlates with
distillation quality, validating our core hypothesis. Our work establishes interaction-focused exploration as a principled framework for tabular model extraction.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.CV
Seeing Beyond: Extrapolative Domain Adaptive Panoramic Segmentation
Yuanfan Zheng, Kunyu Peng, Xu Zheng et al. (+1 more)
Cross-domain panoramic semantic
segmentation has attracted growing interest as it enables comprehensive 360{\deg} scene understanding for real-world applications. However, it remains particularly challenging due to severe
geometric Field of View (FoV) distortions and inconsistent open-set semantics across domains. In this work, we formulate an open-set domain adaptation setting, and propose Extrapolative Domain Adaptive Panoramic
Segmentation (EDA-PSeg) framework that trains on local perspective views and tests on full 360{\deg} panoramic images, explicitly tackling both
geometric FoV shifts across domains and semantic uncertainty arising from previously unseen classes. To this end, we propose the Euler-Margin
Attention (EMA), which introduces an angular margin to enhance viewpoint-invariant semantic representation, while performing amplitude and phase modulation to improve generalization toward unseen classes. Additionally, we design the Graph Matching Adapter (GMA), which builds high-order graph relations to align shared semantics across FoV shifts while effectively separating novel categories through structural adaptation. Extensive experiments on four
benchmark datasets under camera-shift, weather-condition, and open-set scenarios demonstrate that EDA-PSeg achieves state-of-the-art performance, robust generalization to diverse viewing geometries, and resilience under varying environmental conditions. The code is available at https://github.com/zyfone/EDA-PSeg.
Read the full abstract ▾
All authors Yuanfan Zheng, Kunyu Peng, Xu Zheng, Kailun Yang
Machine Learning · Cross-listed from math.AG
Terminal Fano 4-fold Hypersurfaces via Deep Reinforcement Learning
Marc Truter
We construct $46{,}992$ new families of Fano $4$-fold hypersurfaces $X_d\subset\mathbb(a_1,\ldots,a_6)$ of Fano index $1$ with $d>200$, whose general members have terminal singularities. Unlike the $11{,}617$ quasismooth families classified by Brown and Kasprzyk, these are nonquasismooth, for which determining terminality can require the analysis of hyperquotient singularities. An exhaustive search has classified all nonquasismooth families with $d\leq200$, but extending this classification to higher degrees becomes computationally prohibitive. We therefore exploit the sparsity and spatial clustering of terminal examples using two best-first searches over $\mathbb{Z}^6$: one with a fixed heuristic, and the other with a neural network trained online by deep reinforcement learning. Together, the searches reach degrees up to $3{,}234$. The neural network additionally discovers an average of $79$ hard-to-reach families per run. For the most isolated examples, our conservative distance-based model gives an estimated lower bound of nearly $40\%$ of the fixed search's total step budget to discover a single such family. An ablation study demonstrates that this advantage arises from the neural network rather than
stochastic exploration alone. The complete list of families is publicly available.
Read the full abstract ▾
Machine Learning
Physics-informed fine-tuning of foundation models for partial differential equations
Vlad Medvedev, Leon Armbruster, Christopher Straub et al. (+2 more)
Foundation models for partial differential equations (PDEs) have emerged as powerful surrogates pre-trained on diverse physical systems, but adapting them to new downstream tasks remains challenging due to limited task-specific data and distribution shifts. While fine-tuning has proven transformative in natural
language processing, best practices for adapting PDE foundation models remain underexplored. Although physics-informed training has successfully trained accurate solvers across a wide range of PDE problems, its potential for fine-tuning data-based foundation models has not been systematically studied. In this work, we introduce a physics-informed fine-tuning framework that adapts pre-trained PDE foundation models by incorporating physical constraints (PDE residuals and boundary conditions) directly into the fine-tuning objective. This enables effective adaptation in data-scarce regimes while promoting physical consistency. We evaluate our method on a downstream task composed of an unseen PDE class and compare it with data-driven finetuning counterparts. Our results demonstrate that physics-informed fine-tuning achieves competitive accuracy without requiring PDE solutions for training. Furthermore, a hybrid fine-tuning strategy yields superior generalization to out-of-distribution scenarios when only minimal training data is available. These findings establish physics-informed fine-tuning as a scalable and data-efficient paradigm, providing a physically interpretable pathway for adapting foundation models in scientific machine learning.
Read the full abstract ▾
All authors Vlad Medvedev, Leon Armbruster, Christopher Straub, Georg Kruse, Andreas Rosskopf
Machine Learning
Amplification Effects in Test-Time Reinforcement Learning: Safety and Reasoning Vulnerabilities
Vanshaj Khattar, Md Rafi ur Rashid, Moumita Choudhury et al. (+4 more)
Test-time training (TTT) has recently emerged as a promising method to improve the
reasoning abilities of large
language models (LLMs), in which the model directly learns from test data without access to labels. However, this reliance on test data also makes TTT methods vulnerable to harmful
prompt injections. In this paper, we investigate safety vulnerabilities of TTT methods, where we study a representative self-consistency-based test-time learning method: test-time reinforcement learning (TTRL), a recent TTT method that improves LLM
reasoning by rewarding self-consistency using majority vote as a reward signal. We show that harmful
prompt injection during TTRL amplifies the model's existing behaviors, i.e., safety amplification when the base model is relatively safe, and harmfulness amplification when it is vulnerable to the injected data. In both cases, there is a decline in
reasoning ability, which we refer to as the
reasoning tax. We also show that TTT methods such as TTRL can be exploited adversarially using specially designed "HarmInject"
prompts to force the model to answer jailbreak and
reasoning queries together, resulting in stronger harmfulness amplification. Overall, our results highlight that TTT methods that enhance LLM
reasoning by promoting self-consistency can lead to amplification behaviors and
reasoning degradation, highlighting the need for safer TTT methods.
Read the full abstract ▾
All authors Vanshaj Khattar, Md Rafi ur Rashid, Moumita Choudhury, Jing Liu, Toshiaki Koike-Akino, Ming Jin, Ye Wang
Machine Learning
RESQ: A Unified Framework for REliability- and Security Enhancement of Quantized Deep Neural Networks
Ali Soltan Mohammadi, Samira Nazari, Ali Azarpeyvand et al. (+5 more)
This work proposes a unified three-stage framework that produces a quantized DNN with balanced fault and attack robustness. The first stage improves attack resilience via fine-tuning that desensitizes feature representations to small input perturbations. The second stage reinforces fault resilience through fault-aware fine-tuning under simulated bit-flip faults. Finally, a lightweight post-training adjustment integrates quantization to enhance efficiency and further mitigate fault sensitivity without degrading attack resilience. Experiments on ResNet18, VGG16, EfficientNet, and Swin-Tiny in CIFAR-10, CIFAR-100, and GTSRB show consistent gains of up to 10.35% in attack resilience and 12.47% in fault resilience, while maintaining competitive accuracy in quantized networks. The results also highlight an asymmetric interaction in which improvements in fault resilience generally increase resilience to
adversarial attacks, whereas enhanced
adversarial resilience does not necessarily lead to higher fault resilience.
Read the full abstract ▾
All authors Ali Soltan Mohammadi, Samira Nazari, Ali Azarpeyvand, Mahdi Taheri, Milos Krstic, Michael Huebner, Christian Herglotz, Tara Ghasempouri
Machine Learning
The Metric Slingshot: Navigational Reuse as Width-Optimal Structural Decoupling in Continual Learning
Xin Li
The mammalian
brain, most extensively studied in rodents and bats, solves an enormous variety of non-spatial cognitive tasks using neural circuitry, including grid
cells, place
cells, and hippocampal indexing, that originally evolved for physical
navigation. We formalize the above observation within the local Urysohn width (LUW) framework for continual learning. The central construct is the metric slingshot: a learned
embedding $\phi: X \to Z$ that maps an arbitrary learning problem into a navigational latent space $Z$ where pre-evolved contraction maps (grid
cells) already provide the metric machinery, so that only the topological indexing subproblem must be solved de novo. We prove three results. First, the optimal spacing of multi-scale grid
cell modules is a
geometric series whose ratio is determined by the $\Omega(w \log w)$ sample complexity bound of the LUW framework; for ecologically plausible parameters, optimality yields $r^* \approx 1.4$–$1.7$, matching electrophysiological measurements in rodent medial entorhinal cortex. Second, the slingshot preserves the width hierarchy with a Lipschitz-controlled transfer bound: a contractive
embedding into a fine-resolution navigational space reduces the effective number of contexts the learner must discover. Third, the anatomical separation of the ventral (“what”) and dorsal (“where”) visual streams achieves the structural decoupling required by Metric-
Topology Factorization (MTF) by architecture, without gradient-routing mechanisms. We demonstrate that such metric slingshot is applicable to both perception cognition and motor control. Together, these results provide a unified, complexity-theoretic account of
navigation in non-spatial domain, grid
cell multi-modularity, and hippocampal-neocortical complementary learning as consequences of a single exaptation principle: metric slingshot.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.AI
A Hybrid Modeling Framework for Crop Prediction Tasks via Dynamic Parameter Calibration and Multi-Task Learning
William Solow, Paola Pesantez-Cabrera, Markus Keller et al. (+3 more)
Accurate prediction of crop states (e.g., phenology stages and cold hardiness) is essential for timely farm management decisions such as irrigation, fertilization, and canopy management to optimize crop yield and quality. While traditional biophysical models can be used for season-long predictions, they lack the precision required for site-specific management. Deep learning methods are a compelling alternative, but can produce biologically unrealistic predictions and require large-scale data. We propose a hybrid modeling approach that uses a neural network to parameterize a differentiable biophysical model and leverages multi-task learning for efficient data sharing across crop cultivars in data limited settings. By predicting the parameters of the biophysical model, our approach improves the prediction accuracy while preserving biological realism. Empirical evaluation using real-world and synthetic
datasets demonstrates that our method improves prediction accuracy by 60% for phenology and 40% for cold hardiness compared to deployed biophysical models.
Read the full abstract ▾
All authors William Solow, Paola Pesantez-Cabrera, Markus Keller, Lav Khot, Sandhya Saisubramanian, Alan Fern
Machine Learning · Cross-listed from cs.CR
TrinityGuard: A Unified Framework for Safeguarding Multi-Agent Systems
Kai Wang, Biaojie Zeng, Zeming Wei et al. (+7 more)
With the rapid development of LLM-based multi-
agent systems (MAS), their significant safety and security concerns have emerged, which introduce novel risks going beyond single
agents or LLMs. Despite attempts to address these issues, the existing literature lacks a cohesive safeguarding system specialized for MAS risks. In this work, we introduce TrinityGuard, a comprehensive safety evaluation and monitoring framework for LLM-based MAS, grounded in the OWASP standards. Specifically, TrinityGuard encompasses a three-tier fine-grained risk taxonomy that identifies 20 risk types, covering single-
agent vulnerabilities, inter-
agent communication threats, and system-level emergent hazards. Designed for scalability across various MAS structures and platforms, TrinityGuard is organized in a trinity manner, involving an MAS abstraction layer that can be adapted to any MAS structures, an evaluation layer containing risk-specific test modules, alongside runtime monitor
agents coordinated by a unified LLM Judge Factory. During Evaluation, TrinityGuard executes curated attack probes to generate detailed vulnerability reports for each risk type, where monitor
agents analyze structured execution traces and issue real-time alerts, enabling both pre-development evaluation and runtime monitoring. We further formalize these safety metrics and present detailed case studies across various representative MAS examples, showcasing the versatility and reliability of TrinityGuard. Overall, TrinityGuard acts as a comprehensive framework for evaluating and monitoring various risks in MAS, paving the way for further research into their safety and security.
Read the full abstract ▾
All authors Kai Wang, Biaojie Zeng, Zeming Wei, Chang Jin, Hefeng Zhou, Xiangtian Li, Chao Yang, Jingjing Qu, Xingcheng Xu, Xia Hu
Machine Learning
Efficient Morphology-Control Co-Design via Stackelberg Proximal Policy Optimization
Yanning Dai, Yuhui Wang, Dylan R. Ashley et al. (+1 more)
Morphology-control co-design concerns the coupled optimization of an
agent's body structure and control policy. This problem exhibits a bi-level structure, where the control dynamically adapts to the morphology to maximize performance. Existing methods typically neglect the control's adaptation dynamics by adopting a single-level formulation that treats the control policy as fixed when optimizing morphology. This can lead to inefficient optimization, as morphology updates may be misaligned with control adaptation. In this paper, we revisit the co-design problem from a game-theoretic perspective, modeling the intrinsic coupling between morphology and control as a novel variant of a Stackelberg game. We propose Stackelberg Proximal Policy Optimization (Stackelberg PPO), which explicitly incorporates the control's adaptation dynamics into morphology optimization. By modeling this intrinsic coupling, our method aligns morphology updates with control adaptation, thereby stabilizing training and improving learning efficiency. Experiments across diverse co-design tasks demonstrate that Stackelberg PPO outperforms standard PPO in both stability and final performance, opening the way for dramatically more efficient robotics designs.
Read the full abstract ▾
All authors Yanning Dai, Yuhui Wang, Dylan R. Ashley, Jürgen Schmidhuber
Machine Learning · Cross-listed from stat.ML
Persistence Spheres: a Bi-continuous Linear Representation of Measures for Partial Optimal Transport
Matteo Pegoraro
We improve and extend persistence spheres, introduced in~\cite{pegoraro2025persistence}. Persistence spheres map an integrable measure $\mu$ on the upper half-plane, including persistence diagrams (PDs) as counting measures, to a function $S(\mu)\in C(\mathbb{S}^2)$, and the map is stable with respect to 1-Wasserstein partial transport distance $\mathrm{POT}_1$. Moreover, to the best of our knowledge, persistence spheres are the first explicit representation used in topological machine learning for which continuity of the inverse on the image is established at every compactly supported target. Recent bounded-cardinality bi-Lipschitz
embedding results in partial transport spaces, despite being powerful, are not given by the kind of explicit summary map considered here. Our construction is rooted in convex geometry: for positive measures, the defining ReLU integral is the support function of the lift zonoid. Building on~\cite{pegoraro2025persistence}, we refine the definition to better match the $\mathrm{POT}_1$ deletion mechanism, encoding partial transport via a signed diagonal augmentation. In particular, for integrable $\mu$, the uniform norm between $S(0)$ and $S(\mu)$ depends only on the persistence of $\mu$, without any need of ad-hoc re-weightings, reflecting optimal transport to the diagonal at persistence cost. This yields a parameter-free representation at the level of measures (up to numerical discretization), while accommodating future extensions where $\mu$ is a smoothed measure derived from PDs (e.g., persistence intensity functions~\citep{wu2024estimation}). Across clustering, regression, and classification tasks involving functional data, time series, graphs, meshes, and point clouds, the updated persistence spheres are competitive and often improve upon persistence images, persistence landscapes, persistence splines, and sliced Wasserstein kernel baselines.
Read the full abstract ▾
Machine Learning
More Test-Time Compute Can Hurt: Overestimation Bias in LLM Beam Search
Gal Dalal, Assaf Hallak, Gal Chechik et al. (+1 more)
Wider beam search should improve LLM
reasoning, but when should you stop widening? Prior work on beam width selection has focused on inference efficiency \citep{qin2025dsbd, freitag2017beam}, without analyzing whether wider search can hurt output quality. We present an analysis, grounded in Extreme Value Theory, that answers this question. Beam selection over noisy scorer outputs introduces a systematic overestimation bias that grows with the candidate pool size, and we derive a maximum useful beam width $\hat{k}$ beyond which search degrades performance. This critical width depends on the signal-to-noise ratio of the scorer: $\hat{k}$ grows exponentially with $(\Delta/\sigma)^2$, where $\Delta > 0$ is the quality advantage of correct paths over incorrect ones and $\sigma$ is the scorer noise. We validate this theory by comparing perplexity-guided and PRM-guided beam search across three 7B-parameter models and ten domains on MR-BEN (5,975 questions). Perplexity scoring, with its high noise, yields $\hat{k} = 1$: search provides no benefit at any width tested. PRM scoring, with lower noise, yields $\hat{k} \geq 4$, with gains of up to 8.9 percentage points. The same model, the same
algorithm, but different scorers place $\hat{k}$ at opposite ends of the beam width range. Our analysis identifies the scorer's signal-to-noise ratio as the key quantity governing beam width selection, and we propose diagnostic indicators for choosing the beam width in practice.
Read the full abstract ▾
All authors Gal Dalal, Assaf Hallak, Gal Chechik, Yftah Ziser
Machine Learning
GradCFA: A Hybrid Gradient-Based Counterfactual and Feature Attribution Explanation Algorithm for Local Interpretation of Neural Networks
Jacob Sanderson, Hua Mao and Wai Lok Woo
Explainable Artificial Intelligence (XAI) is increasingly essential as AI systems are deployed in critical fields such as healthcare and finance, offering transparency into AI-driven decisions. Two major XAI paradigms, counterfactual explanations (CFX) and feature attribution (FA), serve distinct roles in model interpretability. This study introduces GradCFA, a hybrid framework combining CFX and FA to improve interpretability by explicitly optimizing feasibility, plausibility, and diversity - key qualities often unbalanced in existing methods. Unlike most CFX research focused on binary classification, GradCFA extends to multi-class scenarios, supporting a wider range of applications. We evaluate GradCFA's validity, proximity, sparsity, plausibility, and diversity against state-of-the-art methods, including Wachter, DiCE, CARE for CFX, and SHAP for FA. Results show GradCFA effectively generates feasible, plausible, and diverse counterfactuals while offering valuable FA insights. By identifying influential features and validating their impact, GradCFA advances AI interpretability. The code for implementation of this work can be found at: https://github.com/jacob-ws/GradCFs .
Read the full abstract ▾
Machine Learning · Cross-listed from cond-mat.dis-nn
Controlled Langevin Dynamics for Sampling of Feedforward Neural Networks Trained with Minibatches
Alessandro Zambon, Francesca Caruso, Riccardo Zecchina et al. (+1 more)
Sampling the parameter space of artificial neural networks according to a Boltzmann distribution provides insight into the geometry of low-loss solutions and offers an alternative to conventional loss minimization for training. However, exact sampling methods such as hybrid Monte Carlo (hMC), while formally correct, become computationally prohibitive for realistic
datasets because they require repeated evaluation of full-batch gradients. We introduce a pseudo-Langevin (pL) dynamics that enables efficient Boltzmann sampling of feed-forward neural networks trained with large
datasets by using minibatches in a controlled manner. The method exploits the statistical properties of minibatch gradient noise and adjusts fictitious masses and friction coefficients to ensure that the induced
stochastic process samples efficiently the desired
equilibrium distribution. We validate numerically the approach by comparing its
equilibrium statistics with those obtained from exact hMC sampling. Performance
benchmarks demonstrate that, while hMC rapidly becomes inefficient as network size increases, the pL scheme maintains high computational
diffusion and scales favorably to networks with over one million parameters. Finally, we show that sampling at intermediate temperatures yields optimal generalization performance, comparable to SGD, without requiring a validation set or early stopping procedure. These results establish controlled minibatch Langevin dynamics as a practical and scalable tool for exploring and exploiting the solution space of large neural networks.
Read the full abstract ▾
All authors Alessandro Zambon, Francesca Caruso, Riccardo Zecchina, Guido Tiana
Machine Learning
Deep learning and the rate of approximation by flows
Jingpu Cheng, Qianxiao Li, Ting Lin et al. (+1 more)
We investigate the dependence of the approximation capacity of deep residual networks on its depth in a continuous dynamical systems setting. This can be formulated as the general problem of quantifying the minimal time-horizon required to approximate a diffeomorphism by flows driven by a given family $\mathcal F$ of vector fields. We show that this minimal time can be identified as a geodesic distance on a sub-Finsler
manifold of diffeomorphisms, where the local geometry is characterised by a variational principle involving $\mathcal F$. This connects the learning efficiency of target relationships to their compatibility with the learning architectural choice. Further, the results suggest that the key approximation mechanism in deep learning, namely the approximation of functions by composition or dynamics, differs in a fundamental way from linear approximation theory, where linear spaces and norm-based rate estimates are replaced by
manifolds and geodesic distances.
Read the full abstract ▾
All authors Jingpu Cheng, Qianxiao Li, Ting Lin, Zuowei Shen
Machine Learning
FuXiWeather2: Learning accurate atmospheric state estimation for operational global weather forecasting
Xiaoze Xu, Xiuyu Sun, Songling Zhu et al. (+5 more)
Numerical weather prediction has long been constrained by the computational bottlenecks inherent in data assimilation and numerical modeling. While machine learning has accelerated
forecasting, existing models largely serve as "emulators of reanalysis products," thereby retaining their systematic biases and operational latencies. Here, we present FuXiWeather2, a unified end-to-end neural framework for assimilation and
forecasting. We align training objectives directly with a combination of real-world observations and reanalysis data, enabling the framework to effectively rectify inherent errors within reanalysis products. To address the distribution shift between NWP-derived background inputs during training and self-generated backgrounds during deployment, we introduce a recursive unrolling training method to enhance the precision and stability of analysis generation. Furthermore, our model is trained on a hybrid
dataset of raw and simulated observations to mitigate the impact of observational distribution inconsistency. FuXiWeather2 generates high-resolution ($0.25^{\circ}$) global analysis fields and 10-day forecasts within minutes. The analysis fields surpass the NCEP-GFS across most variables and demonstrate superior accuracy over both ERA5 and the ECMWF-HRES system in lower-tropospheric and surface variables. These high-quality analysis fields drive deterministic forecasts that exceed the skill of the HRES system in 91% of evaluated metrics. Additionally, its outstanding performance in typhoon track prediction underscores its practical value for rapid response to extreme weather events. The FuXiWeather2 analysis
dataset is available at https://doi.org/10.5281/zenodo.18872728.
Read the full abstract ▾
All authors Xiaoze Xu, Xiuyu Sun, Songling Zhu, Xiaohui Zhong, Yuanqing Huang, Zijian Zhu, Jun Liu, Hao Li
Machine Learning
Conditional Rectified Flow-based End-to-End Rapid Seismic Inversion Method
Haofei Xu, Wei Cheng, Sizhe Li et al. (+1 more)
Seismic inversion is a core problem in geophysical exploration, where traditional methods suffer from high computational costs and are susceptible to initial model dependence. In recent years, deep generative model-based seismic inversion methods have achieved remarkable progress, but existing generative models struggle to balance sampling efficiency and inversion accuracy. This paper proposes an end-to-end fast seismic inversion method based on Conditional Rectified Flow[1], which designs a dedicated seismic encoder to extract multi-scale seismic features and adopts a layer-by-layer injection control strategy to achieve fine-grained conditional control. Experimental results demonstrate that the proposed method achieves excellent inversion accuracy on the OpenFWI[2]
benchmark dataset. Compared with
Diffusion[3,4] methods, it achieves sampling acceleration; compared with InversionNet[5,6,7] methods, it achieves higher accuracy in generation. Our zero-shot generalization experiments on Marmousi[8,9] real data further verify the practical value of the method. Experimental results show that the proposed method achieves excellent inversion accuracy on the OpenFWI
benchmark dataset; compared with
Diffusion methods, it achieves sampling acceleration while maintaining higher accuracy than InversionNet methods; experiments based on the Marmousi standard model further verify that this method can generate high-quality initial velocity models in a zero-shot manner, effectively alleviating the initial model dependency problem in traditional Full Waveform Inversion (FWI), and possesses industrial practical value.
Read the full abstract ▾
All authors Haofei Xu, Wei Cheng, Sizhe Li, Jie Xiong
Machine Learning · Cross-listed from stat.ML
Active Seriation: Efficient Ordering Recovery with Statistical Guarantees
James Cheshire and Yann Issartel
Active seriation aims at recovering an unknown ordering of $n$ items by adaptively querying pairwise similarities. The observations are noisy measurements of entries of an underlying $n$ x $n$ permuted Robinson
matrix, whose permutation encodes the latent ordering. The framework allows the
algorithm to start with partial information on the latent ordering, including seriation from scratch as a special case. We propose an active seriation
algorithm that provably recovers the latent ordering with high probability. Under a uniform separation condition on the similarity
matrix, optimal performance guarantees are established, both in terms of the probability of error and the number of observations required for successful recovery.
Read the full abstract ▾
Machine Learning
Data Augmentation via Causal-Residual Bootstrapping
Mateusz Gajewski, Sophia Xiao and Bijan Mazaheri
Data augmentation integrates domain knowledge into a
dataset by making domain-informed modifications to existing data points. For example, image data can be augmented by duplicating images in different tints or orientations, thereby incorporating the knowledge that images may vary in these dimensions. Recent work by Teshima and Sugiyama has explored the integration of causal knowledge (e.g, A causes B causes C) up to conditional independence equivalence. We suggest a related approach for settings with additive noise that can incorporate information beyond a Markov equivalence class. The approach, built on the principle of independent mechanisms, permutes the residuals of models built on marginal probability distributions. Predictive models built on our augmented data demonstrate improved accuracy, for which we provide theoretical backing in linear Gaussian settings.
Read the full abstract ▾
Machine Learning · Cross-listed from math.NA
A scaled TW-PINN: A physics-informed neural network for traveling wave solutions of reaction-diffusion equations with general coefficients
Seungwan Han, Kwanghyuk Park, Jiaxi Gu et al. (+1 more)
We propose an efficient and generalizable physics-informed neural network (PINN) framework for computing traveling wave solutions of $n$-dimensional reaction-
diffusion equations with various reaction and
diffusion coefficients. By applying a scaling transformation with the traveling wave form, the original problem is reduced to a one-dimensional scaled reaction-
diffusion equation with unit reaction and
diffusion coefficients. This reduction leads to the proposed framework, termed scaled TW-PINN, in which a single PINN solver trained on the scaled equation is reused for different coefficient choices and spatial dimensions. We also prove a universal approximation property of the proposed PINN solver for traveling wave solutions. Numerical experiments in one and two dimensions, together with a comparison to the existing wave-PINN method, demonstrate the accuracy, flexibility, and superior performance of scaled TW-PINN. Finally, we explore an extension of the framework to the Fisher's equation with general initial conditions.
Read the full abstract ▾
All authors Seungwan Han, Kwanghyuk Park, Jiaxi Gu, Jae-Hun Jung
Machine Learning
CASHomon Sets: Efficient Rashomon Sets Across Multiple Model Classes and their Hyperparameters
Fiona Katharina Ewald, Martin Binder, Matthias Feurer et al. (+2 more)
Rashomon sets are model sets within one model class that perform nearly as well as a reference model from the same model class. They reveal the existence of alternative well-performing models, which may support different interpretations. This enables selecting models that match domain knowledge, hidden constraints, or user preferences. However, efficient construction methods currently exist for only a few model classes. Applied machine learning usually searches many model classes, and the best class is unknown beforehand. We therefore study Rashomon sets in the combined
algorithm selection and hyperparameter optimization (CASH) setting and call them CASHomon sets. We propose TruVaRImp, a model-based active learning
algorithm for level set estimation with an implicit threshold, and provide convergence guarantees. On synthetic and real-world
datasets, TruVaRImp reliably identifies CASHomon sets members and matches or outperforms naive sampling,
Bayesian optimization, classical and implicit level set estimation methods, and other baselines. Our analyses of predictive multiplicity and feature-importance variability across model classes question the common practice of interpreting data through a single model class.
Read the full abstract ▾
All authors Fiona Katharina Ewald, Martin Binder, Matthias Feurer, Bernd Bischl, Giuseppe Casalicchio
Machine Learning
A Kolmogorov-Arnold Surrogate Model for Chemical Equilibria: Application to Solid Solutions
Leonardo Boledi, Dirk Bosbach and Jenna Poonoosamy
The computational cost of geochemical solvers is a challenging matter. For reactive transport simulations, where chemical calculations are performed up to billions of times, it is crucial to reduce the total computational time. Existing publications have explored various machine-learning approaches to determine the most effective data-driven surrogate model. In particular, multilayer perceptrons are widely employed due to their ability to recognize nonlinear relationships. In this work, we focus on the recent Kolmogorov-Arnold networks, where learnable spline-based functions replace classical fixed activation functions. This architecture has achieved higher accuracy with fewer trainable parameters and has become increasingly popular for solving partial differential equations. First, we train a surrogate model based on an existing cement system
benchmark. Then, we move to an application case for the geological disposal of
nuclear waste, i.e., the determination of radionuclide-bearing solids solubilities. To the best of our knowledge, this work is the first to investigate co-precipitation with radionuclide incorporation using data-driven surrogate models, considering increasing levels of thermodynamic complexity from simple mechanical mixtures to non-ideal solid solutions of binary (Ba,Ra)SO$_4$ and ternary (Sr,Ba,Ra)SO$_4$ systems. On the cement
benchmark, we demonstrate that the Kolmogorov-Arnold architecture outperforms multilayer perceptrons in both absolute and relative error metrics, reducing them by 62% and 59%, respectively. On the binary and ternary radium solid solution models, Kolmogorov-Arnold networks maintain median prediction errors near $1\times10^{-3}$. This is the first step toward employing surrogate models to speed up reactive transport simulations and optimize the safety assessment of deep geological waste repositories.
Read the full abstract ▾
Machine Learning
xplainfi: Feature Importance and Statistical Inference for Machine Learning in R
Lukas Burk, Fiona Katharina Ewald, Giuseppe Casalicchio et al. (+2 more)
We introduce xplainfi, an R package built on top of the mlr3 ecosystem for global, loss-based feature importance methods for machine learning models. Various feature importance methods exist in R, but significant gaps remain, particularly regarding conditional importance methods and associated statistical inference procedures. The package implements permutation feature importance, conditional feature importance, relative feature importance, leave-one-
covariate-out, and generalizations thereof, and both marginal and conditional Shapley additive global importance methods. It provides a modular conditional sampling architecture based on Gaussian distributions,
adversarial random forests, conditional inference trees, and knockoff-based samplers, which enable conditional importance analysis for continuous and mixed data. Statistical inference is available through multiple approaches, including variance-corrected confidence intervals and the conditional predictive impact framework. We demonstrate that xplainfi produces importance scores consistent with existing implementations across multiple simulation settings and learner types, while offering competitive runtime performance. The package is available on CRAN and provides researchers and practitioners with a comprehensive toolkit for feature importance analysis and model interpretation in R.
Read the full abstract ▾
All authors Lukas Burk, Fiona Katharina Ewald, Giuseppe Casalicchio, Marvin N. Wright, Bernd Bischl