arXiv Machine Learning

TASER: Task-Aware Stein Regularisation for Geometry-Driven Smoothness

The paper introduces TASER, a training-time regularisation method that couples neural network derivatives to density scores via the Langevin Stein operator, providing a weighted Sobolev interpretation and a hierarchy of stability bounds. A lighter variant, TASERLight, uses a first-order Stein operator and avoids explicit tangent-space estimation or inner perturbation searches. Experiments on spectroscopy, skeleton motion, ECG, MNIST, and CIFAR-10 show improved robustness to distribution shifts and complementary benefits when combined with isotropic regularisation.

arXiv Machine Learning
Oct 16

TASTE: Task-Aware Out-of-Distribution Detection via Stein Operators

TASTE (Task-Aware STEin operators) is a framework that links distribution shift to a model’s input sensitivity using Stein operators. It provides a geometric interpretation of shift as a projection onto the model’s sensitivity field, offers coordinate‑wise localisation, and delivers interpretable per‑pixel diagnostics for image data. Experiments on Gaussian shifts, MNIST, and CIFAR‑10/ImageNet‑1K benchmarks show that TASTE closely tracks task degradation and performs competitively with existing baselines, with gains varying by shift regime.

By Micha{\l} Kozyra, Gesine Reinert
arXiv Machine Learning
Aug 27

StablePDENet: Enhancing Neural Operator Stability through Physics-Informed Residual-Sensitivity Regularization

The paper introduces StablePDENet, a physics-informed adversarial training framework that regularizes the residual sensitivity of neural operators to improve stability against input perturbations. The method formulates operator learning as a min–max optimization, where a physics-based projected‑gradient adversary generates perturbations and the outer objective combines the attacked physics loss with a normalized residual‑sensitivity penalty. Experiments on benchmark problems show that StablePDENet outperforms PI‑DeepONet and its adversarial variant in accuracy under adversarial attacks while maintaining competitive performance on clean data, and it also enhances generalization and highlights the distinction between model sensitivity and intrinsic operator ill‑conditioning.

By Chutian Huang, Chang Ma, Kaibo Wang, Yang Xiang
arXiv AI
Aug 11

Second Order Drifting Models

arXiv:2608. 07924v1 Announce Type: cross Abstract: Drifting models are a recent class of one-step generative models that evolve the model distribution during training using a predefined sample-based drift field.

By Drake Brown, Yuhao Huang, Shih-Hsin Wang, Bao Wang
arXiv Machine Learning
Jun 9

Mitigating the Contractivity Trap in Diffusion ODEs via Stein Stabilization

arXiv:2606. 07835v1 Announce Type: new Abstract: A fundamental tension exists in the large-step inference of diffusion models via their deterministic probability flow ordinary differential equation (PF-ODE) trajectories, which we identify as the contractivity trap: efficient inference favors large step sizes, while aggressive steps and highly expressive denoisers can undermine contraction-based stability certificates for error suppression.

By Shigui Li, Delu Zeng
arXiv Machine Learning
6d ago

A Unified Matrix-Spectral Framework for Stability and Interpretability in Deep Learning

The paper introduces a unified matrix‑spectral framework that treats deep neural networks as data‑dependent products of linear operators, enabling the analysis of stability and interpretability through spectral quantities. It defines a Global Matrix Stability Index that aggregates spectral information from Jacobians, parameter gradients, Neural Tangent Kernel operators, and loss Hessians into a single stability scale, and shows that spectral entropy provides a more realistic measure of sensitivity than worst‑case bounds. Experiments on MNIST, CIFAR‑10, and CIFAR‑100 demonstrate that modest spectral regularization can significantly improve attribution stability without large changes to global spectral summaries.

By Ronald Katende