Learning with unreliable boundary queries
From MaRDI portal
Publication:1271553
DOI10.1006/jcss.1997.1559zbMath0910.68184OpenAlexW2912883934MaRDI QIDQ1271553
Donna K. Slonim, Sally A. Goldman, Prasad Chalasani, Avrim L. Blum
Publication date: 24 January 1999
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcss.1997.1559
Related Items (4)
Learning intersections and thresholds of halfspaces ⋮ PAC learning with nasty noise. ⋮ Learning fixed-dimension linear thresholds from fragmented data ⋮ On the limits of efficient teachability
Cites Work
- Unnamed Item
- Four types of noise in data for PAC learning
- On learning from queries and counterexamples in the presence of noise
- Prediction-preserving reducibility
- Equivalence of models for polynomial learnability
- Randomly fallible teachers: Learning monotone DNF with an incomplete membership oracle
- Predicting \(\{ 0,1\}\)-functions on randomly drawn points
- Can PAC learning algorithms tolerate random attribute noise?
- Learning from a consistently ignorant teacher
- Queries and concept learning
- Exact Identification of Read-Once Formulas Using Fixed Points of Amplification Functions
- Learning in the Presence of Malicious Errors
- Learnability and the Vapnik-Chervonenkis dimension
- A theory of the learnable
- Cryptographic limitations on learning Boolean formulae and finite automata
This page was built for publication: Learning with unreliable boundary queries
