Understanding Clustering in Slot Attention via Particle Dynamics
cs.LG, cs.AI, cs.CV
Submitted: 2026-10-03
Updated: 2026-10-03
Comments: 13 pages, 4 figures. Accepted to the DynaFront workshop at NeurIPS 2026
License: http://creativecommons.org/licenses/by/4.0/
The gist: Studying attention through the lens of interacting particle dynamics has shown how token clustering can emerge from the underlying dynamics.
Terminology
Abstract
Studying attention through the lens of interacting particle dynamics has shown how token clustering can emerge from the underlying dynamics. We extend this perspective to slot attention, a method for object-centric image segmentation and representation learning in which learned components obscure how much of the clustering behaviour is intrinsic to the attention dynamics. We therefore introduce simplified slot attention (SSA), a parameter-free variant whose dynamics are connected to soft k-means clustering and which provides a straightforward mechanistic explanation for the emergence of object-centric representations. On the Pascal VOC dataset, SSA achieves performance comparable to that of slot attention, demonstrating that competitive object-centric segmentation can be achieved without learned neural-network components.
Sources
- Layer Normalization
- Emerging Properties in Self-Supervised Vision Transformers
- Quantitative Clustering in Mean-Field Transformer Models
- Learning Phrase Representations using RNN Encoder-Decoder for Statistical Machine Translation
- The emergence of clusters in self-attention dynamics
- A mathematical perspective on Transformers
- Clustering in Causal Attention Masking
- Attention Normalization Impacts Cardinality Generalization in Slot Attention
- Revisiting k-means: New Algorithms via Bayesian Nonparametrics
- The Mean-Field Dynamics of Transformers
- Bridging the Gap to Real-World Object-Centric Learning
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks