scientific article; zbMATH DE number 7370566
From MaRDI portal
Publication:4998940
Recommendations
- Confidence sets for discrete stochastic optimization
- Tight Bounds for Stochastic Convex Programs
- Uncertain convex programs: randomized solutions and confidence levels
- scientific article; zbMATH DE number 3956819
- Lower bounds for non-convex stochastic optimization
- Convex and stochastic optimization
- Stochastic Successive Convex Approximation for Non-Convex Constrained Stochastic Optimization
- A stochastic algorithm with optimal convergence rate for strongly convex optimization problems
- On optimal probabilities in stochastic coordinate descent methods
- Stochastic convexity and its applications
Cites work
- 10.1162/153244302760200704
- 10.1162/153244303321897690
- Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization
- Acceleration of Stochastic Approximation by Averaging
- Algorithms of robust stochastic optimization based on mirror descent method
- An optimal randomized incremental gradient method
- Bandits With Heavy Tail
- Beyond the regret minimization barrier: optimal algorithms for stochastic strongly-convex optimization
- Challenging the empirical mean and empirical variance: a deviation study
- Confidence level solutions for stochastic programming
- Deterministic and stochastic primal-dual subgradient algorithms for uniformly convex minimization
- Estimate sequences for stochastic composite optimization: variance reduction, acceleration, and robustness to noise
- First-order methods in optimization
- Geometric median and robust estimation in Banach spaces
- scientific article; zbMATH DE number 3790208 (Why is no real title available?)
- scientific article; zbMATH DE number 3341597 (Why is no real title available?)
- scientific article; zbMATH DE number 3359250 (Why is no real title available?)
- Lectures on convex optimization
- Loss minimization and parameter estimation with heavy tails
- Monotone Operators and the Proximal Point Algorithm
- On complexity of stochastic programming problems
- On convergence rates of subgradient optimization methods
- On the estimation of the mean of a random vector
- Optimal Stochastic Approximation Algorithms for Strongly Convex Stochastic Composite Optimization I: A Generic Algorithmic Framework
- Optimal stochastic approximation algorithms for strongly convex stochastic composite optimization. II: Shrinking procedures and optimal algorithms
- Proximally guided stochastic subgradient method for nonsmooth, nonconvex problems
- Proximité et dualité dans un espace hilbertien
- Random generation of combinatorial structures from a uniform distribution
- Risk minimization by median-of-means tournaments
- Robust accelerated gradient methods for smooth strongly convex functions
- Robust linear least squares regression
- Robust Stochastic Approximation Approach to Stochastic Programming
- Smooth minimization of non-smooth functions
- Smoothing and first order methods: a unified framework
- Stochastic (Approximate) Proximal Point Methods: Convergence, Optimality, and Adaptivity
- Stochastic Methods for Composite and Weakly Convex Optimization Problems
- Stochastic model-based minimization of weakly convex functions
- Sub-Gaussian estimators of the mean of a random vector
- The importance of better models in stochastic optimization
- The space complexity of approximating the frequency moments
- Understanding machine learning. From theory to algorithms
Cited in
(12)- 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
- From low probability to high confidence in stochastic convex optimization
- General procedure to provide high-probability guarantees for stochastic saddle point problems
- High probability bounds for stochastic subgradient schemes with heavy tailed noise]
- High-probability complexity bounds for non-smooth stochastic convex optimization with heavy-tailed noise
- Online distributed algorithms for aggregative games with stochastic costs over time-varying networks
- Accelerated gradient methods with biased gradient estimates: risk sensitivity, high-probability guarantees, and large deviation bounds
- Smoothed gradient clipping and error feedback for decentralized optimization under symmetric heavy-tailed noise
- Some unified theory for variance reduced prox-linear methods
- High-probability minimax lower bounds
- The price of adaptivity in stochastic convex optimization
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4998940)
