Penalized logspline density estimation using total variation penalty

  • Bak, Kwan-Young
  • Jhong, Jae-Hwan
  • Lee, JungJun
  • Shin, Jae-Kyung
  • Koo, Ja-Yong
Citations

WEB OF SCIENCE

3
Citations

SCOPUS

3

초록

We study a penalized logspline density estimation method using a total variation penalty. The B-spline basis is adopted to approximate the logarithm of density functions. Total variation of derivatives of splines is penalized to impart a data-driven knot selection. The proposed estimator is a bonafide density function in the sense that it is positive and integrates to one. We devise an efficient coordinate descent algorithm for implementation and study its convergence property. An oracle inequality of the proposed estimator is established when the quality of fit is measured by the Kullback-Leibler divergence. Based on the oracle inequality, it is proved that the estimator achieves an optimal rate of convergence in the minimax sense. We also propose a logspline method for the bivariate case by adopting the tensor-product B-spline basis and a two-dimensional total variation type penalty. Numerical studies show that the proposed method captures local features without compromising the global smoothness. (C) 2020 Elsevier B.V. All rights reserved.

키워드

B-splineCoordinate descent algorithmKullback-Leibler divergenceOptimal convergence rateOracle inequalityGENERALIZED LINEAR-MODELSSPARSITYAPPROXIMATIONSELECTION
제목
Penalized logspline density estimation using total variation penalty
저자
Bak, Kwan-YoungJhong, Jae-HwanLee, JungJunShin, Jae-KyungKoo, Ja-Yong
DOI
10.1016/j.csda.2020.107060
발행일
2021-01
유형
Article
저널명
Computational Statistics and Data Analysis
153