lspartition: PartitioningBased Least Squares Regression^{†}^{†}thanks: We thank Sebastian Calonico, David Drukker, and Xinwei Ma for thoughtful comments and suggestions on our software implementation and related articles. Cattaneo gratefully acknowledges financial support from the National Science Foundation (SES1459931).
Abstract
Nonparametric partitioningbased least squares regression is an important tool in empirical work. Common examples include regressions based on splines, wavelets, and piecewise polynomials. This article discusses the main methodological and numerical features of the R software package lspartition, which implements results for partitioningbased least squares (series) regression estimation and inference from Cattaneo and Farrell (2013) and Cattaneo, Farrell and
Feng (2019). These results cover the multivariate regression function as well as its derivatives. First, the package provides datadriven methods to choose the number of partition knots optimally, according to integrated mean squared error, yielding optimal point estimation. Second, robust bias correction is implemented to combine this point estimator with valid inference. Third, the package provides estimates and inference for the unknown function both pointwise and uniformly in the conditioning variables. In particular, valid confidence bands are provided. Finally, an extension to twosample analysis is developed, which can be used in treatmentcontrol comparisons and related problems.
[1]label*=()
Keywords: series nonparametrics, partitioning least squares, tuning parameter selection, robust biascorrected inference, confidence bands, splines, wavelets, piecewise polynomials, R.
1 Introduction
Nonparametric partitioningbased least squares regression estimation is an important method for estimating conditional expectation functions in statistics, economics, and other disciplines. These methods first partition the support of covariates and then construct a set of local basis functions on top of the partition to approximate the unknown regression function or its derivatives. Empirically popular basis functions include splines, compactly supported wavelets, and piecewise polynomials. For textbook reviews on classical and modern nonparametric regression methodology see, among others, Fan and Gijbels (1996), Györfi, Kohler, Krzyżak and Walk (2002), and Ruppert, Wand and Carroll (2009). For a review on partitioningbased approximations in nonparametrics and machine learning see Zhang and Singer (2010) and references therein.
This article gives a detailed discussion of the software package lspartition, available for R, which implements partitioningbased least squares regression estimation and inference. This package offers several features which improve on existing tools, leveraging the recent results of Cattaneo and Farrell (2013) and Cattaneo, Farrell and Feng (2019), and delivering datadriven methods to easily implement partitioningbased estimation and inference, including optimal tuning parameter choices and uniform inference results such as confidence bands. We cover splines, wavelets, and piecewise polynomials, in a unified way, encompassing prior methods and routines previously unavailable without manual coding by researchers.
The first contribution offered by lspartition is a datadriven choice of the number of partitioning knots that is optimal in an integrated mean squared error (IMSE) sense. A major hurdle to practical implementation of any nonparametric estimator is tuning parameter choice, and by offering several feasible IMSEoptimal methods for splines, compactly supported wavelets, and piecewise polynomials, lspartition provides practitioners with tools to overcome this important implementation issue.
However, point estimation optimal tuning parameter choices yield invalid inference in general, and the IMSEoptimal choice is no exception. The second contribution of lspartition is the inclusion of robust bias correction methods, which allow for inference based on optimal point estimator. lspartition implements the three methods studied by Cattaneo, Farrell and Feng (2019), which are based on novel bias expansions therein. Both the bias and variance quantities are kept in preasymptotic form, yielding better bias correction and standard errors robust to conditional heteroskedasticity of unknown form. Collectively, this style of robust bias correction has been proven to yield improved inference in other nonparametric contexts (Calonico, Cattaneo and Farrell, 2018, 2019).
The third main contribution is valid inference, both pointwise and uniformly in the support of the conditioning variables. When robust bias correction is employed, this inference is valid for the IMSEoptimal point estimator, allowing the researcher to combine an optimal partition for point estimation and a “faithful” measure of uncertainty (i.e., one that uses the same nonparametric estimation choices, here captured by the partition). In particular, lspartition delivers valid confidence bands that cover the entire regression function and its derivatives. These datadriven confidence bands are constructed by approximating the distribution of statistic processes, using either a plugin approach or a bootstrap approach. Importantly, the construction of confidence bands does not employ (asymptotic) extreme value theory, but instead uses the strong approximation results of Cattaneo, Farrell and Feng (2019), which perform substantially better in samples of moderate size.
Last but not least, the package also offers a convenient function to implement estimation and inference for linear combinations of regression estimators of different groups with all the features mentioned above. This function can be used to analyze conditional treatment effects in random control trials in particular, or for twosample comparisons more generally. For example, a common question in applications is whether two groups have the same “trend” in a regression function, and this is often answered in a restricted way by testing a single interaction term in a (parametric) linear model. In contrast, lspartition delivers a valid measure of this difference nonparametrically and uniformly over the support of the conditioning variables, greatly increasing its flexibility in applications.
All of these contributions are fully implemented for splines, wavelets, and piecewise polynomials through the following four functions included in the package lspartition:

