A theory of transfer learning with applications to active learning
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1713116 (Why is no real title available?)
- scientific article; zbMATH DE number 5957307 (Why is no real title available?)
- scientific article; zbMATH DE number 527229 (Why is no real title available?)
- scientific article; zbMATH DE number 1448976 (Why is no real title available?)
- A Bayesian/information theoretic model of learning to learn via multiple task sampling
- Active Learning in the Non-realizable Case
- Agnostic active learning
- Analysis of perceptron-based active learning
- Combinatorial methods in density estimation
- Estimation of dependences based on empirical data. Transl. from the Russian by Samuel Kotz
- Learning Theory and Kernel Machines
- Learning multiple tasks with kernel methods
- Margin Based Active Learning
- Minimax Bounds for Active Learning
- Rademacher complexities and bounding the excess risk in active learning
- Rates of convergence in active learning
- Rates of convergence of minimum distance estimators and Kolmogorov's entropy
- Selective sampling using the query by committee algorithm
- Support vector machine active learning with applications to text classification
- Teaching Dimension and the Complexity of Active Learning
- The true sample complexity of active learning
- Theory of statistics
Cited in
(11)- On Universal Transfer Learning
- Best-effort adaptation
- A theoretical framework for deep transfer learning
- A Bayesian approach to (online) transfer learning: theory and algorithms
- On universal transfer learning
- scientific article; zbMATH DE number 7156178 (Why is no real title available?)
- Marginal singularity and the benefits of labels in covariate-shift
- Physics-informed neural networks for solving forward and inverse flow problems via the Boltzmann-BGK formulation
- scientific article; zbMATH DE number 7370519 (Why is no real title available?)
- Risk bound of transfer learning using parametric feature mapping and its application to sparse coding
- A no-free-lunch theorem for multitask learning
This page was built for publication: A theory of transfer learning with applications to active learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1945022)