Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Four types of noise in data for PAC learning

From MaRDI portal
Publication:673611
Jump to:navigation, search

DOI10.1016/0020-0190(95)00016-6zbMath1004.68539OpenAlexW2036478832MaRDI QIDQ673611

Robert H. Sloan

Publication date: 28 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(95)00016-6

zbMATH Keywords

noisecomputational learning theorydesign of algorithmsPAC learningconcept learning


Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)


Related Items

Learning under \(p\)-tampering poisoning attacks, Learning with unreliable boundary queries, Learning with restricted focus of attention, Improved lower bounds for learning from noisy examples: An information-theoretic approach



Cites Work

  • Unnamed Item
  • Occam's razor
  • Equivalence of models for polynomial learnability
  • Can PAC learning algorithms tolerate random attribute noise?
  • Learning in the Presence of Malicious Errors
  • A theory of the learnable
  • Efficient noise-tolerant learning from statistical queries
  • Probability Inequalities for Sums of Bounded Random Variables
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:673611&oldid=12578931"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 10:21.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki