paper-with-me

홈 › Papers

Vertical Consensus Inference for High-Dimensional Random Partition

2026-03-29 · Khai Nguyen, Yang Ni, Peter Mueller 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.

📄 PDF Abstract BibTeX arXiv:2603.27864

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Autonomous Collaborative Learning Among an Ensemble of Tsetlin Machines with Consensus-Based Inference

2026-07-22 · Yehuda Rudin, Osnat Keren, Michal Yemini, Alexander Fish arxiv

Tsetlin Machine (TM) is a rule-based machine-learning algorithm comprising collectives of two-action Tsetlin Automata (TAs) that cooperatively form conjunctive logical clauses from Boolean inputs through stochastic feedb…

Federated Learning

Consensus Based Multi-Layer Perceptrons for Edge Computing

2021-02-09 · Haimonti Dutta, Nitin Nataraj, Saurabh Amarnath Mahindre

In recent years, storing large volumes of data on distributed devices has become commonplace. Applications involving sensors, for example, capture data in different modalities including image, video, audio, GPS and other…

Edge-computing

Determining the Number of Clusters via Iterative Consensus Clustering

2014-08-05 · Shaina Race, Carl Meyer, Kevin Valakuzhy

We use a cluster ensemble to determine the number of clusters, k, in a group of data. A consensus similarity matrix is formed from the ensemble using multiple algorithms and several values for k. A random walk is induced…

Clustering

VertCoHiRF: Decentralized Vertical Clustering Beyond k-means

2026-02-07 · Bruno Belucci, Karim Lounici, Vladimir R. Kostic, Katia Meziani arxiv

Vertical Federated Learning (VFL) enables collaborative analysis across parties holding complementary feature views of the same samples, yet existing approaches are largely restricted to distributed variants of $k$-means…

Federated Learning

Feature Inference Attack on Model Predictions in Vertical Federated Learning

2020-10-20 · Xinjian Luo, Yuncheng Wu, Xiaokui Xiao, Beng Chin Ooi

Federated learning (FL) is an emerging paradigm for facilitating multiple organizations' data collaboration without revealing their private data to each other. Recently, vertical FL, where the participating organizations…

Federated LearningInference AttackPredictionVertical Federated Learning