mlsanityData to 7 Oct 2026

Vertical Consensus Inference for High-Dimensional Random Partition

arXiv 2603.27864 ↗First posted 29 Mar 2026stat.ME stat.CO stat.MLcited by 1

Not on the map. Why?

Abstract (arXiv)

We review recently proposed Bayesian approaches for clustering high-dimensional data. After identifying the main limitations of available approaches, we introduce an alternative framework based on vertical consensus inference (VCI) to mitigate the curse of dimensionality in high-dimensional Bayesian clustering. VCI builds on the idea of consensus Monte Carlo by dividing the data into multiple shards (smaller subsets of variables), performing posterior inference on each shard, and then combining the shard-level posteriors to obtain a consensus posterior. The key distinction is that VCI splits the data vertically, producing vertical shards that retain the same number of observations but have lower dimensionality. We use an entropic regularized Wasserstein barycenter to define a consensus posterior. The shard-specific barycenter weights are constructed to favor shards that provide meaningful partitions, distinct from a trivial single cluster or all singleton clusters, favoring balanced cluster sizes and precise shard-specific posterior random partitions. We show that VCI can be interpreted as a variational approximation to the posterior under a hierarchical model with a generalized Bayes prior. For relatively low-dimensional problems, experiments suggest that VCI closely approximates inference based on clustering the entire multivariate data. For high-dimensional data and in the presence of many noninformative dimensions, VCI introduces a new framework for model-based and principled inference on random partitions. Although our focus here is on random partitions, VCI can be applied to any dimension-independent parameters and serves as a bridge to emerging areas in statistics such as consensus Monte Carlo, optimal transport, variational inference, and generalized Bayes.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 22 of its 63 references that are in the map. First posted on arXiv 29 Mar 2026.

Builds on

22 of 63 references.

References · 22

  1. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
  2. 2016Variational Inference: A Review for Statisticianscited by 1,466
  3. 2017Near-linear time approximation algorithms for optimal transport via Sinkhorn iterationcited by 219
  4. 2013Fast Computation of Wasserstein Barycenterscited by 216
  5. 2013Expectation Propagation for approximate Bayesian inferencecited by 172
  6. 2013A General Framework for Updating Belief Distributionscited by 172
  7. 2022Vertical Federated Learning: Concepts, Advances and Challengescited by 104
  8. 2015Scalable Bayes via Barycenter in Wasserstein Spacecited by 44
  9. 2013Asymptotically Exact, Embarrassingly Parallel MCMCcited by 30
  10. 2015Bayesian cluster analysis: Point estimation and credible ballscited by 16
  11. 2020Escaping the curse of dimensionality in Bayesian model based clusteringcited by 12
  12. 2013Parallelizing MCMC via Weierstrass Samplercited by 11
10 more
  1. 2015Are Gibbs-type priors the most natural generalization of the Dirichlet process?cited by 10
  2. 2021Search Algorithms and Loss Functions for Bayesian Clusteringcited by 9
  3. 2015Variational consensus Monte Carlocited by 6
  4. 2024Extending Mean-Field Variational Inference via Entropic Regularization: Theory and Computationcited by 4
  5. 2016Likelihood Inflating Sampling Algorithmcited by 3
  6. 2019Centered Partition Process: Informative Priors for Clusteringcited by 3
  7. 2019Consensus Monte Carlo for Random Subsets using Shared Anchorscited by 3
  8. 2024Interpolating between Optimal Transport and KL regularized Optimal Transport using R'enyi Divergencescited by 3
  9. 2022Using the left Gram matrix to cluster high dimensional datacited by 2
  10. 2018A Fast Algorithm for Clustering High Dimensional Feature Vectorscited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.