Freshly Printed - allow 10 days lead
Advances in Domain Adaptation Theory
Focuses on the current results of transfer learning, with an emphasis on field adaptation from a theoretical POV
Ievgen Redko (Author), Emilie Morvant (Author), Amaury Habrard (Author), Marc Sebban (Author), Younès Bennani (Author)
9781785482366, Elsevier Science
Hardback, published 14 August 2019
208 pages
22.9 x 15.1 x 2 cm, 0.46 kg
"This book goes beyond the common assumption of supervised and semi-supervised learning that training and test data obey the same distribution. When the distribution changes, most statistical models must be reconstructed from new collected data that may be costly or even impossible to get for some applications. Therefore, it becomes necessary to develop approaches that reduce the need and the effort demanded for obtaining new labeled samples, by exploiting data available in related areas and using it further in similar fields. This has created a new family of machine learning algorithms, called transfer learning: a learning setting inspired by the capability of a human being to extrapolate knowledge across tasks to learn more efficiently. This book provides an overview of the state-of-the-art theoretical results in a specific - and arguably the most popular - subfield of transfer learning, called domain adaptation." --Mathematical Reviews Clippings
Advances in Domain Adaptation Theory gives current, state-of-the-art results on transfer learning, with a particular focus placed on domain adaptation from a theoretical point-of-view. The book begins with a brief overview of the most popular concepts used to provide generalization guarantees, including sections on Vapnik-Chervonenkis (VC), Rademacher, PAC-Bayesian, Robustness and Stability based bounds. In addition, the book explains domain adaptation problem and describes the four major families of theoretical results that exist in the literature, including the Divergence based bounds. Next, PAC-Bayesian bounds are discussed, including the original PAC-Bayesian bounds for domain adaptation and their updated version. Additional sections present generalization guarantees based on the robustness and stability properties of the learning algorithm.
1. Introduction
2. State-of-the-art on statistical learning theory
3. Domain adaptation problem
4. Divergence based bounds
5. PAC-Bayes bounds for domain adaptation
6. Robustness and adaptation
7. Stability and hypothesis transfer learning
8. Impossibility results
9. Conclusions and open discussions
Subject Areas: Algorithms & data structures [UMB], Applied mathematics [PBW], Number theory [PBH], Mathematics [PB]