High probability bounds on AdaGrad for constrained weakly convex optimization

Artificial intelligence (68Txx) Mathematical programming (90Cxx) Numerical methods for mathematical programming, optimization and variational techniques (65Kxx)

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Robust principal component analysis?
A Stochastic Approximation Method
Robust Stochastic Approximation Approach to Stochastic Programming
Convex Analysis
Accelerated gradient methods for nonconvex nonlinear and stochastic programming
Stochastic First- and Zeroth-Order Methods for Nonconvex Stochastic Programming
AN OLD‐NEW CONCEPT OF CONVEX RISK MEASURES: THE OPTIMIZED CERTAINTY EQUIVALENT
On the Generalization Ability of On-Line Learning Algorithms
Stochastic generalized gradient method for nonconvex nonsmooth stochastic optimization
Online Regularized Classification Algorithms
Expected Utility, Penalty Functions, and Duality in Stochastic Nonlinear Programming
A Linearization Method for Nonsmooth Stochastic Programming Problems
Lectures on convex optimization
Optimization Methods for Large-Scale Machine Learning
Rates of convergence of randomized Kaczmarz algorithms in Hilbert spaces
Modified Fejér sequences and applications
Solving (most) of a set of quadratic equalities: composite optimization for robust phase retrieval
Stochastic Model-Based Minimization of Weakly Convex Functions
Efficiency of minimizing compositions of convex functions and smooth maps
Proximally Guided Stochastic Subgradient Method for Nonsmooth, Nonconvex Problems
The nonsmooth landscape of phase retrieval
Moreau envelope augmented Lagrangian method for nonconvex optimization with linear constraints
Convergence of online mirror descent
Lower bounds for non-convex stochastic optimization
Capacity dependent analysis for functional online learning algorithms

This page was built for publication: High probability bounds on AdaGrad for constrained weakly convex optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6649705)