Pith. sign in

REVIEW 1 cited by

Locally sharp goodness-of-fit testing in sup norm for high-dimensional counts

Not yet reviewed by Pith; the record is open.

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 2409.08871 v1 pith:2WR7K7W4 submitted 2024-09-13 math.ST stat.TH

classification math.STstat.TH
keywords nullnormseparationbounddecaydetermineddistributiongoodness-of-fit
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We consider testing the goodness-of-fit of a distribution against alternatives separated in sup norm. We study the twin settings of Poisson-generated count data with a large number of categories and high-dimensional multinomials. In previous studies of different separation metrics, it has been found that the local minimax separation rate exhibits substantial heterogeneity and is a complicated function of the null distribution; the rate-optimal test requires careful tailoring to the null. In the setting of sup norm, this remains the case and we establish that the local minimax separation rate is determined by the finer decay behavior of the category rates. The upper bound is obtained by a test involving the sample maximum, and the lower bound argument involves reducing the original heteroskedastic null to an auxiliary homoskedastic null determined by the decay of the rates. Further, in a particular asymptotic setup, the sharp constants are identified.

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

  1. Optimal community detection in dense bipartite graphs

    math.ST 2025-05 accept novelty 7.0 of 10

    The minimax separation rate for detecting a planted dense k1 by k2 subgraph in an n1 by n2 bipartite Erdős-Renyi graph is established up to constants under a dense-graph assumption.

Pith tools