On the Cryptographic Hardness of Learning Single Periodic Neurons

v1v2 (latest)

On the Cryptographic Hardness of Learning Single Periodic Neurons

20 June 2021

Joan Bruna

ArXiv (abs)PDF HTML

Papers citing "On the Cryptographic Hardness of Learning Single Periodic Neurons"

7 / 7 papers shown

Title
Low-dimensional Functions are Efficiently Learnable under Randomly Biased Distributions Elisabetta Cornacchia Dan Mikulincer Elchanan Mossel 138 1 0 10 Feb 2025
Learning Single-Index Models with Shallow Neural Networks A. Bietti Joan Bruna Clayton Sanford M. Song 225 71 0 27 Oct 2022
Hardness of Agnostically Learning Halfspaces from Worst-Case Lattice Problems Stefan Tiegel 72 17 0 28 Jul 2022
Continuous LWE is as Hard as LWE & Applications to Learning Gaussian Mixtures A. Gupte Neekon Vafa Vinod Vaikuntanathan 108 39 0 06 Apr 2022
Hardness of Noise-Free Learning for Two-Hidden-Layer Neural Networks Sitan Chen Aravind Gollakota Adam R. Klivans Raghu Meka 68 31 0 10 Feb 2022
Lattice-Based Methods Surpass Sum-of-Squares in Clustering Ilias Zadik M. Song Alexander S. Wein Joan Bruna 78 39 0 07 Dec 2021
Inference in High-Dimensional Linear Regression via Lattice Basis Reduction and Integer Relation Detection D. Gamarnik Eren C. Kizildaug Ilias Zadik 61 11 0 24 Oct 2019