On the sample complexity of parameter estimation in logistic regression with normal design

The perceptron: A probabilistic model for information storage and organization in the brain

Frank Rosenblatt · 1958

Earlier work this paper cites.

Partitions of N N -space by hyperplanes

Robert O Winder · 1966

Earlier work this paper cites.

An Introduction to Probability Theory and Its Applications , volume 1

William Feller · 1968

Earlier work this paper cites.

Information-theoretic upper and lower bounds for statistical estimation

Tong Zhang · 1968

Earlier work this paper cites.

On the uniform convergence of relative frequencies of events to their probabilities

Vladimir Naumovich Vapnik and Alexey Yakovlevich Chervonenkis · 1971

Earlier work this paper cites.

Asymptotic behavior of likelihood methods for exponential families when the number of parameters tends to infinity

Stephen Portnoy · 1988

Earlier work this paper cites.

Generalizing the Fano inequality

Te Sun Han and Sergio Verdú · 1994

Earlier work this paper cites.

Lower bounds in pattern recognition and learning

Luc Devroye and Gábor Lugosi · 1995

Earlier work this paper cites.

On the sample complexity of PAC learning half-spaces against the uniform distribution

Philip M Long · 1995

Earlier work this paper cites.

On the Lambert W function

Robert M Corless, Gaston H Gonnet, David EG Hare, David J Jeffrey, and Donald E Knuth · 1996

Earlier work this paper cites.

Smooth discrimination analysis

Enno Mammen and Alexandre B Tsybakov · 1999

Cited alongside, same era.

On PAC learning using Winnow, Perceptron, and a Perceptron-like algorithm

Rocco A Servedio · 1999

Cited alongside, same era.

On parameters of increasing dimensions

Xuming He and Qi-Man Shao · 2000

Cited alongside, same era.

An upper bound on the sample complexity of PAC-learning halfspaces with respect to the uniform distribution

Philip M Long · 2003

Cited alongside, same era.

Online bounds for Bayesian algorithms

Sham M Kakade and Andrew Ng · 2004

Cited alongside, same era.

1-bit compressive sensing

Petros T Boufounos and Richard G Baraniuk · 2008

Cited alongside, same era.

Robust 1-bit compressive sensing via binary stable embeddings of sparse vectors

Laurent Jacques, Jason N Laska, Petros T Boufounos, and Richard G Baraniuk · 2013

Later among the works it cites.

Logistic regression: Tight bounds for stochastic and online optimization

Elad Hazan, Tomer Koren, and Kfir Y Levy · 2014

Later among the works it cites.

On Bayes risk lower bounds

Xi Chen, Adityanand Guntuboyina, and Yuchen Zhang · 2016

Later among the works it cites.

High-dimensional estimation with geometric constraints

Yaniv Plan, Roman Vershynin, and Elena Yudovina · 2017

Later among the works it cites.

Logistic regression: The importance of being improper

Dylan J Foster, Satyen Kale, Haipeng Luo, Mehryar Mohri, and Karthik Sridharan · 2018

Later among the works it cites.

The impact of regularization on high-dimensional logistic regression

Fariborz Salehi, Ehsan Abbasi, and Babak Hassibi · 2019