REVIEW 4 cited by
Higher Order Spline Highly Adaptive Lasso Estimators of Functional Parameters: Pointwise Asymptotic Normality and Uniform Convergence Rates
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
We consider estimation of a functional of the data distribution based on i.i.d. observations. We assume the target function can be defined as the minimizer of the expectation of a loss function over a class of $d$-variate real valued cadlag functions that have finite sectional variation norm. For all $k=0,1,\ldots$, we define a $k$-th order smoothness class of functions as $d$-variate functions on the unit cube for which each of a sequentially defined $k$-th order Radon-Nikodym derivative w.r.t. Lebesgue measure is cadlag and of bounded variation. For a target function in this $k$-th order smoothness class we provide a representation of the target function as an infinite linear combination of tensor products of $\leq k$-th order spline basis functions indexed by a knot-point, where the lower (than $k$) order spline basis functions are used to represent the function at the $0$-edges. The $L_1$-norm of the coefficients represents the sum of the variation norms across all the $k$-th order derivatives, which is called the $k$-th order sectional variation norm of the target function. This generalizes the zero order spline representation of cadlag functions with bounded sectional variation norm to higher order smoothness classes. We use this $k$-th order spline representation of a function to define the $k$-th order spline sieve minimum loss estimator (MLE), Highly Adaptive Lasso (HAL) MLE, and Relax HAL-MLE. For first and higher order smoothness classes, in this article we analyze these three classes of estimators and establish pointwise asymptotic normality and uniform convergence at dimension free rate $n^{-k^*/(2k^*+1)}$ up till a power of $\log n$ depending on the dimension, where $k^*=k+1$, assuming appropriate undersmoothing is used in selecting the $L_1$-norm. We also establish asymptotic linearity of plug-in estimators of pathwise differentiable features of the target function.
Forward citations
Cited by 4 Pith papers
-
Seeing the Forest for the Trees: The Gaussian Process Limit of BART
In the infinite-tree limit, BART converges to a Gaussian process whose RKHS is a tensor-product Sobolev space, and ridge regression on random tree features achieves the resulting minimax rate with only logarithmic dep...
-
Model-Agnostic Bounds for Augmented Inverse Probability Weighted Estimators' Wald-Confidence Interval Coverage in Randomized Controlled Trials
First Berry-Esseen-type coverage bounds for AIPW Wald intervals with estimated variance in RCTs show cross-fitting can improve coverage through variance overestimation.
-
The V-fold jackknife for semiparametric inference: variance estimation, confidence intervals, and simultaneous confidence bands
The V-fold jackknife, Studentized with t_{V-1} critical values, yields valid confidence intervals and simultaneous bands for semiparametric estimators and extends to slower-rate estimators by scale invariance.
-
Targeted Highly Adaptive Lasso Minimum Loss Estimation of Target Functions
Targeted HAL-MLE projects a non-pathwise-differentiable target onto a HAL spline working model, applies LASSO-targeted TMLE, and attains dimension-free pointwise asymptotic normality up to log n factors.
Discussion (0). Continue with ORCID to comment.