Smoothing Splines Approximation Using Hilbert Curve Basis Selection. Issue 3 (3rd July 2022)

• Record Type: Journal Article
• Authors: Meng, Cheng; Yu, Jun; Chen, Yongkai; Zhong, Wenxuan; Ma, Ping
• Is Part Of: Journal of computational and graphical statistics. Volume 31:Issue 3(2022)
• Page Start: 802
• Page End: 812
• Publication Date: 2022-07-03
• Subjects: Nonparametric regression -- Penalized least squares -- Space-filling curve -- Subsampling; Mathematical statistics -- Data processing -- Periodicals; Mathematical statistics -- Graphic methods -- Periodicals; 519.50285
• DOI: 10.1080/10618600.2021.2002161
• Languages: English
• ISSNs: 1061-8600

Abstract

Abstract: Smoothing splines have been used pervasively in nonparametric regressions. However, the computational burden of smoothing splines is significant when the sample size n is large. When the number of predictors d ≥ 2, the computational cost for smoothing splines is at the order of O ( n 3 ) using the standard approach. Many methods have been developed to approximate smoothing spline estimators by using q basis functions instead of n ones, resulting in a computational cost of the order O ( n q 2 ) . These methods are called the basis selection methods. Despite algorithmic benefits, most of the basis selection methods require the assumption that the sample is uniformly distributed on a hypercube. These methods may have deteriorating performance when such an assumption is not met. To overcome the obstacle, we develop an efficient algorithm that is adaptive to the unknown probability density function of the predictors. Theoretically, we show the proposed estimator has the same convergence rate as the full-basis estimator when q is roughly at the order of O [ n 2 d / { ( p r + 1 ) ( d + 2 ) } ], where p ∈ [ 1, 2 ] and r ≈ 4 are some constants depend on the type of the spline. Numerical studies on various synthetic datasets demonstrate the superior performance of the proposed estimator in comparison with mainstream competitors. Supplementary files for this article are available online.