| 2025 | ICML | On Learning Parallel Pancakes with Mostly Uniform Weights. | Ilias Diakonikolas, Daniel Kane, Sushrut Karmalkar, Jasper C. H. Lee, Thanasis Pittas |
| 2025 | ICML | Batch List-Decodable Linear Regression via Higher Moments. | Ilias Diakonikolas, Daniel Kane, Sushrut Karmalkar, Sihan Liu, Thanasis Pittas |
| 2025 | ICML | On Fine-Grained Distinct Element Estimation. | Ilias Diakonikolas, Daniel Kane, Jasper C. H. Lee, Thanasis Pittas, David P. Woodruff, Samson Zhou |
| 2025 | ICML | Efficient Multivariate Robust Mean Estimation Under Mean-Shift Contamination. | Ilias Diakonikolas, Giannis Iakovidis, Daniel Kane, Thanasis Pittas |
| 2024 | ICML | Robust Sparse Estimation for Gaussians with Optimal Error under Huber Contamination. | Ilias Diakonikolas, Daniel Kane, Sushrut Karmalkar, Ankit Pensia, Thanasis Pittas |
| 2023 | COLT | A Nearly Tight Bound for Fitting an Ellipsoid to Gaussian Random Points. | Daniel Kane, Ilias Diakonikolas |
| 2023 | COLT | Exponential Hardness of Reinforcement Learning with Linear Function Approximation. | Sihan Liu, Gaurav Mahajan, Daniel Kane, Shachar Lovett, Gellrt Weisz, Csaba Szepesvri |
| 2023 | ICML | Nearly-Linear Time and Streaming Algorithms for Outlier-Robust PCA. | Ilias Diakonikolas, Daniel Kane, Ankit Pensia, Thanasis Pittas |
| 2023 | ICML | Near-Optimal Cryptographic Hardness of Agnostically Learning Halfspaces and ReLU Regression under Gaussian Marginals. | Ilias Diakonikolas, Daniel Kane, Lisheng Ren |
| 2023 | SODA | Sampling Equilibria: Fast No-Regret Learning in Structured Games. | Daniel Beaglehole, Max Hopkins, Daniel Kane, Sihan Liu, Shachar Lovett |
| 2022 | AISTATS | Hardness of Learning a Single Neuron with Adversarial Label Noise. | Ilias Diakonikolas, Daniel Kane, Pasin Manurangsi, Lisheng Ren |
| 2022 | COLT | Near-Optimal Statistical Query Hardness of Learning Halfspaces with Massart Noise. | Ilias Diakonikolas, Daniel Kane |
| 2022 | COLT | Non-Gaussian Component Analysis via Lattice Basis Reduction. | Ilias Diakonikolas, Daniel Kane |
| 2022 | COLT | Computational-Statistical Gap in Reinforcement Learning. | Daniel Kane, Sihan Liu, Shachar Lovett, Gaurav Mahajan |
| 2021 | AISTATS | vqSGD: Vector Quantized Stochastic Gradient Descent. | Venkata Gandikota, Daniel Kane, Raj Kumar Maity, Arya Mazumdar |
| 2021 | COLT | Bounded Memory Active Learning through Enriched Queries. | Max Hopkins, Daniel Kane, Shachar Lovett, Michal Moshkovitz |
| 2020 | COLT | Noise-tolerant, Reliable Active Classification with Comparison Queries. | Max Hopkins, Daniel Kane, Shachar Lovett, Gaurav Mahajan |
| 2020 | FOCS | Outlier-Robust Clustering of Gaussians and Other Non-Spherical Mixtures. | Ainesh Bakshi, Ilias Diakonikolas, Samuel B. Hopkins, Daniel Kane, Sushrut Karmalkar, Pravesh K. Kothari |
| 2020 | FOCS | Point Location and Active Learning: Learning Halfspaces Almost Optimally. | Max Hopkins, Daniel Kane, Shachar Lovett, Gaurav Mahajan |
| 2019 | COLT | The Optimal Approximation Factor in Density Estimation. | Olivier Bousquet, Daniel Kane, Shay Moran |
| 2019 | COLT | On Communication Complexity of Classification Problems. | Daniel Kane, Roi Livni, Shay Moran, Amir Yehudayoff |
| 2019 | ICML | Sever: A Robust Meta-Algorithm for Stochastic Optimization. | Ilias Diakonikolas, Gautam Kamath, Daniel Kane, Jerry Li, Jacob Steinhardt, Alistair Stewart |
| 2017 | FOCS | Robust Polynomial Regression up to the Information Theoretic Limit. | Daniel Kane, Sushrut Karmalkar, Eric Price |
| 2017 | FOCS | The Independence Number of the Birkhoff Polytope Graph, and Applications to Maximally Recoverable Codes. | Daniel Kane, Shachar Lovett, Sankeerth Rao |
| 2016 | CRYPTO | Big-Key Symmetric Encryption: Resisting Key Exfiltration. | Mihir Bellare, Daniel Kane, Phillip Rogaway |
| 2015 | CCS | Mass-surveillance without the State: Strongly Undetectable Algorithm-Substitution Attacks. | Mihir Bellare, Joseph Jaeger, Daniel Kane |
| 2009 | SODA | The geometry of binary search trees. | Erik D. Demaine, Dion Harmon, John Iacono, Daniel Kane, Mihai Patrascu |
| 2009 | WADS | A Pseudopolynomial Algorithm for Alexandrov's Theorem. | Daniel Kane, Gregory N. Price, Erik D. Demaine |
| 2005 | FOCS | On the Complexity of Two-PlayerWin-Lose Games. | Timothy G. Abbott, Daniel Kane, Paul Valiant |