atlas

Research map / Learning theory and algorithms / Clustering

Contrastive Learning is Spectral Clustering on Similarity Graph

ICLR 2024 · Learning theory and algorithms › Clustering · approach: Spectral clustering algorithms · 2 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Proves that InfoNCE-based contrastive learning (SimCLR) equals spectral clustering on a similarity graph of augmentations, extends the result to CLIP's pair graph, and proposes Kernel-InfoNCE with mixtures of exponential kernels that beat the Gaussian kernel on CIFAR-10/100 and TinyImageNet.

Problem

Contrastive learning, notably SimCLR and CLIP, lacks a clear theoretical explanation of what objective it optimizes; existing spectral-contrastive analyses use a surrogate loss rather than the standard InfoNCE loss.

Approach

Models the augmentation similarity graph and the embedding Gram matrix as Markov random fields over subgraphs; shows that InfoNCE equals cross-entropy between these MRFs under a unitary out-degree constraint, which with a Gaussian kernel reduces to spectral clustering. The same argument covers CLIP's bipartite pair graph, and a maximum-entropy argument motivates exponential kernels, leading to mix

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
replace Gaussian kernel with a Simple Sum mixture of Gaussian and Laplacian kernels (ablation)SimCLR · CIFAR-10accuracy: 88.11 ± 0.09 -> 89.82 ± 0.09; 90.60 ± 0.15 -> 91.72 ± 0.10Helped
replace Gaussian kernel with a Simple Sum mixture of Gaussian and Laplacian kernels (ablation)SimCLR · CIFAR-100accuracy: 62.57 ± 0.10 -> 66.67 ± 0.20; 66.29 ± 0.12 -> 68.62 ± 0.15Helped
replace Gaussian kernel with a Simple Sum mixture of Gaussian and Laplacian kernels (ablation)SimCLR · TinyImageNetaccuracy: 34.00 ± 0.18 -> 36.61 ± 0.13; 37.83 ± 0.09 -> 39.38 ± 0.16Helped
replace Gaussian kernel with a Laplacian kernel (ablation)SimCLR · CIFAR-100, 400 epochsaccuracy: 66.29 ± 0.12 -> 66.09 ± 0.11No clear effect
replace Gaussian kernel with a gamma=0.5 exponential kernel (ablation)SimCLR · CIFAR-100accuracy: 62.57 ± 0.10 -> 63.48 ± 0.22; 66.29 ± 0.12 -> 65.81 ± 0.19Mixed
replace Gaussian kernel with a concatenation of Gaussian and Laplacian kernels (ablation)SimCLR · CIFAR-10accuracy: 88.11 ± 0.09 -> 89.89 ± 0.18; 90.60 ± 0.15 -> 91.28 ± 0.07Helped
replace Gaussian kernel with a concatenation of Gaussian and Laplacian kernels (ablation)SimCLR · CIFAR-100accuracy: 62.57 ± 0.10 -> 66.10 ± 0.21; 66.29 ± 0.12 -> 68.57 ± 0.11Helped
replace Gaussian kernel with a concatenation of Gaussian and Laplacian kernels (ablation)SimCLR · TinyImageNetaccuracy: 34.00 ± 0.18 -> 35.98 ± 0.17; 37.83 ± 0.09 -> 38.77 ± 0.22Helped
replace MoCo's Gaussian kernel with a Laplacian kernel (ablation)MoCo · CIFAR-100, 200 epochsaccuracy: 47.02 ± 0.11 -> 46.12 ± 0.22Hurt
replace MoCo's Gaussian kernel with a Simple Sum mixture (ablation)MoCo · CIFAR-100accuracy: 47.02 ± 0.11 -> 46.65 ± 0.06; 52.50 ± 0.07 -> 53.62 ± 0.19; 57.62 ± 0.15 -> 59.83 ± 0.12Mixed

Limitations

Experimental setup

Datasets: CIFAR-10 CIFAR-100 TinyImageNet

Benchmarks: CIFAR-10 CIFAR-100 TinyImageNet

Metrics: linear evaluation accuracy

Baselines: SimCLR (Gaussian kernel) MoCo Laplacian kernel gamma=0.5 exponential kernel

Builds on: SimCLR InfoNCE spectral contrastive loss (HaoChen et al.) CLIP MoCo

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy