Smart PAC-learners
From MaRDI portal
Publication:2431423
DOI10.1016/j.tcs.2010.12.053zbMath1209.68283MaRDI 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
minimax theorem; machine learning; semi-supervised learning; PAC-learning; learning under a fixed distribution; smart PAC-learner; value of unlabeled data
68Q32: Computational learning theory
Related Items
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