Minimax Bounds for Active Learning

DOI10.1109/TIT.2008.920189zbMath1330.68246OpenAlexW2106447856MaRDI QIDQ3604658

Rui M. Castro, Robert D. Nowak

Publication date: 24 February 2009

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2008.920189

Mathematics Subject Classification ID

Minimax procedures in statistical decision theory (62C20) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (13)

Generalized density clustering ⋮ Learning noisy linear classifiers via adaptive and selective sampling ⋮ Rates of convergence in active learning ⋮ A theory of transfer learning with applications to active learning ⋮ Two faces of active learning ⋮ Unnamed Item ⋮ Spatially-adaptive sensing in nonparametric regression ⋮ Technical Note—Nonstationary Stochastic Optimization Under L_p,q-Variation Measures ⋮ Adaptive sensing performance lower bounds for sparse signal detection and support estimation ⋮ A strong converse bound for multiple hypothesis testing, with applications to high-dimensional estimation ⋮ Active Nearest-Neighbor Learning in Metric Spaces ⋮ Surrogate losses in passive and active learning ⋮ Unnamed Item

This page was built for publication: Minimax Bounds for Active Learning