Cargando…
Fast Estimation of L1-Regularized Linear Models in the Mass-Univariate Setting
In certain modeling approaches, activation analyses of task-based fMRI data can involve a relatively large number of predictors. For example, in the encoding model approach, complex stimuli are represented in a high-dimensional feature space, resulting in design matrices with many predictors. Simila...
Autores principales: | , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer US
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8233242/ https://www.ncbi.nlm.nih.gov/pubmed/32935193 http://dx.doi.org/10.1007/s12021-020-09489-1 |
_version_ | 1783713807031336960 |
---|---|
author | Mohr, Holger Ruge, Hannes |
author_facet | Mohr, Holger Ruge, Hannes |
author_sort | Mohr, Holger |
collection | PubMed |
description | In certain modeling approaches, activation analyses of task-based fMRI data can involve a relatively large number of predictors. For example, in the encoding model approach, complex stimuli are represented in a high-dimensional feature space, resulting in design matrices with many predictors. Similarly, single-trial models and finite impulse response models may also encompass a large number of predictors. In settings where only few of those predictors are expected to be informative, a sparse model fit can be obtained via L1-regularization. However, estimating L1-regularized models requires an iterative fitting procedure, which considerably increases computation time compared to estimating unregularized or L2-regularized models, and complicates the application of L1-regularization on whole-brain data and large sample sizes. Here we provide several functions for estimating L1-regularized models that are optimized for the mass-univariate analysis approach. The package includes a parallel implementation of the coordinate descent algorithm for CPU-only systems and two implementations of the alternating direction method of multipliers algorithm requiring a GPU device. While the core algorithms are implemented in C++/CUDA, data input/output and parameter settings can be conveniently handled via Matlab. The CPU-based implementation is highly memory-efficient and provides considerable speed-up compared to the standard implementation not optimized for the mass-univariate approach. Further acceleration can be achieved on systems equipped with a CUDA-enabled GPU. Using the fastest GPU-based implementation, computation time for whole-brain estimates can be reduced from 9 h to 5 min in an exemplary data setting. Overall, the provided package facilitates the use of L1-regularization for fMRI activation analyses and enables an efficient employment of L1-regularization on whole-brain data and large sample sizes. ELECTRONIC SUPPLEMENTARY MATERIAL: The online version of this article (10.1007/s12021-020-09489-1) contains supplementary material, which is available to authorized users. |
format | Online Article Text |
id | pubmed-8233242 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2020 |
publisher | Springer US |
record_format | MEDLINE/PubMed |
spelling | pubmed-82332422021-07-09 Fast Estimation of L1-Regularized Linear Models in the Mass-Univariate Setting Mohr, Holger Ruge, Hannes Neuroinformatics Software Original Article In certain modeling approaches, activation analyses of task-based fMRI data can involve a relatively large number of predictors. For example, in the encoding model approach, complex stimuli are represented in a high-dimensional feature space, resulting in design matrices with many predictors. Similarly, single-trial models and finite impulse response models may also encompass a large number of predictors. In settings where only few of those predictors are expected to be informative, a sparse model fit can be obtained via L1-regularization. However, estimating L1-regularized models requires an iterative fitting procedure, which considerably increases computation time compared to estimating unregularized or L2-regularized models, and complicates the application of L1-regularization on whole-brain data and large sample sizes. Here we provide several functions for estimating L1-regularized models that are optimized for the mass-univariate analysis approach. The package includes a parallel implementation of the coordinate descent algorithm for CPU-only systems and two implementations of the alternating direction method of multipliers algorithm requiring a GPU device. While the core algorithms are implemented in C++/CUDA, data input/output and parameter settings can be conveniently handled via Matlab. The CPU-based implementation is highly memory-efficient and provides considerable speed-up compared to the standard implementation not optimized for the mass-univariate approach. Further acceleration can be achieved on systems equipped with a CUDA-enabled GPU. Using the fastest GPU-based implementation, computation time for whole-brain estimates can be reduced from 9 h to 5 min in an exemplary data setting. Overall, the provided package facilitates the use of L1-regularization for fMRI activation analyses and enables an efficient employment of L1-regularization on whole-brain data and large sample sizes. ELECTRONIC SUPPLEMENTARY MATERIAL: The online version of this article (10.1007/s12021-020-09489-1) contains supplementary material, which is available to authorized users. Springer US 2020-09-15 2021 /pmc/articles/PMC8233242/ /pubmed/32935193 http://dx.doi.org/10.1007/s12021-020-09489-1 Text en © The Author(s) 2020 https://creativecommons.org/licenses/by/4.0/Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/ (https://creativecommons.org/licenses/by/4.0/) . |
spellingShingle | Software Original Article Mohr, Holger Ruge, Hannes Fast Estimation of L1-Regularized Linear Models in the Mass-Univariate Setting |
title | Fast Estimation of L1-Regularized Linear Models in the Mass-Univariate Setting |
title_full | Fast Estimation of L1-Regularized Linear Models in the Mass-Univariate Setting |
title_fullStr | Fast Estimation of L1-Regularized Linear Models in the Mass-Univariate Setting |
title_full_unstemmed | Fast Estimation of L1-Regularized Linear Models in the Mass-Univariate Setting |
title_short | Fast Estimation of L1-Regularized Linear Models in the Mass-Univariate Setting |
title_sort | fast estimation of l1-regularized linear models in the mass-univariate setting |
topic | Software Original Article |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8233242/ https://www.ncbi.nlm.nih.gov/pubmed/32935193 http://dx.doi.org/10.1007/s12021-020-09489-1 |
work_keys_str_mv | AT mohrholger fastestimationofl1regularizedlinearmodelsinthemassunivariatesetting AT rugehannes fastestimationofl1regularizedlinearmodelsinthemassunivariatesetting |