pith. sign in

arxiv: 1505.01461 · v1 · pith:SDEV2VN4new · submitted 2015-05-06 · 🧮 math.ST · stat.TH

Online Hyperparameter-Free Sparse Estimation Method

classification 🧮 math.ST stat.TH
keywords lassoonlineestimatorapproachhyperparameter-freesparseadvantagealgorithm
0
0 comments X
read the original abstract

In this paper we derive an online estimator for sparse parameter vectors which, unlike the LASSO approach, does not require the tuning of any hyperparameters. The algorithm is based on a covariance matching approach and is equivalent to a weighted version of the square-root LASSO. The computational complexity of the estimator is of the same order as that of the online versions of regularized least-squares (RLS) and LASSO. We provide a numerical comparison with feasible and infeasible implementations of the LASSO and RLS to illustrate the advantage of the proposed online hyperparameter-free estimator.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.