Active Learning in the Non-realizable Case
From MaRDI portal
Publication:3522977
DOI10.1007/11894841_9zbMATH Open1168.68470OpenAlexW1507695921MaRDI QIDQ3522977FDOQ3522977
Authors: Matti Kääriäinen
Publication date: 4 September 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11894841_9
Recommendations
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)
Cited In (19)
- Learning noisy linear classifiers via adaptive and selective sampling
- Smoothness, disagreement coefficient, and the label complexity of agnostic active learning
- Title not available (Why is that?)
- 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
- Theory of Disagreement-Based Active Learning
- A theory of transfer learning with applications to 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)