arXiv paper· information retrieval / recommender systems (generative retrieval)· method paper

Exploring Bottom-Up Clustering for Creating Semantic IDs

Leah Woldemariam, Sudhanshu Garg, Taha Belkhouja, Charles Kim-Yip, Ali Sahami

cs.IR · cs.AI

Quick verdict

Proposes bottom-up clustering for structure-preserving, unique Semantic IDs; mostly beats RQ-VAE, but Sports ties, no stats tests, one baseline limit claims.

Summary

The paper proposes constructing Semantic IDs (SIDs) for generative retrieval via bottom-up hierarchical clustering instead of top-down residual quantization. MiniBatch K-Means first partitions embeddings into fine-grained clusters; each item receives an enumerated within-cluster index as its last codeword, guaranteeing uniqueness; member-count-weighted centroids are then recursively merged into coarser levels, with a size cap splitting oversized groups. The authors compare against a hyperparameter-tuned RQ-VAE (256-codebook, 3 codebooks, extra dedup codeword) on Amazon Beauty, Sports & Outdoors, and a proprietary ~6M-item dataset embedded with a Qwen model. Bottom-up yields exactly one item per SID (vs 1.35-1.63 for RQ-VAE), higher silhouette scores on all three datasets (e.g., 0.29 vs 0.00 on the custom set), and higher Recall@10/NDCG@10 on Beauty and the custom set, but ties or slightly loses to RQ-VAE on Sports & Outdoors (Recall@10 0.0327 vs 0.0328) and has lower cosine similarity there (0.79 vs 0.88). Bottom-up clusters also contain more unique categories, which the authors attribute to granularity differences. Main limitations: no significance tests or seed variance, a single baseline (R-KMeans is not compared), an unnormalized category metric, an unreleased custom dataset, and no code.

Review complete

Assessment at a glance

information retrieval / recommender systems (generative retrieval)

5

risk flags identified

● high 1

● medium 4

● low 0

Reproducibility readinesslow
Code & data availablenot stated
Review confidencehigh
AI text signal0/20 passages flagged
Deep research viableCode-reproducibleNeeds GPU

4 strengths · 5 weaknesses · 5 author questions

AI text signal = Binoculars zero-shot detector score over 20 sampled passages (Fast-DetectGPT co-reported) — absence does not prove human authorship, and a flag does not imply misconduct.

Levels reflect verification complexity — not a quality score. Evolve never rates your paper.

Key claims under review

  • Bottom-up clustering produces Semantic IDs that are unique by construction, eliminating collisions without ad hoc deduplication steps.
  • Because items are grouped at the finest level first, bottom-up assignment preserves local embedding structure, yielding higher silhouette scores than RQ-VAE at the finest granularity on all three tested datasets.
  • The improved SID structure transfers to downstream next-product prediction, with higher Recall@10/NDCG@10 on Amazon Beauty and the custom 6M-item dataset.
  • The method scales to millions of items via chunked MiniBatch K-Means and weighted merging, and generalizes to unseen items via nearest-neighbor codeword inheritance.

Strengths

  • Uniqueness by construction

    Enumerating items within fine clusters as the L-th codeword guarantees one item per SID; Table 1 shows Avg. Rows per ID = 1.00 vs 1.35 (Beauty), 1.49 (Sports), 1.63 (custom) for RQ-VAE — the paper's headline problem is cleanly solved.

  • Consistent local-structure evidence

    Silhouette score at the finest level favors bottom-up on all three datasets: 0.29 vs 0.00 (custom), 0.07 vs -0.07 (Beauty), 0.07 vs 0.02 (Sports), directly supporting the bottom-up motivation in Sections 1 and 3.

  • Simple, scalable, training-free algorithm

  • Fairly tuned baseline

Weaknesses

  • Downstream claim contradicted by own table

  • Category-coherence metric contradicts the narrative

  • Single baseline, no ablations

  • Zero statistical rigor

  • Poor reproducibility

Full Review Report

$1.99 · one-time

Unlock the complete preliminary analysis Evolve produced for this paper.

Report preview

Scope & Claims

The paper (arXiv 2609.08310, NeurIPS 2026 formatting) targets identifier construction for generative retrieval: it replaces RQ-VAE-style top-down residual quantization with bottom-up hierarchical clustering so that Semantic IDs (SIDs) are unique by construction and preserve local embedding structure. Three central claims are made: (1) uniqueness is guaranteed by enumerating items within fine clusters (Section 3, Algorithm 1); (2) bottom-up merging preserves local neighborhoods, improving clustering quality; (3) this structure transfers to downstream next-product prediction. Experiments (Section 4, Table 1) cover Amazon Beauty, Sports & Outdoors, and a proprietary ~6M-item catalog (5.8M in the table caption) embedded with a Qwen model.

The remaining sections cover Methodology Assessment, Statistical Evidence, Results & Reproducibility, Limitations & Risks, and Verdict & Recommendations.

  • All 4 strengths & 5 weaknesses, analyzed in detail
  • 5 risk flags with severity, section & reviewer questions
  • Methods & statistical evidence assessment
  • 5 questions a peer reviewer would ask
  • Full six-dimension evaluation report & recommendations

One-time purchase · this paper only

One-time purchase, this paper only. AI-generated preliminary analysis — not peer review.

Frequently asked questions

What are Semantic IDs in generative recommendation?

Semantic IDs (SIDs) are short sequences of integer codewords that replace arbitrary item identifiers (like random hashes) in generative recommenders. They are derived from item embeddings so that similar items receive similar identifiers, which helps the model generalize to new items and shrinks the candidate space at each decoding step.

How does this paper make Semantic IDs unique?

It clusters item embeddings bottom-up: a MiniBatch K-Means pass creates fine-grained clusters, and each item gets an enumerated index within its cluster as the final codeword. Since indices are unique within a cluster, every item maps to exactly one SID — the paper reports an average of 1.00 item per ID versus 1.35-1.63 for RQ-VAE baselines.

Does bottom-up clustering beat RQ-VAE for Semantic IDs?

Partly. It wins on uniqueness (1.00 rows per ID) and silhouette score on all three tested datasets, and on Recall@10/NDCG@10 on Amazon Beauty and a private ~6M-item set. But on Sports & Outdoors it roughly ties RQ-VAE (Recall@10 0.0327 vs 0.0328) and has lower cosine similarity (0.79 vs 0.88). No statistical significance tests are reported.

Is the code or dataset from this paper available?

The paper does not mention a code release. Its largest experiments use a proprietary ~6 million item catalog with model-generated image captions; only the Amazon Beauty and Sports & Outdoors splits it also evaluates on are publicly available.

About this review

This is an AI-generated preliminary review by Evolve.Pub, produced from the openly available text of the paper. It is not peer review and does not represent the authors' views. The canonical record of the paper is at the publisher link above.

  • Figure 1 is a diagram; only its caption appears in the extracted text, so the visual content could not be assessed. No other truncation observed — references and Algorithm 1 are complete through the end.

Go deeper on this paper

Wrote a paper? Stress-test it before reviewers do.

Upload your manuscript for the same structured scrutiny — reasoning, statistics, evidence, figures, and reproducibility.

Scan your paper
Exploring Bottom-Up Clustering for Creating Semantic IDs | Evolve.Pub