Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Ergodic mirror descent
KTH, School of Electrical Engineering (EES), Automatic Control.
2011 (English)In: Annual Allerton Conference on Communication, Control, and Computing, 2011, 701-706 p.Conference paper, Published paper (Refereed)
Abstract [en]

We generalize stochastic subgradient methods to situations in which we do not receive independent samples from the distribution over which we optimize, but instead receive samples that are coupled over time. We show that as long as the source of randomness is suitably ergodic - it converges quickly enough to a stationary distribution - the method enjoys strong convergence guarantees, both in expectation and with high probability. This result has implications for high-dimensional stochastic optimization, peer-to-peer distributed optimization schemes, and stochastic optimization problems over combinatorial spaces.

Place, publisher, year, edition, pages
2011. 701-706 p.
Keyword [en]
Distributed optimization, Ergodics, High probability, High-dimensional, Peer to peer, Stationary distribution, Stochastic optimization problems, Stochastic optimizations, Strong convergence, Subgradient methods, Communication, Probability distributions, Stochastic systems, Optimization
National Category
Computational Mathematics
Identifiers
URN: urn:nbn:se:kth:diva-149919DOI: 10.1109/Allerton.2011.6120236Scopus ID: 2-s2.0-84856096317ISBN: 9781457718168 (print)OAI: oai:DiVA.org:kth-149919DiVA: diva2:742227
Conference
2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011, 28 September 2011 through 30 September 2011, Monticello, IL
Note

QC 20140901

Available from: 2014-09-01 Created: 2014-08-28 Last updated: 2014-09-01Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Johansson, Mikael
By organisation
Automatic Control
Computational Mathematics

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 30 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf