research
∙
04/18/2023
Optimal PAC Bounds Without Uniform Convergence
In statistical learning theory, determining the sample complexity of rea...
share
research
∙
12/19/2022
The One-Inclusion Graph Algorithm is not Always Optimal
The one-inclusion graph algorithm of Haussler, Littlestone, and Warmuth ...
research
∙
11/08/2022
On the amortized complexity of approximate counting
Naively storing a counter up to value n would require Ω(log n) bits of m...
research
∙
06/03/2021
Privately Learning Mixtures of Axis-Aligned Gaussians
We consider the problem of learning mixtures of Gaussians under the cons...
research
∙
10/19/2020
On the Sample Complexity of Privately Learning Unbounded High-Dimensional Gaussians
We provide sample complexity upper bounds for agnostically learning mult...
research
∙
12/05/2019
