This work proposes a two-step neural network procedure, estimating the transferable component from abundant unlabeled feature pairs that bridge the two input spaces and the non-transferable component from limited labels, and derives prediction risk bounds that improve on those of a non-transfer alternative when the non-transferable component is small or smooth.
Abstract
Pre-trained black-box predictive functions encode knowledge distilled from massive datasets and extensive computation. However, when the available input features differ from those the black box expects, direct use is infeasible. We introduce a method for transferring predictive knowledge from the black box to a new, heterogeneous input space. Our approach decomposes the target regression function into a transferable component, which the black box can inform, and a non-transferable component, which captures information unique to the new space. We propose a two-step neural network procedure, estimating the transferable component from abundant unlabeled feature pairs that bridge the two input spaces and the non-transferable component from limited labels. We derive prediction risk bounds that improve on those of a non-transfer alternative when the non-transferable component is small or smooth, and the procedure adapts to either case. Under additional conditions, the worst-case risk of our estimator is of strictly smaller polynomial order than the minimax risk of estimation from the labeled data alone. We extend the framework to multiple black boxes, each on its own input space, and show that aggregation can reduce prediction error relative to the best single black box. Simulated and real data demonstrate the practical value of the method.
Modern machine learning pipelines increasingly rely on reusing pretrained and foundation models across downstream tasks. These pretrained models can differ not only in performance but also in how they can be used: some only provide black-box predictions, while others may permit white-box access to internal representati...
This paper presents Hide&Seek, an end-to-end differentiable model for instance-wise feature selection and prediction under a single objective without information leakage that outperforms existing state-of-the-art models across a range of experiments and is fast to train.
This paper proposes ADA-CS, a plug-and-play module compatible with any ADA or ASFDA framework, and introduces a CSS metric to quantify the Concept Shift Severity across domains, revealing that non-negligible concept shift exists in many transfer tasks.
Black-box domain adaptation (BBDA) technologies have been extensively studied to transfer diagnosis knowledge from the source model to the target domain without accessing source data and source model parameters. However, existing BBDA methods assume identical fault categories across domains, which rarely holds in open...
Zongzhen Ye, Qi Deng, Xiang Xia et al.· IEEE Transactions on Reliabi...· 0 citations
The experiments show that CATTLE can learn generalized context from a single source data set and is rank-wise and statistically superior to nine state-of-the-art baselines, including machine learning, deep learning, and transfer learning methods using large-scale pre-trained models.
K. F. Akhter, Ibna Kowsar, Manar D. Samad· Neural Networks· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.