A Data-Driven Approach to Robust Hypothesis Testing Using Sinkhorn Uncertainty Sets
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
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
- 2016Distributionally Robust Stochastic Optimization with Wasserstein Distancecited by 182
- 2018Robust Hypothesis Testing Using Wasserstein Uncertainty Setscited by 28
- 2019Classification Logit Two-sample Testing by Neural Networkscited by 25
- 2016Anomaly detection in online social networkscited by 15
- 2021Robust Hypothesis Testing with Wasserstein Uncertainty Setscited by 7
- 2021Class-conditioned Domain Generalization via Wasserstein Distributional Robust Optimizationcited by 5
Built on by
Citing papers per year: 2022: 1; 2023: 2; 2024: 4; 2025: 1; 2026: 1.
9 papers.
- 2023Flow-based Distributionally Robust Optimizationcited by 13
- 2023Exact Generalization Guarantees for (Regularized) Wasserstein Distributionally Robust Modelscited by 9
- 2024Robust Kernel Hypothesis Testing under Data Corruptioncited by 7
- 2022Kernel Robust Hypothesis Testingcited by 6
- 2024Non-Convex Robust Hypothesis Testing using Sinkhorn Uncertainty Setscited by 4
- 2024Statistical and Computational Guarantees of Kernel Max-Sliced Wasserstein Distancescited by 4
- 2024Gaussian Derivative Change-point Detection for Early Warnings of Industrial System Failurescited by 2
- 2025Iterative Sampling Methods for Sinkhorn Distributionally Robust Optimizationcited by 1
- 2026Generative Neural Networks for Sinkhorn Distributionally Robust Hypothesis Testingcited by 0
- 2026Generative Neural Networks for Sinkhorn Distributionally Robust Hypothesis Testing24 Aug 2026
- 2025Iterative Sampling Methods for Sinkhorn Distributionally Robust Optimization14 Dec 2025
- 2024Gaussian Derivative Change-point Detection for Early Warnings of Industrial System Failures29 Oct 2024
- 2024Robust Kernel Hypothesis Testing under Data Corruption30 May 2024
- 2024Statistical and Computational Guarantees of Kernel Max-Sliced Wasserstein Distances24 May 2024
- 2024Non-Convex Robust Hypothesis Testing using Sinkhorn Uncertainty Sets21 Mar 2024
- 2023Flow-based Distributionally Robust Optimization30 Oct 2023
- 2023Exact Generalization Guarantees for (Regularized) Wasserstein Distributionally Robust Models26 May 2023
- 2022Kernel Robust Hypothesis Testing23 Mar 2022