Trust your Good Friends: Source-free Domain Adaptation by Reciprocal Neighborhood Clustering
Domain adaptation (DA) aims to alleviate the domain shift between source domain and target domain. Most DA methods require access to the source data, but often that is not possible (e.g. due to data privacy or intellectual property). In this paper, we address the challenging source-free domain adaptation (SFDA) problem, where the source pretrained model is adapted to the target domain in the absence of source data. Our method is based on the observation that target data, which might not align with the source domain classifier, still forms clear clusters. We capture this intrinsic structure by defining local affinity of the target data, and encourage label consistency among data with high local affinity. We observe that higher affinity should be assigned to reciprocal neighbors. To aggregate information with more context, we consider expanded neighborhoods with small affinity values. Furthermore, we consider the density around each target sample, which can alleviate the negative impact of potential outliers. In the experimental results we verify that the inherent structure of the target features is an important source of information for domain adaptation. We demonstrate that this local structure can be efficiently captured by considering the local neighbors, the reciprocal neighbors, and the expanded neighborhood. Finally, we achieve state-of-the-art performance on several 2D image and 3D point cloud recognition datasets.
Code (0)
등록된 구현이 없습니다.
Tasks
ClusteringDomain AdaptationSource-Free Domain AdaptationMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Why You Should Charge Your Friends for Borrowing Your Stuff
We consider goods that can be shared with k-hop neighbors (i.e., the set of nodes within k hops from an owner) on a social network. We examine incentives to buy such a good by devising game-theoretic models where each no…
The happiness paradox: your friends are happier than you
Most individuals in social networks experience a so-called Friendship Paradox: they are less popular than their friends on average. This effect may explain recent findings that widespread social network media use leads t…
Truly Costly Search and Word-of-Mouth Communication
In markets with search frictions, consumers can acquire information about goods either through costly search or from friends via word-of-mouth (WOM) communication. How do sellers' market power react to a very large incre…
“What Do Your Friends Think?”: Efficient Polling Methods for Networks Using Friendship Paradoxhttps://ieeexplore.ieee.org/abstract/document/8832260
This paper deals with randomized polling of a social network. In the case of forecasting the outcome of an election between two candidates A and B, classical intent polling asks randomly sampled individuals: who will you…
Find Your Friends: Personalized Federated Learning with the Right Collaborators
In the traditional federated learning setting, a central server coordinates a network of clients to train one global model. However, the global model may serve many clients poorly due to data heterogeneity. Moreover, the…
Federated LearningPersonalized Federated Learning