Minimax Bounds for Active Learning
From MaRDI portal
Publication:3604658
DOI10.1109/TIT.2008.920189zbMATH Open1330.68246OpenAlexW2106447856MaRDI QIDQ3604658FDOQ3604658
Authors: 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
Recommendations
Learning and adaptive systems in artificial intelligence (68T05) Minimax procedures in statistical decision theory (62C20)
Cited In (25)
- Minimax Bounds for Active Learning
- Rademacher complexities and bounding the excess risk in active learning
- Learning noisy linear classifiers via adaptive and selective sampling
- Plug-in approach to active learning
- An adaptive strategy for active learning with smooth decision boundary
- A strong converse bound for multiple hypothesis testing, with applications to high-dimensional estimation
- Algorithms for minimally supervised learning
- Title not available (Why is that?)
- Upper-Confidence-Bound Algorithms for Active Learning in Multi-armed Bandits
- Title not available (Why is that?)
- Active learning of Bayesian linear models with high-dimensional binary features by parameter confidence-region estimation
- Surrogate losses in passive and active learning
- Adaptive sensing performance lower bounds for sparse signal detection and support estimation
- Asymptotic analysis of objectives based on Fisher information in active learning
- Active nearest-neighbor learning in metric spaces
- Spatially-adaptive sensing in nonparametric regression
- Rates of convergence in active learning
- Algorithmic connections between active learning and stochastic convex optimization
- Active Learning for Enumerating Local Minima Based on Gaussian Process Derivatives
- Technical note: Nonstationary stochastic optimization under \(L_{p,q} \)-variation measures
- Minimax analysis of active learning
- Minimax robust active learning for approximately specified regression models
- A theory of transfer learning with applications to active learning
- Generalized density clustering
- Two faces of active learning
This page was built for publication: Minimax Bounds for Active Learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604658)