.png){kind=icon}
返回
Bayesian rank penalization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neunet.2019.04.018.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Rank minimization is a key component of many computer vision and machine learning methods, including robust principal component analysis (RPCA) and low-rank representations (LRR). However, usual methods rely on optimization to produce a point estimate without characterizing uncertainty in this estimate, and also face difficulties in tuning parameter choice. Both of these limitations are potentially overcome with Bayesian methods, but there is currently a lack of general purpose Bayesian approaches for rank penalization. We address this gap using a positive generalized double Pareto prior, illustrating the approach in RPCA and LRR. Posterior computation relies on hybrid Gibbs sampling and geodesic Monte Carlo algorithms. We assess performance in simulation examples, and benchmark data sets. (C) 2019 Elsevier Ltd. All rights reserved.
Keyword:
Bayesian model
Generalized double Pareto
LRR
Low-rank
RPCA
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.3
论文数:
8.3K
被引数:
3.0W
机构
引用论文
.png){kind=icon}
Tinnitus Retraining Therapy (TRT) as a Method for Treatment of Tinnitus and Hyperacusis Patients耳鸣再训练疗法 (TRT) 作为治疗耳鸣和高亢患者的方法
PREAI
分享收藏Mechanical characterization of neural electrodes based on PDMS-parylene C-PDMS sandwiched system
PREAI
分享收藏
查看更多内容