lsprobust(): This function implements estimation and inference for partitioningbased least squares regression. It takes the partitioning scheme as given, and constructs point and variance estimators, bias correction, conventional and robust biascorrected confidence intervals, and simulationbased conventional and robust biascorrected uniform inference measures (e.g., confidence bands). Three approximation bases are provided: Bsplines, CohenDaubechiesVial wavelets, and piecewise polynomials. When the partitioning scheme is not specified, the companion function lspkselect() is used to select a tensorproduct partition in a fully datadriven fashion.

lspkselect(): This function implements datadriven procedures to select the number of knots for partitioningbased least squares regression. It allows for evenlyspaced and quantilespaced knot placements, and computes the corresponding IMSEoptimal choices. Two selectors are provided: rule of thumb (ROT) and direct plugin (DPI) rule.

lsplincom(): This function implements estimation and robust inference procedures for linear combinations of regression estimators of multiple groups based on lsprobust(). Given a userspecified linear combination, it offers all the estimation and inference methods available in the functions lsprobust() and lspkselect().

lsprobust.plot(): This function builds on ggplot2, and is used as a wrapper for plotting results. It plots regression function curves, robust biascorrected confidence intervals and uniform confidence bands, among other possibilities.
The paper continues as follows. Section 2 describes the basic setup including a brief introduction to partitioningbased least squares regression and the empirical example to be used throughout to illustrate features of lspartition. Section 3 discusses datadriven IMSEoptimal selection of the number of knots and gives implementation details. Estimation and inference implementation is covered in Section 4, including bias correction methods. The last section concludes. We defer to Cattaneo, Farrell and Feng (2019, CFF hereafter) for complete theoretical and technical details. Statements below are sometimes specific versions of a general case therein.
2 Setup
We assume that is an observed random sample of a scalar outcome and a vector of covariates . The object of interest is the regression function or its derivative, the latter denoted by , for a tuple with .
Estimation and inference is based on least squares regression of on set of basis functions of which are themselves built on top of a partition of the support . A partition, denoted by , is a collection of disjoint open sets such that the closure of their union is . For a partition, a set of basis functions, each of order and denoted by , is constructed so that each individual function (i.e., each element of the vector ) is nonzero on a fixed number of contiguous . lspartition allows for three such bases: piecewise polynomials, Bsplines, and CohenDaubechiesVial wavelets (Cohen, Daubechies and Vial, 1993). For the first two bases, the order of the basis can be any positive integer, and any derivative of up to total order can be estimated employing such a basis. For Daubechies wavelets, the current version allows for (i.e., up to cubic wavelets), and . The package takes (linear basis) as default. To fix ideas, consider with piecewise polynomials. Each is an interval and collects all the indicator functions , .
Once the basis is constructed, the final estimator of is
(1) 
where . When , we write for simplicity.
The approximation power of such estimators increases with the granularity of the partition and the order . We take the latter as fixed in practice. The most popular structure of in applications is a tensorproduct form, which partitions each covariate marginally into intervals and then sets to be the set of all tensor (Cartesian) products of these intervals (CFF consider more general cases). For this type of partition, the user must choose the number and placement of the partitioning knots in each dimension. lspartition allows for three knot placement types: userspecified, evenlyspaced, and quantilespaced. In the first case, the user has complete freedom to choose both the number and positions of knots for each dimension. In the latter two cases, the knot placement scheme is prespecified, and hence only the number of subintervals for each dimension needs to be chosen.
We denote the number of knots in the dimensions of the regressor by , which can be either specified by users or selected by datadriven procedures (see Section 3 below). Moreover, for wavelet bases, motivated by the standard multiresolution analysis, we provide an option J for the regression command lsprobust(), which indicates the resolution level of a wavelet basis. This gives , for a resolution (see Chui, 2016, for a review). In any case, the tuning parameter to be chosen is . In the next section we choose to minimize the IMSE of the estimator (1).
2.1 Package and Data
We will showcase the main aspects of lspartition using a running empirical example. The package is available in R and can be installed as follows:
The data we use come from Capital Bikeshare, and is available at https://www.kaggle.com/c/bikesharingdemand/data/. For the first 19 days of each month of 2011 and 2012 we observe the outcome count, the total number of rentals and the covariates atemp, the “feelslike” temperature, and workingday, a binary indicator for working days (versus weekends and holidays). The data is summarized as follows.
We will investigate nonparametrically the relationship between temperature and number of rentals and compare the two groups defined by the type of days:
The sample code that follows will use this designation of y, x, and g.
3 Partitioning Scheme Selection
We will now briefly describe the IMSE expansion and its use in tuning parameter selection. To differentiate the original point estimator of (1) and the postbiascorrection estimators, we will add a subscript to the original estimator: . The three bias corrections discussed below will add corresponding subscripts of 1, 2, and 3. We first discuss the bias and variance of , and then use these for minimizing the IMSE. Throughout, denotes that the approximation holds for large sample in probability and denotes the sample average over . To simplify notation, we may write the estimator as
Again, note the subscript “0”; the biascorrected estimators are of the same form (see below).
3.1 Bias and Variance
The bias expansion for the is:
(2)  
(3) 
is the leading approximation error in the norm and the second term is the accompanying error from the linear projection of onto the space spanned by the basis functions. The form of each of these is complex, and depends on the basis, but what is crucial for the present purposes is that the form is known and the only unknown elements are derivatives of order , , . CFF derive exact expressions for splines, wavelets, and piecewise polynomials. Both bias terms will, in general, contribute to the same order, and both will matter in finite samples. However, the second term in (3) will be higher order if the bases are carefully constructed so that is orthogonal to in with respect to the Lebesgue measure. lspartition allows users to choose whether the projection of the leading error is used in partitioning scheme selection, as well as estimation and inference.
The conditional variance is straightforward from least squares algebra, and takes the familiar sandwich form:
(4) 
where . Only is unknown here, and will be replaced by a residualsbased estimator. In particular lspartition allows for the standard HeteroskedasticityConsistent (HC) class of estimators via the options hc0, hc1, hc2, hc3. See Long and Ervin (2000) for a review in the context of least squares regression.
3.2 Integrated Mean Squared Error
In general, for a weighting function , CFF derive the following (conditional) IMSE expansion:
where the varying quantities and correspond to a fixed approximation to the variance and squared bias, respectively.
Under regularity conditions on the partition and basis used, CFF derive explicit leading constants in this expansion. lspartition implements IMSEminimization for the common simple case where is a tensor product of marginally formed intervals where the same number of intervals are used for each dimension. Specifically, partitions into subintervals, and the complete partition where denotes tensor (Cartesian) product. Thus, the IMSEoptimal number of cells of a tensorproduct partition is .
To select , or equivalently , assume that the partitioning knots are generated as quantiles of some marginal distributions , , that is,
where . Then, the IMSEoptimal choice for is
where is a ceiling operator that outputs the smallest integer that is no less than and is a (squared) bias term that may depend on the marginals and, as before, is entirely known up to order derivatives: , .
3.3 Implementation Details
Two popular choices of partitioning schemes are evenlyspaced partitions (ktype="uni"), which sets to be the uniform distribution over the support of the data, and quantilespaced partitions (ktype="qua"), which sets to be the empirical distribution function of each covariate. The package lspartition implements both partitioning schemes, and for each case offers two IMSEoptimal tuning parameter selection procedures: rule of thumb (imserot) and direct plugin (imsedpi) choices. We close this section with a brief description of the implementation details and an illustration using real data.
3.3.1 RuleofThumb Choice
The ruleofthumb choice is based on the special case of . Let the weighting function be the density of . The implementation steps are summarized in the following:

