Almost sure hypothesis testing and a resolution of the Jeffreys-Lindley paradox

DOI10.1214/16-EJS1146zbMath1419.62034WikidataQ57484154 ScholiaQ57484154MaRDI QIDQ302434

Michael Naaman

Publication date: 5 July 2016

Published in: Electronic Journal of Statistics (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.ejs/1464710240

zbMATH Keywords

model selectionhypothesis testingEdgeworth expansionsp-hacking

Mathematics Subject Classification ID

Parametric hypothesis testing (62F03) Bayesian inference (62F15) Asymptotic properties of parametric tests (62F05) Paired and multiple comparisons; multiple testing (62J15)

Related Items (4)

Null Hypothesis Significance Testing Defended and Calibrated by Bayesian Model Checking ⋮ The case of the Jeffreys-Lindley-paradox as a Bayes-frequentist compromise: a perspective based on the Rao-Lovric-theorem ⋮ On the tight constant in the multivariate Dvoretzky-Kiefer-Wolfowitz inequality ⋮ Operational aspect of the policy coordination for financial stability: role of Jeffreys-Lindley's paradox in operations research

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Heteroskedasticity and Autocorrelation Consistent Covariance Matrix Estimation
• Bootstrapping GMM estimators for time series
• Edgeworth expansion for Student's t statistic under minimal moment conditions
• Inverting an Edgeworth expansion
• Edgeworth expansions for Studentized statistics under weak dependence
• Edgeworth expansion in regression models
• A topological criterion for hypothesis testing
• Optimization of Convex Functions with Random Pursuit
• Normal Approximation and Asymptotic Expansions
• A STATISTICAL PARADOX
• Higher Order Properties of Gmm and Generalized Empirical Likelihood Estimators
• The bootstrap and Edgeworth expansion
• A note on the Borel-Cantelli lemma

This page was built for publication: Almost sure hypothesis testing and a resolution of the Jeffreys-Lindley paradox