Fetching the paper…
Reading the bibliography…
This manuscript portrays optimization as a process.
Ifors’ operational research hall of fame: John von neumann
Saul I. Gass · 1909
Earlier work this paper cites.
A new method of solving some classes of extremal problems
L.V. Kantorovich · 1940
Earlier work this paper cites.
Theory of Games and Economic Behavior
John Von Neumann and Oskar Morgenstern · 1944
Earlier work this paper cites.
A stochastic approximation method
Herbert Robbins and Sutton Monro · 1951
Earlier work this paper cites.
Maximization of a Linear Function of Variables Subject to Linear Inequalities, in Activity Analysis of Production and Allocation , chapter XXI
G. B. Dantzig · 1951
Earlier work this paper cites.
Some aspects of the sequential design of experiments
Herbert Robbins · 1952
Earlier work this paper cites.
Controlled random walks
D. Blackwell · 1954
Earlier work this paper cites.
An algorithm for quadratic programming
M. Frank and P. Wolfe · 1956
Earlier work this paper cites.
An analog of the minimax theorem for vector payoffs
D. Blackwell · 1956
Earlier work this paper cites.
Approximation to bayes risk in repeated play
James Hannan · 1957
Earlier work this paper cites.
The perceptron: a probabilistic model for information storage and organization in the brain
Frank Rosenblatt · 1958
Earlier work this paper cites.
Brownian motion in the stock market
M. F. M. Osborne · 1959
Earlier work this paper cites.
Perceptrons: An Introduction to Computational Geometry
Marvin Minsky and Seymour Papert · 1969
Earlier work this paper cites.
The pricing of options and corporate liabilities
Fischer Black and Myron Scholes · 1973
Earlier work this paper cites.
Problem Complexity and Method Efficiency in Optimization
Arkadi S. Nemirovski and David B. Yudin · 1983
Earlier work this paper cites.
A theory of the learnable
L. G. Valiant · 1984
Earlier work this paper cites.
An interview with george b. dantzig: The father of linear programming
Donald J. Albers, Constance Reid, and George B. Dantzig · 1986
Earlier work this paper cites.
Relating data compression and learnability
Nick Littlestone and Manfred Warmuth · 1986
Earlier work this paper cites.
Introduction to optimization
Boris T. Polyak · 1987
Earlier work this paper cites.
The weighted majority algorithm
N. Littlestone and M. Warmuth · 1989
Earlier work this paper cites.
From on-line to batch learning
Nick Littlestone · 1989
Earlier work this paper cites.
Aggregating strategies
Volodimir G Vovk · 1990
Earlier work this paper cites.
The strength of weak learnability
Robert E. Schapire · 1990
Earlier work this paper cites.
Universal portfolios
Thomas Cover · 1991
Earlier work this paper cites.
A sherman-morrison-woodbury identity for rank augmenting matrices with application to centering
Kurt Riedel · 1991
Earlier work this paper cites.
A training algorithm for optimal margin classifiers
Bernhard E. Boser, Isabelle M. Guyon, and Vladimir N. Vapnik · 1992
Earlier work this paper cites.
Estimating the largest eigenvalue by the power and lanczos algorithms with a random start
Jacek Kuczyński and Henryk Woźniakowski · 1992
Earlier work this paper cites.
The Probabilistic Method
Noga Alon and Joel Spencer · 1992
Earlier work this paper cites.
The weighted majority algorithm
Nick Littlestone and Manfred K. Warmuth · 1994
Earlier work this paper cites.
Interior Point Polynomial Algorithms in Convex Programming
Y. E. Nesterov and A. S. Nemirovskii · 1994
Earlier work this paper cites.
An Introduction to Computational Learning Theory
Michael J. Kearns and Umesh V. Vazirani · 1994
Earlier work this paper cites.
Support-vector networks
Corinna Cortes and Vladimir Vapnik · 1995
Earlier work this paper cites.
Fast approximation algorithms for fractional packing and covering problems
Serge A. Plotkin, David B. Shmoys, and Éva Tardos · 1995
Earlier work this paper cites.
Boosting a weak learning algorithm by majority
Yoav Freund · 1995
Earlier work this paper cites.
Convex Analysis
R.T. Rockafellar · 1997
Earlier work this paper cites.
A decision-theoretic generalization of on-line learning and an application to boosting
Yoav Freund and Robert E. Schapire · 1997
Earlier work this paper cites.
Exponentiated gradient versus gradient descent for linear predictors
Jyrki Kivinen and Manfred K. Warmuth · 1997
Earlier work this paper cites.
Introduction to Linear Optimization
Dimitris Bertsimas and John Tsitsiklis · 1997
Earlier work this paper cites.
Live-and-die coding for binary piecewise i.i.d. sources
F.M.J. Willems and M. Krom · 1997
Earlier work this paper cites.
Online learning and stochastic approximations
Léon Bottou · 1998
Earlier work this paper cites.
Statistical Learning Theory
Vladimir N. Vapnik · 1998
Earlier work this paper cites.
Tracking the best expert
Mark Herbster and Manfred K. Warmuth · 1998
Earlier work this paper cites.
Switching portfolios
Yoram Singer · 1998
Earlier work this paper cites.
Asymptotic calibration
D. P Foster and R. V Vohra · 1998
Earlier work this paper cites.
Universal portfolios with and without transaction costs
Avrim Blum and Adam Kalai · 1999
Earlier work this paper cites.
Averaging expert predictions
Jyrki Kivinen and ManfredK. Warmuth · 1999
Earlier work this paper cites.
Adaptive game playing using multiplicative weights
Yoav Freund and Robert E. Schapire · 1999
Earlier work this paper cites.
A simple adaptive procedure leading to correlated equilibrium
Sergiu Hart and Andreu Mas-Colell · 2000
Earlier work this paper cites.
Relative loss bounds for on-line density estimation with the exponential family of distributions
Katy S. Azoury and M. K. Warmuth · 2001
Earlier work this paper cites.
General convergence results for linear discriminant updates
A. Grove, N. Littlestone, and D. Schuurmans · 2001
Earlier work this paper cites.
Relative loss bounds for multidimensional regression problems
Jyrki Kivinen and Manfred K. Warmuth · 2001
Earlier work this paper cites.
A conversation with Leo Breiman
Richard Olshen · 2001
Earlier work this paper cites.
Agnostic boosting
Shai Ben-David, Philip M Long, and Yishay Mansour · 2001
Earlier work this paper cites.
Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond
Bernhard Schölkopf and Alexander J. Smola · 2002
Earlier work this paper cites.
Stochastic gradient boosting
Jerome H Friedman · 2002
Earlier work this paper cites.
Online convex programming and generalized infinitesimal gradient ascent
Martin Zinkevich · 2003
Earlier work this paper cites.
Efficient algorithms for universal portfolios
Adam Kalai and Santosh Vempala · 2003
Earlier work this paper cites.
The nonstochastic multiarmed bandit problem
Peter Auer, Nicolò Cesa-Bianchi, Yoav Freund, and Robert E. Schapire · 2003
Earlier work this paper cites.
The empirical bayes envelope and regret minimization in competitive markov decision processes
S. Mannor and N. Shimkin · 2003
Earlier work this paper cites.
Tracking a small set of experts by mixing past posteriors
Olivier Bousquet and Manfred K. Warmuth · 2003
Earlier work this paper cites.
Convex Optimization
S. Boyd and L. Vandenberghe · 2004
Earlier work this paper cites.
Introductory Lectures on Convex Optimization: A Basic Course
Y. Nesterov · 2004
Earlier work this paper cites.
Interior point polynomial time methods in convex programming, 2004
A.S. Nemirovskii · 2004
Earlier work this paper cites.
Learning with Matrix Factorizations
Nathan Srebro · 2004
Earlier work this paper cites.
Boosting in the presence of noise
Adam Tauman Kalai and Rocco A. Servedio · 2004
Earlier work this paper cites.
Efficient algorithms for online decision problems
Adam Kalai and Santosh Vempala · 2005
Earlier work this paper cites.
Online convex optimization in the bandit setting: Gradient descent without a gradient
Abraham Flaxman, Adam Tauman Kalai, and H. Brendan McMahan · 2005
Earlier work this paper cites.
Fast maximum margin matrix factorization for collaborative prediction
Jasson D. M. Rennie and Nathan Srebro · 2005
Earlier work this paper cites.
Data dependent concentration bounds for sequential prediction algorithms
Tong Zhang · 2005
Cited alongside, same era.
Tracking the best of many experts
András György, Tamás Linder, and Gábor Lugosi · 2005
Cited alongside, same era.
Prediction, Learning, and Games
Nicolò Cesa-Bianchi and Gábor Lugosi · 2006
Cited alongside, same era.
Convex Analysis and Nonlinear Optimization: Theory and Examples
J.M. Borwein and A.S. Lewis · 2006
Cited alongside, same era.
Efficient Algorithms for Online Convex Optimization and Their Applications
Elad Hazan · 2006
Cited alongside, same era.
Algorithms for portfolio management based on the newton method
Amit Agarwal, Elad Hazan, Satyen Kale, and Robert E. Schapire · 2006
Cited alongside, same era.
Boosting: Foundations and Algorithms
R.E. Schapire and Y. Freund · 2012
Later among the works it cites.
An online boosting algorithm with theoretical justifications
Shang-Tse Chen, Hsuan-Tien Lin, and Chi-Jen Lu · 2012
Later among the works it cites.
Stochastic gradient descent for non-smooth optimization: Convergence results and optimal averaging schemes
Ohad Shamir and Tong Zhang · 2013
Later among the works it cites.
Online markov decision processes under bandit feedback
Gergely Neu, András György, Csaba Szepesvári, and András Antos · 2013
Later among the works it cites.
Block-coordinate frank-wolfe optimization for structural svms
Simon Lacoste-Julien, Martin Jaggi, Mark W. Schmidt, and Patrick Pletscher · 2013
Later among the works it cites.
Revisiting frank-wolfe: Projection-free sparse convex optimization
Martin Jaggi · 2013
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Logarithmic regret algorithms for online convex optimization
Elad Hazan, Adam Kalai, Satyen Kale, and Amit Agarwal · 2006
Cited alongside, same era.
Online trading algorithms and robust option pricing
Peter DeMarzo, Ilan Kremer, and Yishay Mansour · 2006
Cited alongside, same era.
On the generalization ability of on-line learning algorithms
N. Cesa-Bianchi, A. Conconi, and C. Gentile · 2006
Cited alongside, same era.
Low-complexity sequential lossless coding for piecewise-stationary memoryless sources
G. I. Shamir and N. Merhav · 2006
Cited alongside, same era.
Logarithmic regret algorithms for online convex optimization
Elad Hazan, Amit Agarwal, and Satyen Kale · 2007
Cited alongside, same era.
Online linear optimization and adaptive routing
Baruch Awerbuch and Robert Kleinberg · 2007
Cited alongside, same era.
Later among the works it cites.
Playing non-linear games with linear oracles
Dan Garber and Elad Hazan · 2013
Later among the works it cites.
The equivalence of linear programs and zero-sum games
Ilan Adler · 2013
Later among the works it cites.
Online learning for time series prediction
Oren Anava, Elad Hazan, Shie Mannor, and Ohad Shamir · 2013
Later among the works it cites.
Theory of statistical learning and sequential prediction
Alexander Rakhlin and Karthik Sridharan · 2014
Later among the works it cites.
Lecture notes: Subgradient methods, January 2014
Stephen Boyd · 2014
Later among the works it cites.
Proximal algorithms
Neal Parikh and Stephen Boyd · 2014
Later among the works it cites.
Adam: A method for stochastic optimization
Diederik P Kingma and Jimmy Ba · 2014
Later among the works it cites.
Online linear optimization via smoothing
Jacob Abernethy, Chansoo Lee, Abhinav Sinha, and Ambuj Tewari · 2014
Later among the works it cites.
Distributed frank-wolfe algorithm: A unified framework for communication-efficient sparse learning
Aurélien Bellet, Yingyu Liang, Alireza Bagheri Garakani, Maria-Florina Balcan, and Fei Sha · 2014
Later among the works it cites.
Understanding Machine Learning: From Theory to Algorithms
Shai Shalev-Shwartz and Shai Ben-David · 2014
Later among the works it cites.
Boosting with online binary learners for the multiclass bandit problem
Shang-Tse Chen, Hsuan-Tien Lin, and Chi-Jen Lu · 2014
Later among the works it cites.
Convex optimization: Algorithms and complexity
Sébastien Bubeck · 2015
Later among the works it cites.
Fast rates in statistical and online learning
Tim van Erven, Peter D Grünwald, Nishant A Mehta, Mark D Reid, and Robert C Williamson · 2015
Later among the works it cites.
Bandit convex optimization: \ \backslash sqrtt regret in one dimension
Sébastien Bubeck, Ofer Dekel, Tomer Koren, and Yuval Peres · 2015
Later among the works it cites.
On the complexity of bandit linear optimization
Ohad Shamir · 2015
Later among the works it cites.
Randomized block krylov methods for stronger and faster approximate singular value decomposition
Cameron Musco and Christopher Musco · 2015
Later among the works it cites.
Intrinsic robustness of the price of anarchy
Tim Roughgarden · 2015
Later among the works it cites.
Non-stationary stochastic optimization
Omar Besbes, Yonatan Gur, and Assaf Zeevi · 2015
Later among the works it cites.
Strongly adaptive online learning
Amit Daniely, Alon Gonen, and Shai Shalev-Shwartz · 2015
Later among the works it cites.
Functional frank-wolfe boosting for general loss functions
Chu Wang, Yingfei Wang, Robert Schapire, et al · 2015
Later among the works it cites.
A survey on contextual multi-armed bandits
Li Zhou · 2015
Later among the works it cites.
Optimal black-box reductions between optimization objectives
Zeyuan Allen-Zhu and Elad Hazan · 2016
Later among the works it cites.
Complexity theoretic limitations on learning halfspaces
Amit Daniely · 2016
Later among the works it cites.
Deep Learning
Ian Goodfellow, Yoshua Bengio, and Aaron Courville · 2016
Later among the works it cites.
Perturbation techniques in online learning and optimization
Jacob Abernethy, Chansoo Lee, and Ambuj Tewari · 2016
Later among the works it cites.
An optimal algorithm for bandit convex optimization
Elad Hazan and Yuanzhi Li · 2016
Later among the works it cites.
Faster projection-free convex optimization over the spectrahedron
Dan Garber · 2016
Later among the works it cites.
Conditional gradient sliding for convex optimization
Guanghui Lan and Yi Zhou · 2016
Later among the works it cites.
Variance-reduced and projection-free stochastic optimization
Elad Hazan and Haipeng Luo · 2016
Later among the works it cites.
Lazysvd: even faster svd decomposition yet without agonizing pain
Zeyuan Allen-Zhu and Yuanzhi Li · 2016
Later among the works it cites.
Sample compression schemes for vc classes
Shay Moran and Amir Yehudayoff · 2016
Later among the works it cites.
On statistical learning via the lens of compression
Ofir David, Shay Moran, and Amir Yehudayoff · 2016
Later among the works it cites.
A closer look at adaptive regret
Dmitry Adamskiy, Wouter M Koolen, Alexey Chernov, and Vladimir Vovk · 2016
Later among the works it cites.
Bistro: An efficient relaxation-based method for contextual bandits
Alexander Rakhlin and Karthik Sridharan · 2016
Later among the works it cites.
An online convex optimization approach to blackwell’s approachability
Nahum Shimkin · 2016
Later among the works it cites.
A unified approach to adaptive regularization in online and stochastic optimization
Vineet Gupta, Tomer Koren, and Yoram Singer · 2017
Later among the works it cites.
Kernel-based methods for bandit convex optimization
Sébastien Bubeck, Yin Tat Lee, and Ronen Eldan · 2017
Later among the works it cites.
Linear convergence of a frank-wolfe type algorithm over trace-norm balls
Zeyuan Allen-Zhu, Elad Hazan, Wei Hu, and Yuanzhi Li · 2017
Later among the works it cites.
Nearest-neighbor sample compression: efficiency, consistency, infinite dimensions
Aryeh Kontorovich, Sivan Sabato, and Roi Weiss · 2017
Later among the works it cites.
Online multiclass boosting
Young Hun Jung, Jack Goetz, and Ambuj Tewari · 2017
Later among the works it cites.
A new perspective on boosting in linear regression via subgradient optimization and relatives
Robert M. Freund, Paul Grigas, and Rahul Mazumder · 2017
Later among the works it cites.
First-order methods in optimization
Amir Beck · 2017
Later among the works it cites.
Logistic regression: The importance of being improper
Dylan J Foster, Satyen Kale, Haipeng Luo, Mehryar Mohri, and Karthik Sridharan · 2018
Later among the works it cites.
Stochastic conditional gradient methods: From convex minimization to submodular maximization
Aryan Mokhtari, Hamed Hassani, and Amin Karbasi · 2018
Later among the works it cites.
Projection-free online optimization with stochastic gradient: From convexity to submodularity
Lin Chen, Christopher Harshaw, Hamed Hassani, and Amin Karbasi · 2018
Later among the works it cites.
Near-optimal sample compression for nearest neighbors
Lee-Ad Gottlieb, Aryeh Kontorovich, and Pinhas Nisnevitch · 2018
Later among the works it cites.
Dynamic regret of strongly adaptive methods
Lijun Zhang, Tianbao Yang, Zhi-Hua Zhou, et al · 2018
Later among the works it cites.
Online boosting algorithms for multi-label ranking
Young Hun Jung and Ambuj Tewari · 2018
Later among the works it cites.
Lecture notes: Optimization for machine learning
Elad Hazan · 2019
Closest in time.
Revisiting the polyak step size
Elad Hazan and Sham Kakade · 2019
Closest in time.
Stochastic recursive gradient-based methods for projection-free online learning
Jiahao Xie, Zebang Shen, Chao Zhang, Hui Qian, and Boyu Wang · 2019
Closest in time.
Mathematics and Computation: A Theory Revolutionizing Technology and Science
Avi Wigderson · 2019
Closest in time.
Sample compression for real-valued learners
Steve Hanneke, Aryeh Kontorovich, and Menachem Sadigurschi · 2019
Closest in time.
Adaptive regret of convex and smooth functions
Lijun Zhang, Tie-Yan Liu, and Zhi-Hua Zhou · 2019
Closest in time.
Boosting for dynamical systems
Naman Agarwal, Nataly Brukhim, Elad Hazan, and Zhou Lu · 2019
Closest in time.
A survey on practical applications of multi-armed and contextual bandits
Djallel Bouneffouf and Irina Rish · 2019
Closest in time.
Bandit algorithms
Tor Lattimore and Csaba Szepesvári · 2020
Closest in time.
Proper learning, helly number, and an optimal svm bound
Olivier Bousquet, Steve Hanneke, Shay Moran, and Nikita Zhivotovskiy · 2020
Closest in time.
Adaptive regret for control of time-varying dynamics
Paula Gradu, Elad Hazan, and Edgar Minasyan · 2020
Closest in time.
Online agnostic boosting via regret minimization, 2020
Nataly Brukhim, Xinyi Chen, Elad Hazan, and Shay Moran · 2020
Closest in time.
Online boosting with bandit feedback
Nataly Brukhim and Elad Hazan · 2020
Closest in time.
Boosting for online convex optimization, 2021
Elad Hazan and Karan Singh · 2021
Closest in time.