Bias constant. The unknown quantities in the bias constants are: , , which is estimated by a global polynomial regression of degree ; and the density of , which is either assumed to be uniform or estimated by a trimmedfrombelow Gaussian reference model (controlled by the option rotnorm).

Variance constant. The unknown quantities in the variance constants are: the conditional variance , which is estimated by global polynomial regressions of degree ; and the density of , which is either assumed to be uniform or estimated by a trimmedfrombelow Gaussian reference model.

Ruleofthumb . Using the above results, a simple ruleofthumb choice of is
where and are the estimates of bias and variance constants respectively. While this choice of is obtained under strong parametric assumptions, it still exhibits the correct convergence rate ().
The command lspkselect() implements the ruleofthumb selection (kselect="imserot"). For example, we focus on a subsample of bike rentals during working days (g==1), and then the selected number of knots are reported in the following:
In this example, for the point estimator based on an evenlyspaced partition, the ruleofthumb estimate of the IMSEoptimal number of knots is , and for the derivative estimators used in bias correction for later inference, the ruleofthumb choice is .
3.3.2 Direct Plugin Choice
Assuming that the weighting is equal to the density of , the package lspartition implements a directplugin (DPI) procedure summarized by the following steps.

Preliminary choice of : Implement the ruleofthumb procedure to obtain .

