atlas

Research map / Label-efficient and robust learning / Recognition and long-tail

Just Cluster It: An Approach for Exploration in High-Dimensions using Clustering and Pre-Trained Representations

ICML 2024 · Label-efficient and robust learning › Recognition and long-tail · approach: Contrastive representation theory · 1 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.

Proposes "Just Cluster It", an exploration method that estimates pseudo-counts by episodic GMM clustering and global cosine-threshold cluster tables over random or pre-trained DINOv2 features, evaluated on VizDoom and Habitat.

Problem

Count-based exploration in high-dimensional 3-D environments fails because pixel changes between transitions are large but not salient, so pseudo-count density models need appropriate state aggregation.

Approach

Cluster representations at two levels: episodic Gaussian mixture clustering of random or pre-trained DINOv2 embeddings, then a global cluster table where episodic centers are matched by cosine similarity against threshold kappa to accumulate pseudo-counts for an inverse-square-root intrinsic reward.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use random features instead of DINO featuresJust Cluster It · VizDoom MyWayHome (Sparse and VerySparse)convergence steps: around 1.7M -> around 1.5M; around 1.9M -> around 1.8MHelped
Use DINO features instead of random featuresJust Cluster It · Habitat-Replica Apartment-0visitation counts: 14K -> 17KHelped
Use Just Cluster It instead of RECODE with DINO featuresDINO-based exploration · VizDoom MyWayHome Sparseconvergence steps: 5M steps -> around 1.7MHelped
Use DINO features with Just Cluster It instead of RECODEHabitat-Replica Apartment-0 · Habitat-Replica Apartment-0visitation counts: slightly under 15K -> 17KHelped
Use clustering-based exploration instead of prediction-error methodsVizDoom MyWayHome · VizDoom MyWayHome Sparseconvergence steps: at least 5M stepsHelped
Use DINO-based Just Cluster It instead of Random Network DistillationHabitat-Replica Apartment-0 · Habitat-Replica Apartment-0visitation counts: around 5K -> 17KHelped
Increase cosine similarity threshold κ so the global cluster table becomes more granular (ablation)Just Cluster It · Habitat-Replica Apartment-0visitation countsHurt
Remove episodic clustering (ablation)Just Cluster It with DINO features · Habitat-Replica Apartment-0visitation countsHurt
Remove episodic clustering (ablation)Just Cluster It with random features · Habitat-Replica Apartment-0visitation countsNo clear effect
Remove episodic clustering (ablation)Just Cluster It · VizDoom MyWayHome VerySparseextrinsic rewardHurt
Replace DINOv2 small with DINOv2 large (ablation)Just Cluster It · Habitat-Replica Apartment-0visitation countsNo clear effect
Add random noise to observations (ablation)Just Cluster It · Habitat-Replica Apartment-0visitation countsNo clear effect

Surprising findings

Limitations

Experimental setup

Datasets: VizDoom MyWayHome Habitat Replica Apartment-0

Benchmarks: VizDoom MyWayHome Sparse VizDoom MyWayHome VerySparse Habitat Replica Apartment-0 visitation counts

Metrics: extrinsic reward visitation counts

Baselines: RECODE E3B Random Network Distillation Curiosity-driven exploration RIDE

Builds on: RECODE Never Give Up E3B Random Network Distillation PPO

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