Sparse functional linear models via calibrated concave-convex procedure

被引:0
|
作者
Lee, Young Joo [1 ]
Jeon, Yongho [1 ]
机构
[1] Yonsei Univ, Dept Appl Stat, 50 Yonsei Ro, Seoul 03722, South Korea
基金
新加坡国家研究基金会;
关键词
Functional regression; Variable selection; High-dimensional regression; CCCP-SCAD; Gene expression data; VARIABLE SELECTION; CELL-CYCLE; GENE-EXPRESSION; ADAPTIVE LASSO; REGRESSION; GCR2;
D O I
10.1007/s42952-023-00242-3
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
In this paper, we propose a calibrated ConCave-Convex Procedure (CCCP) for variable selection in high-dimensional functional linear models. The calibrated CCCP approach for the Smoothly Clipped Absolute Deviation (SCAD) penalty is known to produce a consistent solution path with probability converging to one in linear models. We incorporate the SCAD penalty into function-on-scalar regression models and phrase them as a type of group-penalized estimation using a basis expansion approach. We then implement the calibrated CCCP method to solve the nonconvex group-penalized problem. For the tuning procedure, we use the Extended Bayesian Information Criterion (EBIC) to ensure consistency in high-dimensional settings. In simulation studies, we compare the performance of the proposed method with two existing convex-penalized estimators in terms of variable selection consistency and prediction accuracy. Lastly, we apply the method to the gene expression dataset for sparsely estimating the time-varying effects of transcription factors on the regulation of yeast cell cycle genes.
引用
收藏
页码:189 / 207
页数:19
相关论文
共 50 条
  • [21] Large-Scale MIMO Receiver Based on Finite-Alphabet Sparse Detection and Concave-Convex Optimization
    Meslem, Yacine
    Aissa-El-Bey, Abdeldjalil
    Djeddou, Mustapha
    PROCEEDINGS OF THE 21ST IEEE INTERNATIONAL WORKSHOP ON SIGNAL PROCESSING ADVANCES IN WIRELESS COMMUNICATIONS (IEEE SPAWC2020), 2020,
  • [22] On Schrodinger-Poisson systems involving concave-convex nonlinearities via a novel constraint approach
    Sun, Juntao
    Wu, Tsung-Fang
    COMMUNICATIONS IN CONTEMPORARY MATHEMATICS, 2021, 23 (06)
  • [23] Variable selection in multivariate linear models for functional data via sparse regularization
    Matsui, Hidetoshi
    Umezu, Yuta
    JAPANESE JOURNAL OF STATISTICS AND DATA SCIENCE, 2020, 3 (02) : 453 - 467
  • [24] Variable selection in multivariate linear models for functional data via sparse regularization
    Hidetoshi Matsui
    Yuta Umezu
    Japanese Journal of Statistics and Data Science, 2020, 3 : 453 - 467
  • [25] REPRESENTATION OF SYNTHETIC SHADOWS ON 3D DIGITAL MODELS FOR THE VOLUMETRIC INTERPRETATION ON CONCAVE-CONVEX ARCHAEOLOGICAL ARTIFACTS
    Garcia-Fernandez, J.
    Medeiros, L.
    Pernao, J.
    8TH INTERNATIONAL WORKSHOP 3D-ARCH: 3D VIRTUAL RECONSTRUCTION AND VISUALIZATION OF COMPLEX ARCHITECTURES, 2019, 42-2 (W9): : 355 - 359
  • [26] Sparse signal reconstruction via concave continuous piecewise linear programming
    Liu, Kuangyu
    Xu, Zhiming
    Xi, Xiangming
    Wang, Shuning
    DIGITAL SIGNAL PROCESSING, 2016, 54 : 12 - 26
  • [27] Porphyrin bearing phenothiazine pincers as hosts for fullerene binding via concave-convex complementarity: synthesis and complexation study
    Jain, Kanika
    Duvva, Naresh
    Roy, Tapta Kanchan
    Giribabu, Lingamallu
    Chitta, Raghu
    NEW JOURNAL OF CHEMISTRY, 2021, 45 (42) : 19691 - 19703
  • [28] Multiple positive solutions for a class of quasi-linear elliptic equations involving concave-convex nonlinearities and Hardy terms
    Tsing-San Hsu
    Boundary Value Problems, 2011 (1)
  • [29] Tight Convex and Concave Relaxations via Taylor Models for Global Dynamic Optimization
    Sahlodin, Ali M.
    Chachuat, Benoit
    21ST EUROPEAN SYMPOSIUM ON COMPUTER AIDED PROCESS ENGINEERING, 2011, 29 : 537 - 541
  • [30] Synthesis of Sparse Linear Array for Directional Modulation via Convex Optimization
    Hong, Tao
    Shi, Xiao-Pan
    Liang, Xue-Song
    IEEE TRANSACTIONS ON ANTENNAS AND PROPAGATION, 2018, 66 (08) : 3959 - 3972