Resource-bounded measure and learnability

DOI10.1007/S002249910010MaRDI QIDQ1974447zbMATH OpenOpenAlexFDO

Authors Rainer Schuler, Osamu Watanabe, Wolfgang Lindner

Publication date 7 May 2000

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s002249910010

zbMATH Keywords

computational learning theorypolynomial-time learnable subclasses

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Recommendations

• scientific article; zbMATH DE number 1335899
• scientific article; zbMATH DE number 1335892
• Resource-bounded measure on probabilistic classes
• scientific article; zbMATH DE number 1335897

Cited in

(7)

• Efficient learning algorithms yield circuit lower bounds
• scientific article; zbMATH DE number 1335899 (Why is no real title available?)
• Resource Restricted Computability Theoretic Learning: Illustrative Topics and Problems
• Online Learning and Resource-Bounded Dimension: Winnow Yields New Lower Bounds for Hard Sets
• Exact learning algorithms, betting games, and circuit lower bounds
• Theory and Applications of Models of Computation
• Dimension, halfspaces, and the density of hard sets

This page was built for publication: Resource-bounded measure and learnability

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