paper-with-me

홈 › Papers

Polycentric Clustering and Structural Regularization for Source-free Unsupervised Domain Adaptation

2022-10-14 · Xinyu Guan, Han Sun, Ningzhong Liu, Huiyu Zhou

Source-Free Domain Adaptation (SFDA) aims to solve the domain adaptation problem by transferring the knowledge learned from a pre-trained source model to an unseen target domain. Most existing methods assign pseudo-labels to the target data by generating feature prototypes. However, due to the discrepancy in the data distribution between the source domain and the target domain and category imbalance in the target domain, there are severe class biases in the generated feature prototypes and noisy pseudo-labels. Besides, the data structure of the target domain is often ignored, which is crucial for clustering. In this paper, a novel framework named PCSR is proposed to tackle SFDA via a novel intra-class Polycentric Clustering and Structural Regularization strategy. Firstly, an inter-class balanced sampling strategy is proposed to generate representative feature prototypes for each class. Furthermore, k-means clustering is introduced to generate multiple clustering centers for each class in the target domain to obtain robust pseudo-labels. Finally, to enhance the model's generalization, structural regularization is introduced for the target domain. Extensive experiments on three UDA benchmark datasets show that our method performs better or similarly against the other state of the art methods, demonstrating our approach's superiority for visual domain adaptation problems.

📄 PDF Abstract BibTeX arXiv:2210.07463

Code (1)

gxinuu/pcsr 공식 구현 pytorch

Tasks

ClusteringDomain AdaptationSource-Free Domain AdaptationUnsupervised Domain Adaptation

Methods 이 논문이 사용한 방법론

k-Means Clustering k-Means Clustering is a clustering algorithm that divides a training set into $k$ different clusters of examples that are near each other. It works by initializing $k$…

Similar Papers 제목 키워드 기반

Unsupervised Domain Adaptation via Structurally Regularized Deep Clustering

2020-03-19 · CVPR 2020 6 · Hui Tang, Ke Chen, Kui Jia

Unsupervised domain adaptation (UDA) is to make predictions for unlabeled data on a target domain, given labeled data on a source domain whose distribution shifts from the target one. Mainstream UDA methods learn aligned…

ClusteringDeep ClusteringDomain AdaptationUnsupervised Domain Adaptation

Towards Uncovering the Intrinsic Data Structures for Unsupervised Domain Adaptation using Structurally Regularized Deep Clustering

2020-12-08 · Hui Tang, Xiatian Zhu, Ke Chen, Kui Jia 외

Unsupervised domain adaptation (UDA) is to learn classification models that make predictions for unlabeled data on a target domain, given labeled data on a source domain whose distribution diverges from the target one. M…

ClusteringConstrained ClusteringDeep ClusteringDomain Adaptation+4

New Online Communities: Graph Deep Learning on Anonymous Voting Networks to Identify Sybils in Polycentric Governance

2023-11-25 · Quinn DuPont

This research examines the polycentric governance of digital assets in blockchain-based Decentralized Autonomous Organizations (DAOs). It offers a theoretical framework and addresses a critical challenge facing decentral…

K-means Enhanced Density Gradient Analysis for Urban and Transport Metrics Using Multi-Modal Satellite Imagery

2025-04-15 · P. Tomkiewicz, J. Jaworski, P. Zielonka, A. Wilinski

This paper presents a novel computational approach for evaluating urban metrics through density gradient analysis using multi-modal satellite imagery, with applications including public transport and other urban systems.…

A Co-Evolutionary Theory of Human-AI Coexistence: Mutualism, Governance, and Dynamics in Complex Societies

2026-04-24 · Somyajit Chakraborty arxiv

Classical robot ethics is often framed around obedience, including Asimov's laws. This framing is insufficient for contemporary AI systems, which are increasingly adaptive, generative, embodied, and embedded in physical,…