mlsanityData to 14 Oct 2026

Wasserstein Filtering: A Sample Selection Method for Robust Distribution Learning

arXiv 2608.13418 ↗First posted 13 Aug 2026stat.ML cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Given a dataset where a portion of the samples are contaminated, our goal is to recover the underlying clean population distribution. To this end, we propose Wasserstein Filtering (WF), a novel sample selection framework that discards a fraction of suspicious samples and estimates the target distribution using the empirical measure of the remaining data. The core insight is to select a subset of samples whose empirical distribution maximizes its Wasserstein distance to the fully contaminated empirical distribution, thereby preferentially isolating and removing geometrically influential outliers. To render this optimization computationally tractable, we introduce three algorithms: a marginal screening scheme, SinkMarg, and two joint optimization algorithms, SinkWF and SlicedWF, leveraging entropic optimal transport and sliced Wasserstein approximations, respectively. On the theoretical front, we introduce the Far Exclusion and Local Projection (FELP) contamination model, which characterizes corruptions consisting of well-separated outliers and locally indistinguishable perturbations. Under this model, we prove that the WF estimator achieves minimax optimality over distribution families with bounded covariance. Extensive numerical experiments on synthetic datasets, benchmark anomaly detection suites, and robust generative learning with diffusion models demonstrate that WF serves as a highly practical, model-agnostic preprocessing tool. It delivers competitive outlier detection performance and provides substantial downstream benefits for generative modeling under heavy contamination.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 21 of its 42 references that are in the map. First posted on arXiv 13 Aug 2026.

Builds on

21 of 42 references.

References · 21

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2020Denoising Diffusion Probabilistic Modelscited by 21,076
  3. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,316
  4. 2022ADBench: Anomaly Detection Benchmarkcited by 232
  5. 2016Robust Estimators in High Dimensions without the Computational Intractabilitycited by 209
  6. 2020COPOD: Copula-Based Outlier Detectioncited by 146
  7. 2015Optimal Entropy-Transport problems and a new Hellinger-Kantorovich distance between positive measurescited by 139
  8. 2022Deep Isolation Forest for Anomaly Detectioncited by 92
  9. 2020Robust Optimal Transport with Applications in Generative Modeling and Domain Adaptationcited by 87
  10. 2020On Unbalanced Optimal Transport: An Analysis of Sinkhorn Algorithmcited by 61
  11. 2018Differential Properties of Sinkhorn Approximation for Learning with Wasserstein Distancecited by 56
  12. 2020Outlier-Robust Optimal Transportcited by 45
9 more
  1. 2017Resilience: A Criterion for Learning in the Presence of Arbitrary Outlierscited by 43
  2. 2018Convergence and Concentration of Empirical Measures under Wasserstein Distance in Unbounded Functional Spacescited by 41
  3. 2019Generalized Resilience and Robust Statisticscited by 37
  4. 2022On Unbalanced Optimal Transport: Gradient Methods, Sparsity and Approximation Errorcited by 16
  5. 2020Robust Kernel Density Estimation with Median-of-Means principlecited by 9
  6. 2023Robust Estimation under the Wasserstein Distancecited by 8
  7. 2024Robust Distribution Learning with Local and Global Adversarial Corruptionscited by 5
  8. 2019Projections onto the canonical simplex with additional linear inequalitiescited by 3
  9. 2019Finding Outliers in Gaussian Model-Based Clusteringcited by 3

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2026Robustness of Diffusion Models under Distribution Shift
  2. 2026Load--Reserve Wasserstein Propagation for Isotropic Diffusion Samplers
  3. 2026Wasserstein bounds for denoising diffusion probabilistic models via the F"ollmer process
  4. 2025Assessing the Quality of Denoising Diffusion Models in Wasserstein Distance: Noisy Score and Optimal Bounds
  5. 2025Data denoising with self consistency, variance maximization, and the Kantorovich dominance
  6. 2025Wasserstein Convergence of Score-based Generative Models under Semiconvexity and Discontinuous Gradients
  7. 2024Rethinking the Diffusion Models for Numerical Tabular Data Imputation from the Perspective of Wasserstein Gradient Flow
  8. 2025Quantization-based Bounds on the Wasserstein Metric