Fetching the paper…
Reading the bibliography…
Due to the drastic gap in complexity between sequential and batch statistical learning, recent work has studied a smoothed sequential learning setting, where Nature is constrained to select contexts with density bounded by 1/{\sigma} with respect to a known measure {\mu}.
Etude critique de la notion de collectif
Jean Ville · 1939
Earlier work this paper cites.
On the volume of tubes
Hermann Weyl · 1939
Earlier work this paper cites.
Extremum problems with inequalities as subsidiary conditions, studies and essays presented to r. courant on his 60th birthday, january 8, 1948, 1948
Fritz John · 1948
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.
On convergence proofs for perceptrons
Albert B Novikoff · 1963
Earlier work this paper cites.
How good is the simplex algorithm
Victor Klee and George J Minty · 1972
Earlier work this paper cites.
A central cutting plane algorithm for the convex programming problem
Jack Elzinga and Thomas G Moore · 1975
Earlier work this paper cites.
Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm
Nick Littlestone · 1988
Earlier work this paper cites.
The method of inscribed ellipsoids
Sergei Pavlovich Tarasov, Leonid Khachiyan, and Igor Érlikh · 1988
Earlier work this paper cites.
Learnability and the vapnik-chervonenkis dimension
Anselm Blumer, Andrzej Ehrenfeucht, David Haussler, and Manfred K Warmuth · 1989
Earlier work this paper cites.
An inequality for the volume of inscribed ellipsoids
Leonid Genrikhovich Khachiyan · 1990
Earlier work this paper cites.
A modification of the inscribed ellipsoid method
ME Primak and BL Kheyfets · 1995
Earlier work this paper cites.
An elementary introduction to modern convex geometry
Keith Ball et al · 1997
Earlier work this paper cites.
Large margin classification using the perceptron algorithm
Yoav Freund and Robert E Schapire · 1999
Earlier work this paper cites.
Distributional and ℒ q \mathcal{L}^{q} - norm inequalities for polynomials over convex bodies in ℝ n \mathbb{R}^{n}
Anthony Carbery and James Wright · 2001
Earlier work this paper cites.
Tubes , volume 221
Alfred Gray · 2003
Cited alongside, same era.
Solving convex programs by random walks
Dimitris Bertsimas and Santosh Vempala · 2004
Cited alongside, same era.
Convex optimization
Stephen Boyd and Lieven Vandenberghe · 2004
Cited alongside, same era.
Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
Daniel A Spielman and Shang-Hua Teng · 2004
Cited alongside, same era.
Online passive-aggressive algorithms
Koby Crammer, Ofer Dekel, Joseph Keshet, Shai Shalev-Shwartz, and Yoram Singer · 2006
Cited alongside, same era.
A bound on the label complexity of agnostic active learning
Steve Hanneke · 2007
Cited alongside, same era.
Approximating the centroid is hard
Theory of disagreement-based active learning
Steve Hanneke et al · 2014
Later among the works it cites.
Online non-parametric regression
Alexander Rakhlin and Karthik Sridharan · 2014
Later among the works it cites.
On the volume of tubular neighborhoods of real algebraic varieties
Martin Lotz · 2015
Later among the works it cites.
The computational power of optimization in online learning
Elad Hazan and Tomer Koren · 2016
Later among the works it cites.
Learning without mixing: Towards a sharp analysis of linear system identification
Max Simchowitz, Horia Mania, Stephen Tu, Michael I Jordan, and Benjamin Recht · 2018
Later among the works it cites.
High-dimensional statistics: A non-asymptotic viewpoint , volume 48
Martin J Wainwright · 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…
Luis A Rademacher · 2007
Cited alongside, same era.
Surface area and other measures of ellipsoids
Igor Rivin · 2007
Cited alongside, same era.
Agnostic online learning
Shai Ben-David, Dávid Pál, and Shai Shalev-Shwartz · 2009
Cited alongside, same era.
Rates of convergence in active learning
Steve Hanneke · 2011
Cited alongside, same era.
Online learning: Stochastic, constrained, and smoothed adversaries
Alexander Rakhlin, Karthik Sridharan, and Ambuj Tewari · 2011
Cited alongside, same era.
Smoothness, disagreement coefficient, and the label complexity of agnostic active learning
Liwei Wang · 2011
Cited alongside, same era.
Beyond ucb: Optimal and efficient contextual bandits with regression oracles
Dylan Foster and Alexander Rakhlin · 2020
Later among the works it cites.
Smoothed analysis of online and differentially private learning
Nika Haghtalab, Tim Roughgarden, and Abhishek Shetty · 2020
Later among the works it cites.
The set of zeroes of an “almost polynomial” function
Y Yomdin · 2020
Later among the works it cites.
Majorizing measures, sequential complexities, and online learning
Adam Block, Yuval Dagan, and Alexander Rakhlin · 2021
Later among the works it cites.
Smoothed analysis with adaptive adversaries
Nika Haghtalab, Tim Roughgarden, and Abhishek Shetty · 2021
Later among the works it cites.
Beyond the Worst-Case Analysis of Algorithms
Tim Roughgarden, editor · 2021
Later among the works it cites.
Smoothed online learning is as easy as statistical learning
Adam Block, Yuval Dagan, Noah Golowich, and Alexander Rakhlin · 2022
Closest in time.
Oracle-efficient online learning for beyond worst-case adversaries
Nika Haghtalab, Yanjun Han, Abhishek Shetty, and Kunhe Yang · 2022
Closest in time.