FAStEN: An Efficient Adaptive Method for Feature Selection and Estimation in High-Dimensional Functional Regressions
Not on the map. Why?
Abstract (arXiv)
Functional regression analysis is an established tool for many contemporary scientific applications. Regression problems involving large and complex data sets are ubiquitous, and feature selection is crucial for avoiding overfitting and achieving accurate predictions. We propose a new, flexible and ultra-efficient approach to perform feature selection in a sparse high dimensional function-on-function regression problem, and we show how to extend it to the scalar-on-function framework. Our method, called FAStEN, combines functional data, optimization, and machine learning techniques to perform feature selection and parameter estimation simultaneously. We exploit the properties of Functional Principal Components and the sparsity inherent to the Dual Augmented Lagrangian problem to significantly reduce computational cost, and we introduce an adaptive scheme to improve selection accuracy. In addition, we derive asymptotic oracle properties, which guarantee estimation and selection consistency for the proposed FAStEN estimator. Through an extensive simulation study, we benchmark our approach to the best existing competitors and demonstrate a massive gain in terms of CPU time and selection performance, without sacrificing the quality of the coefficients' estimation. The theoretical derivations and the simulation study provide a strong motivation for our approach. Finally, we present an application to brain fMRI data from the AOMIC PIOP1 study. Complete FAStEN code is provided at https://github.com/IBM/funGCN.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 9 of its 92 references that are in the map. First posted on arXiv 26 Mar 2023.
Builds on
9 of 92 references.
References · 9
- 2021Convex optimizationcited by 2,479
- 2015A Unified Approach to Error Bounds for Structured Convex Optimization Problemscited by 21
- 2016A highly efficient semismooth Newton augmented Lagrangian method for solving Lasso problemscited by 14
- 2017In Defense of the Indefensible: A Very Naive Approach to High-Dimensional Inferencecited by 8
- 2022Nonlinear Sufficient Dimension Reduction for Distribution-on-Distribution Regressioncited by 8
- 2016Primal-Dual Rates and Certificatescited by 3
- 2019On function-on-function regression: Partial least squares approachcited by 2
- 2020Smooth Lasso Estimator for the Function-on-Function Linear Regression Modelcited by 2
- 2020An Efficient Semi-smooth Newton Augmented Lagrangian Method for Elastic Netcited by 1
Built on by
Citing papers per year: 2024: 2; 2025: 1; 2026: 1.
4 papers.
- 2025Forging Time Series with Language: A Large Language Model Approach to Synthetic Data Generationcited by 6
- 2024A new computationally efficient algorithm to solve Feature Selection for Functional Data Classification in high-dimensional spacescited by 2
- 2024Functional Graph Convolutional Networks: A unified multi-task and multi-modal learning framework to facilitate health and social-care insightscited by 1
- 2026A Doubly Robust Machine Learning Approach for Disentangling Treatment Effect Heterogeneity with Functional Outcomescited by 1
- 2026A Doubly Robust Machine Learning Approach for Disentangling Treatment Effect Heterogeneity with Functional Outcomes11 Feb 2026
- 2025Forging Time Series with Language: A Large Language Model Approach to Synthetic Data Generation21 May 2025
- 2024Functional Graph Convolutional Networks: A unified multi-task and multi-modal learning framework to facilitate health and social-care insights15 Mar 2024
- 2024A new computationally efficient algorithm to solve Feature Selection for Functional Data Classification in high-dimensional spaces11 Jan 2024