.png){kind=icon}
返回
Distributed Bayesian matrix factorization with limited communication
.png){kind=icon}
OA
AI
DOI：10.1007/s10994-019-05778-2.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Bayesian matrix factorization (BMF) is a powerful tool for producing low-rank representations of matrices and for predicting missing values and providing confidence intervals. Scaling up the posterior inference for massive-scale matrices is challenging and requires distributing both data and computation over many workers, making communication the main computational bottleneck. Embarrassingly parallel inference would remove the communication needed, by using completely independent computations on different data subsets, but it suffers from the inherent unidentifiability of BMF solutions. We introduce a hierarchical decomposition of the joint posterior distribution, which couples the subset inferences, allowing for embarrassingly parallel computations in a sequence of at most three stages. Using an efficient approximate implementation, we show improvements empirically on both real and simulated data. Our distributed approach is able to achieve a speed-up of almost an order of magnitude over the full posterior, with a negligible effect on predictive accuracy. Our method outperforms state-of-the-art embarrassingly parallel MCMC methods in accuracy, and achieves results competitive to other available distributed and parallel implementations of BMF.
Keyword:
Bayesian matrix factorization
Embarrassingly parallel MCMC
Distributed inference
Posterior propagation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.9
论文数:
2.7K
被引数:
3.4W
机构
引用论文
.png){kind=icon}
分享收藏Querying Dynamic Wireless Sensor Networks with Non-revisiting Random Walks基于非重访随机游走的动态无线传感器网络查询
PREAI
分享收藏Limited SHIV env diversification in macaques failing oral antiretroviral pre-exposure prophylaxis
OAAI
OAAI分享收藏分享收藏 没有更多内容
没有更多内容