scientific article; zbMATH DE number 7370566
From MaRDI portal
Damek Davis, Junyu Zhang, Lin Xiao, Dmitriy Drusvyatskiy
Publication date: 9 July 2021
Full work available at URL: https://arxiv.org/abs/1907.13307
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
stochastic approximationproximal point methodempirical risk minimizationcomposite optimizationrobust distance estimation
Related Items
Gradient-free methods for non-smooth convex stochastic optimization with heavy-tailed noise on convex compact, Nonlinear Gradient Mappings and Stochastic Optimization: A General Framework with Applications to Heavy-Tail Noise
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Geometric median and robust estimation in Banach spaces
- Smooth minimization of non-smooth functions
- On the estimation of the mean of a random vector
- Robust linear least squares regression
- Lectures on convex optimization
- Random generation of combinatorial structures from a uniform distribution
- The space complexity of approximating the frequency moments
- Sub-Gaussian estimators of the mean of a random vector
- An optimal randomized incremental gradient method
- Challenging the empirical mean and empirical variance: a deviation study
- Algorithms of robust stochastic optimization based on mirror descent method
- Risk minimization by median-of-means tournaments
- Confidence level solutions for stochastic programming
- Smoothing and First Order Methods: A Unified Framework
- Deterministic and stochastic primal-dual subgradient algorithms for uniformly convex minimization
- An optimal algorithm for stochastic strongly-convex optimization
- Robust Stochastic Approximation Approach to Stochastic Programming
- Acceleration of Stochastic Approximation by Averaging
- Monotone Operators and the Proximal Point Algorithm
- On convergence rates of subgradient optimization methods
- Stochastic Methods for Composite and Weakly Convex Optimization Problems
- First-Order Methods in Optimization
- Stochastic Model-Based Minimization of Weakly Convex Functions
- 10.1162/153244302760200704
- 10.1162/153244303321897690
- Optimal Stochastic Approximation Algorithms for Strongly Convex Stochastic Composite Optimization I: A Generic Algorithmic Framework
- The importance of better models in stochastic optimization
- Proximally Guided Stochastic Subgradient Method for Nonsmooth, Nonconvex Problems
- Stochastic (Approximate) Proximal Point Methods: Convergence, Optimality, and Adaptivity
- Bandits With Heavy Tail
- Optimal Stochastic Approximation Algorithms for Strongly Convex Stochastic Composite Optimization, II: Shrinking Procedures and Optimal Algorithms
- Understanding Machine Learning
- Proximité et dualité dans un espace hilbertien
- Robust Accelerated Gradient Methods for Smooth Strongly Convex Functions
- Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization
