Name
Abstract | ||
|---|---|---|
A common strategy for sparse linear regression is to introduce regularization, which eliminates irrelevant features by letting the corresponding weights be zeros. However, regularization often shrinks the estimator for relevant features, which leads to incorrect feature selection. Motivated by the above-mentioned issue, we propose Bayesian masking (BM), a sparse estimation method which imposes no regularization on the weights. The key concept of BM is to introduce binary latent variables that randomly mask features. Estimating the masking rates determines the relevance of the features automatically. We derive a variational Bayesian inference algorithm that maximizes the lower bound of the factorized information criterion (FIC), which is a recently developed asymptotic criterion for evaluating the marginal log-likelihood. In addition, we propose reparametrization to accelerate the convergence of the derived algorithm. Finally, we show that BM outperforms Lasso and automatic relevance determination (ARD) in terms of the sparsity-shrinkage trade-off. |
Year | Venue | Field |
|---|---|---|
2015 | ACML | Bayesian inference,Feature selection,Pattern recognition,Upper and lower bounds,Lasso (statistics),Regularization (mathematics),Artificial intelligence,Bayes estimator,Machine learning,Mathematics,Bayesian probability,Estimator |
DocType | Volume | Citations |
Journal | abs/1509.01004 | 0 |
PageRank | References | Authors |
0.34 | 9 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| yohei kondo | 1 | 0 | 0.34 |
| Hayashi, Kohei | 2 | 159 | 15.31 |
| Shin-ichi Maeda | 3 | 238 | 13.16 |