arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2005.08741stat.MLcs.LGmath.STstat.TH
收藏

自动确定相关性的稀疏方法

Sparse Methods for Automatic Relevance Determination

Massachusetts Institute of Technology(麻省理工学院)

Samuel H. Rudy, Themistoklis P. Sapsis

摘要:

这项工作认为,在贝叶斯回归的应用在非线性系统识别的方法施加稀疏。我们首先回顾自动相关性确定(ARD)和分析证明需要额外的正则化或阈值,以实现稀疏模型。然后,我们讨论了两类方法,正则化和阈值的基础上,ARD学习线性问题的简约解决方案。在正交协变量的情况下,我们分析证明了良好的性能,关于学习一个小的一组活动项的线性系统与稀疏的解决方案。几个例子的问题,提出了一套比较所提出的方法的优势和局限性ARD在基地数百个元素。本文的目的是分析和理解导致几种算法的假设,并提供理论和实证结果,以便读者可以获得洞察力,并对稀疏贝叶斯回归做出更明智的选择。

英文摘要:

This work considers methods for imposing sparsity in Bayesian regression with applications in nonlinear system identification. We first review automatic relevance determination (ARD) and analytically demonstrate the need to additional regularization or thresholding to achieve sparse models. We then discuss two classes of methods, regularization based and thresholding based, which build on ARD to learn parsimonious solutions to linear problems. In the case of orthogonal covariates, we analytically demonstrate favorable performance with regards to learning a small set of active terms in a linear system with a sparse solution. Several example problems are presented to compare the set of proposed methods in terms of advantages and limitations to ARD in bases with hundreds of elements. The aim of this paper is to analyze and understand the assumptions that lead to several algorithms and to provide theoretical and empirical results so that the reader may gain insight and make more informed choices regarding sparse Bayesian regression.

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

↑