A Prototype-Oriented Clustering for Domain Shift with Source Privacy
Not on the map. Why?
Abstract (arXiv)
Unsupervised clustering under domain shift (UCDS) studies how to transfer the knowledge from abundant unlabeled data from multiple source domains to learn the representation of the unlabeled data in a target domain. In this paper, we introduce Prototype-oriented Clustering with Distillation (PCD) to not only improve the performance and applicability of existing methods for UCDS, but also address the concerns on protecting the privacy of both the data and model of the source domains. PCD first constructs a source clustering model by aligning the distributions of prototypes and data. It then distills the knowledge to the target model through cluster labels provided by the source model while simultaneously clustering the target data. Finally, it refines the target model on the target domain data without guidance from the source model. Experiments across multiple benchmarks show the effectiveness and generalizability of our source-private clustering method.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 70 of its 103 references that are in the map. First posted on arXiv 8 Feb 2023.
Builds on
70 of 103 references.
References · 70
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2020Language Models are Few-Shot Learnerscited by 32,199
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
- 2014Microsoft COCO: Common Objects in Contextcited by 17,498
- 2015Distilling the Knowledge in a Neural Networkcited by 10,076
- 2014ImageNet Large Scale Visual Recognition Challengecited by 8,441
- 2021Emerging Properties in Self-Supervised Vision Transformerscited by 6,893
- 2019CutMix: Regularization Strategy to Train Strong Classifiers with Localizable Featurescited by 2,875
- 2020Unsupervised Learning of Visual Features by Contrasting Cluster Assignmentscited by 2,845
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
- 2013Rich feature hierarchies for accurate object detection and semantic segmentationcited by 2,160
- 2014Unsupervised Domain Adaptation by Backpropagationcited by 1,906
38 more
- 2015Learning Transferable Features with Deep Adaptation Networkscited by 1,323
- 2017Adversarial Discriminative Domain Adaptationcited by 1,309
- 2017Deep Hashing Network for Unsupervised Domain Adaptationcited by 1,181
- 2016Temporal Ensembling for Semi-Supervised Learningcited by 1,054
- 2018Deep Clustering for Unsupervised Learning of Visual Featurescited by 1,020
- 2019When Does Label Smoothing Help?cited by 985
- 2017Deeper, Broader and Artier Domain Generalizationcited by 983
- 2020Do We Really Need to Access the Source Data? Source Hypothesis Transfer for Unsupervised Domain Adaptationcited by 844
- 2018Computational Optimal Transportcited by 765
- 2015Unsupervised Deep Embedding for Clustering Analysiscited by 763
- 2016Deep Transfer Learning with Joint Adaptation Networkscited by 609
- 2014Deep Domain Confusion: Maximizing for Domain Invariancecited by 597
- 2019Self-labelling via simultaneous clustering and representation learningcited by 525
- 2017Regularizing Neural Networks by Penalizing Confident Output Distributionscited by 461
- 2018Invariant Information Clustering for Unsupervised Image Classification and Segmentationcited by 454
- 2018Detecting and Correcting for Label Shift with Black Box Predictorscited by 364
- 2016Revisiting Batch Normalization For Practical Domain Adaptationcited by 285
- 2017Joint Distribution Optimal Transportation for Domain Adaptationcited by 280
- 2016Towards K-means-friendly Spaces: Simultaneous Deep Learning and Clusteringcited by 237
- 2018Characterizing and Avoiding Negative Transfercited by 226
- 2020Universal Source-Free Domain Adaptationcited by 219
- 2018A DIRT-T Approach to Unsupervised Domain Adaptationcited by 215
- 2019Data-Free Learning of Student Networkscited by 203
- 2021Generalized Source-free Domain Adaptationcited by 175
- 2020Domain Adaptation with Conditional Distribution Matching and Generalized Label Shiftcited by 124
- 2020Self-Knowledge Distillation with Progressive Refinement of Targetscited by 106
- 2021Domain Impression: A Source Data Free Domain Adaptation Methodcited by 91
- 2019Unsupervised Deep Learning by Neighbourhood Discoverycited by 78
- 2021Multi-view Contrastive Graph Clusteringcited by 76
- 2021FuseDream: Training-Free Text-to-Image Generation with Improved CLIP+GAN Space Optimizationcited by 71
- 2017Minimal-Entropy Correlation Alignment for Unsupervised Deep Domain Adaptationcited by 70
- 2021Multimodal Clustering Networks for Self-supervised Learning from Unlabeled Videoscited by 62
- 2021A Prototype-Oriented Framework for Unsupervised Domain Adaptationcited by 62
- 2022Towards Data-Free Model Stealing in a Hard Label Settingcited by 57
- 2021Knowing More About Questions Can Help: Improving Calibration in Question Answeringcited by 47
- 2018Deep Adversarial Attention Alignment for Unsupervised Domain Adaptation: the Benefit of Target Expectation Maximizationcited by 40
- 2021You Never Cluster Alonecited by 38
- 2022Representing Mixtures of Word Embeddings with Mixtures of Topic Embeddingscited by 36
50 most cited of 70 All 70 (JSON)
Built on by
Citing papers per year: 2023: 2.
2 papers.