Fetching the paper…
Reading the bibliography…
The increased availability of data in recent years has led several authors to ask whether it is possible to use data as a {\em computational} resource.
Computational sample complexity
S. Decatur, O. Goldreich, and D. Ron · 1998
Earlier work this paper cites.
Computational sample complexity and attribute-efficient learning
R. Servedio · 2000
Earlier work this paper cites.
On the generalization ability of on-line learning algorithms
Nicolo Cesa-Bianchi, Alex Conconi, and Claudio Gentile · 2001
Earlier work this paper cites.
Phase Transitions in Combinatorial Problems
O. Dubios, R. Monasson, B. Selma, and R. Zecchina (Guest Editors) · 2001
Earlier work this paper cites.
Relations between average case complexity and approximation complexity
U. Feige · 2002
Earlier work this paper cites.
Easily refutable subformulas of large random 3cnf formulas
Uriel Feige and Eran Ofek · 2007
Cited alongside, same era.
On basing lower-bounds for learning on worst-case assumptions
Benny Applebaum, Boaz Barak, and David Xiao · 2008
Cited alongside, same era.
Near-optimal algorithms for online matrix prediction
E. Hazan, S. Kale, and S. Shalev-Shwartz · 2012
Cited alongside, same era.
Using more data to speed-up training time
Shai Shalev-Shwartz, Ohad Shamir, and Eran Tromer · 2012
Cited alongside, same era.
The Nature of Statistical Learning Theory
V.N. Vapnik · 2012
Later among the works it cites.
Complexity theoretic lower bounds for sparse principal component detection
Quentin Berthet and Philippe Rigollet · 2013
Closest in time.
Computational and statistical tradeoffs via convex relaxation
Venkat Chandrasekaran and Michael I. Jordan · 2013
Closest in time.
Low-weight halfspaces for sparse boolean vectors
P. Long. and R. Servedio · 2013
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…