SearcharxivSearch

arXiv · 2603.18590

Sometimes nonparametrics beat parametrics, even when the model is right

Abstract

A basic issue in both teaching of and practice of statistics is the interplay between modelling assumptions and inference performance. The general message conveyed is that stronger assumptions lead to better statistical performance of the relevant estimators, tests and confidence intervals, provided that these assumptions hold. On the other hand, fewer assumptions often lead to safer and more robust methods that are good also outside narrow conditions, but not quite as good as specialist methods that exploit such narrower conditions, if these are fulfilled. This interplay is nicely illustrated in the context of density estimation, where parametric and nonparametric methods can be contrasted. The parametric ones have mean squared errors of size $O(n^{-1})$ in terms of sample size $n$ if the parametric model is right, but are not even consistent outside the model. The nonparametric methods are everywhere consistent and have mean squared errors of size $O(n^{-4/5})$ for broad classes of estimands. The point we are making here is that this picture is not universally true! We show that a simple kernel density estimator can perform better than a directly estimated parametric density on the latter's home turf, for small sample sizes, in the sense of mean integrated squared error. Our main example is that of estimating an unknown normal density. In the process of developing and discussing this somewhat counter-intuitive and half-paradoxical example we touch on several tangential issues of interest, pertaining to exact small-sample analysis of density estimators.

Explore related subjects

Keep this discovery

BibTeXRIS

Morten Byholt, Nils Lid Hjort. 2026-03-19. Sometimes nonparametrics beat parametrics, even when the model is right. https://arxiv.org/abs/2603.18590

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

A Scale Invariance Property of PCA

The PCA algorithm is sensitive to changes in measurement scale. Measuring one variable of a system in inches rather than centimeters, say, alters both its principal axes and principal eigenvalues. Although this scale dependence is generally complicated, we show here that it nevertheless obeys a strict invariance property: under a continuous scale adjustment, the initial state's $k$-th largest principal component (ordered by eigenvalue) continuously evolves into the final state's $k$-th largest principal component, for each $k$. In this sense, we can say that the modes of PCA are "order-stable" with respect to changes in measurement scale. A special case occurs when scaling along directions that are orthogonal to some modes. Here, apparent eigenvalue crossings can occur. However, we show that we can interpret these apparent crossings as cases where the modes instantaneously swap their orientation, in this way maintaining the required order stability.

math.ST

Small noise asymptotics for linear parabolic SPDEs in two space dimensions with unknown damping factors

We study parametric estimation for second order linear parabolic stochastic partial differential equations in two space dimensions with a small volatility parameter driven by a $Q$-Wiener process with an unknown damping parameter using high frequency spatio-temporal data. We first provide an estimator for the damping parameter of the $Q$-Wiener process utilizing realized quadratic variations based on spatial and temporal increments. We next propose minimum contrast estimators of the diffusive and advective parameters in the SPDE using a contrast function with the proposed estimator of the damping parameter. We then construct a quasi-maximum likelihood estimator of the reaction parameter in the SPDE using the approximate coordinate process derived from the estimators of the diffusive and advective parameters. We also provide simulation results of the proposed estimators.

math.ST

Spike Estimation from Heteroscedastic Noise via Random Splitting

In this paper, we consider a spiked Wigner type matrix with a heteroscedastic and unknown variance profile. It is well known that in the supercritical regime of the BBP transition, strong spikes can create outliers in the spectrum. Unfortunately, in the heteroscedastic case, in general it is not possible to estimate the spike strength from these observed outlier consistently, as the latter is a solution to a Dyson equation with unknown parameters from the variance profile. In this paper, inspired by the work on sparse matrix completion \citep{BordenaveCosteNadakuditi2023}, we introduce an asymmetrized model by randomly splitting the spiked matrix into two parts, which transforms the noisy Wigner type matrix into a non Hermitian random matrix, while preserving the Hermitian spikes at the cost of a dilution. We establish a BBP type transition for the asymmetrized model, from which we can estimate the strength of the spikes precisely, even without knowing the variance profile of the noise part. We then further apply our approach to study the correlation between two correlated spiked models, where the spike/signal parts of the two models are correlated, and the noise parts are independent but may both be heteroscedastic. By applying our asymmetrization approach to the two models separately and also jointly, we are able to obtain a precise estimate of the correlation between the signal parts of the two models.

math.ST