Specification and simulation of statistical query algorithms for efficiency and noise tolerance
From MaRDI portal
Publication:1271551
DOI10.1006/jcss.1997.1558zbMath0912.68063OpenAlexW4242423407MaRDI QIDQ1271551
Javed A. Aslam, Scott E. Decatur
Publication date: 10 November 1998
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/9583051163e9d72dc76ff02cb863a8c2aad09600
Related Items (5)
A complete characterization of statistical query learning with applications to evolvability ⋮ Agnostic learning of geometric patterns ⋮ Boosting in the presence of noise ⋮ On the Evolution of Monotone Conjunctions: Drilling for Best Approximations ⋮ Statistical active learning algorithms for noise tolerance and differential privacy
Cites Work
- Unnamed Item
- Quantifying inductive bias: AI learning algorithms and Valiant's learning framework
- Fast probabilistic algorithms for Hamiltonian circuits and matchings
- Decision theoretic generalizations of the PAC model for neural net and other learning applications
- A general lower bound on the number of examples needed for learning
- Weakly learning DNF and characterizing statistical query learning using Fourier analysis
- Learning in the Presence of Malicious Errors
- Learnability and the Vapnik-Chervonenkis dimension
- A theory of the learnable
- Efficient noise-tolerant learning from statistical queries
This page was built for publication: Specification and simulation of statistical query algorithms for efficiency and noise tolerance