arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2510.24318cs.LGcs.AI
收藏

变换器可以进行贝叶斯聚类

Transformers can do Bayesian Clustering

Delft University of Technology(代尔夫特理工大学)

Prajit Bhaskaran, Tom Viering

AI总结:

本文提出Cluster-PFN,一种基于变换器的模型,扩展了先验-数据拟合网络以实现无监督贝叶斯聚类。该方法在合成数据上训练,准确估计聚类数和分配,速度快于传统方法。

摘要:

贝叶斯聚类考虑不确定性但计算成本高。现实数据常含缺失值,简单填补忽略相关不确定性,导致结果不佳。我们提出Cluster-PFN,一种基于变换器的模型,扩展了先验-数据拟合网络(PFNs)以实现无监督贝叶斯聚类。该模型在合成数据上训练,学习估计聚类数和分配的后验分布。我们的方法在估计聚类数方面优于AIC、BIC和变分推断(VI)等手工模型选择方法,并在速度上比VI快多个数量级。Cluster-PFN可在包含缺失数据的复杂先验上训练,在高缺失率的现实基因组数据集上优于基于填补的基线方法。这些结果表明,Cluster-PFN能够提供可扩展且灵活的贝叶斯聚类。

英文摘要:

Bayesian clustering accounts for uncertainty but is computationally demanding at scale. Furthermore, real-world datasets often contain missing values, and simple imputation ignores the associated uncertainty, resulting in suboptimal results. We present Cluster-PFN, a Transformer-based model that extends Prior-Data Fitted Networks (PFNs) to unsupervised Bayesian clustering. Trained entirely on synthetic datasets generated from a finite Gaussian Mixture Model (GMM) prior, Cluster-PFN learns to estimate the posterior distribution over both the number of clusters and the cluster assignments. Our method estimates the number of clusters more accurately than handcrafted model selection procedures such as AIC, BIC and Variational Inference (VI), and achieves clustering quality competitive with VI while being orders of magnitude faster. Cluster-PFN can be trained on complex priors that include missing data, outperforming imputation-based baselines on real-world genomic datasets, at high missingness. These results show that the Cluster-PFN can provide scalable and flexible Bayesian clustering.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