( en | de | ru )

 

Disambiguation of "Kane, Daniel"

Author of the publication

copydeleteadd this publication to your clipboard
Near-Optimal Cryptographic Hardness of Agnostically Learning Halfspaces and ReLU Regression under Gaussian Marginals.

, , and . ICML, volume 202 of Proceedings of Machine Learning Research, page 7922-7938. PMLR, (2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Ladji Kane

Gavin Kane

Mamadou Kane

Gerald Kane

Andrew Kane

 

Other publications of authors with the same name

Statistical Query Lower Bounds for List-Decodable Linear Regression., , , , and . NeurIPS, page 3191-3204. (2021)Forster Decomposition and Learning Halfspaces with Noise., , and . NeurIPS, page 7732-7744. (2021)SQ Lower Bounds for Learning Single Neurons with Massart Noise., , , and . NeurIPS, (2022)List-Decodable Sparse Mean Estimation via Difference-of-Pairs Filtering., , , , and . NeurIPS, (2022)SQ Lower Bounds for Non-Gaussian Component Analysis with Weaker Assumptions., , , and . CoRR, (2024)Almost Optimal Explicit Johnson-Lindenstrauss Transformations., , and . Electron. Colloquium Comput. Complex., (2010)vqSGD: Vector Quantized Stochastic Gradient Descent., , , and . AISTATS, volume 130 of Proceedings of Machine Learning Research, page 2197-2205. PMLR, (2021)Big-Key Symmetric Encryption: Resisting Key Exfiltration., , and . CRYPTO (1), volume 9814 of Lecture Notes in Computer Science, page 373-402. Springer, (2016)The Independence Number of the Birkhoff Polytope Graph, and Applications to Maximally Recoverable Codes., , and . SIAM J. Comput., 48 (4): 1425-1435 (2019)Sampling Equilibria: Fast No-Regret Learning in Structured Games., , , , and . SODA, page 3817-3855. SIAM, (2023)