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

基于局部近似的依赖高斯专家集聚集

Aggregating Dependent Gaussian Experts in Local Approximation

University of Tuebingen(图宾根大学)

Hamed Jalali, Gjergji Kasneci

摘要:

分布式高斯过程(DGP)是将高斯过程(GP)扩展到大型数据集的重要局部逼近方法。代替全局估计,他们通过将训练集划分为子集来训练本地专家,从而降低了时间复杂度。该策略基于条件独立性假设,这基本上意味着本地专家之间存在完美的多样性。然而,在实践中,这一假设往往被违反,专家的聚集导致次优和不一致的解决方案。在本文中,我们提出了一种通过检测条件独立性的强烈违反来聚合高斯专家的新方法。专家之间的依赖性是通过使用高斯图形模型,产生的精度矩阵。精度矩阵编码专家之间的条件依赖,并用于检测强依赖的专家和构造一个改进的聚集。使用合成数据集和真实数据集,我们的实验评估表明,我们的新方法优于其他最先进的(SOTA)DGP方法,同时比基于独立专家的SOTA方法更具时间效率。

英文摘要:

Distributed Gaussian processes (DGPs) are prominent local approximation methods to scale Gaussian processes (GPs) to large datasets. Instead of a global estimation, they train local experts by dividing the training set into subsets, thus reducing the time complexity. This strategy is based on the conditional independence assumption, which basically means that there is a perfect diversity between the local experts. In practice, however, this assumption is often violated, and the aggregation of experts leads to sub-optimal and inconsistent solutions. In this paper, we propose a novel approach for aggregating the Gaussian experts by detecting strong violations of conditional independence. The dependency between experts is determined by using a Gaussian graphical model, which yields the precision matrix. The precision matrix encodes conditional dependencies between experts and is used to detect strongly dependent experts and construct an improved aggregation. Using both synthetic and real datasets, our experimental evaluations illustrate that our new method outperforms other state-of-the-art (SOTA) DGP approaches while being substantially more time-efficient than SOTA approaches, which build on independent experts.

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

↑