On universal transfer learning
From MaRDI portal
Publication:1017661
DOI10.1016/j.tcs.2009.01.013zbMath1167.68051OpenAlexW2108723060MaRDI QIDQ1017661
Publication date: 12 May 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2009.01.013
Computational learning theory (68Q32) Learning and adaptive systems in artificial intelligence (68T05) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Markov chains and stochastic stability
- An introduction to MCMC for machine learning
- Transfer of learning by composing solutions of elemental sequential tasks
- THE FASTEST AND SHORTEST ALGORITHM FOR ALL WELL-DEFINED PROBLEMS
- On Universal Transfer Learning
- Clustering by Compression
- The Similarity Metric
- A Theory of Program Size Formally Identical to Information Theory
- Complexity-based induction systems: Comparisons and convergence theorems
- Finite Markov Chains and Algorithmic Applications
- Information distance
- 10.1162/1532443041827952
- 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
- Random forests
This page was built for publication: On universal transfer learning