Search arXiv⌕ Search

arXiv · 2610.33912

Near-boundary asymptotics for profile score statistics

Abstract

We establish asymptotic results for profile score statistics under sequences of parameters that may tend to the boundary of the parameter set. When the likelihood is profiled over a set with boundary points, the distribution of the statistic can depend, even asymptotically, on a distance to the boundary that cannot be estimated consistently. We address this in three ways. First, we give conditions under which the nuisance score has a root on an extended parameter set, and the profile score statistic formed with that root converges to a chi-squared distribution. Second, we show that the efficient score statistic converges to a chi-squared distribution under a separate condition that can hold even for estimators constrained to the original set. Both lead to confidence regions with asymptotically correct coverage probability, uniformly on sets that may contain boundary points, and the conditions allow the scores for the interest and nuisance parameters to grow at different rates or become asymptotically collinear. Third, we quantify the coverage error of applying the profile score statistic without an extended set. We approximate the distribution of the statistic and bound the error by a quantity that decays like a normal tail in the standardized distance to the boundary. The approximation also gives one-sided tests with least favorable critical values whose asymptotic size is at most the nominal level. We illustrate the results in a zero-inflated Poisson model and a one-way random effects model.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Matias Shedden, Karl Oskar Ekvall. 2026-10-24. Near-boundary asymptotics for profile score statistics. https://arxiv.org/abs/2610.33912

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

KEEP EXPLORING

Related papers

Parametric Statistical Inference in the Zone of Moderate Deviation Probabilities

A parametric theory of statistical inference is developed for the moderate deviation probability zone. The new approach to the proofs is based on the Taylor series expansion of the logarithm of the likelihood ratio based on the Hellinger distance. The Large Deviation Principle in the moderate deviation probability zone is proven for Bayesian estimators and maximum likelihood estimators. A uniform approximation of the logarithm of the likelihood ratio and Theorem on concentration of the posterior Bayesian measure are also established for the zone of moderate deviation probabilities.

math.ST↗

Asymptotics and finite sample bounds for prediction and smoothing in Wright-Fisher hidden Markov models

We study signal prediction and smoothing in hidden Markov models whose latent signal is a multi-type Wright-Fisher diffusion and whose discrete-time observations are categorical. We consider a repeated-sampling regime with finitely many inspection times and large within-time samples. Under neutrality and parent-independent mutation, the Bayesian predictive and smoothing laws admit exact representations as mixtures of Dirichlet distributions. We show that the one-step predictive and local smoothing laws converge in total variation to the corresponding Wright-Fisher transition and bridge laws determined by the neighboring population frequencies, thereby justifying plug-in approximations based on empirical proportions. For prediction, we derive explicit finite-sample bounds for this approximation and for bounded predictive functionals such as diversity, together with a finite-sample concentration bound for the marginal smoother. The joint posterior at the inspection times concentrates at the target frequencies and satisfies a Bernstein-von Mises limit with distinct interior and boundary regimes, with Gaussian and Gamma limits on different scales. The results allow arbitrary dependence across inspection times. A key technical ingredient is a fixed-interval tail bound for the coalescent-based dual death process.

math.ST↗

Wasserstein approximation of measures via orthogonal frames: statistical and computational complexities

Dimension-reduction methods such as PCA identify a subspace capturing most of the variation in the data, but not a distinguished basis within it. Selecting a basis in which the samples are sparsely represented is a recurring task in unsupervised learning, addressed by methods in factor analysis, dictionary learning, and subspace clustering. We pose this task as Wasserstein approximation of the data distribution by measures supported on the axes of an orthogonal frame, which, in turn, reduces to a nonsmooth optimization problem over the orthogonal group $\mathrm{O}(d)$. We show that, under mild assumptions, both empirical risk minimizers and a locally initialized stochastic gradient method recover the population-optimal frame at the near-parametric rate $\widetilde{O}_d(n^{-1/2})$, where $n$ is the sample size. The main difficulty is that, although the population objective is smooth, the empirical objective is not-this mismatch precludes standard covering arguments. We overcome this issue by replacing Lipschitz continuity of the empirical gradient with a coarsely Lipschitz bound, a tool that may be of independent interest. Numerical experiments support our theoretical findings.

math.ST↗