Plug-in approach to active learning
From MaRDI portal
Abstract: We present a new active learning algorithm based on nonparametric estimators of the regression function. Our investigation provides probabilistic bounds for the rates of convergence of the generalization error achievable by proposed method over a broad class of underlying distributions. We also prove minimax lower bounds which show that the obtained rates are almost tight.
Recommendations
Cited in
(9)- Statistical asymptotic theory of active learning
- Improving importance estimation in pool-based batch active learning for approximate linear regression
- Surrogate losses in passive and active learning
- Probability bounds for active learning in the regression problem
- Learning from non-iid data: fast rates for the one-vs-all multiclass plug-in classifiers
- Active nearest-neighbor learning in metric spaces
- The relationship between agnostic selective classification, active learning and the disagreement coefficient
- Bayesian active learning using arbitrary binary valued queries
- Active learning for cost-sensitive classification
This page was built for publication: Plug-in approach to active learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5405110)