Preliminary regression. Given the userspecified basis, knot placement scheme, and ruleofthumb choice , implement a partitioningbased regression of order to estimate all necessary order derivatives; denote these by , .

Bias constant. Construct an estimate of the leading error by replacing by . can be obtained similarly. Then, use the preasymptotic version of the conditional bias to estimate the bias constant:
As mentioned before, for the three bases considered in the package lspartition, the second term in the conditional bias is of smaller order under some additional conditions. We employ this property to simplify the estimate of bias constant for wavelets. For splines and piecewise polynomials, however, users may specify whether the projection of the leading error is taken into account in the selection procedure (see option proj).

Variance constant. Implement a partitioningbased series regression of order with , and then use the preasymptotic version of the conditional variance to estimate the variance constant. Specifically, let
where ’s are regression residuals, is an estimate of , and is the weighting scheme used to construct different HC variance estimators.

Direct plugin . Collecting all these results, a direct plugin choice of is
The following shows the results of the direct plugin procedure based on the real data:
The direct plugin procedure gives more partitioning knots than the ruleofthumb, leading to a finer partition. For point estimation, knots are suggested, while for bias correction purpose, it selects knots to estimate derivatives in the leading bias. Quantilespaced knot placement is obtained by adding ktype = "qua".
4 Estimation and Inference
This section reviews and illustrates the estimation and inference procedures implemented. A crucial ingredient is the bias correction that allows for valid inference after tuning parameter selection.
4.1 Point Estimation and Bias Correction
The estimator is IMSEoptimal from a point estimation perspective when implemented using the choice to form , but conventional inference methods based on this resulting point estimator will be invalid. More precisely, the ratio of bias to standard error in the statistic is nonnegligible, requiring either adhoc undersmoothing or some form of bias correction. In addition to the (uncorrected) point estimate in (1), the package lspartition implements the three bias correction options derived by CFF for valid (pointwise and uniform) inference. All these strategies resort to a higherorder basis, , of order . The partition where is built on may be different from but need not be. These approaches allow researchers to combine an optimal point estimate based on the IMSEoptimal with inference based on the same tuning parameter and partitioning scheme choices.
Our bias correction strategies are based on (2) and (3), where the only unknowns are , , and for . These are summarized as follows; see CFF for details.

