Scalable Model-Based Clustering with Sequential Monte Carlo
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917413433376768 |
|---|---|
| author | Trojan, Connie Myshkov, Pavel Fearnhead, Paul Hensman, James Minka, Tom Nemeth, Christopher |
| author_facet | Trojan, Connie Myshkov, Pavel Fearnhead, Paul Hensman, James Minka, Tom Nemeth, Christopher |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_14810 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Scalable Model-Based Clustering with Sequential Monte Carlo Trojan, Connie Myshkov, Pavel Fearnhead, Paul Hensman, James Minka, Tom Nemeth, Christopher Machine Learning Computation 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. |
| title | Scalable Model-Based Clustering with Sequential Monte Carlo |
| topic | Machine Learning Computation |
| url | https://arxiv.org/abs/2604.14810 |