Skip to content
conftrace_

Daniel M. Kane

29 papers · 2017–2026 · 4 venues · across top CS/AI venues

Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.

Jump to papers ↓
+9 more ↓ πŸ—ΊοΈ Taxonomy Completionist (40) 🌍 Conference Polyglot Β· Bronze πŸƒ Academic Marathon Β· Sprint πŸŒ‰ Interdisciplinary Bridge Β· Bronze 🐣 Hot Topic Early Bird
🏠 Conference Loyalist (22) πŸ”¬ Deep Specialist (17) 🀝 Dynamic Duo (26) πŸ† Keyword Champion (5) πŸ“ˆ Trend Setter ⚑ Prolific Year Β· Productive πŸ”₯ Unstoppable Β· Silver πŸ—ƒοΈ Keyword Collector (131) πŸ’Ž Century Club Β· Bronze

Papers

A Quasi-Polynomial Time Mean Estimator Under Mean-Shift Contamination with Unknown Covariance COLT 2026 High-Dimensional Gaussian Mean Estimation under Realizable Contamination COLT 2026 Linear Regression under Missing or Corrupted Coordinates COLT 2026 Faster Algorithms for Agnostically Learning Disjunctions and their Implications COLT 2025 Active Learning of General Halfspaces: Label Queries vs Membership Queries NeurIPS 2024 Efficiently Learning One-Hidden-Layer ReLU Networks via SchurPolynomials COLT 2024 Statistical Query Lower Bounds for Learning Truncated Gaussians COLT 2024 Information-Computation Tradeoffs for Learning Margin Halfspaces with Random Classification Noise COLT 2023 SQ Lower Bounds for Learning Mixtures of Separated and Bounded Covariance Gaussians COLT 2023 Statistical and Computational Limits for Tensor-on-Tensor Association Detection COLT 2023 Coresets for Data Discretization and Sine Wave Fitting AISTATS 2022 Optimal SQ Lower Bounds for Robustly Learning Discrete Product Distributions and Ising Models COLT 2022 Realizable Learning is All You Need COLT 2022 Robust Sparse Mean Estimation via Sum of Squares COLT 2022 Streaming Algorithms for High-Dimensional Robust Statistics ICML 2022 Boosting in the Presence of Massart Noise COLT 2021 Outlier-Robust Learning of Ising Models Under Dobrushin’s Condition COLT 2021 The Optimality of Polynomial Regression for Agnostic Learning under Gaussian Marginals in the SQ Model COLT 2021 The Sample Complexity of Robust Covariance Testing COLT 2021 Algorithms and SQ Lower Bounds for PAC Learning One-Hidden-Layer ReLU Networks COLT 2020 Outlier Robust Mean Estimation with Subgaussian Rates via Stability NeurIPS 2020 The Complexity of Adversarially Robust Proper Learning of Halfspaces with Agnostic Noise NeurIPS 2020 Communication and Memory Efficient Testing of Discrete Distributions COLT 2019 Learning Ising Models with Independent Failures COLT 2019 Testing Identity of Multidimensional Histograms COLT 2019 Sharp Bounds for Generalized Uniformity Testing NeurIPS 2018 Being Robust (in High Dimensions) Can Be Practical ICML 2017 Learning Multivariate Log-concave Distributions COLT 2017 Testing Bayesian Networks COLT 2017