SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Online Linear Optimization via Smoothing
14 references·0 citing·41 second hop
Online Linear Optimization via Smoothing (2014)Online Linear Optimization via SmoothingFollow the Leader with Dropout Perturbations (2014)Follow the Leader with Dropou…Efficient Market Making via Convex Optimization, and a Connection to Online Learning (2013)Efficient Market Making via C…Relax and Randomize : From Value to Algorithms (2012)Relax and Randomize : From Va…Random gradient-free minimization of convex functions (2011)Random gradient-free minimiza…Online Learning and Online Convex Optimization (2011)Online Learning and Online Co…On the Universality of Online Mirror Descent (2011)On the Universality of Online…Optimal Strategies and Minimax Lower Bounds for Online Convex Games (2008)Optimal Strategies and Minima…Adaptive Newton-based multivariate smoothed functional algorithms for simulation optimization (2007)Adaptive Newton-based multiva…Prediction, Learning, and Games (2006)Prediction, Learning, and Gam…Efficient algorithms for online decision problems (2004)Efficient algorithms for onli…Online convex programming and generalized infinitesimal gradient ascent (2003)Online convex programming and…On the Global Convergence of Stochastic Fictitious Play (2002)On the Global Convergence of …A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting (1997)A Decision-Theoretic Generali…Oddness of the Number of Equilibrium Points: A New Proof (1982)Oddness of the Number of Equi…Finite-time Analysis of the Multiarmed Bandit Problem (2002)Online Learning and Online Convex Optimization (2012)Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (2012)Theory of games and economic behavior (2019)Non-Cooperative Games (1951)Games with randomly disturbed payoffs: A new rationale for mixed-strategy equilibrium points (1973)The tracing procedure: A Bayesian approach to defining a solution forn-person noncooperative games (1975)Evolutionary stability in extensive two-person games (1983)Bargaining with Two-sided Incomplete Information: An Infinite Horizon Model with Alternating Offers (1987)Non-cooperative games (1989)Some aspects of the sequential design of experiments (1952)The Nonstochastic Multiarmed Bandit Problem (2002)Introduction to Online Convex Optimization (2016)Introduction to Online Convex Optimization (2016)A general approach for predicting the behavior of the Supreme Court of the United States (2017)Econometric Models of Probabilistic Choice (1981)Discrete Choice Theory of Product Differentiation (1992)Uncoupled Dynamics Do Not Lead to Nash Equilibrium (2003)Stochastic Approximations and Differential Inclusions (2005)Autonomous Vehicle-Target Assignment: A Game-Theoretical Formulation (2007)The Economy as an Evolving Complex System II (2018)Exponentiated Gradient versus Gradient Descent for Linear Predictors (1997)Online Learning: Theory, Algorithms, and Applications (2007)Online Optimization with Gradual Variations (2012)Towards minimax policies for online linear optimization with bandit feedback (2012)Beyond UCB: Optimal and Efficient Contextual Bandits with Regression Oracles (2020)The Theory of Learning in Games (1998)Ad click prediction (2013)Contributions to the theory of games. (1960)How to use expert advice (1997)Algorithms for portfolio management based on the Newton method (2006)Combinatorial bandits (2012)From Bandits to Monte-Carlo Tree Search: The Optimistic Principle Applied to Optimization and Planning (2014)Logarithmic Regret Algorithms for Online Convex Optimization (2006)Mind the Duality Gap: Logarithmic regret algorithms for online optimization (2008)A Stochastic View of Optimal Regret through Minimax Duality (2009)Online Learning: Beyond Regret (2010)Survey on speech emotion recognition: Features, classification schemes, and databases (2010)(Bandit) Convex Optimization with Biased Noisy Gradient Oracles (2016)Bandit Convex Optimization with Biased Noisy Gradient Oracles (2017)Learning Generalized Nash Equilibria in a Class of Convex Games (2018)
this work references cited by second hop

References

  • 1997A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting20,469 cited
  • 2006Prediction, Learning, and Games3,176 cited
  • 2003Online convex programming and generalized infinitesimal gradient ascent1,733 cited
  • 2011Online Learning and Online Convex Optimization1,095 cited
  • 2004Efficient algorithms for online decision problems595 cited
  • 2002On the Global Convergence of Stochastic Fictitious Play407 cited
  • 1982Oddness of the Number of Equilibrium Points: A New Proof176 cited
  • 2011On the Universality of Online Mirror Descent139 cited
  • 2008Optimal Strategies and Minimax Lower Bounds for Online Convex Games105 cited
  • 2011Random gradient-free minimization of convex functions89 cited
  • 2013Efficient Market Making via Convex Optimization, and a Connection to Online Learning75 cited
  • 2007Adaptive Newton-based multivariate smoothed functional algorithms for simulation optimization52 cited
  • 2012Relax and Randomize : From Value to Algorithms40 cited
  • 2014Follow the Leader with Dropout Perturbations39 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