On universal learning algorithms

DOI10.1016/S0020-0190(97)00117-8MaRDI QIDQ287154zbMATH OpenOpenAlexFDO

Authors Oded Goldreich, Dana Ron

Publication date 26 May 2016

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

Full work available at URL https://doi.org/10.1016/s0020-0190(97)00117-8

zbMATH Keywords

PAC-learningtheorey of computation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational learning theory (68Q32)

Recommendations

• scientific article; zbMATH DE number 67636
• scientific article; zbMATH DE number 4060753
• PAC learning with simple examples
• scientific article; zbMATH DE number 996386
• scientific article; zbMATH DE number 1373681

Cites work

• scientific article; zbMATH DE number 3566230 (Why is no real title available?)
• scientific article; zbMATH DE number 3571502 (Why is no real title available?)
• A general lower bound on the number of examples needed for learning
• A theory of the learnable
• Efficient noise-tolerant learning from statistical queries
• Learnability and the Vapnik-Chervonenkis dimension
• Learnability with respect to fixed distributions
• One way functions and pseudorandom generators
• Queries and concept learning
• Results on learnability and the Vapnik-Chervonenkis dimension

Cited in

(2)

• On extension theorems and their connection to universal consistency in machine learning
• A Complete Public-Key Cryptosystem

This page was built for publication: On universal learning algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q287154)