A stochastic subgradient method for distributionally robust non-convex and non-smooth learning
From MaRDI portal
Publication:2159458
DOI10.1007/s10957-022-02063-6zbMath1492.90103arXiv2006.04873OpenAlexW4284970065MaRDI QIDQ2159458
Landi Zhu, Mert Gürbüzbalaban, Ruszczyński, Andrzej
Publication date: 1 August 2022
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2006.04873
risk measuresnon-smooth optimizationrobust learningstochastic subgradient methodcomposition optimization
Related Items
Uses Software
Cites Work
- Models and algorithms for distributionally robust least squares problems
- Stochastic compositional gradient descent: algorithms for minimizing compositions of expected-value functions
- Learning models with uniform performance via distributionally robust optimization
- A robust approach based on conditional value-at-risk measure to statistical learning problems
- From stochastic dominance to mean-risk models: Semideviations as risk measures
- Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations
- The landscape of empirical risk for nonconvex losses
- Convergence of a stochastic subgradient method with averaging for nonsmooth nonconvex constrained optimization
- Statistical estimation of composite risk functionals and risk optimization problems
- Coherent Measures of Risk
- Curves of Descent
- Computationally Tractable Counterparts of Distributionally Robust Constraints on Risk Measures
- A Linearization Method for Nonsmooth Stochastic Programming Problems
- Lectures on Stochastic Programming
- Generalized Gradients and Applications
- Semismooth and Semiconvex Functions in Constrained Optimization
- Stochastic Methods for Composite and Weakly Convex Optimization Problems
- Stochastic Model-Based Minimization of Weakly Convex Functions
- Multilevel Stochastic Gradient Methods for Nested Composition Optimization
- Accelerating Stochastic Composition Optimization
- A Stochastic Subgradient Method for Nonsmooth Nonconvex Multilevel Composition Optimization
- A Single Timescale Stochastic Approximation Method for Nested Stochastic Optimization
- Optimization of Convex Risk Functions
- Optimal Stochastic Approximation Algorithms for Strongly Convex Stochastic Composite Optimization, II: Shrinking Procedures and Optimal Algorithms
- Sample Average Approximation Method for Compound Stochastic Optimization Problems
- Understanding Machine Learning
- A Stochastic Approximation Method
- Stochastic finance. An introduction in discrete time
- On consistency of stochastic dominance and mean-semideviation models
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
