Fetching the paper…
Reading the bibliography…
We study the problem of PAC learning halfspaces with Massart noise.
The Perceptron: a probabilistic model for information storage and organization in the brain
F. Rosenblatt · 1958
Earlier work this paper cites.
On convergence proofs on perceptrons
A. Novikoff · 1962
Earlier work this paper cites.
Perceptrons: an introduction to computational geometry
M. Minsky and S. Papert · 1968
Earlier work this paper cites.
Estimation of Dependences Based on Empirical Data: Springer Series in Statistics
V. Vapnik · 1982
Earlier work this paper cites.
A theory of the learnable
L. G. Valiant · 1984
Earlier work this paper cites.
Learning from noisy examples
D. Angluin and P. Laird · 1988
Earlier work this paper cites.
Types of noise in data for concept learning
R. H. Sloan · 1988
Earlier work this paper cites.
On ACC and threshold circuits
A. Yao · 1990
Earlier work this paper cites.
Majority gates vs. general weighted threshold gates
M. Goldmann, J. Håstad, and A. Razborov · 1992
Earlier work this paper cites.
Decision theoretic generalizations of the PAC model for neural net and other learning applications
D. Haussler · 1992
Earlier work this paper cites.
Corrigendum to types of noise in data for concept learning
R. H. Sloan · 1992
Earlier work this paper cites.
Weakly learning DNF and characterizing statistical query learning using Fourier analysis
A. Blum, M. Furst, J. Jackson, M. Kearns, Y. Mansour, and S. Rudich · 1994
Earlier work this paper cites.
Toward Efficient Agnostic Learning
M. Kearns, R. Schapire, and L. Sellie · 1994
Earlier work this paper cites.
How fast can a threshold gate learn?
W. Maass and G. Turan · 1994
Earlier work this paper cites.
A formal model of hierarchical concept learning
R. Rivest and R. Sloan · 1994
Earlier work this paper cites.
A polynomial-time algorithm for learning noisy linear threshold functions
A. Blum, A. M. Frieze, R. Kannan, and S. Vempala · 1996
Earlier work this paper cites.
Pac Learning, Noise, and Geometry
R. H. Sloan · 1996
Earlier work this paper cites.
A polynomial time algorithm for learning noisy linear threshold functions
A. Blum, A. Frieze, R. Kannan, and S. Vempala · 1997
Earlier work this paper cites.
Learning noisy perceptrons by a perceptron in polynomial time
E. Cohen · 1997
Earlier work this paper cites.
A decision-theoretic generalization of on-line learning and an application to boosting
Y. Freund and R. Schapire · 1997
Earlier work this paper cites.
Efficient noise-tolerant learning from statistical queries
M. J. Kearns · 1998
Earlier work this paper cites.
Statistical Learning Theory
V. Vapnik · 1998
Earlier work this paper cites.
An introduction to support vector machines
J. Shawe-Taylor and N. Cristianini · 2000
Earlier work this paper cites.
On using extended statistical queries to avoid membership queries
N. Bshouty and V. Feldman · 2002
Earlier work this paper cites.
Noise-tolerant learning, the parity problem, and the statistical query model
A. Blum, A. Kalai, and H. Wasserman · 2003
Cited alongside, same era.
Machine learning: My favorite results, directions, and open problems
A. Blum · 2003
Cited alongside, same era.
Map-reduce for machine learning on multicore
C.-T. Chu, S. K. Kim, Y. A. Lin, Y. Yu, G. Bradski, A. Y. Ng, and K. Olukotun · 2006
Cited alongside, same era.
New results for learning noisy parities and halfspaces
V. Feldman, P. Gopalan, S. Khot, and A. Ponnuswami · 2006
Cited alongside, same era.
Hardness of learning halfspaces with noise
V. Guruswami and P. Raghavendra · 2006
Cited alongside, same era.
Risk bounds for statistical learning
P. Massart and E. Nedelec · 2006
Cited alongside, same era.
A general characterization of the statistical query complexity
V. Feldman · 2017
Later among the works it cites.
Statistical algorithms and a lower bound for detecting planted cliques
V. Feldman, E. Grigorescu, L. Reyzin, S. Vempala, and Y. Xiao · 2017
Later among the works it cites.
Statistical query algorithms for mean vector estimation and stochastic convex optimization
V. Feldman, C. Guzman, and S. S. Vempala · 2017
Later among the works it cites.
Revisiting perceptron: Efficient and label-optimal learning of halfspaces
S. Yan and C. Zhang · 2017
Later among the works it cites.
A hitting time analysis of stochastic gradient langevin dynamics
Y. Zhang, P. Liang, and M. Charikar · 2017
Later among the works it cites.
Robustly learning a gaussian: Getting optimal error, efficiently
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Evolvability from learning algorithms
V. Feldman · 2008
Cited alongside, same era.
Learning halfspaces with malicious noise
A. Klivans, P. Long, and R. Servedio · 2009
Cited alongside, same era.
Bounded independence fools halfspaces
I. Diakonikolas, P. Gopalan, R. Jaiswal, R. Servedio, and E. Viola · 2010
Cited alongside, same era.
Distribution-independent evolvability of linear threshold functions
V. Feldman · 2011
Cited alongside, same era.
Hardness of learning halfspaces with massart noise
I. Diakonikolas and D. M. Kane · 2012
Cited alongside, same era.
Embedding hard learning problems into gaussian space
A. R. Klivans and P. Kothari · 2014
Cited alongside, same era.
I. Diakonikolas, G. Kamath, D. M. Kane, J. Li, A. Moitra, and A. Stewart · 2018
Later among the works it cites.
Learning geometric concepts with nasty noise
I. Diakonikolas, D. M. Kane, and A. Stewart · 2018
Later among the works it cites.
Efficient algorithms for outlier-robust regression
A. R. Klivans, P. K. Kothari, and R. Meka · 2018
Later among the works it cites.
Distribution-independent PAC learning of halfspaces with massart noise
I. Diakonikolas, T. Gouleakis, and C. Tzamos · 2019
Later among the works it cites.
Recent advances in algorithmic high-dimensional robust statistics
I. Diakonikolas and D. M. Kane · 2019
Later among the works it cites.
Sever: A robust meta-algorithm for stochastic optimization
I. Diakonikolas, G. Kamath, D. Kane, J. Li, J. Steinhardt, and A. Stewart · 2019
Later among the works it cites.
Efficient algorithms and lower bounds for robust linear regression
I. Diakonikolas, W. Kong, and A. Stewart · 2019
Later among the works it cites.
Statistical query algorithms and low-degree tests are almost equivalent
M. Brennan, G. Bresler, S. B. Hopkins, J. Li, and T.Schramm · 2020
Closest in time.
S. Chen, F. Koehler, A. Moitra, and M. Yau · 2020
Closest in time.
A polynomial time algorithm for learning halfspaces with tsybakov noise
I. Diakonikolas, D. Kane, V. Kontonis, C. Tzamos, and N. Zarifis · 2020
Closest in time.
Learning halfspaces with massart noise under structured distributions
I. Diakonikolas, V. Kontonis, C. Tzamos, and N. Zarifis · 2020
Closest in time.
Learning halfspaces with tsybakov noise
I. Diakonikolas, V. Kontonis, C. Tzamos, and N. Zarifis · 2020
Closest in time.
Near-optimal SQ lower bounds for agnostically learning halfspaces and relus under gaussian marginals
I. Diakonikolas, D. M. Kane, and N. Zarifis · 2020
Closest in time.
Statistical-query lower bounds via functional gradients
S. Goel, A. Gollakota, and A. R. Klivans · 2020
Closest in time.
Efficient active learning of sparse halfspaces with arbitrary bounded noise
C. Zhang, J. Shen, and P. Awasthi · 2020
Closest in time.
Boosting in the presence of massart noise
I. Diakonikolas, R. Impagliazzo, D. M. Kane, R. Lei, J. Sorrell, and C. Tzamos · 2021
Closest in time.
Efficiently learning halfspaces with tsybakov noise
I. Diakonikolas, D. M. Kane, V. Kontonis, C. Tzamos, and N. Zarifis · 2021
Closest in time.
The optimality of polynomial regression for agnostic learning under gaussian marginals
I. Diakonikolas, D. M. Kane, T. Pittas, and N. Zarifis · 2021
Closest in time.