Penalized polygram regression

Penalized polygram regression
Citations

WEB OF SCIENCE

1
Citations

SCOPUS

1

초록

We consider a study on regression function estimation over a bounded domain of arbitrary shapes based on triangulation and penalization techniques. A total variation type penalty is imposed to encourage fusion of adjacent triangles, which leads to a partition of the domain consisting of disjointed polygons. The proposed method provides a piecewise linear, and continuous estimator over a data adaptive polygonal partition of the domain. We adopt a coordinate decent algorithm to handle the non-separable structure of the penalty and investigate its convergence property. Regarding the asymptotic results, we establish an oracle type inequality and convergence rate of the proposed estimator. A numerical study is carried out to illustrate the performance of this method. An R software package polygram is available.

키워드

Barycentric coordinatesCoordinate descent algorithmMinimaxityPolygonal partitionsTriangulationPOLYNOMIAL SPLINESTENSOR-PRODUCTSBIVARIATEREGULARIZATIONAPPROXIMATIONCONVERGENCEASYMPTOTICSSELECTIONSPARSITY
제목
Penalized polygram regression
제목 (타언어)
Penalized polygram regression
저자
Jhong, Jae-HwanBak, Kwan-YoungKoo, Ja-Yong
DOI
10.1007/s42952-022-00181-5
발행일
2022-12
유형
Article
저널명
Journal of the Korean Statistical Society
51
4
페이지
1161 ~ 1192