Active Learning in the Non-realizable Case
From MaRDI portal
Publication:3522977
Recommendations
Cited in
(19)- Learning noisy linear classifiers via adaptive and selective sampling
- Smoothness, disagreement coefficient, and the label complexity of agnostic active learning
- scientific article; zbMATH DE number 7387623 (Why is no real title available?)
- Active learning with a misspecified prior
- Active learning using smooth relative regret approximations with applications
- Active classification with uncertainty comparison queries
- Active learning via perfect selective classification
- Teaching Dimension and the Complexity of Active Learning
- Efficient active learning of halfspaces: an aggressive approach
- Rates of convergence in active learning
- Parallel distributed block coordinate descent methods based on pairwise comparison oracle
- The relationship between agnostic selective classification, active learning and the disagreement coefficient
- The true sample complexity of active learning
- Cost-Minimising Strategies for Data Labelling: Optimal Stopping and Active Learning
- Agnostic active learning
- Minimax analysis of active learning
- Statistical active learning algorithms for noise tolerance and differential privacy
- A theory of transfer learning with applications to active learning
- Theory of Disagreement-Based Active Learning
This page was built for publication: Active Learning in the Non-realizable Case
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3522977)