RTF-Q: Efficient Unsupervised Domain Adaptation with Retraining-free Quantization
Performing unsupervised domain adaptation on resource-constrained edge devices is challenging. Existing research typically adopts architecture optimization (e.g., designing slimmable networks) but requires expensive training costs. Moreover, it does not consider the considerable precision redundancy of parameters and activations. To address these limitations, we propose efficient unsupervised domain adaptation with ReTraining-Free Quantization (RTF-Q). Our approach uses low-precision quantization architectures with varying computational costs, adapting to devices with dynamic computation budgets. We subtly configure subnet dimensions and leverage weight-sharing to optimize multiple architectures within a single set of weights, enabling the use of pre-trained models from open-source repositories. Additionally, we introduce multi-bitwidth joint training and the SandwichQ rule, both of which are effective in handling multiple quantization bit-widths across subnets. Experimental results demonstrate that our network achieves competitive accuracy with state-of-the-art methods across three benchmarks while significantly reducing memory and computational costs.
Code (0)
등록된 구현이 없습니다.
Tasks
Domain AdaptationQuantizationUnsupervised Domain AdaptationMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Align, Minimize and Diversify: A Source-Free Unsupervised Domain Adaptation Method for Handwritten Text Recognition
This paper serves to introduce the Align, Minimize and Diversify (AMD) method, a Source-Free Unsupervised Domain Adaptation approach for Handwritten Text Recognition (HTR). This framework decouples the adaptation process…
Domain AdaptationHandwritten Text RecognitionHTRUnsupervised Domain AdaptationUnsupervised Domain Adaptation of Contextualized Embeddings for Sequence Labeling
Contextualized word embeddings such as ELMo and BERT provide a foundation for strong performance across a wide range of natural language processing tasks by pretraining on large corpora of unlabeled text. However, the ap…
Domain AdaptationLanguage ModelingLanguage ModellingMasked Language Modeling+3Confidence Score Weighting Adaptation for Source-Free Unsupervised Domain Adaptation
Unsupervised domain adaptation (UDA) aims to achieve high performance within the unlabeled target domain by leveraging the labeled source domain. Source-free UDA, which is a more challenging UDA task, can access the pre-…
Domain AdaptationPseudo LabelUnsupervised Domain AdaptationTemporal Source Recovery for Time-Series Source-Free Unsupervised Domain Adaptation
Source-Free Unsupervised Domain Adaptation (SFUDA) has gained popularity for its ability to adapt pretrained models to target domains without accessing source domains, ensuring source data privacy. While SFUDA is well-de…
DiversityDomain AdaptationTime SeriesUnsupervised Domain AdaptationWhen Cars meet Drones: Hyperbolic Federated Learning for Source-Free Domain Adaptation in Adverse Weather
In Federated Learning (FL), multiple clients collaboratively train a global model without sharing private data. In semantic segmentation, the Federated source Free Domain Adaptation (FFreeDA) setting is of particular int…
Autonomous VehiclesDomain AdaptationFederated LearningSegmentation+2