SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
The Convex Optimization Approach to Regret Minimization
0 references·2 citing·9 second hop
The Convex Optimization Approach to Regret Minimization (2011)The Convex Optimization Approach to Regre…Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (2012)Regret Analysis of Stochastic…Online Prediction under Submodular Constraints (2012)Online Prediction under Submo…A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting (1997)Online convex programming and generalized infinitesimal gradient ascent (2003)Efficient algorithms for online decision problems (2004)A Stochastic Approximation Method (1951)Finite-time Analysis of the Multiarmed Bandit Problem (2002)Prediction, Learning, and Games (2006)Taking the Human Out of the Loop: A Review of Bayesian Optimization (2015)Introduction to Online Convex Optimization (2016)Introduction to Online Convex Optimization (2016)
this work references cited by second hop

References

No references inside the corpus for this window.

Cited by

  • 2012Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems1,483 cited
  • 2012Online Prediction under Submodular Constraints32 cited

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work