Search arXiv⌕ Search

arXiv · 2609.38412

Local polynomial density ratio estimation

Abstract

We propose a novel local-polynomial estimator of the ratio $r=f/g$ of two $d$-dimensional densities $f$ and $g$, from which independent samples are available. The estimator is shown to achieve pointwise minimax optimal rates over Hölder classes of arbitrary smoothness index without additional logarithmic factors, and with smoothness being only assumed of $r$ but not of $f$ nor $g$. Our analysis remains valid for points on the boundary of the support of the distribution associated to $g$ under a mild geometric assumption on the (unknown) boundary. We also derive a concentration inequality for the estimator, which can be useful in applications to classification, and give a rate in the supremum norm, where the supremum is also taken over boundary support points. The smoothness class over which the rate is obtained is sufficiently large that the individual densities $f$ and $g$ cannot be consistently estimated uniformly over this class. Direct estimators of the partial derivatives of $r$ together with rates of convergence are also provided. We also obtain asymptotic normality of the estimators under quite general assumptions and again including boundary points, with a consistent variance estimator allowing for data-driven studentization. Moreover, we show how our estimator can be used to estimate the Kullback-Leibler information, in a construction which additionally uses debiasing. We provide the parametric rate together with asymptotic normality under sufficient smoothness of $r$ relative to the dimension $d$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hajo Holzmann, Alexander Meister. 2026-09-29. Local polynomial density ratio estimation. https://arxiv.org/abs/2609.38412

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

KEEP EXPLORING

Related papers

Clustered Switchback Designs for Experimentation Under Spatio-temporal Interference

We consider experimentation in the presence of non-stationarity, inter-unit (spatial) interference, and carry-over effects (temporal interference), where we wish to estimate the global average treatment effect (GATE), the difference between average outcomes having exposed all units at all times to treatment or to control. We suppose spatial interference is described by a graph, where a unit's outcome depends on its neighborhood's treatments, and that temporal interference is described by an MDP, where the transition kernel under either treatment (action) satisfies a rapid mixing condition. We propose a clustered switchback design, where units are grouped into clusters and time steps are grouped into blocks, and each whole cluster-block combination is assigned a single random treatment. Under this design, we show that for graphs that admit good clustering, a truncated Horvitz-Thompson estimator achieves a $\tilde O(1/NT)$ mean squared error (MSE), matching the lower bound up to logarithmic terms for sparse graphs. Our results simultaneously generalize the results from \citet{hu2022switchback,ugander2013graph} and \citet{leung2022rate}. Simulation studies validate the favorable performance of our approach.

math.ST↗

Random sets from the perspective of metric statistics

Since the seminal work by Beresteanu and Molinari(2008), the random set theory and related inference methods have been widely applied in partially identified econometric models. Meanwhile, there is an emerging field in statistics for studying random objects in metric spaces, called metric statistics. This paper clarifies a relationship between two fundamental concepts in these literatures, the Aumann and Fréchet means, and presents some applications of metric statistics to econometric problems involving random sets.

math.ST↗

Minimax Binary Counting under Shuffle Privacy: Poisson Limits and Randomized-Response Optimality

We study estimation of a deterministic binary count from the shuffled outputs of a common single-message local channel. Privacy is required for every neighboring composition at fixed global parameters $(\varepsilon,δ)$, and estimators may be biased. We obtain uniform critical Poisson and Skellam approximations and characterize the limiting minimax risk as an infimum over finite observed-mark Poisson experiments. Let $Λ$ be the noise intensity required by the boundary Poisson-shift profile and let $λ_{\min}$ be the intensity required by the full composition-maximized randomized-response profile. Binary randomized response is asymptotically minimax optimal if and only if $Λ=λ_{\min}$. When $Λ<λ_{\min}$, the minimax value lies strictly between $(Λ+λ_{\min})/2$ and $λ_{\min}$, and a randomized-response construction with observed rare marks strictly improves on binary randomized response. We give a finite-sample certified example. Binary randomized response is strictly suboptimal at $\varepsilon=0$ for every $0<δ<1$, and this persists for sufficiently small positive $\varepsilon$ at each fixed target. For every fixed positive $\varepsilon$, strict suboptimality also occurs along a sequence of fixed privacy targets tending to zero. The variational characterization permits approximation by finite marked channels; it does not assert that a finite optimizer exists.

math.ST↗