SearcharxivSearch

arXiv · 2609.15811

When Is a Relevance Threshold Statistically Resolvable? Minimax Limits for Effect Classification

Abstract

Statistical precision and scientific relevance operate on different scales. In regular problems, sampling uncertainty contracts at rate $n^{-1/2}$, whereas the magnitude below which an effect is scientifically negligible may be fixed or may vary with information. Let $Δ_n$ denote a relevance threshold and $I_0$ Fisher information, and define $λ_n=\sqrt{nI_0}Δ_n$. For separated negligible and meaningful parameter classes, we establish the minimax lower bound $\liminf R_n^*\ge 2\{1-Φ(\varepsilonκ)\}$ when $λ_n\toκ$. If $λ_n\to0$, the experiments merge and consistent classification is impossible. If $λ_n\toκ\in(0,\infty)$, the problem converges to a Gaussian-shift decision problem. We characterize the exact minimax rule and risk in that limiting composite problem. As $κ\downarrow0$, the optimal cutoff converges to one statistical-error unit and the optimal improvement over trivial risk is $O(κ^2)$, while a simple relevance-boundary rule improves only at $O(κ^3)$; as $κ$ grows, that rule becomes asymptotically minimax. If $λ_n\to\infty$, consistent classification is attainable under a uniform estimation-resolution condition, verified for Gaussian and Bernoulli models. For $Δ_n=dn^{-γ}$, the critical rate is $γ=1/2$. We also show that moving asymmetric relevance regions depend on standardized distances to their two boundaries rather than total width alone. For heterogeneous true effects, we derive a significance-saturation limit and show that point-null significance can be most selective for scientifically relevant effects at intermediate information. The framework characterizes when scientific relevance is statistically resolvable through a common information scale.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Subir Hait. 2026-09-15. When Is a Relevance Threshold Statistically Resolvable? Minimax Limits for Effect Classification. https://arxiv.org/abs/2609.15811

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