REVIEW 2 cited by
Deep Transfer Learning: Model Framework and Error Analysis
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
This paper presents a framework for deep transfer learning, which aims to leverage information from multi-domain upstream data with a large number of samples $n$ to a single-domain downstream task with a considerably smaller number of samples $m$, where $m \ll n$, in order to enhance performance on downstream task. Our framework offers several intriguing features. First, it allows the existence of both shared and domain-specific features across multi-domain data and provides a framework for automatic identification, achieving precise transfer and utilization of information. Second, the framework explicitly identifies upstream features that contribute to downstream tasks, establishing clear relationships between upstream domains and downstream tasks, thereby enhancing interpretability. Error analysis shows that our framework can significantly improve the convergence rate for learning Lipschitz functions in downstream supervised tasks, reducing it from $\tilde{O}(m^{-\frac{1}{2(d+2)}}+n^{-\frac{1}{2(d+2)}})$ ("no transfer") to $\tilde{O}(m^{-\frac{1}{2(d^*+3)}} + n^{-\frac{1}{2(d+2)}})$ ("partial transfer"), and even to $\tilde{O}(m^{-1/2}+n^{-\frac{1}{2(d+2)}})$ ("complete transfer"), where $d^* \ll d$ and $d$ is the dimension of the observed data. Our theoretical findings are supported by empirical experiments on image classification and regression datasets.
Forward citations
Cited by 2 Pith papers
-
A Unified Analysis of Generalization and Sample Complexity for Semi-Supervised Domain Adaptation
The sample complexity of MMD and adversarial domain-adaptive networks is upper-bounded by O(d^2 L^2 / eps^2), and the target-loss weight should scale as O(sqrt(M_t)).
-
Adaptive deep nonparametric regression from dependent data under covariate shift
Sparse-penalized deep networks for Huber and quantile regression under covariate shift are shown to attain minimax rates (up to logs) for dependent data satisfying a generalized Bernstein inequality.
Discussion (0). Continue with ORCID to comment.