articleJan 1, 2010Closed access

Adaptive Subgradient Methods for Online Learning and Stochastic Optimization

University of California, Berkeley · Princeton University · +2 more institutions

Abstract

Stochastic subgradient methods are widely used, well analyzed, and constitute effective tools for optimization and online learning. Stochastic gradient methods ’ popularity and appeal are largely due to their simplicity, as they largely follow predetermined procedural schemes. However, most common subgradient approaches are oblivious to the characteristics of the data being observed. We present a new family of subgradient methods that dynamically incorporate knowledge of the geometry of the data observed in earlier iterations to perform more informative gradient-based learning. The adaptation, in essence, allows us to find needles in haystacks in the form of very predictive but rarely seenfeatures.…

Citation impact

8,624
total citations
FWCI
50.33
Percentile
100%
References
47
Citations per year

Authors

3

Topics & keywords

Keywords
  • Subgradient method
  • Regret
  • Computer science
  • Regularization (linguistics)
  • Mathematical optimization
  • Empirical risk minimization
  • Artificial intelligence
  • Hindsight bias
No related works found for this paper.