Optimal Algorithms and Lower Bounds for Testing Closeness of Structured Distributions.
Ilias DiakonikolasDaniel M. KaneVladimir NikishkinPublished in: CoRR (2015)
Keyphrases
- lower bound
- worst case
- learning algorithm
- lower and upper bounds
- computational complexity
- computational cost
- upper bound
- data structure
- computationally efficient
- structured data
- times faster
- branch and bound algorithm
- upper and lower bounds
- online algorithms
- kullback leibler divergence
- exponential distributions
- theoretical analysis
- minimum cost
- exhaustive search
- optimization problems
- probability distribution
- optimal solution