# Frontiers in Distribution Testing at FOCS 2017

From Open Problems in Sublinear Algorithms

Revision as of 05:54, 8 November 2017 by Krzysztof Onak (talk | contribs) (Turning a link into a full sentence.)

The workshop was held at FOCS in Berkeley, USA, in November 2017. This list contains open problems suggested by participants during the open problems session. More information about the workshop can be found at the workshop webpage.

## Links[edit]

## Open Problems[edit]

- Problem 81: Rényi Entropy Estimation
- Problem 82: Beyond Identity Testing
- Problem 83: Instance-Specific Hellinger Testing
- Problem 84: Efficient Profile Maximum Likelihood Computation
- Problem 85: Sample Stretching
- Problem 86: Equivalence Testing Lower Bound via Communication Complexity
- Problem 87: Equivalence Testing with Conditional Samples
- Problem 88: Separating PDF and CDF Query Models
- Problem 89: AM vs. NP for Proofs of Proximity in Distribution Testing