Research
Scalable Model-Based Clustering with Sequential Monte Carlo
arXiv:2604.14810v1 Announce Type: cross Abstract: In online clustering problems, there is often a large amount of uncertainty over possible cluster assignments that cannot be resolved until more data
arXiv:2604.14810v1 Announce Type: cross Abstract: In online clustering problems, there is often a large amount of uncertainty over possible cluster assignments that cannot be resolved until more data are observed. This difficulty is compounded when clusters follow complex distributions, as is the case with text data. Sequential Monte Carlo (SMC) methods give a natural way of representing and updating this uncertainty over time, but have prohibitive memory requirements for large-scale problems. We propose a novel SMC algorithm that decomposes clustering problems into approximately independent subproblems, allowing a more compact representation of the algorithm state. Our approach is motivated by the knowledge base construction problem, and we show that our method is able to accurately and efficiently solve clustering problems in this setting and others where traditional SMC struggles.
Related
- Doubly Outlier-Robust Online Infinite Hidden Markov Model
- Scalable unsupervised feature selection via weight stability
- metasnf: Meta Clustering with Similarity Network Fusion in R
Source: arXiv cs.LG | 2026-04-17