Adaptive Feature Ranking for Unsupervised Transfer Learning
Transfer Learning is concerned with the application of knowledge gained from solving a problem to a different but related problem domain. In this paper, we propose a method and efficient algorithm for ranking and selecting representations from a Restricted Boltzmann Machine trained on a source domain to be transferred onto a target domain. Experiments carried out using the MNIST, ICDAR and TiCC image datasets show that the proposed adaptive feature ranking and transfer learning method offers statistically significant improvements on the training of RBMs. Our method is general in that the knowledge chosen by the ranking function does not depend on its relation to any specific target domain, and it works with unsupervised learning and knowledge-based transfer.
Code (0)
등록된 구현이 없습니다.
Tasks
Transfer LearningMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Box Re-Ranking: Unsupervised False Positive Suppression for Domain Adaptive Pedestrian Detection
False positive is one of the most serious problems brought by agnostic domain shift in domain adaptive pedestrian detection. However, it is impossible to label each box in countless target domains. Therefore, it yields o…
object-detectionObject DetectionPedestrian DetectionRe-RankingQD-PCQA: Quality-Aware Domain Adaptation for Point Cloud Quality Assessment
No-Reference Point Cloud Quality Assessment (NR-PCQA) still struggles with generalization, primarily due to the scarcity of annotated point cloud datasets. Since the Human Visual System (HVS) drives perceptual quality as…
Unsupervised Domain AdaptationPoint Cloud Quality AssessmentPoint CloudsUnsupervised Domain Adaptive Lane Detection via Contextual Contrast and Aggregation
This paper focuses on two crucial issues in domain-adaptive lane detection, i.e., how to effectively learn discriminative features and transfer knowledge across domains. Existing lane detection methods usually exploit a …
Lane DetectionLeveraging Estimated Transferability Over Human Intuition for Model Selection in Text Ranking
Text ranking has witnessed significant advancements, attributed to the utilization of dual-encoder enhanced by Pre-trained Language Models (PLMs). Given the proliferation of available PLMs, selecting the most effective o…
Model SelectionSentenceSentence EmbeddingsLearning List-Level Domain-Invariant Representations for Ranking
Domain adaptation aims to transfer the knowledge learned on (data-rich) source domains to (low-resource) target domains, and a popular method is invariant representation learning, which matches and aligns the data distri…
Domain AdaptationPassage RerankingRepresentation LearningReranking+1