Approach 1, bc="bc1": Higherorderbasis bias correction. Use to construct a higherorder least squares estimator which takes exactly the same form as but has less bias. If we substitute and for and in (2) respectively and subtract this estimated bias from , the resulting “biascorrected” estimator is equivalent to . This option is called by bc="bc1".

Approach 2: Least squares bias correction. Construct and substitute it for in (2), but replace by rather than . The least squares biascorrected estimator is obtained by subtracting this estimated bias from . The supplement to CFF discusses in detail how this approach relates to higherorderbasis bias correction and when they are equivalent. This option is called by bc="bc2".

Approach 3: Plugin bias correction. Referring to (3), use to construct for all needed . Substitute and for and in and respectively. Subtracting this estimated bias from leads to a plugin biascorrected estimator . This option is called by bc="bc3".
The optimal (uncorrected) point estimator () and the three biascorrected estimators () can be written in a unified form:
These estimators only differ in and , which depend in different ways on and . See CFF for exact formulas.
4.2 Pointwise Inference
Pointwise inference relies on a Gaussian approximation for the statistics:
where is an estimator of the conditional variance of , and denotes convergence in distribution. is a consistent estimator of where and ’s are additional weights leading to various HC variance estimators. Then nominal percent symmetric confidence intervals are
(5) 
where is the quantile of the standard normal distribution.
For conventional confidence intervals (), the (asymptotically) correct coverage relies on undersmoothing () that renders the bias negligible relative to the standard error in large samples. Though straightforward in theory, it is difficult to implement in a principled way. In comparison, given the IMSEoptimal tuning parameter, all three biascorrected estimators () have only higherorder bias, and thus the corresponding confidence intervals based on these estimators will have asymptotically correct coverage. Importantly, the Studentization quantity also captures the additional variability introduced by bias correction.
We now illustrate the pointwise inference features of lsprobust() using the bike rental data. The previous result of knot selection based on the DPI procedure will be employed. Specifically, we set nknot=8 for point estimation. For higherorderbasis bias correction (bc="bc1"), the same number of knots is used to correct bias by default, while for plugin bias correction (bc="bc3"), we use knots (bnknot=10) to estimate the higherorder derivatives in the leading bias. One may leave these options unspecified and then the command lsprobust() will automatically implement knot selection using the command lspkselect().
The above table summarizes the results for pointwise estimation and inference, including point estimates, conventional standard errors, and robust confidence intervals based on higherorderbasis bias correction for quantilespaced evaluation points. We can use the companion plotting command lsprobust.plot() to visualize the results:
The result is displayed in Figure 1. As the temperature gets higher, the number of rentals increases as expected. Both panels show the same point estimator, . We plot both the robust confidence intervals based on higherorderbasis bias correction (Figure (a)a) and plugin bias correction (Figure (b)b). Since the higherorderbasis approach is equivalent to a quadratic spline fitting, the resulting confidence interval has a smoother shape.
4.3 Uniform Inference
To obtain uniform inference (over the support of ), CFF establish Gaussian approximations for the whole statistic processes, and propose several samplingbased approximations which are easy to implement in practice. To be concrete, for each , there exists a Gaussian process such that
where and are population counterparts of and , is a dimensional standard normal random vector, and is the length of , and is proportional to . The notation means that the two processes are approximately equal in distribution in the following sense: in a sufficiently rich probability space, we have identical copies of and whose difference converges in probability to zero uniformly.
The Gaussian stochastic process is not feasible in practice because it involves unknown population quantities. Thus, the package lspartition offers two options for implementation: plugin or bootstrap.

