Fetching the paper…
Reading the bibliography…
The classical Perceptron algorithm of Rosenblatt can be used to find a linear threshold function to correctly classify $n$ linearly separable data points, assuming the classes are separated by some margin $\gamma > 0$.
The perceptron: a probabilistic model for information storage and organization in the brain
Frank Rosenblatt · 1958
Earlier work this paper cites.
On convergence proofs on perceptrons
A.B.J. Novikoff · 1962
Earlier work this paper cites.
Theoretical foundations of the potential function method in pattern recognition learning
Mark A Aizerman · 1964
Earlier work this paper cites.
Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm
Nick Littlestone · 1988
Earlier work this paper cites.
On an approach to the construction of optimal methods of minimization of smooth convex functions
Yurii Nesterov · 1988
Earlier work this paper cites.
Learning the unlearnable
A Wendemuth · 1995
Earlier work this paper cites.
Large margin classification using the perceptron algorithm
Yoav Freund and Robert E Schapire · 1999
Earlier work this paper cites.
The robustness of the p-norm algorithms
Claudio Gentile and Nick Littlestone · 1999
Earlier work this paper cites.
A new approximate maximal margin classification algorithm
Claudio Gentile · 2000
Earlier work this paper cites.
A new approximate maximal margin classification algorithm
Claudio Gentile · 2001
Earlier work this paper cites.
A polynomial-time rescaling algorithm for solving linear programs
John Dunagan and Santosh Vempala · 2004
Earlier work this paper cites.
Prox-method with rate of convergence O ( 1 / t ) {O}(1/t) for variational inequalities with lipschitz continuous monotone operators and smooth convex-concave saddle point problems
Arkadi Nemirovski · 2004
Earlier work this paper cites.
A second-order perceptron algorithm
Nicolo Cesa-Bianchi, Alex Conconi, and Claudio Gentile · 2005
Cited alongside, same era.
Excessive gap technique in nonsmooth convex minimization
Yu Nesterov · 2005
Cited alongside, same era.
Pattern Recognition and Machine Learning
Christopher M. Bishop · 2007
Cited alongside, same era.
Approximating semidefinite programs in sublinear time
Dan Garber and Elad Hazan · 2011
Cited alongside, same era.
Online learning and online convex optimization
Shai Shalev-Shwartz · 2011
Cited alongside, same era.
A smooth perceptron algorithm
Negar Soheili and Javier Pena · 2012
Cited alongside, same era.
Optimization, learning, and games with predictable sequences
Training gans with optimism
Constantinos Daskalakis, Andrew Ilyas, Vasilis Syrgkanis, and Haoyang Zeng · 2018
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 · 2018
Later among the works it cites.
Acceleration through optimistic no-regret dynamics
Jun-Kun Wang and Jacob D Abernethy · 2018
Later among the works it cites.
Last-iterate convergence: Zero-sum games and constrained min-max optimization
C Daskalakis and Ioannis Panageas · 2019
Later among the works it cites.
Convergence of gradient descent on separable data
Mor Shpigel Nacson, Jason Lee, Suriya Gunasekar, Pedro Henrique Pamplona Savarese, Nathan Srebro, and Daniel Soudry · 2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Sasha Rakhlin and Karthik Sridharan · 2013
Cited alongside, same era.
Saddle points and accelerated perceptron algorithms
Adams Wei Yu, Fatma Kilinc-Karzan, and Jaime Carbonell · 2014
Cited alongside, same era.
Introduction to online convex optimization
Elad Hazan · 2016
Cited alongside, same era.
A deterministic rescaled perceptron algorithm
Javier Peña and Negar Soheili · 2016
Cited alongside, same era.
On frank-wolfe and equilibrium computation
Jacob D Abernethy and Jun-Kun Wang · 2017
Cited alongside, same era.
Faster rates for convex-concave games
Jacob Abernethy, Kevin A Lai, Kfir Y Levy, and Jun-Kun Wang · 2018
Cited alongside, same era.
Francesco Orabona · 2019
Later among the works it cites.
Rescaling algorithms for linear conic feasibility
Daniel Dadush, Laszlo A Vegh, and Giacomo Zambelli · 2020
Later among the works it cites.
Characterizing the implicit bias via a primal-dual analysis
Ziwei Ji and Matus Telgarsky · 2021
Later among the works it cites.
Fast margin maximization via dual acceleration
Ziwei Ji, Nathan Srebro, and Matus Telgarsky · 2021
Later among the works it cites.
No-regret dynamics in the fenchel game: A unified framework for algorithmic convex optimization
Jun-Kun Wang, Jacob Abernethy, and Kfir Y Levy · 2021
Later among the works it cites.
Mirror descent maximizes generalized margin and can be implemented efficiently
Haoyuan Sun, Kwangjun Ahn, Christos Thrampoulidis, and Navid Azizan · 2022
Closest in time.