Vector Quantized Latent Concepts: A Scalable Alternative to Clustering-Based Concept Discovery

Xuemin Yu, Ankur Garg, Samira Ebrahimi Kahou, Hassan Sajjad
2/2/2026
cs.LGcs.CL

No confident code implementation found for this paper.

Abstract

Deep Learning models encode rich semantic information in their hidden representations. However, it remains challenging to understand which parts of this information models actually rely on when making predictions. A promising line of post-hoc concept-based explanation methods relies on clustering token representations. However, commonly used approaches such as hierarchical clustering are computationally infeasible for large-scale datasets, and K-Means often yields shallow or frequency-dominated clusters. We propose the vector quantized latent concept (VQLC) method, a framework built upon the vector quantized-variational autoencoder (VQ-VAE) architecture that learns a discrete codebook mapping continuous representations to concept vectors. We perform thorough evaluations and show that VQLC improves scalability while maintaining comparable quality of human-understandable explanations.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{yu2026vector,
  title  = {Vector Quantized Latent Concepts: A Scalable Alternative to Clustering-Based Concept Discovery},
  author = {Xuemin Yu and Ankur Garg and Samira Ebrahimi Kahou and Hassan Sajjad},
  year   = {2026},
  eprint = {2602.02726},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2602.02726v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2602.02726.svg)](https://codeofpaper.com/paper/2602.02726)

Discussion