Non-Concave Penalized Likelihood with NP-Dimensionality

By Jianqing Fan, Jinchi Lv. 2009

434 citations recorded by the source corpus.

Penalized likelihood methods are fundamental to ultrahigh dimensional variable selection. How high dimensionality such methods can handle remains largely unknown. In this paper, we show that in the context of generalized linear models, such methods possess model selection consistency with oracle properties even for dimensionality of nonpolynomial (NP) order of sample size, for a class of penalized likelihood approaches using folded-concave penalty functions, which were introduced to ameliorate the bias problems of convex penalty functions. This fills a long-standing gap in the literature where the dimensionality is allowed to grow slowly with the sample size. Our results are also applicable to penalized likelihood with the L1-penalty, which is a convex function at the boundary of the class of folded-concave penalty functions under consideration. The coordinate optimization is implemented for finding the solution paths, whose performance is evaluated by a few simulation examples and the real data analysis.

Subfields: Artificial Intelligence, Control and Systems Engineering, Statistics and Probability

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Jianqing Fan
  2. Jinchi Lv
  3. Yingying Fan
  4. Hui Zou
  5. Lingzhou Xue
  6. Heng Peng
  7. Cheng Yong Tang
  8. Clifford Lam

In Control and Systems Engineering

  1. Jianqing Fan
  2. Jinchi Lv
  3. Yingying Fan
  4. Jelena Bradic
  5. Mladen Kolar
  6. Han Liu
  7. Rui Song
  8. Heng Peng

In Statistics and Probability

  1. Jianqing Fan
  2. Jinchi Lv
  3. Hui Zou
  4. Yingying Fan
  5. Cun-Hui Zhang
  6. Lingzhou Xue
  7. Heng Peng
  8. Clifford Lam

Citations in the corpus