Rademacher complexities and bounding the excess risk in active learning
From MaRDI portal
Publication:2896152
Recommendations
- Probability bounds for active learning in the regression problem
- The true sample complexity of active learning
- Minimax Bounds for Active Learning
- Minimax Bounds for Active Learning
- Statistical asymptotic theory of active learning
- 10.1162/153244303321897690
- scientific article; zbMATH DE number 1804106
Cited in
(13)- Minimax Bounds for Active Learning
- Local Rademacher complexity-based learning guarantees for multi-task learning
- Recent advances in scaling-down sampling methods in machine learning
- Surrogate losses in passive and active learning
- Adaptive sensing performance lower bounds for sparse signal detection and support estimation
- Spatially-adaptive sensing in nonparametric regression
- Rates of convergence in active learning
- Regularized sample average approximation for high-dimensional stochastic optimization under low-rankness
- The true sample complexity of active learning
- Statistical active learning algorithms for noise tolerance and differential privacy
- A theory of transfer learning with applications to active learning
- High-Dimensional Learning Under Approximate Sparsity with Applications to Nonsmooth Estimation and Regularized Neural Networks
- Probability bounds for active learning in the regression problem
This page was built for publication: Rademacher complexities and bounding the excess risk in active learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2896152)
