Bayesian active learning using arbitrary binary valued queries

DOI10.1007/978-3-642-16108-7_8MaRDI QIDQ4930688zbMATH OpenOpenAlexFDO

Authors Liu Yang, Jaime G. Carbonell, Steve Hanneke

Publication date 1 October 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-16108-7_8

zbMATH Keywords

active learningBayesian learninginformation theorysample complexity

Mathematics Subject Classification ID

Statistical aspects of information-theoretic topics (62B10) Bayesian inference (62F15) Computational learning theory (68Q32) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Active learning using arbitrary binary valued queries
• Average-case active learning with costs
• Active learning
• Two faces of active learning
• Plug-in approach to active learning

Cited in

(13)

• Partial data querying through racing algorithms
• Near-optimal Bayesian active learning with correlated and noisy tests
• Active learning using arbitrary binary valued queries
• Probability bounds for active learning in the regression problem
• Active learning
• Active learning of recursive functions by ultrametric algorithms
• Active learning of Bayesian linear models with high-dimensional binary features by parameter confidence-region estimation
• Average-case active learning with costs
• Learning unrealizable tasks from minimum entropy queries
• Query efficient posterior estimation in scientific experiments via Bayesian active learning
• Active classification with uncertainty comparison queries
• Asymptotic analysis of objectives based on Fisher information in active learning
• Twenty questions with noise: Bayes optimal policies for entropy loss

This page was built for publication: Bayesian active learning using arbitrary binary valued queries

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