MATH · IN · MODELS
methods / Dictionary Learning / k-Subspace Clustering

k-Subspace Clustering

Techniqueadvanced

Groups an already-trained sparse dictionary's decoder atoms into candidate low-rank subspaces by fitting a mixture of linear subspaces (rather than point clusters) to the atom set, surfacing groups of latents that jointly span a shared direction set.

Used in (1 observation)

structure: Belief State Geometry Hypothesis (Mixed-State Presentation), Polytope (Simplex) · models: Gemma-2-9B · paper: Finding Belief Geometries with Sparse Autoencoders