Plugin. Replace all unknowns in by some consistent estimators:
CFF show that delivers a valid distributional approximation to . In practice one may obtain many simulated realizations of by sampling from the dimensional standard normal distribution conditional on the data. This option is called by uni.method="pl".

Bootstrap. Construct a bootstrapped version of the approximation process (conditional on the data):
where , and is an i.i.d sequence of bounded random variables with zero mean and unit variance. CFF show that this bootstrapped process also approximates conditional on the data. Thus one can implement bootstrapping by sampling from the distribution of given the data. In the package lspartition, the ’s are taken to be Rademacher variables, and this option is called by uni.method="wb".
Importantly, these strong approximations apply to the whole statistic processes, and thus can be used to implement general inference procedures based on transformations of . The main regression command lsprobust() will output the the following quantities for uniform analyses upon setting uni.out=TRUE:

t.num.pl, t.num.wb1, t.num.wb2: The numerators of approximation processes except the “simulated components”, which are evaluated at a set of prespecified grid points . Suppose that contains grid points. Then for the plugin method, the numerator, stored in t.num.pl, is the matrix . For wild bootstrap, the numerator is separated to t.num.wb1 and t.num.wb2, which are and respectively.

t.denom: The denominator of approximation processes, i.e., , stored in a vector of length .

