IDEAS home Printed from https://ideas.repec.org/a/eee/csdana/v153y2021ics0167947320301511.html
   My bibliography  Save this article

Penalized logspline density estimation using total variation penalty

Author

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

Abstract

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 bona fide 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.

Suggested Citation

  • Bak, Kwan-Young & Jhong, Jae-Hwan & Lee, JungJun & Shin, Jae-Kyung & Koo, Ja-Yong, 2021. "Penalized logspline density estimation using total variation penalty," Computational Statistics & Data Analysis, Elsevier, vol. 153(C).
    • Handle: RePEc:eee:csdana:v:153:y:2021:i:c:s0167947320301511
    DOI: 10.1016/j.csda.2020.107060
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0167947320301511
    Download Restriction: Full text for ScienceDirect subscribers only.
    File URL: https://libkey.io/10.1016/j.csda.2020.107060?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. P. Tseng, 2001. "Convergence of a Block Coordinate Descent Method for Nondifferentiable Minimization," Journal of Optimization Theory and Applications, Springer, vol. 109(3), pages 475-494, June.
    2. Koo, Ja-Yong & Kooperberg, Charles, 2000. "Logspline density estimation for binned data," Statistics & Probability Letters, Elsevier, vol. 46(2), pages 133-147, January.
    3. Jérémie Bigot & Sébastien Van Bellegem, 2009. "Log‐density Deconvolution by Wavelet Thresholding," Scandinavian Journal of Statistics, Danish Society for Theoretical Statistics;Finnish Statistical Society;Norwegian Statistical Association;Swedish Statistical Association, vol. 36(4), pages 749-763, December.
    4. Friedman, Jerome H. & Hastie, Trevor & Tibshirani, Rob, 2010. "Regularization Paths for Generalized Linear Models via Coordinate Descent," Journal of Statistical Software, Foundation for Open Access Statistics, vol. 33(i01).
    5. Kooperberg, Charles & Stone, Charles J., 1991. "A study of logspline density estimation," Computational Statistics & Data Analysis, Elsevier, vol. 12(3), pages 327-347, November.
    6. Ja‐Yong Koo & Charles Kooperberg & Jinho Park, 1999. "Logspline Density Estimation under Censoring and Truncation," Scandinavian Journal of Statistics, Danish Society for Theoretical Statistics;Finnish Statistical Society;Norwegian Statistical Association;Swedish Statistical Association, vol. 26(1), pages 87-105, March.
    7. Sylvain Sardy & Paul Tseng, 2010. "Density Estimation by Total Variation Penalized Likelihood Driven by the Sparsity ℓ1 Information Criterion," Scandinavian Journal of Statistics, Danish Society for Theoretical Statistics;Finnish Statistical Society;Norwegian Statistical Association;Swedish Statistical Association, vol. 37(2), pages 321-337, June.
    8. Koo, Ja-Yong & Kim, Woo-Chul, 1996. "Wavelet density estimation by approximation of log-densities," Statistics & Probability Letters, Elsevier, vol. 26(3), pages 271-278, February.
    9. Qu, Leming & Yin, Wotao, 2012. "Copula density estimation by total variation penalized likelihood with linear equality constraints," Computational Statistics & Data Analysis, Elsevier, vol. 56(2), pages 384-398.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Koo, Ja-Yong & Kooperberg, Charles, 2000. "Logspline density estimation for binned data," Statistics & Probability Letters, Elsevier, vol. 46(2), pages 133-147, January.
    2. Griveau-Billion, Théophile & Richard, Jean-Charles & Roncalli, Thierry, 2013. "A Fast Algorithm for Computing High-dimensional Risk Parity Portfolios," MPRA Paper 49822, University Library of Munich, Germany.
    3. Murat Genç, 2022. "A new double-regularized regression using Liu and lasso regularization," Computational Statistics, Springer, vol. 37(1), pages 159-227, March.
    4. Lopes, Hedibert F. & Dias, Ronaldo, 2011. "Bayesian mixture of parametric and nonparametric density estimation: A Misspecification Problem," Brazilian Review of Econometrics, Sociedade Brasileira de Econometria - SBE, vol. 31(1), March.
    5. Pan, Yuqing & Mai, Qing, 2020. "Efficient computation for differential network analysis with applications to quadratic discriminant analysis," Computational Statistics & Data Analysis, Elsevier, vol. 144(C).
    6. Matthew Pietrosanu & Jueyu Gao & Linglong Kong & Bei Jiang & Di Niu, 2021. "Advanced algorithms for penalized quantile and composite quantile regression," Computational Statistics, Springer, vol. 36(1), pages 333-346, March.
    7. Cheik Traoré & Saverio Salzo & Silvia Villa, 2023. "Convergence of an asynchronous block-coordinate forward-backward algorithm for convex composite optimization," Computational Optimization and Applications, Springer, vol. 86(1), pages 303-344, September.
    8. Wu, Tong Tong & He, Xin, 2012. "Coordinate ascent for penalized semiparametric regression on high-dimensional panel count data," Computational Statistics & Data Analysis, Elsevier, vol. 56(1), pages 25-33, January.
    9. Victor Chernozhukov & Whitney K. Newey & Rahul Singh, 2022. "Automatic Debiased Machine Learning of Causal and Structural Effects," Econometrica, Econometric Society, vol. 90(3), pages 967-1027, May.
    10. Evans, R.J. & Forcina, A., 2013. "Two algorithms for fitting constrained marginal models," Computational Statistics & Data Analysis, Elsevier, vol. 66(C), pages 1-7.
    11. Jean-Charles Richard & Thierry Roncalli, 2019. "Constrained Risk Budgeting Portfolios: Theory, Algorithms, Applications & Puzzles," Papers 1902.05710, arXiv.org.
    12. Vincent, Martin & Hansen, Niels Richard, 2014. "Sparse group lasso and high dimensional multinomial classification," Computational Statistics & Data Analysis, Elsevier, vol. 71(C), pages 771-786.
    13. Federico Palacios-González & Rosa M. García-Fernández, 2020. "A faster algorithm to estimate multiresolution densities," Computational Statistics, Springer, vol. 35(3), pages 1207-1230, September.
    14. Nicholson, William B. & Matteson, David S. & Bien, Jacob, 2017. "VARX-L: Structured regularization for large vector autoregressions with exogenous variables," International Journal of Forecasting, Elsevier, vol. 33(3), pages 627-651.
    15. Koo, Ja-Yong, 1998. "Convergence Rates for Logspline Tomography," Journal of Multivariate Analysis, Elsevier, vol. 67(2), pages 367-384, November.
    16. Runmin Shi & Faming Liang & Qifan Song & Ye Luo & Malay Ghosh, 2018. "A Blockwise Consistency Method for Parameter Estimation of Complex Models," Sankhya B: The Indian Journal of Statistics, Springer;Indian Statistical Institute, vol. 80(1), pages 179-223, December.
    17. Michoel, Tom, 2016. "Natural coordinate descent algorithm for L1-penalised regression in generalised linear models," Computational Statistics & Data Analysis, Elsevier, vol. 97(C), pages 60-70.
    18. Sylvain Sardy & Paul Tseng, 2010. "Density Estimation by Total Variation Penalized Likelihood Driven by the Sparsity ℓ1 Information Criterion," Scandinavian Journal of Statistics, Danish Society for Theoretical Statistics;Finnish Statistical Society;Norwegian Statistical Association;Swedish Statistical Association, vol. 37(2), pages 321-337, June.
    19. Benjamin G. Stokell & Rajen D. Shah & Ryan J. Tibshirani, 2021. "Modelling high‐dimensional categorical data using nonconvex fusion penalties," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 83(3), pages 579-611, July.
    20. Sarah Perrin & Thierry Roncalli, 2019. "Machine Learning Optimization Algorithms & Portfolio Allocation," Papers 1909.10233, arXiv.org.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:csdana:v:153:y:2021:i:c:s0167947320301511. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/csda .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.