Consistency of Penalized Convex Regression
International Journal of Statistics and Probability · 2020
DOI: 10.5539/ijsp.v10n1p69 ↗Kurz gefasst
Fachartikel in der Zeitschrift International Journal of Statistics and Probability, 2020. Verfasst von Eunji Lim. Die Arbeit wurde bisher 1-mal zitiert (Crossref). Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
We consider the problem of estimating an unknown convex function f_* (0, 1)^d →R from data (X1, Y1), … (X_n; Y_n).A simple approach is finding a convex function that is the closest to the data points by minimizing the sum of squared errors over all convex functions. The convex regression estimator, which is computed this way, su ers from a drawback of having extremely large subgradients near the boundary of its domain. To remedy this situation, the penalized convex regression estimator, which minimizes the sum of squared errors plus the sum of squared norms of the subgradient over all convex functions, is recently proposed. In this paper, we prove that the penalized convex regression estimator and its subgradient converge with probability one to f_* and its subgradient, respectively, as n → ∞, and hence, establish the legitimacy of the penalized convex regression estimator.
Zitieren
APA
Lim, E. (2020). Consistency of Penalized Convex Regression. International Journal of Statistics and Probability. https://doi.org/10.5539/ijsp.v10n1p69
Vancouver
Lim E. Consistency of Penalized Convex Regression. International Journal of Statistics and Probability. 2020. doi:10.5539/ijsp.v10n1p69
BibTeX
@article{Lim2020,
author = {Lim, Eunji},
title = {Consistency of Penalized Convex Regression},
journal = {International Journal of Statistics and Probability},
year = {2020},
doi = {10.5539/ijsp.v10n1p69}
}
EUVIMED