Semi-supervised Learning based on Distributionally Robust Optimization
Not on the map. Why?
Abstract (arXiv)
We propose a novel method for semi-supervised learning (SSL) based on data-driven distributionally robust optimization (DRO) using optimal transport metrics. Our proposed method enhances generalization error by using the unlabeled data to restrict the support of the worst case distribution in our DRO formulation. We enable the implementation of our DRO formulation by proposing a stochastic gradient descent algorithm which allows to easily implement the training procedure. We demonstrate that our Semi-supervised DRO method is able to improve the generalization error over natural supervised procedures and state-of-the-art SSL estimators. Finally, we include a discussion on the large sample behavior of the optimal uncertainty region in the DRO formulation. Our discussion exposes important aspects such as the role of dimension reduction in SSL.
Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). First posted on arXiv 28 Feb 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 1; 2023: 5; 2024: 2; 2025: 2.
12 papers.
- 2021Sinkhorn Distributionally Robust Optimizationcited by 38
- 2022A Unified Wasserstein Distributional Robustness Framework for Adversarial Trainingcited by 36
- 2021Stochastic Bias-Reduced Gradient Methodscited by 25
- 2023Flow-based Distributionally Robust Optimizationcited by 13
- 2023Exact Generalization Guarantees for (Regularized) Wasserstein Distributionally Robust Modelscited by 9
- 2023Wasserstein Distributionally Robust Policy Evaluation and Learning for Contextual Banditscited by 9
- 2023Optimal Transport Model Distributional Robustnesscited by 5
- 2024Toward Robust Neural Reconstruction from Sparse Point Setscited by 5
- 2023Out-Of-Domain Unlabeled Data Improves Generalizationcited by 3
- 2024An Inexact Halpern Iteration with Application to Distributionally Robust Optimizationcited by 2
- 2025A stochastic smoothing framework for nonconvex-nonconcave minEmax problems with applications to Wasserstein distributionally robust optimizationcited by 1
- 2025Duality and Policy Evaluation in Distributionally Robust Bayesian Diffusion Controlcited by 0
- 2025Duality and Policy Evaluation in Distributionally Robust Bayesian Diffusion Control24 Jun 2025
- 2025A stochastic smoothing framework for nonconvex-nonconcave minEmax problems with applications to Wasserstein distributionally robust optimization24 Feb 2025
- 2024Toward Robust Neural Reconstruction from Sparse Point Sets20 Dec 2024
- 2024An Inexact Halpern Iteration with Application to Distributionally Robust Optimization8 Feb 2024
- 2023Flow-based Distributionally Robust Optimization30 Oct 2023
- 2023Out-Of-Domain Unlabeled Data Improves Generalization29 Sep 2023
- 2023Wasserstein Distributionally Robust Policy Evaluation and Learning for Contextual Bandits15 Sep 2023
- 2023Optimal Transport Model Distributional Robustness7 Jun 2023
- 2023Exact Generalization Guarantees for (Regularized) Wasserstein Distributionally Robust Models26 May 2023
- 2022A Unified Wasserstein Distributional Robustness Framework for Adversarial Training27 Feb 2022
- 2021Sinkhorn Distributionally Robust Optimization24 Sep 2021
- 2021Stochastic Bias-Reduced Gradient Methods17 Jun 2021