Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2609.32718

A Second-Order Extension of Hájek's Convolution Theorem with Statistical Applications

Junichi Hirukawa·Masanobu Taniguchi·Marc Hallin
View original source ↗Read source document ↗Export metadata ↓

Abstract

For a class of regular estimators, Hájek, in his celebrated ``Convolution Theorem,'' showed that the asymptotic distribution of a regular estimator is the convolution of the distribution of an efficient estimator and some residual distribution. This result constitutes the foundation of the concept of asymptotic efficiency of regular estimators. In this paper, we provide a second-order version of that classical result. Introducing a class of second-order regular estimators with a valid Edgeworth expansion, we derive their asymptotic distribution under contiguous alternatives and show that it is the convolution of the second-order efficient distribution and some second-order residual distribution. This constitutes a second-order extension of Hájek's convolution theorem. Based on this, we introduce a concept of {\it second-order robustness} for second-order regular estimators. For a class of general Bayes estimators and minimum contrast estimators in time series models, this second-order robustness is used (i) in the characterization of second-order robust priors, (ii) in a comparison between the second-order robustness of maximum likelihood and Whittle estimators.

Explore related subjects

math.STstat.TH

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Junichi Hirukawa, Masanobu Taniguchi, Marc Hallin. 2026-09-26. A Second-Order Extension of Hájek's Convolution Theorem with Statistical Applications. https://arxiv.org/abs/2609.32718

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

KEEP EXPLORING

Related papers

arXiv2026

On the Nonasymptotic Scaling Guarantee of Hyperparameter Estimation in Inhomogeneous, Weakly-Dependent Complex Network Dynamical Systems

Hierarchical Bayesian models are increasingly used in large, inhomogeneous complex network dynamical systems by modeling parameters as draws from a hyperparameter-governed distribution. However, theoretical guarantees for these estimates as the network population size grows have been lacking. A critical concern is that hyperparameter estimation may diverge for larger networks, undermining the model's reliability. Formulating the system's evolution in a measure transport perspective, we propose a theoretical framework for estimating hyperparameters with mean-type observations, which are prevalent in many scientific applications. Our primary contribution is a nonasymptotic bound for the deviation of estimate of hyperparameters in inhomogeneous complex network dynamical systems with respect to network population size, which is established for a general family of optimization algorithms within a fixed observation duration. For systems with independent nodes, we first establish a fixed-accuracy probabilistic hyperparameter bound and then use it to derive an explicit nonasymptotic hyperparameter bound. We subsequently extend both bounds to the more challenging and practically relevant setting of systems with weakly-dependent nodes. We validate our theoretical findings with numerical experiments on two representative models: a Susceptible-Infected-Susceptible model and a Spiking Neuronal Network model. In both cases, the results confirm that the estimation error decreases as the network population size increases, aligning with our theoretical guarantees. This research proposes the foundational theory to ensure that hierarchical Bayesian methods are statistically consistent for large-scale inhomogeneous systems, filling a gap in this area of theoretical research and justifying their application in practice.

math.ST↗
arXiv2026

Intrinsic-dimension empirical Bernstein inequalities for bounded self-adjoint operators

Operator-valued concentration inequalities are foundational to the analysis of modern high-dimensional statistics and randomized algorithms. However, standard oracle bounds are frequently limited in practice: they require explicit a priori knowledge of the true variance, and often explicitly scale with the ambient dimension, rendering them vacuous for infinite-dimensional or heavily structured operators. Motivated by these challenges, we establish the first empirical Bennett and Bernstein inequalities for sums of independent, bounded, self-adjoint Hilbert-Schmidt operators. Our fully data-driven bounds replace the unknown variance with an empirical estimate and rely strictly on the intrinsic dimension rather than the ambient dimension. This structural shift yields computable, dimension-free guarantees with a sharper first-order asymptotic radius for non-isotropic random matrices and seamlessly extends to infinite-dimensional Hilbert spaces. We demonstrate that our empirical bounds achieve asymptotic sharpness with the best known oracle rates. Finally, as an independent byproduct, we derive novel empirical concentration guarantees for the intrinsic dimension itself.

math.ST↗
arXiv2026

Bentkus-type asymptotic e-values

Asymptotic e-values are emerging as a powerful alternative to asymptotic p-values, particularly in post-hoc inference and multiple testing, where significance levels may be data-dependent. Existing asymptotic e-values, however, suffer from the ``missing factor,'' a scaling inefficiency resulting in overly conservative inference. Drawing on the framework of near-optimal concentration inequalities developed by Bentkus in the 2000s, we introduce Bentkus-type asymptotic e-values and prove that they successfully eliminate the missing factor. We also demonstrate both theoretically and empirically that Bentkus-type e-values consistently deliver sharper inference than existing alternatives, leading to tighter post-hoc confidence intervals and higher rejection rates in multiple testing procedures.

math.ST↗