Skip to content
Preprint

Breakdown Reliability for Saturated Fixed-Effect Inference

Aug 2026 · 0 citations
Economics

Abstract

Fixed-effect saturation does not itself distort conventional inference, but classical measurement error does. Under a local noise drift $\sigma_\nu^2=c^2/n$, the FE-OLS $t$-statistic converges to a non-central normal; saturation contributes a common $\sqrt{1-\rho}$ scaling rather than preferentially destroying signal or noise. Inverting the size distortion gives a Stock--Yogo-style critical value. Self-consistency of the within-reliability-corrected pilot yields a breakdown reliability $\lambda^{\dagger}=|t|/(|t|+\eta^{\dagger})$ --- the minimum within reliability at which conventional inference retains nominal size within the chosen tolerance --- computable from the reported $t$-statistic alone and algebraically $\rho$-free conditional on it; $\eta^{\dagger}\approx0.65$ at $5\%$ size and a 5-point tolerance. Replacing $|t|$ by $|t|+z_{1-\gamma_\beta}$ gives a certified breakdown reliability; with a lower-reliability bound whose coverage error is $\gamma_\lambda$, false certification is at most $\gamma_\beta+\gamma_\lambda$. Under a checkable projection-compatibility condition, a cluster-level score CLT and consistency of the Arellano variance estimator in the many-fixed-effect regime justify applying the same map to the reported cluster-robust $t$-statistic; clustering can reverse a verdict. In a saturated democracy--growth panel, aggregate V-Dem polyarchy is certified at $\gamma_\beta=0.05$, conditional on the supplied measurement model, while its judicial-constraints sub-index is flagged under i.i.d.\ and clustered standard errors. In a twin-pair wage design, the specification is flagged under both independent and correlated reporting-error models, although implied coverage of the nominal-$95\%$ interval ranges from $8\%$ to $68\%$. The diagnostic covers classical error in a continuous regressor, not binary-treatment misclassification.

View source

Similar papers

Preprint Aug 2026

Bessel-Debiased Pseudo-Marginal MCMC for Generalised Bayesian Inference

Sign-Corrected Bessel Debiasing (SCBD), a signed pseudo-marginal method based on independent block estimates of the loss, is introduced and its ordinary-MC and independently randomised quasi-Monte Carlo (RQMC) implementations are studied.

Yingkai Lu, J. Lee, Geoff K. Nicholls · 0 citations
Preprint Sep 2026

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

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 $\Delta_n$ denote a relevance threshold and $I_0$ Fi...

Subir Hait · 0 citations
#machine learning Preprint Aug 2026

The Type-II Error of Test Supermartingales: e-Power versus the Chernoff-Stein Exponent

In safe hypothesis testing with test supermartingales, Ville's inequality provides anytime-valid type-I error guarantees for every significance level $\alpha\in(0,1]$, if one rejects the null hypothesis whenever the wealth process first exceeds $1/\alpha$. Due to an inherent asymmetry, the type-II error behaves differe...

Patrick Forré · 1 citation
Preprint Sep 2026

Finite-sample nonparametric mean tests: Leave-one-out duality and asymptotic optimality

We study finite-sample valid tests of the one-sided mean hypothesis $H_0:\mu\leq 1$ against $H_1:\mu>1$ for nonnegative random variables. To do so, we develop a leave-one-out dual certificate framework, where certain pointwise inequalities imply p-value validity under the conditional mean null $\mathbb{E}[X_i\mid\mathb...

Yi-Fan Zhu, John C. Duchi · 0 citations
#machine learning Preprint Sep 2026

Parameter-Free Interval-Dynamic Regret under Heavy-Tailed Noise

We study online convex optimization with one unbiased stochastic subgradient per round and an unknown finite conditional $p$th noise moment, $1<p\le2$. For every fixed interval $I$ of length $n$ and comparator path with $\Lambda_I=1+P_I/D$, one learner achieves \[ E[Regret_I(u)]\le\min(GDn, C[GD\sqrt{n(\Lambda_I+\log^2...

Vaneet Aggarwal · 0 citations
#machine learning Preprint Sep 2026

The Statistical Cost of Causal Discovery with Feedback

What determines the unavoidable sample cost of learning cyclic causal structure? For cyclic linear non-Gaussian models, we study exact condensation recovery from observational data: identifying the strongly connected component (SCC) partition and all edges between components. We establish the first information-theoreti...

Sunmin Oh, Seung-Su Han, Gunwoong Park · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.