Pith. sign in

REVIEW 2 cited by

The Convexity and Concavity of Envelopes of the Minimum-Relative-Entropy Region for the DSBS

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 2106.03654 v1 pith:FH3OTEI3 submitted 2021-06-07 cs.IT math.ITmath.PR

classification cs.ITmath.ITmath.PR
keywords strongbrascamp--liebconvexityexpansionfunctionminimum-relative-entropyregionsmall-set
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

In this paper, we prove that for the doubly symmetric binary distribution, the lower increasing envelope and the upper envelope of the minimum-relative-entropy region are respectively convex and concave. We also prove that another function induced the minimum-relative-entropy region is concave. These two envelopes and this function were previously used to characterize the optimal exponents in strong small-set expansion problems and strong Brascamp--Lieb inequalities. The results in this paper, combined with the strong small-set expansion theorem derived by Yu, Anantharam, and Chen (2021), and the strong Brascamp--Lieb inequality derived by Yu (2021), confirm positively Ordentlich--Polyanskiy--Shayevitz's conjecture on the strong small-set expansion (2019) and Polyanskiy's conjecture on the strong Brascamp--Lieb inequality (2016). The proofs in this paper are based on the equivalence between the convexity of a function and the convexity of the set of minimizers of its Lagrangian dual.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. On the Fundamental Limits of Integrated Sensing and Communications Under Logarithmic Loss

    cs.IT 2025-02 accept novelty 7.0 of 10

    The capacity-distortion function for ISAC under logarithmic loss is exactly characterized for binary and Gaussian models, including non-degraded regimes via a state-splitting trick.

  2. First Train to Generate, then Generate to Train: UnitedSynT5 for Few-Shot NLI

    cs.CL 2024-12 reject novelty 4.0 of 10

    UnitedSynT5 generates synthetic premise-hypothesis pairs with FLAN-T5 XL, filters them using a teacher model, and fine-tunes GTR-T5-XL, reporting accuracy of 94.7% on SNLI, 94.0% on E-SNLI, and 92.6% on MultiNLI.

Pith tools