res: Residuals from the specified biascorrected regression (needed for bootstrapbased approximation).
For example, the following command requests the necessary quantities for uniform inference based on the plugin method:
We list the first rows of the numerator matrix. Each row corresponds to a grid point. Since we use a linear spline for point estimation and set nknot=4, the higherorderbasis bias correction is equivalent to quadratic spline fitting. Thus the numerator matrix has columns corresponding to the quadratic spline basis.
As a special application, these results can be used to construct uniform confidence bands, which builds on the suprema of . The function lsprobust() computes the critical value to construct confidence bands. Specifically, it generates many simulated realizations of or using the methods described above, and then obtains an estimated quantile of or given the data, denoted by . Then, confidence band for is given by
For example, the following command requests a critical value for constructing confidence bands:
Once the critical value is available, the command lsprobust.plot() is able to visualize confidence bands:
The result is displayed in Figure 2. Since we set CS="all", the command simultaneously plots pointwise confidence intervals (error bars) and a uniform confidence band (shaded region).
It is also possible to specify other bias correction approaches or uniform methods:
4.4 Linear Combinations
The package lspartition also includes a function lsplincom(), which implements estimation and inference for a linear combination of regression functions of different subgroups. To be concrete, consider a random trial with groups. Let be the conditional expectation function (CEF) for group , . The parameter of interest is , i.e., a linear combination of CEFs (or derivatives thereof) for different groups. To fix ideas, consider the most common application, the difference between two groups (or the conditional average treatment effect). Here, , , and . Then .
To implement estimation and inference for , lsplincom() first calls lsprobust() to obtain a point estimate and all other objects for each group. The tuning parameter for each group can be selected by the datadriven procedures above. Then the point estimate of is
The standard error of can be obtained simply by taking the appropriate linear combination of standard errors for each and their estimated covariances. Robust confidence intervals can be similarly constructed as in (5).
lsplincom() also allows users to construct confidence bands for . Specifically, it requests lsprobust() to output the numerators (t.num.pl for “plugin”, or t.num.wb1 and t.num.wb2 for “bootstrap”) and denominators (t.denom) of the feasible approximation processes or . Let and denote the numerator and denominator from group based on bias correction approach , and . The approximation process for the statistic process based on is
where is a collection of independent standard normal vectors, and indicates the dimension of . As discussed before, the dimensionality of these normal vectors depends on the particular bias correction approach and may vary across groups since the selected number of knots may be different across groups. The bootstrap approximation process can be constructed similarly.
Given these processes, inference is implemented by sampling from standard normal vectors (“plugin” method) or groups of Rademacher vectors given the data. Then critical values used to construct confidence bands for are estimated similarly by empirical quantiles of or .
As an illustration, we compare the number of rentals during working days and other time periods (weekends and holidays) based on linear splines and plugin bias correction. To begin with, we first estimate the conditional mean function for each group using the command lsprobust().
The pointwise results for each group are displayed in Figure 4. The shaded regions represent confidence intervals. Clearly, when temperature is low, two regions are well separated, implying that people may rent bikes more during working days than weekends or holidays when the weather is cold.
Next, we employ the command lsplincom() to formally test this result. We specify R=(1, 1), denoting that is the coefficient of the conditional mean function for the group workingday==0 and is the coefficient of the conditional mean function for the group workingday==1.
The pointwise results are summarized in the above table. Clearly, when temperature is low, the point estimate of the rental difference is significantly positive since the robust confidence intervals do not cover . In contrast, when the temperature is above 18, it is no longer significant. This implies that the difference in the number of rentals between working days and other periods is less pronounced when the weather is warm. Again, we can use the command lsprobust.plot() to plot point estimates, confidence intervals and uniform band simultaneously:
The confidence band for the difference is constructed based on the plugin distributional approximation computed previously. It leads to an even stronger conclusion: the entire difference as a function of temperature is significantly positive uniformly over a range of low temperatures since the confidence band is above zero when the temperature is low.
5 Summary
We gave an introduction to the software package lspartition, which offers estimation and robust inference procedures (both pointwise and uniform) for partitioningbased least squares regression. In particular, splines, wavelets, and piecewise polynomials are implemented. The main underlying methodologies were illustrated empirically using real data. Finally, installation details, scripts replicating the numerical results reported herein, links to software repositories, and other companion information, can be found in the package’s website:
References
 Calonico et al. (2018) Calonico, S., Cattaneo, M. D., and Farrell, M. H. (2018), “On the Effect of Bias Estimation on Coverage Accuracy in Nonparametric Inference,” Journal of the American Statistical Association, 113, 767–779.
 Calonico et al. (2019) (2019), “Coverage Error Optimal Confidence Intervals for Local Polynomial Regression,” arXiv:1808.01398.
 Cattaneo and Farrell (2013) Cattaneo, M. D., and Farrell, M. H. (2013), “Optimal Convergence Rates, Bahadur Representation, and Asymptotic Normality of Partitioning Estimators,” Journal of Econometrics, 174, 127–143.
 Cattaneo et al. (2019) Cattaneo, M. D., Farrell, M. H., and Feng, Y. (2019), “Large Sample Properties of PartitioningBased Estimators,” Annals of Statistics, forthcoming.
 Chui (2016) Chui, C. K. (2016), An Introduction to Wavelets, Elsevier.
 Cohen et al. (1993) Cohen, A., Daubechies, I., and Vial, P. (1993), “Wavelets on the Interval and Fast Wavelet Transforms,” Applied and Computational Harmonic Analysis, 1, 54–81.
 Fan and Gijbels (1996) Fan, J., and Gijbels, I. (1996), Local Polynomial Modelling and Its Applications, New York: Chapman & Hall/CRC.
 Györfi et al. (2002) Györfi, L., Kohler, M., Krzyżak, A., and Walk, H. (2002), A DistributionFree Theory of Nonparametric Regression, SpringerVerlag.
 Long and Ervin (2000) Long, J. S., and Ervin, L. H. (2000), “Using Heteroscedasticity Consistent Standard Errors in the Linear Regression Model,” The American Statistician, 54, 217–224.
 Ruppert et al. (2009) Ruppert, D., Wand, M. P., and Carroll, R. (2009), Semiparametric Regression, New York: Cambridge University Press.
 Zhang and Singer (2010) Zhang, H., and Singer, B. H. (2010), Recursive Partitioning and Applications, Springer.