REVIEW 3 cited by
Contrastive Clustering
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
In this paper, we propose a one-stage online clustering method called Contrastive Clustering (CC) which explicitly performs the instance- and cluster-level contrastive learning. To be specific, for a given dataset, the positive and negative instance pairs are constructed through data augmentations and then projected into a feature space. Therein, the instance- and cluster-level contrastive learning are respectively conducted in the row and column space by maximizing the similarities of positive pairs while minimizing those of negative ones. Our key observation is that the rows of the feature matrix could be regarded as soft labels of instances, and accordingly the columns could be further regarded as cluster representations. By simultaneously optimizing the instance- and cluster-level contrastive loss, the model jointly learns representations and cluster assignments in an end-to-end manner. Extensive experimental results show that CC remarkably outperforms 17 competitive clustering methods on six challenging image benchmarks. In particular, CC achieves an NMI of 0.705 (0.431) on the CIFAR-10 (CIFAR-100) dataset, which is an up to 19\% (39\%) performance improvement compared with the best baseline.
Forward citations
Cited by 3 Pith papers
-
Deep Clustering via Probabilistic Ratio-Cut Optimization
PRCut optimizes an upper bound on the expected graph ratio-cut via probabilistic assignments and stochastic gradients, beating spectral relaxation and matching state-of-the-art deep clustering on image benchmarks.
-
Policy-Based Trajectory Clustering in Offline Reinforcement Learning
Proposes Policy-Guided K-means and Centroid-Attracted Autoencoder for clustering offline RL trajectories by their generating policy, with a finite-step convergence result and an NP-completeness connection to graph coloring.
-
A Self-supervised Learning Method for Raman Spectroscopy based on Masked Autoencoders
A masked autoencoder trained to reconstruct randomly masked Raman spectra produces representations that enable 80.6% unsupervised clustering and 83.9% fine-tuned classification on 30 bacterial classes.
Discussion (0). Continue with ORCID to comment.