Penalized I-spline monotone regression estimation

  • Choi, Junsouk
  • Lee, JungJun
  • Jhong, Jae-Hwan
  • Koo, Ja-Yong
Citations

WEB OF SCIENCE

2
Citations

SCOPUS

2

초록

We propose a penalized regression spline estimator for monotone regression. To construct the estimator, we adopt the I-splines with the total variation penalty. The I-splines lend themselves to the monotonicity because of the simpler form of restrictions, and the total variation penalty induces a data-driven knot selection scheme. A coordinate descent algorithm is developed for the estimator. If the number of complexity parameter candidates sufficiently increases, the algorithm considers all possible monotone linear spline fits to the given data. The pruning process of the algorithm not only provides numerical stability, but also implements the data-driven knot selection. We also compute the maximum candidate of the complexity parameter to facilitate complexity parameter selection. Extensive numerical studies show that the proposed estimator captures spatially inhomogeneous behaviors of data, such as sudden jumps.

키워드

Coordinate descent algorithmI-splinesKnot selectionMaximum complexity parameterMonotone regressionTotal variation penaltySUBJECTCURVESGROWTH
제목
Penalized I-spline monotone regression estimation
저자
Choi, JunsoukLee, JungJunJhong, Jae-HwanKoo, Ja-Yong
DOI
10.1080/03610918.2019.1630433
발행일
2021-11-02
유형
Article
저널명
Communications in Statistics Part B: Simulation and Computation
50
11
페이지
3714 ~ 3732