Sparse Methods for Automatic Relevance Determination

Abstract

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.

References in corpus (18)

• Rejoinder to "Least angle regression" by Efron et al
• Least Angle Regression
• Discussion of "Least angle regression" by Efron et al
• Discussion of "Least angle regression" by Efron et al
• Discussion of "Least angle regression" by Efron et al
• Discussion of "Least angle regression" by Efron et al
• Discussion of "Least angle regression" by Efron et al
• Discussion of "Least angle regression" by Efron et al
• Discussion of "Least angle regression" by Efron et al
• Discussion of "Least angle regression" by Efron et al
• Discovering governing equations from data: Sparse identification of nonlinear dynamical systems
• Coordinate descent algorithms for lasso penalized regression
• Deep Hidden Physics Models: Deep Learning of Nonlinear Partial Differential Equations
• Prediction of Dynamical Systems by Symbolic Regression
• How Entropic Regression Beats the Outliers Problem in Nonlinear System Identification
• Machine Discovery of Partial Differential Equations from Spatiotemporal Data
• SubTSBR to tackle high noise and outliers for data-driven discovery of differential equations
• Bayesian differential programming for robust systems identification under uncertainty

Cited by in corpus (1)

• Discovery of interpretable structural model errors by combining Bayesian sparse regression and data assimilation: A chaotic Kuramoto-Sivashinsky test case