Empirically Measuring Transfer Distance for System Design and Operation
Not on the map. Why?
Abstract (arXiv)
Classical machine learning approaches are sensitive to non-stationarity. Transfer learning can address non-stationarity by sharing knowledge from one system to another, however, in areas like machine prognostics and defense, data is fundamentally limited. Therefore, transfer learning algorithms have little, if any, examples from which to learn. Herein, we suggest that these constraints on algorithmic learning can be addressed by systems engineering. We formally define transfer distance in general terms and demonstrate its use in empirically quantifying the transferability of models. We consider the use of transfer distance in the design of machine rebuild procedures to allow for transferable prognostic models. We also consider the use of transfer distance in predicting operational performance in computer vision. Practitioners can use the presented methodology to design and operate systems with consideration for the learning theoretic challenges faced by component learning systems.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 10 of its 55 references that are in the map. First posted on arXiv 2 Jul 2021.
Builds on
10 of 55 references.
References · 10
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
- 2013Auto-Encoding Variational Bayescited by 3,980
- 2015Domain-Adversarial Training of Neural Networkscited by 3,023
- 2016Deep Transfer Learning with Joint Adaptation Networkscited by 609
- 2018Characterizing and Avoiding Negative Transfercited by 226
- 2015Simultaneous Deep Transfer Across Domains and Taskscited by 205
- 2020A survey on domain adaptation theory: learning bounds and theoretical guaranteescited by 109
- 2015Characterizing Concept Driftcited by 93
- 2013Generalization Bounds for Domain Adaptationcited by 27
- 2020Anomalous Example Detection in Deep Learning: A Surveycited by 16
Built on by
Citing papers per year: 2024: 1.
1 paper.