The true sample complexity of active learning
From MaRDI portal
Recommendations
- Rademacher complexities and bounding the excess risk in active learning
- Statistical asymptotic theory of active learning
- Computing and Combinatorics
- Efficient Algorithms for General Active Learning
- Active Learning in the Non-realizable Case
- Improved bounds on the sample complexity of learning
- scientific article; zbMATH DE number 1445318
- Probability bounds for active learning in the regression problem
Cites work
- Agnostic active learning
- Estimation of dependences based on empirical data. Transl. from the Russian by Samuel Kotz
- scientific article; zbMATH DE number 1332320 (Why is no real title available?)
- scientific article; zbMATH DE number 893887 (Why is no real title available?)
- Learnability and the Vapnik-Chervonenkis dimension
- Learning Theory
- Margin Based Active Learning
- Minimax Bounds for Active Learning
- Predicting \(\{ 0,1\}\)-functions on randomly drawn points
- Selective sampling using the query by committee algorithm
- Strong minimax lower bounds for learning
- Structural risk minimization over data-dependent hierarchies
- Teaching Dimension and the Complexity of Active Learning
- The true sample complexity of active learning
Cited in
(18)- A theory of transfer learning with applications to active learning
- The true sample complexity of active learning
- Surrogate losses in passive and active learning
- Statistical active learning algorithms for noise tolerance and differential privacy
- Smart PAC-learners
- Sample complexity of hidden subgroup problem
- Absolute convergence and error thresholds in non-active adaptive sampling
- Analysis of perceptron-based active learning
- Rademacher complexities and bounding the excess risk in active learning
- Active Learning in the Non-realizable Case
- Minimax Bounds for Active Learning
- Active nearest-neighbor learning in metric spaces
- Interactive algorithms: pool, stream and precognitive stream
- Teaching Dimension and the Complexity of Active Learning
- A compression technique for analyzing disagreement-based active learning
- Recent advances in scaling-down sampling methods in machine learning
- An algorithm for learning representations of models with scarce data
- Stable sample compression schemes: new applications and an optimal SVM margin bound
This page was built for publication: The true sample complexity of active learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1959593)
