How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Estimate an inner product from ℓ2-sampling access
Statement
Let be nonzero with exact norm, ℓ2 sample access, and entry-query access, and let have entry-query access and known norm. For , a positive integer , and a positive integer with , there is a finite estimator using the lower median of block means, with samples from and at most entry queries to each of and , such that If , return without sampling. All sample and entry-query costs are charged.
Facts & Assumptions
Given: The access interfaces, and vectors in the Statement.
ℓ2 sample/query access to vectors and matrices: sampling index from nonzero gives probability .
Chebyshev's inequality on a finite probability space: for a finite real variable and , .
Pairwise and mutual independence of finite-valued random variables: independent samples give independent copies of any deterministic function of the sampled index.
The finite union bound: the probability of a finite union is at most the sum of the event probabilities.
Proof
If , the prescribed output equals and has zero error. Suppose henceforth . For one sample , query and and define when and when . Since a zero coordinate has sampling probability zero, [F1] gives .
Directly from the sampling law [F1], . Hence .
Partition independent samples into disjoint blocks of size . Let be the mean of in block and define to be the -th order statistic of (the lower median). Independence gives each block mean variance at most . Apply [F2] with the positive threshold ; each block mean is outside the target interval with probability at most .
If the median lies outside the target interval, at least block means lie outside it. For each fixed subset of that size the probability all its blocks fail is at most by [F3]; there are at most such subsets. By [F4], the failure probability is at most .
Depends on
- ℓ2 sample/query access to vectors and matrices
- Finite probability spaces, outcome weights, events, and event probabilities
- Pairwise and mutual independence of finite-valued random variables
- Normalization, nonnegativity, monotonicity, complements, and differences in a finite probability space
- Chebyshev's inequality on a finite probability space
- The finite union bound
Used by
Dependency tree · two levels
22 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Ewin Tang, A quantum-inspired classical algorithm for recommendation systems, version 3 (standard reference, not scraped)
- Alan Frieze, Ravi Kannan, and Santosh Vempala, Fast Monte-Carlo Algorithms for Finding Low-Rank Approximations (standard reference, not scraped)