Search arXivSearch

arXiv · 2605.20550

Weak-Curvature AMISE and Plug-in Bandwidth Selection for Kernel Density Estimation

Abstract

Kernel density estimation risk expansions are commonly expressed through the integrated squared curvature term that enters second-order AMISE and plug-in bandwidth rules. This paper develops a weak-curvature formulation of this classical calculation for densities whose second derivative exists weakly rather than as a continuous classical function. We prove that if a density has square-integrable weak curvature, then the standard second-order AMISE expansion, oracle bandwidth order, and kernel-dependent optimality calculation remain valid with the curvature functional understood in the weak sense. The class $C^{1,1}(\mathbb{R})\setminus C^2(\mathbb{R})$ serves as a concrete and practically relevant subclass: the first derivative is Lipschitz, while curvature may be kinked, discontinuous, or undefined at isolated points. Building on this formulation, we introduce a generalized-curvature plug-in (GCPI) bandwidth selector. The selector estimates the weak-curvature functional by a pilot density-derivative estimator with a leave-one-out U-statistic correction and substitutes this estimate into the AMISE bandwidth formula. We prove first-order oracle equivalence under ratio-consistent weak-curvature estimation and establish consistency of the proposed U-statistic curvature estimator under explicit pilot-bandwidth conditions. We also give a scalar-bandwidth multivariate extension based on weak Hessians and illustrate the theory through nonsmooth density examples, simulations, and a real-data application.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alireza Kabgani, Elaheh Lotfian. 2026-08-22. Weak-Curvature AMISE and Plug-in Bandwidth Selection for Kernel Density Estimation. https://arxiv.org/abs/2605.20550

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

KEEP EXPLORING

Related papers

Functional independent component analysis by choice of norm: a framework for near-perfect classification

We develop a theory for functional independent component analysis in an infinite-dimensional framework using Sobolev spaces that accommodate smoother functions. The notion of penalized kurtosis is introduced motivated by Silverman's method for smoothing principal components. This approach allows for a classical definition of independent components obtained via projection onto the eigenfunctions of a smoothed kurtosis operator mapping a whitened functional random variable. We discuss the theoretical properties of this operator in relation to a generalized Fisher discriminant function and the relationship it entails with the Feldman-Hájek dichotomy for Gaussian measures, both of which are critical to the principles of functional classification. The proposed estimators are a particularly competitive alternative in binary classification of functional data and can eventually achieve the so-called near-perfect classification, which is a genuine phenomenon of high-dimensional data. Our methods are illustrated through simulations, various real datasets, and used to model electroencephalographic biomarkers for the diagnosis of depressive disorder.

math.ST

Trace-Class Results for MCMC Algorithms for Student-$t$ Regression Models

In this paper, we consider MCMC algorithms for Student-$t$ regression models. In three cases, we investigate the efficiency of Markov chains based on the algorithms in terms of whether trace-class results hold or not. First, we consider the case where the parameters follow a matrix-normal-inverse-Wishart distribution and show that the Markov operator associated with a standard data augmentation algorithm is trace-class. Second, we consider the case of an improper prior and univariate outcomes. In this case, the standard Markov operator is not trace-class but the Markov operator associated with a collapsed Gibbs algorithm is trace-class. Third, we consider the case of an improper prior and multivariate outcomes. We obtain a trace-class result for a parameter expanded data augmentation algorithm which is based on a univariate working parameter. Finally, we consider the problem of numerially estimating a convergence rate of the trace-class Markov operator in the second case.

math.ST

The Manifold Hypothesis under Unknown Gaussian Noise:Conditional Certificates and Consistent Dimension Estimation

We study what noisy data can establish about the Manifold Hypothesis under explicit identification and regularity conditions. A population residual certificate combines independent-view localization, Gaussian concentration, membership uncertainty, and population transfer. Existing rectifiability criteria then yield a covered-scale consequence. For a local smooth manifold with positive Hölder density, the actual-ball covariance limit identifies the spectral crossing with geometric dimension. We prove almost-sure eventual recovery under repeated observations. Reusing accurate localization averages improves the sufficient point-sample condition from $Nr^{d+4}\gg\log N$ to $Nr^d\gg\log N$, with replication $kr^2\gg\log N$. A two-mass certificate controls incorrect geometric-dimension emissions under declared class bounds. For single observations with unknown Gaussian noise, affine-support or known coordinate-bound restrictions provide noise intervals and consistent Gaussian correlation-dimension estimators. Ahlfors regularity identifies this exponent with Hausdorff dimension and with the geometric dimension of a homogeneous smooth class. Exact Cantor calculations delineate the limits of integer spectral counts and adjacent-radius slopes. We credit established local PCA, rectifiability, concentration, binomial inference, and deconvolution results before specifying our constructions. Reproducible experiments distinguish point estimation, finite-scale coverage, and certificate emission.

math.ST