SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Online Prediction under Submodular Constraints
8 references·0 citing·18 second hop
Online Prediction under Submodular Constraints (2012)Online Prediction under Submodular Constr…Combinatorial bandits (2012)Combinatorial banditsThe Convex Optimization Approach to Regret Minimization (2011)The Convex Optimization Appro…Hedging structured concepts (2010)Hedging structured conceptsLearning Permutations with Exponential Weights (2009)Learning Permutations with Ex…Randomized Online PCA Algorithms with Regret Bounds that are Logarithmic in the Dimension (2008)Randomized Online PCA Algorit…Efficient algorithms for online decision problems (2004)Efficient algorithms for onli…Online convex programming and generalized infinitesimal gradient ascent (2003)Online convex programming and…A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting (1997)A Decision-Theoretic Generali…Contributions to the Theory of Games (1952)An analog of the minimax theorem for vector payoffs (1956)Contributions to the theory of games. (1960)Survey on speech emotion recognition: Features, classification schemes, and databases (2010)How to use expert advice (1997)Prediction, Learning, and Games (2006)Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (2012)Introduction to Multi-Armed Bandits (2019)Exponentiated Gradient versus Gradient Descent for Linear Predictors (1997)The Theory of Learning in Games (1998)A Simple Adaptive Procedure Leading to Correlated Equilibrium (2000)Online Learning and Online Convex Optimization (2011)Introduction to Online Convex Optimization (2016)The Nonstochastic Multiarmed Bandit Problem (2002)Bandit Algorithms (2020)Online Learning and Online Convex Optimization (2012)Introduction to Online Optimization (2011)Efficient Market Making via Convex Optimization, and a Connection to Online Learning (2013)
this work references cited by second hop

References

  • 1997A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting20,503 cited
  • 2003Online convex programming and generalized infinitesimal gradient ascent1,789 cited
  • 2004Efficient algorithms for online decision problems601 cited
  • 2012Combinatorial bandits354 cited
  • 2008Randomized Online PCA Algorithms with Regret Bounds that are Logarithmic in the Dimension121 cited
  • 2010Hedging structured concepts83 cited
  • 2009Learning Permutations with Exponential Weights77 cited
  • 2011The Convex Optimization Approach to Regret Minimization41 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