CoChat

An Automatic Inequality Prover and Instance Optimal Identity Testing

Valiant, Gregory, Valiant, Paul · 2017 · SIAM Journal on Computing
Cited by 93

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Abstract

We consider the problem of verifying the identity of a distribution: Given the description of a distribution over a discrete finite or countably infinite support, $p=(p_1,p_2,\ldots)$, how many samples (independent draws) must one obtain from an unknown distribution, $q$, to distinguish, with high probability, the case that $p=q$ from the case that the total variation distance ($L_1$ distance) $\|p-q\|_1 \ge \epsilon$? We resolve this question, up to constant factors, on an instance by instance basis: there exist universal constants $c,c'$ and a function $f(p,\epsilon)$ on the known distribution $p$ and error parameter $\epsilon$, such that our tester distinguishes $p=q$ from $\|p-q\|_1\ge \epsilon$ using $f(p,\epsilon)$ samples with success probability $>2/3$, but no tester can distinguish $p=q$ from $\|p-q\|_1\ge c\cdot \epsilon$ when given $c'\cdot f(p,\epsilon)$ samples. The function $f(p,\epsilon)$ is upper-bounded by a multiple of $\frac{\|p\|_{2/3}}{\epsilon^2}$ but is more complicated. This result generalizes and tightens previous results: since distributions of support at most $n$ have $L_{2/3}$ norm bounded by $\sqrt{n},$ this result immediately shows that for such distributions, $O(\sqrt{n}/{\epsilon^2})$ samples suffice, tightening the previous bound of $O(\frac{\sqrt{n}\ {\rm polylog}\ n}{\epsilon^4})$ and matching the (tight) results for the case that $p$ is the uniform distribution of support $n$. The analysis of our very simple testing algorithm involves several hairy inequalities. To facilitate this analysis, we give a complete characterization of a general class of inequalities---generalizing Cauchy--Schwarz, Hölder's inequality, and the monotonicity of $L_p$ norms. Specifically, we characterize the set of sequences of triples $(a,b,c)_i=(a_1,b_1,c_1),\ldots,(a_r,b_r,c_r)$ for which it holds that for all finite sequences of positive numbers $(x)_j=x_1,\ldots$ and $(y)_j=y_1,\ldots,$ $\prod_{i=1}^r ( \sum_j x_j^{a_i} y_j^{b_i})^{c_i} \ge 1.$ For example, the standard Cauchy--Schwarz inequality corresponds to the triples $(a,b,c)_i=(1,0,\frac{1}{2}),$ $\,(0,1,\frac{1}{2}),$ $\,(\frac{1}{2},\frac{1}{2},-1)$. Our characterization is constructive and algorithmic, leveraging linear programming to prove or refute an inequality, which would otherwise have to be investigated, through trial and error, by hand. We hope the computational nature of our characterization will be useful to others and facilitate analyses like the one here.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1137/151002526

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 1 references

Cited by

See all 93

Metadata

Authors
Valiant, G., & Valiant, P.
Venue
SIAM Journal on Computing
Published
2017-01
Volume
46
Issue
1
Pages
429-455
ISSN
  • 0097-5397 (ISSN-L)
  • 1095-7111
OpenAlex
W2592411267
Cited by
93
References
1
FWCI
7.38
Type
journal article
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: An Automatic Inequality Prover and Instance Optimal Identity Testing. https://app.cochat.ai/papers/10.1137/151002526
The paper
Valiant, G., & Valiant, P. (2017). An Automatic Inequality Prover and Instance Optimal Identity Testing. SIAM Journal on Computing. https://doi.org/10.1137/151002526

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.