Skip to content

Quickest Change Detection with Diffusion-Integrated Scores

Oct 2026 · 0 citations · 19 references
Mathematics Computer Science

Abstract

Classical CUSUM relies on the log-likelihood ratio of the underlying distributions, which cannot generally be computed from finite pre- and post-change samples alone. We propose diffusion-integrated score CUSUM (DI-SCUSUM), a training-free detector. We add Gaussian noise to the samples to form two smooth density estimates and calculate their Hyv\"arinen scores exactly, without training a score network. For each incoming observation, we sample a diffusion time, perturb the observation, and use the importance-weighted score difference as an increment in the DI-SCUSUM recursion. Under the assumption that observations follow the fixed empirical distributions, the post-change mean increment is proportional to the Kullback-Leibler (KL) divergence from the smoothed post-change to the smoothed pre-change empirical distribution. We establish exponential false-alarm scaling and a first-order delay bound that, for a fixed threshold and increment scaling, is inversely proportional to the KL divergence. In the calibrated anisotropic Gaussian simulation, DI-SCUSUM nearly matches likelihood-ratio CUSUM and reduces the measured detection delay by about 91% relative to score-based CUSUM. On MNIST and Oxford-IIIT Pet, DI-SCUSUM also has lower empirical conditional detection delay than SCUSUM at comparable false-alarm levels.

View source

Similar papers

#machine learning Preprint Sep 2026

Robustness of Diffusion Models under Distribution Shift

This work studies robust score estimation under Wasserstein perturbations of a reference distribution of Ornstein--Uhlenbeck diffusion and characterize how finite data, intrinsic dimension, and distribution shift affect the robustness of score-based diffusion models.

Wei Luo, N. K. Chada, Shi-Jie Zhang et al. · 0 citations
#data science Preprint Sep 2026

FluxLite: Inference-Time Proposal Control for Discrete Diffusion Models

FluxLite is introduced, a lightweight, training-free proposal-control framework for discrete diffusion, identifying a tilted-path coverage factor that governs robustness to score error, together with finite-particle convergence for a fixed controlled Feynman-Kac recursion.

Yinuo Ren, Haoxuan Chen, Grant M. Rotskoff et al. · 1 citation
#machine learning Preprint Sep 2026

Improved Distributional Diffusion Models

A stochastic few-step generator whose FID does not degrade as the sampling budget grows from 4 to 50 NFE, and the same recipe transfers to text-to-image generation.

Tommaso Martorella, Alexandre Galashov, F. Krause et al. · 1 citation
Preprint Oct 2026

Improving score-based sampling via affine post-processing

Sampling from a probability distribution with access only to its log-density is a foundational problem in statistics, machine learning, and the physical sciences. This problem is studied in the data-free score-based diffusion literature, which samples the target density via estimating scores of densities produced by co...

Curtis McDonald, Kevin Rojas, Mo-Lei Tao et al. · 0 citations
Preprint Sep 2026

Anytime-Valid Distribution Shift Detection via Predictive Rank Martingales

Many sequential distribution shift detectors update a growing reference set with incoming observations. After a change, this update contaminates the reference set with post-change observations and can weaken subsequent evidence. Keeping the calibration sample fixed mitigates this contamination, but repeated reuse induc...

Qi Kuang, Yin Xia · 0 citations

Related blog posts

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.