Daniel Kane

Daniel Kane

University of California, San Diego

H-index: 41

North America-United States

About Daniel Kane

Daniel Kane, With an exceptional h-index of 41 and a recent h-index of 35 (since 2020), a distinguished researcher at University of California, San Diego, specializes in the field of Algorithms, Complexity, Number Theory, Combinatorics, Probability.

His recent articles reflect a diverse array of research interests and contributions to the field:

SQ Lower Bounds for Non-Gaussian Component Analysis with Weaker Assumptions

Super Non-singular Decompositions of Polynomials and their Application to Robustly Learning Low-degree PTFs

SQ lower bounds for learning mixtures of linear classifiers

Robust Sparse Estimation for Gaussians with Optimal Error under Huber Contamination

Near-Optimal Bounds for Learning Gaussian Halfspaces with Random Classification Noise

Statistical Query Lower Bounds for Learning Truncated Gaussians

Efficient testable learning of halfspaces with adversarial label noise

Locality Bounds for Sampling Hamming Slices

Daniel Kane Information

University

Position

___

Citations(all)

6675

Citations(since 2020)

4792

Cited By

3768

hIndex(all)

41

hIndex(since 2020)

35

i10Index(all)

121

i10Index(since 2020)

100

Email

University Profile Page

University of California, San Diego

Google Scholar

View Google Scholar Profile

Daniel Kane Skills & Research Interests

Algorithms

Complexity

Number Theory

Combinatorics

Probability

Top articles of Daniel Kane

Title

Journal

Author(s)

Publication Date

SQ Lower Bounds for Non-Gaussian Component Analysis with Weaker Assumptions

Advances in Neural Information Processing Systems

Ilias Diakonikolas

Daniel Kane

Lisheng Ren

Yuxin Sun

2024/2/13

Super Non-singular Decompositions of Polynomials and their Application to Robustly Learning Low-degree PTFs

arXiv preprint arXiv:2404.00529

Ilias Diakonikolas

Daniel M Kane

Vasilis Kontonis

Sihan Liu

Nikos Zarifis

2024/3/31

SQ lower bounds for learning mixtures of linear classifiers

Advances in Neural Information Processing Systems

Ilias Diakonikolas

Daniel Kane

Yuxin Sun

2024/2/13

Robust Sparse Estimation for Gaussians with Optimal Error under Huber Contamination

arXiv preprint arXiv:2403.10416

Ilias Diakonikolas

Daniel M Kane

Sushrut Karmalkar

Ankit Pensia

Thanasis Pittas

2024/3/15

Near-Optimal Bounds for Learning Gaussian Halfspaces with Random Classification Noise

Advances in Neural Information Processing Systems

Ilias Diakonikolas

Jelena Diakonikolas

Daniel Kane

Puqian Wang

Nikos Zarifis

2024/2/13

Statistical Query Lower Bounds for Learning Truncated Gaussians

arXiv preprint arXiv:2403.02300

Ilias Diakonikolas

Daniel M Kane

Thanasis Pittas

Nikos Zarifis

2024/3/4

Efficient testable learning of halfspaces with adversarial label noise

Advances in Neural Information Processing Systems

Ilias Diakonikolas

Daniel Kane

Vasilis Kontonis

Sihan Liu

Nikos Zarifis

2024/2/13

Locality Bounds for Sampling Hamming Slices

arXiv preprint arXiv:2402.14278

Daniel M Kane

Anthony Ostuni

Kewen Wu

2024/2/22

Online Robust Mean Estimation

Daniel M Kane

Ilias Diakonikolas

Hanshen Xiao

Sihan Liu

2024

Near-Optimal Algorithms for Gaussians with Huber Contamination: Mean Estimation and Linear Regression

Ilias Diakonikolas

Daniel Kane

Ankit Pensia

Thanasis Pittas

2023/12

Nearly-linear time and streaming algorithms for outlier-robust pca

Ilias Diakonikolas

Daniel Kane

Ankit Pensia

Thanasis Pittas

2023/7/3

Statistical and computational limits for tensor-on-tensor association detection

Ilias Diakonikolas

Daniel M Kane

Yuetian Luo

Anru Zhang

2023/7/12

Testing Closeness of Multivariate Distributions via Ramsey Theory

arXiv preprint arXiv:2311.13154

Ilias Diakonikolas

Daniel M Kane

Sihan Liu

2023/11/22

Agnostically Learning Multi-index Models with Queries

arXiv preprint arXiv:2312.16616

Ilias Diakonikolas

Daniel M Kane

Vasilis Kontonis

Christos Tzamos

Nikos Zarifis

2023/12/27

Sampling Equilibria: Fast No-Regret Learning in Structured Games

Daniel Beaglehole

Max Hopkins

Daniel Kane

Sihan Liu

Shachar Lovett

2023

Near-optimal cryptographic hardness of agnostically learning halfspaces and relu regression under gaussian marginals

Ilias Diakonikolas

Daniel Kane

Lisheng Ren

2023/7/3

Exponential Hardness of Reinforcement Learning with Linear Function Approximation

Sihan Liu

Gaurav Mahajan

Daniel Kane

Shachar Lovett

Gellért Weisz

...

2023/7/12

Theoretical Foundations of Ordinal Multidimensional Scaling, Including Internal and External Unfolding

arXiv preprint arXiv:2310.00211

Ery Arias-Castro

Clément Berenfeld

Daniel Kane

2023/9/30

Clustering Mixtures of Bounded Covariance Distributions Under Optimal Separation

Ilias Diakonikolas

Daniel M Kane

Jasper CH Lee

Thanasis Pittas

2023/12/19

SQ Lower Bounds for Learning Bounded Covariance GMMs

arXiv preprint arXiv:2306.13057

Ilias Diakonikolas

Daniel M Kane

Thanasis Pittas

Nikos Zarifis

2023/6/22

See List of Professors in Daniel Kane University(University of California, San Diego)

Co-Authors

H-index: 78
Erik Demaine

Erik Demaine

Massachusetts Institute of Technology

H-index: 58
David Woodruff

David Woodruff

Carnegie Mellon University

H-index: 47
Ilias Diakonikolas

Ilias Diakonikolas

University of Wisconsin-Madison

H-index: 45
Richard Ryan Williams

Richard Ryan Williams

Massachusetts Institute of Technology

H-index: 39
Ankur Moitra

Ankur Moitra

Massachusetts Institute of Technology

H-index: 36
Scott Duke Kominers

Scott Duke Kominers

Harvard University

academic-engine