mlsanityData to 14 Oct 2026

Large-scale entity resolution via microclustering Ewens--Pitman random partitions

arXiv 2507.18101 ↗First posted 24 Jul 2025stat.ME math.ST stat.COcited by 0

Not on the map. Why?

Abstract (arXiv)

We introduce the microclustering Ewens--Pitman model for random partitions, obtained by scaling the strength parameter of the Ewens--Pitman model linearly with the sample size. The resulting random partition is shown to have the microclustering property, namely: the size of the largest cluster grows sub-linearly with the sample size, while the number of clusters grows linearly. By leveraging the interplay between the Ewens--Pitman random partition with the Pitman--Yor process, we develop efficient variational inference schemes for posterior computation in entity resolution. Our approach achieves a speed-up of three orders of magnitude over existing Bayesian methods for entity resolution, while maintaining competitive empirical performance.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 6 of its 26 references that are in the map. First posted on arXiv 24 Jul 2025.

Builds on

6 of 26 references.

References · 6

  1. 2018An Alternative View: When Does SGD Escape Local Minima?cited by 115
  2. 2015Are Gibbs-type priors the most natural generalization of the Dirichlet process?cited by 10
  3. 2016Flexible Models for Microclustering with Application to Entity Resolutioncited by 9
  4. 2020Random Partition Models for Microclustering Taskscited by 7
  5. 2016Fast Learning of Clusters and Topics via Sparse Posteriorscited by 2
  6. 2017Non-exchangeable random partition models for microclusteringcited by 2

Built on by

Not cited yet.