Fetching the paper…
Reading the bibliography…
We consider the problem of approximating and learning disjunctions (or equivalently, conjunctions) on symmetric distributions over $\{0,1\}^n$.
Decision theoretic generalizations of the PAC model for neural net and other learning applications
D. Haussler · 1992
Earlier work this paper cites.
Toward efficient agnostic learning
M. Kearns, R. Schapire, and L. Sellie · 1994
Earlier work this paper cites.
Efficient noise-tolerant learning from statistical queries
M. Kearns · 1998
Earlier work this paper cites.
The set covering machine
Mario Marchand and John Shawe-Taylor · 2002
Earlier work this paper cites.
On the difficulty of approximately maximizing agreements
S. Ben-David, N. Eiron, and P. M. Long · 2003
Earlier work this paper cites.
Maximizing agreements and coagnostic learning
N. Bshouty and L. Burroughs · 2006
Earlier work this paper cites.
Polynomial regression under arbitrary product distributions
E. Blais, R. O’Donnell, and K. Wimmer · 2008
Earlier work this paper cites.
Agnostically learning halfspaces
A. Kalai, A. Klivans, Y. Mansour, and R. Servedio · 2008
Earlier work this paper cites.
On agnostic learning of parities, monomials and halfspaces
V. Feldman, P. Gopalan, S. Khot, and A. Ponuswami · 2009
Cited alongside, same era.
Potential-based agnostic boosting
A. Kalai and V. Kanade · 2009
Cited alongside, same era.
Reliable agnostic learning
A. Kalai, V. Kanade, and Y. Mansour · 2009
Cited alongside, same era.
Improved guarantees for agnostic learning of disjunctions
Pranjal Awasthi, Avrim Blum, and Or Sheffet · 2010
Cited alongside, same era.
Distribution-specific agnostic boosting
V. Feldman · 2010
Cited alongside, same era.
Lower bounds for agnostic learning via approximate rank
A. Klivans and A. Sherstov · 2010
Cited alongside, same era.
Agnostically learning under permutation invariant distributions
A complete characterization of statistical query learning with applications to evolvability
V. Feldman · 2012
Later among the works it cites.
Agnostic learning of monomials by halfspaces is hard
Vitaly Feldman, Venkatesan Guruswami, Prasad Raghavendra, and Yi Wu · 2012
Later among the works it cites.
Finding correlations in subquadratic time, with applications to learning parities and juntas
G. Valiant · 2012
Later among the works it cites.
Representation, approximation and learning of submodular functions using low-rank decision trees
V. Feldman, P. Kothari, and J. Vondrák · 2013
Later among the works it cites.
Complexity theoretic limitations on learning dnf’s
Amit Daniely and Shai Shalev-Shwartz · 2014
Closest in time.
Learning coverage functions and private release of marginals
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Karl Wimmer · 2010
Cited alongside, same era.
Privately releasing conjunctions and the statistical query barrier
A. Gupta, M. Hardt, A. Roth, and J. Ullman · 2011
Cited alongside, same era.
Vitaly Feldman and Pravesh Kothari · 2014
Closest in time.
Approximate resilience, monotonicity, and the complexity of agnostic learning
Dana Dachman-Soled, Vitaly Feldman, Li-Yang Tan, Andrew Wan, and Karl Wimmer · 2015
Closest in time.