Wasserstein distributionally robust optimization and its tractable regularization formulation
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 469124 (Why is no real title available?)
- scientific article; zbMATH DE number 7306909 (Why is no real title available?)
- A highly efficient semismooth Newton augmented Lagrangian method for solving lasso problems
- A robust learning approach for regression models based on distributionally robust optimization
- A short and general duality proof for Wasserstein distributionally robust optimization
- A unified theory of robust and distributionally robust optimization via the primal-worst-equals-dual-best principle
- Ambiguous chance constrained problems and robust optimization
- An efficient Hessian based algorithm for solving large-scale sparse group Lasso problems
- Analysis of regularized least squares for functional linear regression model
- Calibrated asymmetric surrogate losses
- Data-driven chance constrained stochastic program
- Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations
- Distributionally Robust Convex Optimization
- Distributionally Robust Stochastic Optimization with Wasserstein Distance
- Distributionally robust optimization and its tractable approximations
- Distributionally robust optimization under moment uncertainty with application to data-driven problems
- Finite-Sample Guarantees for Wasserstein Distributionally Robust Optimization: Breaking the Curse of Dimensionality
- Functional data analysis.
- Functional linear model
- Higher moment coherent risk measures
- Measure theory
- Minimax and adaptive prediction for functional linear regression
- On Choosing and Bounding Probability Metrics
- On efficiently solving the subproblems of a level-set method for fused lasso problems
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Optimal Transport
- Oracle inequalities and optimal inference under group sparsity
- Quantifying distributional model risk via optimal transport
- Regression Quantiles
- Regularization via mass transportation
- Ridge Regression: Biased Estimation for Nonorthogonal Problems
- Robust 1-bit Compressed Sensing and Sparse Logistic Regression: A Convex Programming Approach
- Robust Wasserstein profile inference and applications to machine learning
- Robust regression: Asymptotics, conjectures and Monte Carlo
- Robust sample average approximation
- Sharp oracle inequalities for square root regularization
- Simultaneous analysis of Lasso and Dantzig selector
- Simultaneous feature selection and clustering based on square root optimization
- Solving the OSCAR and SLOPE models using a semismooth Newton-based augmented Lagrangian method
- Square-root lasso: pivotal recovery of sparse signals via conic programming
- The Group Square-Root Lasso: Theoretical Properties and Fast Algorithms
- Tight bounds for some risk measures, with applications to robust portfolio selection
- Wasserstein distributionally robust optimization and variation regularization
This page was built for publication: Wasserstein distributionally robust optimization and its tractable regularization formulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6874619)
