mlsanityData to 7 Oct 2026

A Data-Driven Approach to Robust Hypothesis Testing Using Sinkhorn Uncertainty Sets

arXiv 2202.04258 ↗First posted 9 Feb 2022stat.ML cs.LGcited by 9

Not on the map. Why?

Abstract (arXiv)

Hypothesis testing for small-sample scenarios is a practically important problem. In this paper, we investigate the robust hypothesis testing problem in a data-driven manner, where we seek the worst-case detector over distributional uncertainty sets centered around the empirical distribution from samples using Sinkhorn distance. Compared with the Wasserstein robust test, the corresponding least favorable distributions are supported beyond the training samples, which provides a more flexible detector. Various numerical experiments are conducted on both synthetic and real datasets to validate the competitive performances of our proposed method.

Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). Builds on 7 of its 33 references that are in the map. First posted on arXiv 9 Feb 2022.

Builds on

7 of 33 references.

References · 7

  1. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
  2. 2016Distributionally Robust Stochastic Optimization with Wasserstein Distancecited by 182
  3. 2018Robust Hypothesis Testing Using Wasserstein Uncertainty Setscited by 28
  4. 2019Classification Logit Two-sample Testing by Neural Networkscited by 25
  5. 2016Anomaly detection in online social networkscited by 15
  6. 2021Robust Hypothesis Testing with Wasserstein Uncertainty Setscited by 7
  7. 2021Class-conditioned Domain Generalization via Wasserstein Distributional Robust Optimizationcited by 5

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 1; 2023: 2; 2024: 4; 2025: 1; 2026: 1.

9 papers.