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 条
  • [1] Sparse functional linear models via calibrated concave-convex procedure
    Young Joo Lee
    Yongho Jeon
    Journal of the Korean Statistical Society, 2024, 53 : 189 - 207
  • [2] Sparse graphical models via calibrated concave convex procedure with application to fMRI data
    Son, Sungtaek
    Park, Cheolwoo
    Jeon, Yongho
    JOURNAL OF APPLIED STATISTICS, 2020, 47 (06) : 997 - 1016
  • [3] The concave-convex procedure
    Yuille, AL
    Rangarajan, A
    NEURAL COMPUTATION, 2003, 15 (04) : 915 - 936
  • [4] The Concave-Convex procedure (CCCP)
    Yuille, AL
    Rangarajan, A
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 14, VOLS 1 AND 2, 2002, 14 : 1033 - 1040
  • [5] Iterative decoding based on the concave-convex procedure
    Shibuya, T
    Harada, K
    Tohyama, R
    Sakaniwa, K
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2005, E88A (05): : 1346 - 1364
  • [6] A Concave-Convex Procedure for TDOA Based Positioning
    Gholami, Mohammad Reza
    Gezici, Sinan
    Strom, Erik G.
    IEEE COMMUNICATIONS LETTERS, 2013, 17 (04) : 765 - 768
  • [7] On a decoding algorithm for LDPC codes based on the concave-convex procedure
    Shibuya, T
    Sakaniwa, K
    2003 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, 2003, : 148 - 148
  • [8] Performance of a decoding algorithm for LDPC codes based on the concave-convex procedure
    Shibuya, T
    Sakaniwa, K
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2003, E86A (10) : 2601 - 2606
  • [9] A Proof of Convergence of the Concave-Convex Procedure Using Zangwill's Theory
    Sriperumbudur, Bharath K.
    Lanckriet, Gert R. G.
    NEURAL COMPUTATION, 2012, 24 (06) : 1391 - 1407
  • [10] ConCave-Convex procedure for support vector machines with Huber loss for text classification
    Borah, Parashjyoti
    Gupta, Deepak
    Hazarika, Barenya Bikash
    COMPUTERS & ELECTRICAL ENGINEERING, 2025, 122