2 citations · 3 across the 4 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
cs.DS2022★ 1 cited
Near-Optimal Bounds for Testing Histogram Distributions
Clément L. Canonne, Ilias Diakonikolas, Daniel M. Kane +1
We investigate the problem of testing whether a discrete probability distribution over an ordered domain is a histogram on a specified number of bins. One of the most common tools…
cs.LG2022
Computational-Statistical Gaps in Reinforcement Learning
Daniel Kane, Sihan Liu, Shachar Lovett +1
Reinforcement learning with function approximation has recently achieved tremendous results in applications with large state spaces. This empirical success has motivated a growing…