Search arXivSearch

arXiv · 1312.6348

Higher-order accuracy of multiscale-double bootstrap for testing regions

Abstract

We consider hypothesis testing for the null hypothesis being represented as an arbitrary-shaped region in the parameter space. We compute an approximate p-value by counting how many times the null hypothesis holds in bootstrap replicates. This frequency, known as bootstrap probability, is widely used in evolutionary biology, but often reported as biased in the literature. Based on the asymptotic theory of bootstrap confidence intervals, there have been some new attempts for adjusting the bias via bootstrap probability without direct access to the parameter value. One such an attempt is the double bootstrap which adjusts the bias by bootstrapping the bootstrap probability. Another new attempt is the multiscale bootstrap which is similar to the m-out-of-n bootstrap but very unusually extrapolating the bootstrap probability to $m=-n$. In this paper, we employ these two attempts at the same time, and call the new procedure as multiscale-double bootstrap. By focusing on the multivariate normal model, we investigate higher-order asymptotics up to fourth-order accuracy. Geometry of the region plays important roles in the asymptotic theory. It was known in the literature that the curvature of the boundary surface of the region determines the bias of bootstrap probability. We found out that the curvature-of-curvature determines the remaining bias of double bootstrap. The multiscale bootstrap removes these biases. The multiscale-double bootstrap is fourth order accurate with coverage probability erring only $O(n^{-2})$, and it is robust against computational error of parameter estimation used for generating bootstrap replicates from the null distribution.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hidetoshi Shimodaira. 2014-05-20. Higher-order accuracy of multiscale-double bootstrap for testing regions. https://arxiv.org/abs/1312.6348

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