Algorithms of Robust Stochastic Optimization Based on Mirror Descent Method

A. V. Nazin, A. S. Nemirovsky, A. B. Tsybakov, A. B. Juditsky

Research output: Contribution to journalArticlepeer-review

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 languageEnglish
Pages (from-to)1607-1627
Number of pages21
JournalAutomation and Remote Control
Volume80
Issue number9
DOIs
Publication statusPublished - 1 Sept 2019
Externally publishedYes

Keywords

  • convex composite stochastic optimization
  • mirror descent method
  • robust confidence sets
  • robust iterative algorithms
  • stochastic optimization algorithms

Fingerprint

Dive into the research topics of 'Algorithms of Robust Stochastic Optimization Based on Mirror Descent Method'. Together they form a unique fingerprint.

Cite this