Machine Learning
An LLM-Guided Query-Aware Inference System for GNN Models on Large Knowledge Graphs
Waleed Afandi, Hussein Abdallah, Ashraf Aboulnaga et al. (+1 more)
Efficient inference for graph neural networks (GNNs) on large knowledge graphs (KGs) is essential for many real-world applications. GNN inference queries are computationally expensive and vary in complexity, as each involves a different number of target nodes linked to subgraphs of diverse densities and structures. Existing acceleration methods, such as
pruning, quantization, and knowledge
distillation, instantiate smaller models but do not adapt them to the structure or semantics of individual queries. They also store models as monolithic files that must be fully loaded, and miss the opportunity to retrieve only the neighboring nodes and corresponding model components that are semantically relevant to the target nodes. These limitations lead to excessive data loading and redundant computation on large KGs. This paper presents KG-WISE, a task-driven inference paradigm for large KGs. KG-WISE decomposes trained GNN models into fine-grained components that can be partially loaded based on the structure of the queried subgraph. It employs large
language models (LLMs) to generate reusable query templates that extract semantically relevant subgraphs for each task, enabling query-aware and compact model instantiation. We evaluate KG-WISE on six large KGs with up to 42 million nodes and 166 million edges. KG-WISE achieves up to 28x faster inference and 98% lower
memory usage than state-of-the-art systems while maintaining or improving accuracy across both commercial and open-weight LLMs.
Read the full abstract ▾
All authors Waleed Afandi, Hussein Abdallah, Ashraf Aboulnaga, Essam Mansour
Machine Learning · Cross-listed from astro-ph.IM
A Fast Generative Framework for High-dimensional Posterior Sampling: Application to CMB Delensing
Hadi Sotoudeh, Pablo Lemos and Laurence Perreault-Levasseur
We introduce a deep generative framework for high-dimensional
Bayesian inference that enables efficient posterior sampling. As
telescopes and simulations rapidly expand the volume and resolution of astrophysical data, fast simulation-based inference methods are increasingly needed to extract scientific insights. While
diffusion-based approaches offer high-quality generative capabilities, they are hindered by slow sampling speeds. Our method performs posterior sampling an order of magnitude faster than a
diffusion baseline. Applied to the problem of CMB delensing, it successfully recovers the unlensed CMB power spectrum from simulated observations. The model also remains robust to shifts in cosmological parameters, demonstrating its potential for out-of-distribution generalization and application to observational cosmological data.
Read the full abstract ▾
Machine Learning
Invariant Causal Routing for Governing Social Norms in Online Market Economies
Xiangning Yu, Qirui Mi, Xiao Xue et al. (+4 more)
Social norms are stable behavioral patterns that emerge endogenously within economic systems through repeated interactions among
agents. In online
market economies, such norms – like fair exposure, sustained participation, and balanced reinvestment – are critical for long-term stability. We aim to understand the causal mechanisms driving these emergent norms and to design principled interventions that can steer them toward desired outcomes. This is challenging because norms arise from countless micro-level interactions that aggregate into macro-level regularities, making causal attribution and policy transferability difficult. To address this, we propose Invariant Causal Routing (ICR), a causal governance framework that identifies policy-norm relations stable across heterogeneous environments. ICR integrates counterfactual
reasoning with invariant causal discovery to separate genuine causal effects from spurious correlations and to construct interpretable, auditable policy rules that remain effective under distribution shift. In heterogeneous
agent simulations calibrated with real data, ICR yields more stable norms, smaller generalization gaps, and more concise rules than correlation or coverage baselines, demonstrating that causal invariance offers a principled and interpretable foundation for governance.
Read the full abstract ▾
All authors Xiangning Yu, Qirui Mi, Xiao Xue, Haoxuan Li, Yiwei Shi, Xiaowei Liu, Mengyue Yang
Machine Learning · Cross-listed from stat.ML
The Volterra signature
Paul P. Hager, Fabian N. Harang, Luca Pelizzari et al. (+1 more)
Modern approaches for learning from non-Markovian time series, such as recurrent neural networks, neural controlled differential equations or
transformers, typically rely on implicit
memory mechanisms that can be difficult to interpret or to train over long horizons. We propose the Volterra signature $\mathrm{VSig}(x;K)$ as a principled, explicit feature representation for history-dependent systems. By developing the input path $x$ weighted by a temporal kernel $K$ into the tensor
algebra, we leverage the associated Volterra–Chen identity to derive rigorous learning-theoretic guarantees. Specifically, we prove an injectivity statement (identifiability under augmentation) that leads to a universal approximation
theorem on the infinite dimensional path space, which in certain cases is achieved by linear functionals of $\mathrm{VSig}(x;K)$. Moreover, we demonstrate applicability of the kernel trick by showing that the inner product associated with Volterra signatures admits a closed characterization via a two-parameter integral equation, enabling numerical methods from PDEs for computation. For a large class of exponential-type kernels, $\mathrm{VSig}(x;K)$ solves a linear state-space ODE in the tensor
algebra. Combined with inherent invariance to time reparameterization, these results position the Volterra signature as a robust, computationally tractable feature map for data science. We demonstrate its efficacy in dynamic learning tasks on real and synthetic data, where it consistently improves classical path signature baselines.
Read the full abstract ▾
All authors Paul P. Hager, Fabian N. Harang, Luca Pelizzari, Samy Tindel
Machine Learning · Cross-listed from physics.chem-ph
Projected Hessian Learning: Fast Curvature Supervision for Accurate Machine-Learning Interatomic Potentials
Austin Rodriguez, Justin S. Smith, Sakib Matin et al. (+3 more)
The Hessian
matrix (second derivatives) encodes far richer local
curvature of the potential energy surface than energies and forces alone. However, training machine-learning interatomic potentials (MLIPs) with full Hessians is often impractical because explicitly forming and storing Hessian
matrices scales quadratically in cost and
memory. We introduce Projected Hessian Learning (PHL), a scalable second-order training framework that injects
curvature information using only Hessian-vector products (HVPs). Rather than constructing the Hessian, PHL projects
curvature along
stochastic probe directions and uses an unbiased
stochastic trace-based loss with favorable system-size scaling, enabling
curvature-informed training without quadratic
memory growth. We
benchmark PHL on a chemically diverse
dataset of reactants, products, transition states, intrinsic reaction coordinates, and normal-mode sampled geometries computed at omegaB97XD/6-31G(d). We compare energy-force training (E-F), two HVP-based schemes (E-F-HVP with one-hot or randomized probes), and full energy-force-Hessian training (E-F-H). With randomized probes per minibatch, both HVP schemes match full-Hessian training in energy, force, and Hessian accuracy while delivering >24x epoch speedups for the small molecular systems studied. In a fixed-probe regime with one HVP per molecule, randomized projections consistently outperform one-column probing, especially for far-from-
equilibrium geometries. Overall, PHL replaces explicit Hessian supervision with force-complexity
curvature training, retaining most second-order accuracy gains while scaling to larger, more complex molecular systems.
Read the full abstract ▾
All authors Austin Rodriguez, Justin S. Smith, Sakib Matin, Nicholas Lubbers, Kipton Barros, Jose L. Mendoza-Cortes
Machine Learning
Augmenting representations with scientific papers
Nicolò Oreste Pinciroli Vago, Rocco Di Tella, Carolina Cuesta-Lázaro et al. (+3 more)
Astronomers have acquired vast repositories of
multimodal data, including images, spectra, and time series, complemented by decades of literature that analyzes astrophysical sources. Still, these data sources are rarely systematically integrated. This work introduces a contrastive learning framework designed to align X-ray spectra with domain knowledge extracted from scientific literature, facilitating the development of shared
multimodal representations. Establishing this connection is inherently complex, as scientific texts encompass a broader and more diverse physical context than spectra. We propose a contrastive pipeline that achieves a 20% Recall@1% when retrieving texts from spectra, proving that a meaningful
alignment between these modalities is not only possible but capable of accelerating the interpretation of rare or poorly understood sources. Furthermore, the resulting shared latent space effectively encodes physically significant information. By fusing spectral and textual data, we improve the estimation of 20 physical variables by 16-18% over unimodal spectral baselines. Our results indicate that a Mixture of Experts (MoE) strategy, which leverages both unimodal and shared representations, yields superior performance. Finally, outlier analysis within the
multimodal latent space identifies high-priority targets for follow-up investigation, including a candidate pulsating ULX (PULX) and a gravitational lens system. Importantly, this framework can be extended to other scientific domains where aligning observational data with existing literature is possible.
Read the full abstract ▾
All authors Nicolò Oreste Pinciroli Vago, Rocco Di Tella, Carolina Cuesta-Lázaro, Michael J. Smith, Cecilia Garraffo, Rafael Martínez-Galarza
Machine Learning · Cross-listed from q-bio.QM
AbAffinity: A Large Language Model for Predicting Antibody Binding Affinity against SARS-CoV-2
Faisal Bin Ashraf, Animesh Ray and Stefano Lonardi
Machine learning-based antibody design is emerging as one of the most promising approaches to combat infectious diseases, due to significant advancements in the field of artificial intelligence and an exponential surge in experimental antibody data (in particular related to COVID-19). The ability of an antibody to bind to an antigens (called binding affinity) is one of the the most critical properties in designing neutralizing antibodies. In this study we introduce Ab-Affinity, a new large
language model that can accurately predict the binding affinity of antibodies against a target peptide, e.g., the SARS-CoV-2 spike
protein. Code and model are available at https://github.com/ucrbioinfo/AbAffinity.
Read the full abstract ▾
Machine Learning · Cross-listed from stat.ML
Bayesian Modeling of Collatz Stopping Times: A Probabilistic Machine Learning Perspective
Nicolò Bonacorsi and Matteo Bordoni
We study the Collatz total stopping time $\tau(n)$ over $n\le 10^7$ from a probabilistic machine learning viewpoint. Empirically, $\tau(n)$ is a skewed and heavily overdispersed count with pronounced arithmetic heterogeneity. We develop two complementary models. First, a
Bayesian hierarchical Negative Binomial regression (NB2-GLM) predicts $\tau(n)$ from simple
covariates ($\log n$ and residue class $n \bmod 8$), quantifying uncertainty via posterior and posterior predictive distributions. Second, we propose a mechanistic generative approximation based on the odd-block decomposition: for odd $m$, write $3m+1=2^{K(m)}m'$ with $m'$ odd and $K(m)=v_2(3m+1)\ge 1$; randomizing these block lengths yields a
stochastic approximation calibrated via a Dirichlet-multinomial update. On held-out data, the NB2-GLM achieves substantially higher predictive likelihood than the odd-block generators. Conditioning the block-length distribution on $m\bmod 8$ markedly improves the generator's distributional fit, indicating that low-order modular structure is a key driver of heterogeneity in $\tau(n)$.
Read the full abstract ▾
Machine Learning
Standing on the Shoulders of Giants: Rethinking EEG Foundation Model Pretraining via Multi-Teacher Distillation
Chenqi Li, Yu Liu, Shuo Zhang et al. (+2 more)
Pretraining for electroencephalogram (
EEG) foundation models has predominantly relied on self-supervised masked reconstruction, a paradigm largely adapted from and inspired by the success of
vision and
language foundation models. However, unlike images and text,
EEG datasets are notoriously expensive to collect and characterized by low signal-to-noise ratio. These challenges introduce difficulties in scaling the
EEG foundation models and capturing the underlying neural semantics through reconstruction. In this work, we ask the question: can we stand on the shoulders of well-established foundation models from well-represented modalities to bootstrap the pretraining of
EEG foundation models? We first demonstrate that mainstream foundation models, such as those from
vision and time series, transfer surprisingly well to
EEG domain. To this end, we propose the Multi-Teacher
Distillation Pretraining (MTDP) framework for pretraining
EEG foundation models via a two-stage multi-teacher
distillation. In the first stage, we introduce a learnable gating network to fuse representations from diverse teachers (e.g., DINOv3 and Chronos) via a masked latent denoising objective. In the second stage, we distill the fused representation into an
EEG foundation model. Extensive evaluations across 9 downstream tasks and 12
datasets demonstrate that our MTDP-based
EEG foundation model outperforms its self-supervised counterparts while requiring only 25% of the pretraining data.
Read the full abstract ▾
All authors Chenqi Li, Yu Liu, Shuo Zhang, Timothy Denison, Tingting Zhu
Machine Learning
Activity Recognition from Smart Insole Sensor Data Using a Circular Dilated CNN
Yanhua Zhao
Smart insoles equipped with pressure sensors, accelerometers, and gyroscopes offer a non-intrusive way of monitoring human gait and posture. We present an activity classification system based on a circular dilated convolutional neural network (CDCNN) that processes multi-modal time-series data from such insoles. The model operates on 160-frame windows with 24 channels (18 pressure, 3 accelerometer, 3 gyroscope axes), achieving 86.42% test accuracy in a subject-independent evaluation on a four-class task (Standing, Walking, Sitting, Tandem). Permutation feature importance reveals the distribution of contributions made by various sensors to the classification process. The proposed approach has potential applications in areas such as smart insole design, health monitoring, and rehabilitation.
Read the full abstract ▾
Machine Learning · Cross-listed from stat.ML
Dictionary Based Pattern Entropy for Causal Direction Discovery
Harikrishnan N B, Shubham Bhilare, Aditi Kathpalia et al. (+1 more)
Discovering causal direction from temporal observational data is particularly challenging for symbolic sequences, where functional models and noise assumptions are often unavailable. We propose a novel \emph{Dictionary Based Pattern
Entropy ($DPE$)} framework that infers both the direction of causation and the specific subpatterns driving changes in the effect variable. The framework integrates Algorithmic Information Theory (AIT) and Shannon Information Theory. Causation is interpreted as the emergence of compact, rule based patterns in the candidate cause that systematically constrain the effect. $DPE$ constructs direction-specific dictionaries and quantifies their influence using
entropy-based measures, enabling a principled link between deterministic pattern structure and
stochastic variability. Causal direction is inferred via a minimum-uncertainty criterion, selecting the direction exhibiting stronger and more consistent pattern-driven organization. As summarized in Table 7, $DPE$ consistently achieves reliable performance across diverse synthetic systems, including delayed bit-flip perturbations, AR(1) coupling, 1D skew-tent maps, and sparse processes, outperforming or matching competing AIT-based methods ($ETC_E$, $ETC_P$, $LZ_P$). In biological and ecological
datasets, performance is competitive, while alternative methods show advantages in specific genomic settings. Overall, the results demonstrate that minimizing pattern level uncertainty yields a robust, interpretable, and broadly applicable framework for causal discovery.
Read the full abstract ▾
All authors Harikrishnan N B, Shubham Bhilare, Aditi Kathpalia, Nithin Nagaraj
Machine Learning
Towards Explainable Deep Learning for Ship Trajectory Prediction in Inland Waterways
Tom Legel, Dirk Söffker, Roland Schätzle et al. (+1 more)
Accurate predictions of ship trajectories in crowded environments are essential to ensure safety in inland waterways traffic. Recent advances in deep learning promise increased accuracy even for complex scenarios. While the challenge of ship-to-ship awareness is being addressed with growing success, the explainability of these models is often overlooked, potentially obscuring an inaccurate logic and undermining the confidence in their reliability. This study examines an LSTM-based vessel trajectory prediction model by incorporating trained ship domain parameters that provide insight into the
attention-based fusion of the interacting vessels' hidden states. This approach has previously been explored in the field of maritime shipping, yet the variety and complexity of encounters in inland waterways allow for a more profound analysis of the model's interpretability. The prediction performance of the proposed model variants are evaluated using standard displacement error statistics. Additionally, the plausibility of the generated ship domain values is analyzed. With an final displacement error of around 40 meters in a 5-minute prediction horizon, the model performs comparably to similar studies. Though the ship-to-ship
attention architecture enhances prediction accuracy, the weights assigned to vessels in encounters using the learnt ship domain values deviate from the expectation. The observed accuracy improvements are thus not entirely driven by a causal relationship between a predicted trajectory and the trajectories of nearby ships. This finding underscores the model's explanatory capabilities through its intrinsically interpretable design. Future work will focus on utilizing the architecture for counterfactual analysis and on the incorporation of more sophisticated
attention mechanisms.
Read the full abstract ▾
All authors Tom Legel, Dirk Söffker, Roland Schätzle, Kathrin Donandt
Machine Learning · Cross-listed from cs.CV
SimpliHuMoN: Simplifying Human Motion Prediction
Aadya Agrawal and Alexander Schwing
Human motion prediction combines the tasks of trajectory
forecasting and human pose prediction. For each of the two tasks, specialized models have been developed. Combining these models for holistic human motion prediction is non-trivial, and recent methods have struggled to compete on established
benchmarks for individual tasks. To address this, we propose a simple yet effective
transformer-based model for human motion prediction. The model employs a stack of self-
attention modules to effectively capture both spatial dependencies within a pose and temporal relationships across a motion sequence. This simple, streamlined, end-to-end model is sufficiently versatile to handle pose-only, trajectory-only, and combined prediction tasks without task-specific modifications. We demonstrate that this approach achieves state-of-the-art results across all tasks through extensive experiments on a wide range of
benchmark datasets, including Human3.6M, AMASS, ETH-UCY, and 3DPW.
Read the full abstract ▾
Machine Learning
Accurate and Efficient Hybrid-Ensemble Atmospheric Data Assimilation in Latent Space with Uncertainty Quantification
Hang Fan, Juan Nathaniel, Yi Xiao et al. (+5 more)
Data assimilation (DA) combines model forecasts and observations to estimate the optimal state of the atmosphere with its uncertainty, providing initial conditions for weather prediction and reanalyses for
climate research. Yet, existing traditional and machine-learning DA methods struggle to achieve accuracy, efficiency and uncertainty quantification simultaneously. Here, we propose HLOBA (Hybrid-Ensemble Latent Observation-Background Assimilation), a three-dimensional hybrid-ensemble DA method that operates in an atmospheric latent space learned via an autoencoder (AE). HLOBA maps both model forecasts and observations into a shared latent space via the AE encoder and an end-to-end Observation-to-Latent-space mapping network (O2Lnet), respectively, and fuses them through a
Bayesian update with weights inferred from time-lagged ensemble forecasts. Both idealized and real-observation experiments demonstrate that HLOBA matches dynamically constrained four-dimensional DA methods in both analysis and forecast skill, while achieving end-to-end inference-level efficiency and theoretical flexibility applies to any
forecasting model. Moreover, by exploiting the error decorrelation property of latent variables, HLOBA enables element-wise uncertainty estimates for its latent analysis and propagates them to model space via the decoder. Idealized experiments show that this uncertainty highlights large-error regions and captures their seasonal variability.
Read the full abstract ▾
All authors Hang Fan, Juan Nathaniel, Yi Xiao, Ce Bian, Fenghua Ling, Ben Fei, Lei Bai, Pierre Gentine
Machine Learning · Cross-listed from astro-ph.IM
SELDON: Supernova Explosions Learned by Deep ODE Networks
Jiezhong Wu, Jack O'Brien, Jennifer Li et al. (+6 more)
The discovery rate of optical transients will explode to 10 million public alerts per night once the Vera C. Rubin Observatory's Legacy Survey of Space and Time comes online, overwhelming the traditional physics-based inference pipelines. A continuous-time
forecasting AI model is of interest because it can deliver millisecond-scale inference for thousands of objects per day, whereas legacy MCMC codes need hours per object. In this paper, we propose SELDON, a new continuous-time variational autoencoder for panels of sparse and irregularly time-sampled (gappy) astrophysical light curves that are nonstationary, heteroscedastic, and inherently dependent. SELDON combines a masked GRU-ODE encoder with a latent neural ODE propagator and an interpretable Gaussian-basis decoder. The encoder learns to summarize panels of imbalanced and correlated data even when only a handful of points are observed. The neural ODE then integrates this hidden state forward in continuous time, extrapolating to future unseen epochs. This extrapolated time series is further encoded by deep sets to a latent distribution that is decoded to a weighted sum of Gaussian basis functions, the parameters of which are physically meaningful. Such parameters (e.g., rise time, decay rate, peak flux) directly drive downstream prioritization of spectroscopic follow-up for astrophysical surveys. Beyond astronomy, the architecture of SELDON offers a generic recipe for interpretable and continuous-time sequence modeling in any time domain where data are multivariate, sparse, heteroscedastic, and irregularly spaced.
Read the full abstract ▾
All authors Jiezhong Wu, Jack O'Brien, Jennifer Li, M. S. Krafczyk, Ved G. Shah, Amanda R. Wasserman, Daniel W. Apley, Gautham Narayan, Noelle I. Samia
Machine Learning · Cross-listed from cs.CV
ZipMap: Linear-Time Stateful 3D Reconstruction via Test-Time Training
Haian Jin, Rundi Wu, Tianyuan Zhang et al. (+4 more)
Feed-forward
transformer models have driven rapid progress in 3D
vision, but state-of-the-art methods such as VGGT and $\pi^3$ have a computational cost that scales quadratically with the number of input images, making them inefficient when applied to large image collections. Sequential-reconstruction approaches reduce this cost but sacrifice reconstruction quality. We introduce ZipMap, a stateful feed-forward model that achieves linear-time, bidirectional 3D reconstruction while matching or surpassing the accuracy of quadratic-time methods. ZipMap employs test-time training layers to zip an entire image collection into a compact hidden scene state in a single forward pass, enabling reconstruction of over 700 frames in under 10 seconds on a single H100 GPU, more than $20\times$ faster than state-of-the-art methods such as VGGT. Moreover, we demonstrate the benefits of having a stateful representation in real-time scene-state querying and its extension to sequential streaming reconstruction.
Read the full abstract ▾
All authors Haian Jin, Rundi Wu, Tianyuan Zhang, Ruiqi Gao, Jonathan T. Barron, Noah Snavely, Aleksander Holynski
Machine Learning · Cross-listed from cs.CY
Turning Trust to Transactions: Tracking Affiliate Marketing and FTC Compliance in YouTube's Influencer Economy
Chen Sun, Yash Vekaria, Zubair Shafiq et al. (+1 more)
YouTube has evolved into a powerful platform where creators monetize their influence through affiliate marketing, raising concerns about transparency and ethics, especially when creators fail to disclose their affiliate relationships. Although regulatory agencies like the US Federal Trade Commission (FTC) have issued guidelines to address these issues, non-compliance and consumer harm persist, and the extent of these problems remains unclear. In this paper, we introduce tools, developed with insights from recent advances in Web measurement and NLP research, to examine the state of the affiliate marketing ecosystem on YouTube. We apply these tools to a 10-year
dataset of 2 million
videos from nearly 540,000 creators, analyzing the prevalence of affiliate marketing on YouTube and the rates of non-compliant behavior. Our findings reveal that affiliate links are widespread, yet disclosure compliance remains low, with most
videos failing to meet FTC standards. Furthermore, we analyze the effects of different stakeholders in improving disclosure behavior. Our study suggests that the platform is highly associated with improved compliance through standardized disclosure features. We recommend that regulators and affiliate partners collaborate with platforms to enhance transparency, accountability, and trust in the influencer economy.
Read the full abstract ▾
All authors Chen Sun, Yash Vekaria, Zubair Shafiq, Rishab Nithyanand
Machine Learning
Robustness of Agentic AI Systems via Adversarially-Aligned Jacobian Regularization
Furkan Mumcu and Yasin Yilmaz
As Large
Language Models (LLMs) transition into autonomous multi-
agent ecosystems, robust minimax training becomes essential yet remains prone to instability when highly non-linear policies induce extreme local
curvature in the inner maximization. Standard remedies that enforce global Jacobian bounds are overly conservative, suppressing sensitivity in all directions and inducing a large Price of Robustness. We introduce Adversarially-Aligned Jacobian Regularization (AAJR), a trajectory-aligned approach that controls sensitivity strictly along
adversarial ascent directions. We prove that AAJR yields a strictly larger admissible policy class than global constraints under mild conditions, implying a weakly smaller approximation gap and reduced nominal performance degradation. Furthermore, we derive step-size conditions under which AAJR controls effective smoothness along optimization trajectories and ensures inner-loop stability. These results provide a structural theory for agentic robustness that decouples minimax stability from global expressivity restrictions.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.SD
Low-Resource Guidance for Controllable Latent Audio Diffusion
Zachary Novack, Zack Zukowski, CJ Carr et al. (+6 more)
Generative audio requires fine-grained controllable outputs, yet most existing methods require model retraining on specific controls or inference-time controls (e.g., guidance) that can also be computationally demanding. By examining the bottlenecks of existing guidance-based controls, in particular their high cost-per-step due to decoder backpropagation, we introduce a guidance-based approach through selective TFG and Latent-Control Heads (LatCHs), which enables controlling latent audio
diffusion models with low computational overhead. LatCHs operate directly in latent space, avoiding the expensive decoder step, and requiring minimal training resources (7M parameters and $\approx$ 4 hours of training). Experiments with Stable Audio Open demonstrate effective control over intensity, pitch, and beats (and a combination of those) while maintaining generation quality. Our method balances precision and audio fidelity with far lower computational costs than standard end-to-end guidance. Demo examples can be found at https://zacharynovack.github.io/latch/latch.html.
Read the full abstract ▾
All authors Zachary Novack, Zack Zukowski, CJ Carr, Julian Parker, Zach Evans, Josiah Taylor, Taylor Berg-Kirkpatrick, Julian McAuley, Jordi Pons
Machine Learning
Dual-Modality Multi-Stage Adversarial Safety Training: Robustifying Multimodal Web Agents Against Cross-Modal Attacks
Haoyu Liu, Dingcheng Li, Lukas Rutishauser et al. (+1 more)
Multimodal web
agents that process both screenshots and accessibility trees are increasingly deployed to interact with web interfaces, yet their dual-stream architecture opens an underexplored attack surface: an adversary who injects content into the webpage DOM simultaneously corrupts both observation channels with a consistent deceptive narrative. Our vulnerability analysis on MiniWob++ reveals that attacks including a visual component far outperform text-only injections, exposing critical gaps in text-centric VLM safety training. Motivated by this finding, we propose Dual-Modality Multi-Stage
Adversarial Safety Training (DMAST), a framework that formalizes the
agent-attacker interaction as a two-player general-sum Markov game and co-trains both players through a three-stage pipeline: (1) imitation learning from a strong teacher model, (2) oracle-guided supervised fine-tuning that uses a novel zero-acknowledgment strategy to instill task-focused
reasoning under
adversarial noise, and (3)
adversarial reinforcement learning via Group Relative Policy Optimization (GRPO) self-play. On out-of-distribution tasks, DMAST nearly halves the attack success rate (41.2%$\rightarrow$21.4%) while raising task completion by over 60% relative (6.2%$\rightarrow$10.2%). Our approach outperforms established training-based defenses and complements
prompt-based defenses, demonstrating genuine co-evolutionary progress and robust generalization to complex, unseen environments. Code is available at https://github.com/huajianduzhuo-code/DMAST_official.
Read the full abstract ▾
All authors Haoyu Liu, Dingcheng Li, Lukas Rutishauser, Zeyu Zheng
Machine Learning
Robust Unscented Kalman Filtering via Recurrent Meta-Adaptation of Sigma-Point Weights
Kenan Majewski, Michał Modzelewski, Marcin Żugaj et al. (+1 more)
The Unscented Kalman Filter (UKF) is a ubiquitous tool for nonlinear state estimation; however, its performance is limited by the static parameterization of the Unscented Transform (UT). Conventional weighting schemes, governed by fixed scaling parameters, assume implicit Gaussianity and fail to adapt to time-varying dynamics or heavy-tailed measurement noise. This work introduces the Meta-Adaptive UKF (MA-UKF), a framework that reformulates sigma-point weight synthesis as a hyperparameter optimization problem addressed via
memory-augmented meta-learning. Unlike standard adaptive filters that rely on instantaneous heuristic corrections, our approach employs a Recurrent Context Encoder to compress the history of measurement innovations into a compact latent
embedding. This
embedding informs a policy network that dynamically synthesizes the mean and covariance weights of the sigma points at each time step, effectively governing the filter's trust in the prediction versus the measurement. By optimizing the system end-to-end through the filter's recursive logic, the MA-UKF learns to maximize tracking accuracy while maintaining estimation consistency. Numerical
benchmarks on maneuvering targets demonstrate that the MA-UKF significantly outperforms standard baselines, exhibiting superior robustness to non-Gaussian glint noise and effective generalization to out-of-distribution (OOD) dynamic regimes unseen during training.
Read the full abstract ▾
All authors Kenan Majewski, Michał Modzelewski, Marcin Żugaj, Piotr Lichota
Machine Learning
Dissecting Quantization Error: A Concentration-Alignment Perspective
Marco Federici, Boris van Breugel, Paul Whatmough et al. (+1 more)
Quantization can drastically increase the efficiency of large
language and
vision models, but typically incurs an accuracy drop. Recently, function-preserving transforms (e.g. rotations, Hadamard transform, channel-wise scaling) have been successfully applied to reduce post-training quantization error, yet a principled explanation remains elusive. We analyze linear-layer quantization via the signal-to-quantization-noise ratio (SQNR), showing that for uniform integer quantization at a fixed bit width, SQNR decomposes into (i) the concentration of weights and activations (capturing spread and outliers), and (ii) the
alignment of their dominant variation directions. This reveals an actionable insight: beyond concentration - the focus of most prior transforms (e.g. rotations or Hadamard) - improving
alignment between weight and activation can further reduce quantization error. Motivated by this, we introduce block Concentration-
Alignment Transforms (CAT), a lightweight linear transformation that uses a covariance estimate from a small calibration set to jointly improve concentration and
alignment, approximately maximizing SQNR. Experiments across several LLMs show that CAT consistently matches or outperforms prior transform-based quantization methods at 4-bit precision, confirming the insights gained in our framework.
Read the full abstract ▾
All authors Marco Federici, Boris van Breugel, Paul Whatmough, Markus Nagel
Machine Learning · Cross-listed from cs.RO
RoboCasa365: A Large-Scale Simulation Framework for Training and Benchmarking Generalist Robots
Soroush Nasiriany, Sepehr Nasiriany, Abhiram Maddukuri et al. (+1 more)
Recent advances in
robot learning have accelerated progress toward generalist
robots that can perform everyday tasks in human environments. Yet it remains difficult to gauge how close we are to this
vision. The field lacks a reproducible, large-scale
benchmark for systematic evaluation. To fill this gap, we present RoboCasa365, a comprehensive simulation
benchmark for household mobile manipulation. Built on the RoboCasa platform, RoboCasa365 introduces 365 everyday tasks across 2,500 diverse kitchen environments, with over 600 hours of human demonstration data and over 1600 hours of synthetically generated demonstration data – making it one of the most diverse and large-scale resources for studying generalist policies. RoboCasa365 is designed to support systematic evaluations for different problem settings, including multi-task learning,
robot foundation model training, and lifelong learning. We conduct extensive experiments on this
benchmark with state-of-the-art methods and analyze the impacts of task diversity,
dataset scale, and environment variation on generalization. Our results provide new insights into what factors most strongly affect the performance of generalist
robots and inform strategies for future progress in the field.
Read the full abstract ▾
All authors Soroush Nasiriany, Sepehr Nasiriany, Abhiram Maddukuri, Yuke Zhu
Machine Learning
Efficient Refusal Ablation in LLM through Optimal Transport
Geraldin Nanfack, Eugene Belilovsky and Elvis Dohmatob
Safety-aligned
language models refuse harmful requests through learned refusal behaviors encoded in their internal representations. Recent activation-based jailbreaking methods circumvent these safety mechanisms by applying orthogonal projections to remove refusal directions, but these approaches treat refusal as a one-dimensional phenomenon and ignore the rich distributional structure of model activations. We introduce a principled framework based on optimal transport theory that transforms the entire distribution of harmful activations to match harmless ones. By combining PCA with closed-form Gaussian optimal transport, we achieve efficient computation in high-dimensional representation spaces while preserving essential
geometric structure. Across six models (Llama-2, Llama-3.1, Qwen-2.5; 7B-32B parameters), our method achieves up to 11% higher attack success rates than state-of-the-art baselines while maintaining comparable perplexity, demonstrating superior preservation of model capabilities. Critically, we discover that layer-selective intervention (applying optimal transport to 1-2 carefully chosen layers at approximately 40-60% network depth) substantially outperforms full-network interventions, revealing that refusal mechanisms may be localized rather than distributed. Our analysis provides new insights into the
geometric structure of safety representations and suggests that current
alignment methods may be vulnerable to distributional attacks beyond simple direction removal.
Read the full abstract ▾
Machine Learning
Out-of-distribution transfer of PDE foundation models to material dynamics under extreme loading
Mahindra Rautela, Alexander Most, Siddharth Mansingh et al. (+9 more)
Most PDE foundation models are pretrained and fine-tuned on fluid-centric
benchmarks. Their utility under extreme-loading material dynamics remains unclear. We
benchmark out-of-distribution transfer on two discontinuity-dominated regimes in which shocks, evolving interfaces, and fracture produce highly non-smooth fields: shock-driven multi-material interface dynamics (perturbed layered interface or PLI) and dynamic fracture/failure
evolution (FRAC). We formulate the downstream task as terminal-state prediction, i.e., learning a long-horizon map that predicts the final state directly from the first snapshot without intermediate supervision. Using a unified training and evaluation protocol, we evaluate two open-source pretrained PDE foundation models, POSEIDON and MORPH, and compare fine-tuning from pretrained weights against training from scratch across training-set sizes to quantify sample efficiency under distribution shift.
Read the full abstract ▾
All authors Mahindra Rautela, Alexander Most, Siddharth Mansingh, Aleksandra Pachalieva, Bradley Love, Daniel O Malley, Alexander Scheinker, Kyle Hickmann, Diane Oyen, Nathan Debardeleben, Earl Lawrence, Ayan Biswas
Machine Learning · Cross-listed from cs.NI
A Constrained RL Approach for Cost-Efficient Delivery of Latency-Sensitive Applications
Ozan Aygün, Vincenzo Norman Vitale, Antonia M. Tulino et al. (+3 more)
Next-generation networks aim to provide performance guarantees to real-time interactive services that require timely and cost-efficient packet delivery. In this context, the goal is to reliably deliver packets with strict deadlines imposed by the application while minimizing overall resource allocation cost. A large body of work has leveraged
stochastic optimization techniques to design efficient dynamic routing and scheduling solutions under average delay constraints; however, these methods fall short when faced with strict per-packet delay requirements. We formulate the minimum-cost delay-constrained network control problem as a constrained Markov decision process and utilize constrained deep reinforcement learning (CDRL) techniques to effectively minimize total resource allocation cost while maintaining timely throughput above a target reliability level. Results indicate that the proposed CDRL-based solution can ensure timely packet delivery even when existing baselines fall short, and it achieves lower cost compared to other throughput-maximizing methods.
Read the full abstract ▾
All authors Ozan Aygün, Vincenzo Norman Vitale, Antonia M. Tulino, Hao Feng, Elza Erkip, Jaime Llorca
Machine Learning · Cross-listed from cs.CV
Enhancing Authorship Attribution with Synthetic Paintings
Clarissa Loures, Caio Hosken, Luan Oliveira et al. (+2 more)
Attributing authorship to paintings is a historically complex task, and one of its main challenges is the limited availability of real artworks for training computational models. This study investigates whether synthetic images, generated through DreamBooth fine-tuning of Stable
Diffusion, can improve the performance of classification models in this context. We propose a hybrid approach that combines real and synthetic data to enhance model accuracy and generalization across similar artistic styles. Experimental results show that adding synthetic images leads to higher ROC-AUC and accuracy compared to using only real paintings. By integrating generative and discriminative methods, this work contributes to the development of computer
vision techniques for artwork authentication in data-scarce scenarios.
Read the full abstract ▾
All authors Clarissa Loures, Caio Hosken, Luan Oliveira, Gianlucca Zuin, Adriano Veloso
Machine Learning · Cross-listed from cs.CV
Balancing Fidelity, Utility, and Privacy in Synthetic Cardiac MRI Generation: A Comparative Study
Madhura Edirisooriya, Dasuni Kawya, Ishan Kumarasinghe et al. (+5 more)
Deep learning in cardiac MRI (CMR) is fundamentally constrained by both data scarcity and
privacy regulations. This study systematically
benchmarks three generative architectures: Denoising
Diffusion Probabilistic Models (DDPM), Latent
Diffusion Models (LDM), and Flow Matching (FM) for synthetic CMR generation. Utilizing a two-stage pipeline where anatomical masks condition image synthesis, we evaluate generated data across three critical axes: fidelity, utility, and
privacy. Our results show that
diffusion-based models, particularly DDPM, provide the most effective balance between downstream
segmentation utility, image fidelity, and
privacy preservation under limited-data conditions, while FM demonstrates promising
privacy characteristics with slightly lower task-level performance. These findings quantify the trade-offs between cross-domain generalization and patient confidentiality, establishing a framework for safe and effective synthetic data augmentation in medical imaging.
Read the full abstract ▾
All authors Madhura Edirisooriya, Dasuni Kawya, Ishan Kumarasinghe, Isuri Devindi, Mary M. Maleckar, Roshan Ragel, Isuru Nawinne, Vajira Thambawita
Machine Learning
What Does Flow Matching Bring To TD Learning?
Bhavya Agrawalla, Michal Nauman and Aviral Kumar
Recent work shows that flow matching can be effective for scalar Q-value function estimation in reinforcement learning (RL), but it remains unclear why or how this approach differs from standard critics. Contrary to conventional belief, we show that their success is not explained by distributional RL, as explicitly modeling return distributions can reduce performance. Instead, we argue that the use of integration for reading out values and dense velocity supervision at each step of this integration process for training improves TD learning via two mechanisms. First, it enables robust value prediction through test-time recovery, whereby iterative computation through integration dampens errors in early value estimates as more integration steps are performed. This recovery mechanism is absent in monolithic critics. Second, supervising the velocity field at multiple interpolant values induces more plastic feature learning within the network, allowing critics to represent non-stationary TD targets without discarding previously learned features or overfitting to individual TD targets encountered during training. We formalize these effects and validate them empirically, showing that flow-matching critics substantially outperform monolithic critics (2$\times$ in final performance and around 5$\times$ in sample efficiency) in settings where loss of plasticity poses a challenge e.g., in high-UTD online RL problems, while remaining stable during learning.
Read the full abstract ▾
Machine Learning
Algorithmic Compliance and Regulatory Loss in Digital Assets
Khem Raj Bhatt and Krishna Sharma
We study the deployment performance of machine learning based enforcement systems used in cryptocurrency anti money laundering (AML). Using forward looking and rolling evaluations on Bitcoin transaction data, we show that strong static classification metrics substantially overstate real world regulatory effectiveness. Temporal nonstationarity induces pronounced instability in cost sensitive enforcement thresholds, generating large and persistent excess regulatory losses relative to dynamically optimal
benchmarks. The core failure arises from miscalibration of decision rules rather than from declining predictive accuracy per se. These findings underscore the fragility of fixed AML enforcement policies in evolving digital asset
markets and motivate loss-based evaluation frameworks for regulatory oversight.
Read the full abstract ▾