Minimax properties of gamma kernel density estimators under $L^p$ loss and $β$-Hölder smoothness of the target

Frédéric Ouimet

Home/Archive/arXiv

arXiv · 2602.10103

Minimax properties of gamma kernel density estimators under $L^p$ loss and $β$-Hölder smoothness of the target

Frédéric Ouimet

View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper considers the asymptotic behavior in $β$-Hölder spaces, and under $L^p$ loss, of the non-modified gamma kernel density estimator introduced by Chen (Annals of the Institute of Statistical Mathematics, 52, 471-480, 2000) for the analysis of nonnegative data, in the situation where the target may have a finite effective or true upper endpoint but the estimator itself is left untruncated and treats the support as $[0,\infty)$. The finite endpoint is an analytical device in the definition of the function class and the risk, not information supplied to the estimator. The functional classes are chosen so that the target density matches smoothly to zero at the upper endpoint, which isolates the behavior at the origin and avoids additional upper-endpoint leakage bias. The estimator attains the minimax rate for $(p,β)\in [1,3)\times(0,2]$ and part of $[3,4)\times(0,2]$, but fails for $p\geq 4$ or $β>2$, leaving a small region unresolved.

Explore related subjects

math.ST math.PR stat.TH

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Frédéric Ouimet. 2026-09-12. Minimax properties of gamma kernel density estimators under $L^p$ loss and $β$-Hölder smoothness of the target. https://arxiv.org/abs/2602.10103

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

KEEP EXPLORING

Related papers

arXiv2026

Evidence thresholds of collapsed structured block models

A stochastic block model explains a network by splitting its nodes into communities and a matrix of tie probabilities between them. Collapsing those probabilities out scores each split by one number, its marginal likelihood, and every decision the model takes, how many communities, whether a weak one survives, what generates the ties inside it, is a comparison of two such numbers. The comparisons fail in known ways: weak structure is dropped, small communities are merged, a group of hubs is returned in place of the real groups. Each failure has a threshold, and the thresholds have not been computed. We compute them. We prove that the best single partition keeps a planted structure only above the first-moment bound, which sits above the Kesten-Stigum threshold for up to ten communities, while the evidence summed over all partitions switches at Kesten-Stigum itself: between the two, the posterior favours structure that every partition a sampler can report rejects. We prove three further thresholds, one for merging small communities, one for the density at which the representation alone decides, one for the degree prior that cuts a community along its degrees. The empirical finding confirms the theory: on planted partitions and on thirteen labelled networks, from the karate club to citation and co-purchase networks of up to 19,717 nodes, each threshold falls where it is predicted, against likelihood, spectral, penalised and nonparametric alternatives.

math.ST↗

arXiv2026

Autoregressive Processes on Riemannian Manifolds

This paper introduces a Riemannian autoregressive (R-AR) model of order one for manifold-valued time series. The model is specified through an autoregressive process in the tangent space at a reference point, which is mapped to the manifold via the exponential map. It is characterised by two parameters: a reference point $μ$, representing the intrinsic central tendency through the Fréchet mean, and an autoregressive parameter $ϕ$, governing the dependence structure and stationarity properties. When these parameters are unknown, their estimation introduces geometric and probabilistic challenges arising from the intrinsic estimation of $μ$ and from estimating $ϕ$ as the base point varies over the manifold and the associated tangent spaces change. The estimation theory is developed using a strong law of large numbers for the sample Fréchet mean set of ergodic Markov chains, together with ergodic arguments for the strong consistency of the autoregressive parameter estimator. The framework is validated through numerical simulations in the hyperbolic plane and an application to aerosol size distributions on the Fisher-Rao manifold, demonstrating how the proposed model can characterise mean-reverting dynamics in nonlinear geometries.

math.ST↗

arXiv2026

Sieve Estimation of Optimal Transport Maps from Paired Data in Gaussian Spaces

We study the estimation of infinite-dimensional optimal transport maps from noisy paired observations. The population map pushes a Gaussian reference measure forward to a target probability measure on a function space and takes the Cameron--Martin gradient form $T=I+\nabla_{\mathcal H}ϕ$. Our estimator uses cylindrical gradient sieves based on finitely many Cameron--Martin coordinates, thereby reducing the problem to finite-dimensional empirical risk minimization. A local nonasymptotic oracle inequality separates cylindrical approximation and statistical estimation errors while accounting for the conditioning of the parametrization. The approximation analysis relies on regularity conditions governing coordinate decay and dependence on omitted input coordinates. For diagonal Gaussian and nonlinear block-interaction classes, we derive matching upper and lower bounds that establish the minimax rate $N^{-s/(2s+1)}$ in expected norm, where $s$ measures weighted coordinate regularity. We further analyze a continuous two-groups model with Gaussian--Laplace mixtures and derive a prediction-risk bound for the resulting transport-map estimator.

math.ST↗