Pith. sign in

REVIEW 1 cited by

Improved Random-Binning Exponent for Distributed Hypothesis Testing

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 2306.14499 v2 pith:P777KCJN submitted 2023-06-26 cs.IT math.IT

Yuval Kochman , Ligong Wang This is my paper
classification cs.ITmath.IT
keywords exponentdecisiondistributedhypothesisreceiverschemetestingachievable
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Consider the problem of distributed binary hypothesis testing with two terminals, where the decision is made at one of them (the "receiver"). We study the exponent of the error probability of the second type. Previously, an achievable exponent was derived by Shimokawa, Han, and Amari using a "quantization and binning" scheme. We propose a simple modification on the receiver's decision rule in this scheme to attain a better exponent.

Discussion (0). Sign in 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. Practical Short-Length Coding Schemes for Binary Distributed Hypothesis Testing

    cs.IT 2025-06 reject novelty 4.0 of 10

    Short-length quantization and quantize-binning schemes for binary distributed hypothesis testing are proposed, but the exact error formulas contain a combinatorial error that invalidates the theoretical analysis.

Pith tools