Testing k-Modal Distributions: Optimal Algorithms via Reductions

Testing k-Modal Distributions: Optimal Algorithms via Reductions

We give highly efficient algorithms, and almost matching lower bounds, for a range of basic statistical problems that involve testing and estimating the L[subscript 1] (total variation) distance between two k-modal distributions p and q over the discrete domain {1, ..., n}. More precisely, we consid...

Full description

Bibliographic Details
Main Authors: Diakonikolas, Ilias (Author), Servedio, Rocco A. (Author), Valiant, Gregory (Author), Valiant, Paul (Author), Daskalakis, Konstantinos (Contributor)
Other Authors: Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor)
Format: Article
Language:English
Published: Society for Industrial and Applied Mathematics, 2015-11-20T17:19:02Z.
Subjects:
Article
Online Access:Get fulltext

Internet

Get fulltext

Similar Items