Moderate deviation theorem for the Neyman-Pearson statistic in testing uniformity

Tadeusz Inglot

Moderate deviation theorem for the Neyman-Pearson statistic in testing uniformity

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2003.11771 v1 pith:VS3LB7XL submitted 2020-03-26 math.ST stat.TH

Tadeusz Inglot This is my paper · ORCID

classification math.STstat.TH

keywords theoremdensitiesdeviationmoderateneyman-pearsonstatisticuniformityalternatives

verification ladder T0 review T1 audit T2 compute T3 formal

0 comments

read the original abstract

We show that for local alternatives to uniformity which are determined by a sequence of square integrable densities the moderate deviation (MD) theorem for the corresponding Neyman-Pearson statistic does not hold in the full range for all unbounded densities. We give a sufficient condition under which MD theorem holds. The proof is based on Mogulskii's inequality.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

Robust Multi-Manifold Clustering via Simplex Paths
stat.ML 2025-07 conditional novelty 6.0 of 10

A new clustering distance, the largest angle path distance, separates intersecting manifolds using dihedral angles between simplices, with high-probability guarantees and near-linear runtime.

Pith tools