Fetching the paper…
Reading the bibliography…
Gradient descent, when applied to the task of logistic regression, outputs iterates which are biased to follow a unique ray defined by the data.
On convergence proofs on perceptrons
Albert B.J. Novikoff · 1962
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.
Convex Analysis and Nonlinear Optimization
Jonathan Borwein and Adrian Lewis · 2000
Earlier work this paper cites.
Fundamentals of Convex Analysis
Jean-Baptiste Hiriart-Urruty and Claude Lemaréchal · 2001
Earlier work this paper cites.
Introductory Lectures on Convex Optimization: A Basic Course
Yurii Nesterov · 2004
Earlier work this paper cites.
Logarithmic regret algorithms for online convex optimization
Elad Hazan, Amit Agarwal, and Satyen Kale · 2007
Earlier work this paper cites.
The convergence rate of AdaBoost
Indraneel Mukherjee, Cynthia Rudin, and Robert Schapire · 2011
Earlier work this paper cites.
Boosting: Foundations and Algorithms
Robert E. Schapire and Yoav Freund · 2012
Cited alongside, same era.
No-regret algorithms for unconstrained online convex optimization
Matthew Streeter and Brendan McMahan · 2012
Cited alongside, same era.
A primal-dual convergence analysis of boosting
Matus Telgarsky · 2012
Cited alongside, same era.
Non-strongly-convex smooth stochastic approximation with convergence rate 𝒪 ( 1 / n ) \mathcal{O}(1/n)
Francis Bach and Eric Moulines · 2013
Cited alongside, same era.
Margins, shrinkage, and boosting
Matus Telgarsky · 2013
Cited alongside, same era.
Adaptivity of averaged stochastic gradient descent to local strong convexity for logistic regression
Francis R. Bach · 2014
Cited alongside, same era.
Lower and upper bounds on the generalization of stochastic exponentially concave optimization
Mehrdad Mahdavi, Lijun Zhang, and Rong Jin · 2015
Later among the works it cites.
Coin betting and parameter-free online learning
Francesco Orabona and David Pal · 2016
Later among the works it cites.
Condition number analysis of logistic regression, and its implications for first-order solution methods
Robert M. Freund, Paul Grigas, and Rahul Mazumder · 2017
Later among the works it cites.
The implicit bias of gradient descent on separable data
Daniel Soudry, Elad Hoffer, Mor Shpigel Nacson, Suriya Gunasekar, and Nathan Srebro · 2017
Later among the works it cites.
Characterizing implicit bias in terms of optimization geometry
Suriya Gunasekar, Jason Lee, Daniel Soudry, and Nathan Srebro · 2018
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Convex optimization: Algorithms and complexity
Sébastien Bubeck · 2015
Cited alongside, same era.
Convergence of gradient descent on separable data
Mor Shpigel Nacson, Jason Lee, Suriya Gunasekar, Nathan Srebro, and Daniel Soudry · 2018
Closest in time.