5 citations · 7 across the 3 of their papers we have counts for
3 papers
cs.LG2024★ 1 cited
SQ Lower Bounds for Non-Gaussian Component Analysis with Weaker Assumptions
Ilias Diakonikolas, Daniel Kane, Lisheng Ren +1
We study the complexity of Non-Gaussian Component Analysis (NGCA) in the Statistical Query (SQ) model. Prior work developed a general methodology to prove SQ lower bounds for this…
cs.LG2023★ 1 cited
Near-Optimal Cryptographic Hardness of Agnostically Learning Halfspaces and ReLU Regression under Gaussian Marginals
Ilias Diakonikolas, Daniel M. Kane, Lisheng Ren
We study the task of agnostically learning halfspaces under the Gaussian distribution. Specifically, given labeled examples from an unknown distribution on $\mathb…
cs.LG2022★ 5 cited
Cryptographic Hardness of Learning Halfspaces with Massart Noise
Ilias Diakonikolas, Daniel M. Kane, Pasin Manurangsi +1
We study the complexity of PAC learning halfspaces in the presence of Massart noise. In this problem, we are given i.i.d. labeled examples $(\mathbf{x}, y) \in \mathbb{R}^N \times…