Fetching the paper…
Reading the bibliography…
Linear bandit algorithms yield $\tilde{\mathcal{O}}(n\sqrt{T})$ pseudo-regret bounds on compact convex action sets $\mathcal{K}\subset\mathbb{R}^n$ and two types of structural assumptions lead to better pseudo-regret bounds.
“Existence theorems and convergence of minimizing sequences for extremal problems with constraints”
Boris Polyak · 1966
Earlier work this paper cites.
“Approximate Methods in Optimization Problems”
V.. Demyanov and A.. Rubinov · 1970
Earlier work this paper cites.
“Rates of convergence for conditional gradient algorithms near singular and nonsingular extremals”
Joseph Dunn · 1979
Earlier work this paper cites.
“Topological vector spaces”
Gottfried Köthe · 1983
Earlier work this paper cites.
“Uniformly convex functions on Banach spaces”
J. Borwein, A. Guirao, Petr. Hájek and J. Vanderwerff · 2009
Earlier work this paper cites.
“Beating SGD: learning SVMs in sublinear time”
Elad Hazan, Tomer Koren and Nathan Srebro · 2011
Earlier work this paper cites.
“On the universality of online mirror descent”
Nati Srebro, Karthik Sridharan and Ambuj Tewari · 2011
Earlier work this paper cites.
“Improved regret guarantees for online smooth convex optimization with bandit feedback”
Ankan Saha and Ambuj Tewari · 2011
Earlier work this paper cites.
“Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems”
Sébastien Bubeck and Nicolo Cesa-Bianchi · 2012
Earlier work this paper cites.
“Sublinear optimization for machine learning”
Kenneth Clarkson, Elad Hazan and David Woodruff · 2012
Earlier work this paper cites.
“Bandit Convex Optimization: Towards Tight Bounds.”
Elad Hazan and Kfir Levy · 2014
Earlier work this paper cites.
“Convex bodies: the Brunn–Minkowski theory”
Rolf Schneider · 2014
Earlier work this paper cites.
“On the Global Linear Convergence of Frank-Wolfe Optimization Variants”
Simon Lacoste-Julien and Martin Jaggi · 2015
Cited alongside, same era.
“Following the leader and fast rates in linear prediction: Curved constraint sets and other regularities”
Ruitong Huang, Tor Lattimore, András György and Csaba Szepesvári · 2016
Cited alongside, same era.
“Stochastic gradient methods for distributionally robust optimization with f-divergences”
Hongseok Namkoong and John Duchi · 2016
Cited alongside, same era.
“Online learning with a hint”
Ofer Dekel, Nika Haghtalab and Patrick Jaillet · 2017
Cited alongside, same era.
“Following the leader and fast rates in online linear prediction: Curved constraint sets and other regularities”
Ruitong Huang, Tor Lattimore, András György and Csaba Szepesvári · 2017
Cited alongside, same era.
“On equivalence of martingale tail bounds and deterministic regret inequalities”
“Adaptive sampling for stochastic risk-averse learning”
Sebastian Curi, Kfir Levy, Stefanie Jegelka and Andreas Krause · 2020
Later among the works it cites.
“Locally accelerated conditional gradients”
Jelena Diakonikolas, Alejandro Carderera and Sebastian Pokutta · 2020
Later among the works it cites.
“Revisiting Frank-Wolfe for polytopes: Strict complementary and sparsity”
Dan Garber · 2020
Later among the works it cites.
“Improved regret bounds for projection-free bandit convex optimization”
Dan Garber and Ben Kretzu · 2020
Later among the works it cites.
“Revisiting Projection-free Online Learning: the Strongly Convex Case”
Dan Garber and Ben Kretzu · 2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Alexander Rakhlin and Karthik Sridharan · 2017
Cited alongside, same era.
“Sparsity, variance and curvature in multi-armed bandits”
Sébastien Bubeck, Michael Cohen and Yuanzhi Li · 2018
Cited alongside, same era.
“Optimal affine-invariant smooth minimization algorithms”
Alexandre d’Aspremont, Cristobal Guzman and Martin Jaggi · 2018
Cited alongside, same era.
“Restarting Frank-Wolfe”
Thomas Kerdreux, Alexandre d’Aspremont and Sebastian Pokutta · 2019
Cited alongside, same era.
“Projection free online learning over smooth sets”
Kfir Levy and Andreas Krause · 2019
Cited alongside, same era.
“Online learning with imperfect hints”
Aditya Bhaskara, Ashok Cutkosky, Ravi Kumar and Manish Purohit · 2020
Cited alongside, same era.
“Online Linear Optimization with Many Hints”
Aditya Bhaskara, Ashok Cutkosky, Ravi Kumar and Manish Purohit · 2020
Cited alongside, same era.
Thomas Kerdreux, Lewis Liu, Simon Lacoste-Julien and Damien Scieur · 2020
Later among the works it cites.
“Accelerating conditional gradient methods”, 2020
Thomas Kerdreux · 2020
Later among the works it cites.
“Curvature of Feasible Sets in Offline and Online Optimization”
Marco Molinaro · 2020
Later among the works it cites.
“Parameter-free Locally Accelerated Conditional Gradients”
Alejandro Carderera, Jelena Diakonikolas, Cheuk Lin and Sebastian Pokutta · 2021
Closest in time.
“Complexity of Linear Minimization and Projection on Some Sets”
Cyrille Combettes and Sebastian Pokutta · 2021
Closest in time.
“Local and Global Uniform Convexity Conditions”
Thomas Kerdreux, Alexandre d’Aspremont and Sebastian Pokutta · 2021
Closest in time.
“Projection-Free Optimization on Uniformly Convex Sets”
Thomas Kerdreux, Alexandre d’Aspremont and Sebastian Pokutta · 2021
Closest in time.