Proofs of proximity for distribution testing
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1256775 (Why is no real title available?)
- scientific article; zbMATH DE number 6829278 (Why is no real title available?)
- A Chasm Between Identity and Equivalence Testing with Conditional Queries
- A Coincidence-Based Test for Uniformity Given Very Sparsely Sampled Discrete Data
- Algebrization: a new barrier in complexity theory
- An automatic inequality prover and instance optimal identity testing
- Annotations in Data Streams
- Arguments of proximity (extended abstract)
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
- Arthur-Merlin streaming complexity
- Constant-round interactive proofs for delegating computation
- Estimating Entropy on<tex>$m$</tex>Bins Given Fewer Than<tex>$m$</tex>Samples
- Estimating the unseen, an \(n/\log(n)\)-sample estimator for entropy and support size, shown optimal via new CLTs
- Fast approximate probabilistically checkable proofs
- Improving and extending the testing of distributions for shape-restricted properties
- Interactive proofs of proximity: delegating computation in sublinear time
- Introduction to Property Testing
- Model Selection and Multimodel Inference
- Non-interactive proofs of proximity
- On testing expansion in bounded-degree graphs
- On the randomness complexity of property testing
- Optimal algorithms for testing closeness of discrete distributions
- Partial tests, universal tests and decomposability
- Proofs of proximity for context-free languages and read-once branching programs
- Property testing and its connection to learning and approximation
- Quantum proofs
- Robust Characterizations of Polynomials with Applications to Program Testing
- Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding
- Strong locally testable codes with relaxed local decoders
- Strong lower bounds for approximating distribution support size and the distinct elements problem
- Testing Statistical Hypotheses
- Testing Symmetric Properties of Distributions
- Testing monotone high‐dimensional distributions
- Testing probability distributions underlying aggregated data
- Testing probability distributions using conditional samples
- Testing properties of collections of distributions
- The Complexity of Approximating the Entropy
- The Knowledge Complexity of Interactive Proof Systems
Cited in
(10)- Universal locally verifiable codes and 3-round interactive proofs of proximity for CSP
- Two Party Distribution Testing: Communication and Security
- Proximity Oblivious Testing and the Role of Invariances
- Interactive proofs for verifying machine learning
- Distribution-free proofs of proximity
- Streaming zero-knowledge proofs
- On Proximity-Oblivious Testing
- scientific article; zbMATH DE number 7250162 (Why is no real title available?)
- Public coin interactive proofs for label-invariant distribution properties
- Non-interactive proofs of proximity
This page was built for publication: Proofs of proximity for distribution testing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4993323)
