Differentiable Sparse Coding - Robotics Institute Carnegie Mellon University

Differentiable Sparse Coding

Conference Paper, Proceedings of (NeurIPS) Neural Information Processing Systems, pp. 113 - 120, December, 2008

Abstract

Prior work has shown that features which appear to be biologically plausible as well as empirically useful can be found by sparse coding with a prior such as a laplacian that promotes sparsity. We show how smoother priors can preserve the benefits of these sparse priors while adding stability to the Maximum A-Posteriori (MAP) estimate that makes it more useful for prediction problems. Additionally, we show how to calculate the derivative of the MAP estimate efficiently with implicit differentiation. One prior that can be differentiated this way is KL-regularization. We demonstrate its effectiveness on a wide variety of applications, and find that online optimization of the parameters of the KL-regularized model can significantly improve prediction performance.

BibTeX

@conference{Bradley-2008-10129,
author = {David Bradley and J. Andrew (Drew) Bagnell},
title = {Differentiable Sparse Coding},
booktitle = {Proceedings of (NeurIPS) Neural Information Processing Systems},
year = {2008},
month = {December},
pages = {113 - 120},
keywords = {sparse coding, sparse approximation, semi-supervised learning, machine learning},
}