SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Competitive Gradient Descent
4 references·0 citing·23 second hopsampled
Competitive Gradient Descent (2019)Competitive Gradient DescentOnline Learning with Predictable Sequences (2012)Online Learning with Predicta…Theory and Applications of Robust Optimization (2010)Theory and Applications of Ro…Gradient-Based Algorithms for Finding Nash Equilibria in Extensive Form Games (2007)Gradient-Based Algorithms for…Convex Repeated Games and Fenchel Duality (2007)Convex Repeated Games and Fen…Adaptive Game Playing Using Multiplicative Weights (1999)Playing large games using simple strategies (2003)Internet and Network Economics (2005)First-order algorithm with O(ln(1/ε )) convergence for ε -equilibrium in two-person zero-sum games (2008)Computing pure Bayesian-Nash equilibria in games with finite actions and continuous types (2012)Near-optimal no-regret algorithms for zero-sum games (2014)The Nonstochastic Multiarmed Bandit Problem (2002)Efficient algorithms for online decision problems (2004)Prediction, Learning, and Games (2006)Fast Convergence of Regularized Learning in Games (2015)Adaptive Online Learning in Dynamic Environments (2018)Online Learning: A Modern Introduction Using Convex Optimization (2019)CAPITAL ASSET PRICES: A THEORY OF MARKET EQUILIBRIUM UNDER CONDITIONS OF RISK* (1964)Coherent Measures of Risk (1999)Introduction to Stochastic Programming (2011)Recent advances in robust optimization: An overview (2013)Solving two-stage robust optimization problems using a column-and-constraint generation method (2013)Distributionally Robust Convex Optimization (2014)A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting (1997)Online convex programming and generalized infinitesimal gradient ascent (2003)Mind the Duality Gap: Logarithmic regret algorithms for online optimization (2008)No-regret learning in convex games (2008)Blackwell Approachability and No-Regret Learning are Equivalent (2011)
this work references cited by second hop· second hop is a sample of the most-cited connections

References

  • 2010Theory and Applications of Robust Optimization2,515 cited
  • 2012Online Learning with Predictable Sequences159 cited
  • 2007Convex Repeated Games and Fenchel Duality92 cited
  • 2007Gradient-Based Algorithms for Finding Nash Equilibria in Extensive Form Games53 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