Abstract
AbstractEncoding models provide a powerful framework to identify the information represented in brain recordings. In this framework, a stimulus representation is expressed within a feature space and is used in a regularized linear regression to predict brain activity. To account for a potential complementarity of different feature spaces, a joint model is fit on multiple feature spaces simultaneously. To adapt regularization strength to each feature space, ridge regression is extended to banded ridge regression, which optimizes a different regularization hyperparameter per feature space. The present paper proposes a method to decompose over feature spaces the variance explained by a banded ridge regression model. It also describes how banded ridge regression performs a feature-space selection, effectively ignoring non-predictive and redundant feature spaces. This feature-space selection leads to better prediction accuracy and to better interpretability. Banded ridge regression is then mathematically linked to a number of other regression methods with similar feature-space selection mechanisms. Finally, several methods are proposed to address the computational challenge of fitting banded ridge regressions on large numbers of voxels and feature spaces. All implementations are released in an open-source Python package called Himalaya.
Publisher
Cold Spring Harbor Laboratory
Reference127 articles.
1. Pixels to voxels: Modeling visual representation in the human brain;arXiv preprint,2014
2. Globally normalized transition-based neural networks;arXiv preprint,2016
3. Consistency of the group lasso and multiple kernel learning;Journal of Machine Learning Research,2008
4. Bach, F. R. , Lanckriet, G. R. , and Jordan, M. I. (2004). Multiple kernel learning, conic duality, and the SMO algorithm. In International conference on machine learning, page 6.
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献