Learning with unreliable boundary queries
type: Item
instance of: scholarly article
title: Learning with unreliable boundary queries
zbMATH Open document ID: 0910.68184
author: Prasad Chalasani
author: Sally A. Goldman
author: Donna K. Slonim
author: Avrim Blum
published in: Journal of Computer and System Sciences
publication date: 1999-01-24T00:00:00Z
Mathematics Subject Classification ID: 68T05
zbMATH DE Number: 1220914
zbMATH Keywords: models of learning
MaRDI profile type: Publication
full work available at URL: jcss.1997.1559
OpenAlex ID: W2912883934
cites work: Queries and concept learning
cites work: Randomly fallible teachers: Learning monotone DNF with an incomplete membership oracle
cites work: Learnability and the Vapnik-Chervonenkis dimension
cites work: Learning from a consistently ignorant teacher
cites work: Can PAC learning algorithms tolerate random attribute noise?
cites work: Exact Identification of Read-Once Formulas Using Fixed Points of Amplification Functions
cites work: Equivalence of models for polynomial learnability
cites work: Predicting \(\{ 0,1\}\)-functions on randomly drawn points
cites work: Learning in the Presence of Malicious Errors
cites work: Cryptographic limitations on learning Boolean formulae and finite automata
cites work: Q4040311
cites work: Prediction-preserving reducibility
cites work: On learning from queries and counterexamples in the presence of noise
cites work: Four types of noise in data for PAC learning
cites work: A theory of the learnable
DOI: 10.1006/JCSS.1997.1559
description: scientific article; zbMATH DE number 1220914