On Universal Transfer Learning
From MaRDI portal
Publication:3520055
Recommendations
Cites work
- scientific article; zbMATH DE number 1113195 (Why is no real title available?)
- scientific article; zbMATH DE number 1448976 (Why is no real title available?)
- 10.1162/1532443041827952
- Clustering by Compression
- Complexity-based induction systems: Comparisons and convergence theorems
- Information distance
- Learning Theory and Kernel Machines
- THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
- THE FASTEST AND SHORTEST ALGORITHM FOR ALL WELL-DEFINED PROBLEMS
- The Similarity Metric
- Universal artificial intelligence. Sequential decisions based on algorithmic probability.
Cited in
(14)- A Bayesian/information theoretic model of learning to learn via multiple task sampling
- Optimal Bayesian Transfer Learning
- A theoretical framework for deep transfer learning
- Transfer learning by mapping and revising boosted relational dependency networks
- On universal transfer learning
- Kernel methods for transfer learning to avoid negative transfer
- scientific article; zbMATH DE number 7156178 (Why is no real title available?)
- Adaptive transfer learning
- Dictionary-based transfer learning with universum data
- Transfer bounds for linear feature learning
- Inductive transfer for learning Bayesian networks
- Inductive transfer with context-sensitive neural networks
- Risk bound of transfer learning using parametric feature mapping and its application to sparse coding
- Matching component analysis for transfer learning
This page was built for publication: On Universal Transfer Learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3520055)