Probability bounds for active learning in the regression problem
From MaRDI portal
Abstract: In this article we consider the problem of choosing an optimal sampling scheme for the regression problem simultaneously with that of model selection. We consider a batch type approach and an on-line approach following algorithms recently developed for the classification problem. Our main tools are concentration-type inequalities which allow us to bound the supremum of the deviations of the sampling scheme corrected by an appropriate weight function.
Recommendations
Cited in
(9)- Minimax Bounds for Active Learning
- Rademacher complexities and bounding the excess risk in active learning
- Plug-in approach to active learning
- scientific article; zbMATH DE number 5957325 (Why is no real title available?)
- Upper-Confidence-Bound Algorithms for Active Learning in Multi-armed Bandits
- Rates of convergence in active learning
- Improving importance estimation in pool-based batch active learning for approximate linear regression
- The true sample complexity of active learning
- Minimax robust active learning for approximately specified regression models
This page was built for publication: Probability bounds for active learning in the regression problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2417446)