On large deviation theorem for data-driven Neyman's statistic
From MaRDI portal
Publication:1977641
DOI10.1016/S0167-7152(99)00187-XzbMath0945.62054OpenAlexW2045106296MaRDI QIDQ1977641
Publication date: 19 September 2000
Published in: Statistics \& Probability Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-7152(99)00187-x
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Exponential inequalities for sums of random vectors
- Estimating the dimension of a model
- Asymptotic optimality of data-driven Neyman's tests for uniformity
- A probability inequality for obtaining lower bounds in the large deviation principle
- Data driven smooth tests for composite hypotheses
- Generalized intermediate efficiency of goodness-of-fit tests.
- Consistency and Monte Carlo simulation of a data driven version of smooth goodness-of-fit tests
- On Sums of Random Vectors
- Data-Driven Version of Neyman's Smooth Test of Fit
- Testing Uniformity Via Log-Spline Modeling
- Data-Driven Smooth Tests When the Hypothesis Is Composite
This page was built for publication: On large deviation theorem for data-driven Neyman's statistic