Abstract
We propose an approach to the construction of robust non-Euclidean iterative algorithms by convex composite stochastic optimization based on truncation of stochastic gradients. For such algorithms, we establish sub-Gaussian confidence bounds under weak assumptions about the tails of the noise distribution in convex and strongly convex settings. Robust estimates of the accuracy of general stochastic algorithms are also proposed.
| Original language | English |
|---|---|
| Pages (from-to) | 1607-1627 |
| Number of pages | 21 |
| Journal | Automation and Remote Control |
| Volume | 80 |
| Issue number | 9 |
| DOIs | |
| Publication status | Published - 1 Sept 2019 |
| Externally published | Yes |
Keywords
- convex composite stochastic optimization
- mirror descent method
- robust confidence sets
- robust iterative algorithms
- stochastic optimization algorithms