The true sample complexity of active learning

DOI10.1007/s10994-010-5174-yzbMath1470.68078OpenAlexW2029604420MaRDI QIDQ1959593

Jennifer Wortman Vaughan, Maria-Florina Balcan, Steve Hanneke

Publication date: 7 October 2010

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10994-010-5174-y

zbMATH Keywords

classificationlearning theoryactive learningsample complexityselective samplingsequential design

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (8)

Sample complexity of hidden subgroup problem ⋮ A theory of transfer learning with applications to active learning ⋮ Smart PAC-learners ⋮ The true sample complexity of active learning ⋮ Active Nearest-Neighbor Learning in Metric Spaces ⋮ Surrogate losses in passive and active learning ⋮ Unnamed Item ⋮ Statistical active learning algorithms for noise tolerance and differential privacy

Cites Work

• Estimation of dependences based on empirical data. Transl. from the Russian by Samuel Kotz
• Predicting \(\{ 0,1\}\)-functions on randomly drawn points
• Selective sampling using the query by committee algorithm
• Strong minimax lower bounds for learning
• The true sample complexity of active learning
• Agnostic active learning
• Learnability and the Vapnik-Chervonenkis dimension
• Structural risk minimization over data-dependent hierarchies
• Minimax Bounds for Active Learning
• Margin Based Active Learning
• Teaching Dimension and the Complexity of Active Learning
• Learning Theory
• Unnamed Item
• Unnamed Item

This page was built for publication: The true sample complexity of active learning