SearcharxivSearch

arXiv · 1812.03214

On the lengths of $t$-based confidence intervals

Abstract

Given $n=mk$ $iid$ samples from $N(\theta,\sigma^2)$ with $\theta$ and $\sigma^2$ unknown, we have two ways to construct $t$-based confidence intervals for $\theta$. The traditional method is to treat these $n$ samples as $n$ groups and calculate the intervals. The second, and less frequently used, method is to divide them into $m$ groups with each group containing $k$ elements. For this method, we calculate the mean of each group, and these $k$ mean values can be treated as $iid$ samples from $N(\theta,\sigma^2/k)$. We can use these $k$ values to construct $t$-based confidence intervals. Intuition tells us that, at the same confidence level $1-\alpha$, the first method should be better than the second one. Yet if we define "better" in terms of the expected length of the confidence interval, then the second method is better because the expected length of the confidence interval obtained from the first method is shorter than the one obtained from the second method. Our work proves this intuition theoretically. We also specify that when the elements in each group are correlated, the first method becomes an invalid method, while the second method can give us correct results. We illustrate this with analytical expressions.

Explore related subjects

Keep this discovery

BibTeXRIS

Yu Zhang, Xiangzhong Fang. 2018-12-07. On the lengths of $t$-based confidence intervals. https://arxiv.org/abs/1812.03214

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

KEEP EXPLORING

Related papers

Estimating Hierarchically Rank Structured Covariance Matrices

We consider the problem of estimating a high-dimensional covariance matrix from a very limited number of samples. This problem is ubiquitous in computational fluid dynamics, where a small number of fluid snapshots must be used to construct a Gramian matrix determining a reduced-order model, as well as in computational geoscience, where a small ensemble of Earth system forecasts must be used to estimate the covariance matrix associated with the forecast uncertainty. It is common practice to regularize the small-sample covariance by imposing a "localization" structure that enforces a physically realistic correlation length scale, imposing a sparsity constraint, "shrinking" towards a prescribed target, or attenuating small correlations. We propose an alternate technique that regularizes the small-sample covariance by imposing hierarchical rank structure. Compared to regularization methods that assume sparsity such as spatial localization, hierarchical rank structure accommodates a wider range of covariance matrices, roughly corresponding to situations where long-range correlations vary more smoothly than short-range ones. It also results in a data-sparse matrix format that permits highly efficient matrix-vector products. We present theory and algorithms which show how to efficiently estimate a high-dimensional, hierarchically rank structured covariance matrix from limited samples. Through an error analysis and numerical experiments with a variety of model problems, we demonstrate that these techniques are effective at reducing sampling errors, and that in many cases they achieve smaller estimation error than conventional techniques.

stat.CO

Optimal Slice-Adaptive Tuning of Hybrid Slice Sampling

Slice sampling is a Markov chain Monte Carlo algorithm that draws its next state uniformly from a "slice"---a super-level set of the target density function---at each iteration, thereby providing automatic local adaptivity to the scale of the target. In practice the exact slice is not known, so general-purpose implementations use an approximate slice that is grown from a starting interval of length $w>0$, with a computational cost that depends on $w$. This work presents an analysis of the average per-iteration number of target density evaluations, as a function of $w$, of hybrid slice sampling with various slice-finding schemes for targets with contiguous slices. The paper uses the results of the analysis to develop automated, slice-adaptive tuning schemes along with suboptimality bounds and asymptotic convergence guarantees. Simulations demonstrate that the tuning schemes reliably yield near-optimal slice-adaptive tuning with essentially no dependence on the initial setting of $w$.

stat.CO