Daniel Kane

is this you? claim profile

∙ 0 followers
University of California, San Diego

Assistant Professor, Computer Science and Engineering & Dept. of Mathematics, Mathematical prodigy. By 3rd grade, he had mastered K through 9th-grade mathematics, At age 13, he took honors math courses at the University of Wisconsin–Madison and did research under the mentorship of Ken Ono while dual enrolled at Madison West High School, Gold medals in the 2002 and 2003 International Mathematical Olympiads, Fellow Laureate of the Davidson Institute for Talent Development.

Featured Co-authors

Ilias Diakonikolas
51 publications
Jerry Li
38 publications
Ankur Moitra
35 publications
Shay Moran
30 publications
Gautam Kamath
24 publications
Eric Price
22 publications
Olivier Bousquet
22 publications
Rocco A. Servedio
19 publications
Yuval Filmus
18 publications
Shachar Lovett
18 publications
Alistair Stewart
18 publications

Fooling Gaussian PTFs via Local Hyperconcentration

We give a pseudorandom generator that fools degree-d polynomial threshol...
03/13/2021 ∙ by Ryan O'Donnell, et al. ∙ 0 ∙ share

read it
Bounded Memory Active Learning through Enriched Queries

The explosive growth of easily-accessible unlabeled data has lead to gro...
02/09/2021 ∙ by Max Hopkins, et al. ∙ 2 ∙ share

read it
Highway: Efficient Consensus with Flexible Finality

There has been recently a lot of progress in designing efficient partial...
01/06/2021 ∙ by Daniel Kane, et al. ∙ 0 ∙ share

read it
Robustly Learning any Clusterable Mixture of Gaussians

We study the efficient learnability of high-dimensional Gaussian mixture...
05/13/2020 ∙ by Ilias Diakonikolas, et al. ∙ 6 ∙ share

read it
Noise-tolerant, Reliable Active Classification with Comparison Queries

With the explosion of massive, widely available unlabeled data in the pa...
01/15/2020 ∙ by Max Hopkins, et al. ∙ 9 ∙ share

read it
Outlier-Robust High-Dimensional Sparse Estimation via Iterative Filtering

We study high-dimensional sparse estimation tasks in a robust setting wh...
11/19/2019 ∙ by Ilias Diakonikolas, et al. ∙ 26 ∙ share

read it
The Optimal Approximation Factor in Density Estimation

Consider the following problem: given two arbitrary densities q_1,q_2 an...
02/10/2019 ∙ by Olivier Bousquet, et al. ∙ 16 ∙ share

read it
The entropy of lies: playing twenty questions with a liar

`Twenty questions' is a guessing game played by two players: Bob thinks ...
11/06/2018 ∙ by Yuval Dagan, et al. ∙ 0 ∙ share

read it
The Orthogonal Vectors Conjecture for Branching Programs and Formulas

In the Orthogonal Vectors (OV) problem, we wish to determine if there is...
09/15/2017 ∙ by Daniel Kane, et al. ∙ 0 ∙ share

read it
Robust Learning of Fixed-Structure Bayesian Networks

We investigate the problem of learning Bayesian networks in an agnostic ...
06/23/2016 ∙ by Ilias Diakonikolas, et al. ∙ 0 ∙ share

read it
Robust Estimators in High Dimensions without the Computational Intractability

We study high-dimensional distribution learning in an agnostic setting w...
04/21/2016 ∙ by Ilias Diakonikolas, et al. ∙ 0 ∙ share

read it