Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 0710.1919

Increasing power of the test through pre-test - a robust method

Rossita M Yunus·Shahjahan Khan
View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper develops robust test procedures for testing the intercept of a simple regression model when it is \textit{apriori} suspected that the slope has a specified value. Defining unrestricted test (UT), restricted test (RT) and pre-test test (PTT) corresponding to the unrestricted (UE), restricted (RE), and preliminary test estimators (PTE) in the estimation case, the M-estimation methodology is used to formulate the M-tests and derive their asymptotic power functions. Analytical and graphical comparisons of the three tests are obtained by studying the power functions with respect to size and power of the tests. It is shown that PTT achieves a reasonable dominance over the others asymptotically.

Explore related subjects

math.STstat.TH

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Rossita M Yunus, Shahjahan Khan. 2007-10-10. Increasing power of the test through pre-test - a robust method. https://arxiv.org/abs/0710.1919

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

KEEP EXPLORING

Related papers

arXiv2026

Adaptive Density Estimation Using Projection Kernels and Penalized Comparison to Overfitting

In this work, we study wavelet projection estimators for density estimation, based on compactly supported $\mathcal S$-regular scaling functions. The main issue is the choice of the resolution level, which determines the bias--variance trade-off. We select this level by a Penalized Comparison to Overfitting (PCO) criterion: each candidate estimator is compared in $Ł^2(\R)$ with a single overfitting reference, and the additional stochastic fluctuation is corrected by an explicit penalty. For the selected estimator, we prove a high-probability oracle inequality and a risk oracle inequality in expectation. Over Besov balls of densities satisfying a common $Ł^\infty$ bound, the risk inequality yields the rate $n^{-2r/(2r+1)}$ uniformly over the class, with a sufficient penalty threshold that can be chosen uniformly over the class. This rate has the classical minimax order, and the procedure adapts to the unknown Besov regularity. Numerical experiments on several density shapes confirm that the data-driven level is close to the oracle one and adapts to the structure of the target.

math.ST↗
arXiv2026

Imputation is all you need: double robustness, semiparametric efficiency, and automatic covariate balance for estimating the average treatment effect

Imputation-based causal estimation is typically viewed as relying exclusively on an outcome model, in contrast to augmented inverse-probability weighting, whose consistency is protected by fitting two nuisance models. This paper argues that this view can be misleading by highlighting a hidden dual weighting structure in least-squares sieve regression imputation. Although only outcome regressions are explicitly fitted, the resulting imputation estimator admits an exact weighting representation whose induced weights balance every function in the sieve space and the corresponding population weighting functions are the $L^2$ projections of the inverse propensity scores onto the same sieve space. This projection structure yields an implicit form of double robustness and, under standard sieve approximation and growth conditions, asymptotic linearity with the efficient influence function. Thus, weighting, covariate balance, double robustness, and semiparametric efficiency can all emerge from imputation alone through the geometry of least-squares projection.

math.ST↗
arXiv2026

High-accuracy simulation of Picard HMC, part I: Gaussian cloud correction

We study the problem of sampling from a continuous density $π\propto \exp(-V)$ on $\mathbb R^d$, where $V\in C^2(\mathbb R^d)$ has a $β$-Lipschitz gradient and $π$ satisfies a logarithmic Sobolev inequality with constant $α^{-1}$, and write $κ= β/α$. We introduce the Gaussian cloud sampler, which achieves total variation accuracy $\varepsilon$ using $\widetilde O(κd^{1/5}\,\text{polylog}(1/\varepsilon))$ gradient queries in expectation. The algorithm uses first-order rejection sampling (FORS) to correct the law of smoothed Picard HMC trajectories. To do so, we represent the iterates of the ideal Picard iteration via Gaussian clouds, whose centers are never evaluated, and we develop a suite of likelihood correction gadgets which only use samples from this indirect cloud representation.

math.ST↗