Smart PAC-learners

DOI10.1016/J.TCS.2010.12.053zbMath1209.68283OpenAlexW2142738794MaRDI QIDQ2431423

Hans Ulrich Simon, Malte Darnstädt

Publication date: 14 April 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.12.053

zbMATH Keywords

minimax theoremmachine learningsemi-supervised learningPAC-learninglearning under a fixed distributionsmart PAC-learnervalue of unlabeled data

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Related Items (1)

Supervised learning and co-training

Cites Work

• Unnamed Item
• Learnability with respect to fixed distributions
• A general lower bound on the number of examples needed for learning
• The true sample complexity of active learning
• Agnostic active learning
• Learnability and the Vapnik-Chervonenkis dimension
• A discriminative model for semi-supervised learning
• Margin Based Active Learning
• Teaching Dimension and the Complexity of Active Learning

This page was built for publication: Smart PAC-learners