SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
No-Regret Algorithms for Unconstrained Online Convex Optimization
5 references·0 citing·21 second hop
No-Regret Algorithms for Unconstrained Online Convex Optimization (2012)No-Regret Algorithms for Unconstrained On…Online Learning and Online Convex Optimization (2011)Online Learning and Online Co…Adaptive Bound Optimization for Online Convex Optimization (2010)Adaptive Bound Optimization f…On Stochastic and Worst-case Models for Investing (2009)On Stochastic and Worst-case …Algorithms for portfolio management based on the Newton method (2006)Algorithms for portfolio mana…Exponentiated Gradient versus Gradient Descent for Linear Predictors (1997)Exponentiated Gradient versus…Online convex programming and generalized infinitesimal gradient ascent (2003)Efficient algorithms for online decision problems (2004)Prediction, Learning, and Games (2006)A generalized online mirror descent with applications to classification and regression (2014)Adaptive algorithms for online convex optimization with long-term constraints (2016)Online Learning: A Modern Introduction Using Convex Optimization (2019)Asymptotic Optimality and Asymptotic Equipartition Properties of Log-Optimum Investment (1988)On‐Line Portfolio Selection Using Multiplicative Updates (1998)CORN (2011)PAMR: Passive aggressive mean reversion strategy for portfolio selection (2012)Moving average reversion strategy for on-line portfolio selection (2015)Some aspects of the sequential design of experiments (1952)The Nonstochastic Multiarmed Bandit Problem (2002)A general approach for predicting the behavior of the Supreme Court of the United States (2017)Théorie de la spéculation (1900)The Pricing of Options and Corporate Liabilities (1973)Brownian Motion and Stochastic Calculus (2007)Better Algorithms for Benign Bandits (2009)Online convex optimization in the bandit setting: gradient descent without a gradient (2004)Introduction to Online Convex Optimization (2016)Introduction to Online Convex Optimization (2016)
this work references cited by second hop

References

  • 2011Online Learning and Online Convex Optimization1,095 cited
  • 1997Exponentiated Gradient versus Gradient Descent for Linear Predictors856 cited
  • 2006Algorithms for portfolio management based on the Newton method239 cited
  • 2010Adaptive Bound Optimization for Online Convex Optimization228 cited
  • 2009On Stochastic and Worst-case Models for Investing33 cited

Cited by

No citing works inside the corpus for this window.

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