Fetching the paper…
Reading the bibliography…
One of the beauties of the projected gradient descent method lies in its rather simple mechanism and yet stable behavior with inexact, stochastic gradients, which has led to its wide-spread use in many machine learning applications.
An algorithm for quadratic programming
Marguerite Frank and Philip Wolfe · 1956
Earlier work this paper cites.
Optimal approximation for the submodular welfare problem in the value oracle model
Jan Vondrák · 2008
Earlier work this paper cites.
Maximizing a monotone submodular function subject to a matroid constraint
Gruia Calinescu, Chandra Chekuri, Martin Pál, and Jan Vondrák · 2011
Earlier work this paper cites.
Projection-free online learning
Elad Hazan and Satyen Kale · 2012
Earlier work this paper cites.
Determinantal point processes for machine learning
Alex Kulesza, Ben Taskar, et al · 2012
Earlier work this paper cites.
Revisiting frank-wolfe: Projection-free sparse convex optimization
Martin Jaggi · 2013
Earlier work this paper cites.
Accelerating stochastic gradient descent using predictive variance reduction
Rie Johnson and Tong Zhang · 2013
Earlier work this paper cites.
Submodular function maximization via the multilinear relaxation and contention resolution schemes
Chandra Chekuri, Jan Vondrák, and Rico Zenklusen · 2014
Earlier work this paper cites.
Submodular functions: from discrete to continous domains
Francis Bach · 2015
Earlier work this paper cites.
A distributed frank-wolfe algorithm for communication-efficient sparse learning
Aurélien Bellet, Yingyu Liang, Alireza Bagheri Garakani, Maria-Florina Balcan, and Fei Sha · 2015
Earlier work this paper cites.
Faster rates for the frank-wolfe method over strongly-convex sets
Dan Garber and Elad Hazan · 2015
Earlier work this paper cites.
On the global linear convergence of frank-wolfe optimization variants
Simon Lacoste-Julien and Martin Jaggi · 2015
Earlier work this paper cites.
Variance reduction for faster non-convex optimization
Zeyuan Allen-Zhu and Elad Hazan · 2016
Cited alongside, same era.
Variance-reduced and projection-free stochastic optimization
Elad Hazan and Haipeng Luo · 2016
Cited alongside, same era.
Convergence rate of frank-wolfe for non-convex objectives
Simon Lacoste-Julien · 2016
Cited alongside, same era.
D-fw: Communication efficient distributed algorithms for high-dimensional sparse optimization
Jean Lafond, Hoi-To Wai, and Eric Moulines · 2016
Cited alongside, same era.
Conditional gradient sliding for convex optimization
G. Lan and Y. Zhou · 2016
Cited alongside, same era.
Stochastic frank-wolfe methods for nonconvex optimization
Sashank J Reddi, Suvrit Sra, Barnabás Póczos, and Alex Smola · 2016
On the ineffectiveness of variance reduced optimization for deep learning
Aaron Defazio and Léon Bottou · 2018
Later among the works it cites.
Spider: Near-optimal non-convex optimization via stochastic path-integrated differential estimator
Cong Fang, Chris Junchi Li, Zhouchen Lin, and Tong Zhang · 2018
Later among the works it cites.
Towards gradient free and projection free stochastic optimization
Anit Kumar Sahu, Manzil Zaheer, and Soummya Kar · 2018
Later among the works it cites.
Reinforcement learning: An introduction
Richard S Sutton and Andrew G Barto · 2018
Later among the works it cites.
A distributed frank–wolfe framework for learning low-rank matrices with the trace norm
Wenjie Zheng, Aurélien Bellet, and Patrick Gallinari · 2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Parallel and distributed block-coordinate frank-wolfe algorithms
Yu-Xiang Wang, Veeranjaneyulu Sadhanala, Wei Dai, Willie Neiswanger, Suvrit Sra, and Eric Xing · 2016
Cited alongside, same era.
Lazifying conditional gradient algorithms
Gábor Braun, Sebastian Pokutta, and Daniel Zink · 2017
Cited alongside, same era.
Gradient methods for submodular maximization
Hamed Hassani, Mahdi Soltanolkotabi, and Amin Karbasi · 2017
Cited alongside, same era.
Robust budget allocation via continuous submodular functions
Matthew Staib and Stefanie Jegelka · 2017
Cited alongside, same era.
Optimal dr-submodular maximization and applications to provable mean field inference
An Bian, Joachim M Buhmann, and Andreas Krause · 2018
Cited alongside, same era.
Online continuous submodular maximization
Lin Chen, Hamed Hassani, and Amin Karbasi · 2018
Cited alongside, same era.
Dongruo Zhou, Pan Xu, and Quanquan Gu · 2018
Later among the works it cites.
Black box submodular maximization: Discrete and continuous settings
Lin Chen, Mingrui Zhang, Hamed Hassani, and Amin Karbasi · 2019
Closest in time.
Momentum-based variance reduction in non-convex sgd
Ashok Cutkosky and Francesco Orabona · 2019
Closest in time.
Stochastic conditional gradient++
Hamed Hassani, Amin Karbasi, Aryan Mokhtari, and Zebang Shen · 2019
Closest in time.
Conditional gradient methods via stochastic path-integrated differential estimator
Alp Yurtsever, Suvrit Sra, and Volkan Cevher · 2019
Closest in time.
Quantized frank-wolfe: Communication-efficient distributed optimization
Mingrui Zhang, Lin Chen, Aryan Mokhtari, Hamed Hassani, and Amin Karbasi · 2019
Closest in time.