Drifting Models
Overview
In generative modeling, drifting models learn a vector field—often using kernel-based attraction and repulsion—to transport a source distribution toward data in one or a few steps. Methods connect these fields to score matching and Wasserstein gradient flows, with variants based on Sinkhorn divergences, learned representations, symmetry, multiple bandwidths, and second-order dynamics. Theory examines identifiability, stability, convergence, and finite-sample bias; applications include image and molecule generation, speech enhancement, and robot policies. A related line studies models whose data or behavior changes over time, using drift detection, retraining, parameter extrapolation, and risk-aware monitoring, with open questions about reliable guarantees and when adaptation justifies its cost.
Latest papers
53 papers2 papers in the last four weeks, down 67% on the four weeks before. 0.0% of all new papers.