v1v2 (latest)

Continuous LWE

19 May 2020

Joan Bruna

Papers citing "Continuous LWE"

33 / 33 papers shown

Title
On Learning Parallel Pancakes with Mostly Uniform Weights Ilias Diakonikolas D. Kane Sushrut Karmalkar Jasper C. H. Lee Thanasis Pittas CoGe 82 0 0 21 Apr 2025
Scaling Open-Vocabulary Action Detection Zhen Hao Sia Yogesh Singh Rawat ObjD VLM 111 0 0 04 Apr 2025
Lattice Based Crypto breaks in a Superposition of Spacetimes Divesh Aggarwal Shashwat Agrawal Rajendra Kumar 63 0 0 27 Mar 2025
CLUE-MARK: Watermarking Diffusion Models using CLWE Kareem Shehata Aashish Kolluri P. Saxena DiffM 121 1 0 18 Nov 2024
Sum-of-squares lower bounds for Non-Gaussian Component Analysis Ilias Diakonikolas Sushrut Karmalkar Shuo Pang Aaron Potechin 52 4 0 28 Oct 2024
On the Hardness of Learning One Hidden Layer Neural Networks Shuchen Li Ilias Zadik Manolis Zampetakis 48 2 0 04 Oct 2024
Scabbard: An Exploratory Study on Hardware Aware Design Choices of Learning with Rounding-based Key Encapsulation Mechanisms Suparna Kundu Quinten Norga A. Karmakar Shreya Gangopadhyay J. M. B. Mera Ingrid Verbauwhede 45 3 0 14 Sep 2024
Cryptographic Hardness of Score Estimation Min Jae Song 60 0 0 04 Apr 2024
SQ Lower Bounds for Non-Gaussian Component Analysis with Weaker Assumptions Ilias Diakonikolas Daniel M. Kane Lisheng Ren Yuxin Sun 92 10 0 07 Mar 2024
Improved Hardness Results for Learning Intersections of Halfspaces Stefan Tiegel 64 3 0 25 Feb 2024
Sparse Linear Regression and Lattice Problems A. Gupte Neekon Vafa Vinod Vaikuntanathan 183 1 0 22 Feb 2024
Computational-Statistical Gaps for Improper Learning in Sparse Linear Regression Rares-Darius Buhai Jingqiu Ding Stefan Tiegel 66 4 0 21 Feb 2024
An Uncertainty Principle for the Curvelet Transform, and the Infeasibility of Quantum Algorithms for Finding Short Lattice Vectors Yi-Kai Liu 28 0 0 05 Oct 2023
Polynomial Bounds for Learning Noisy Optical Physical Unclonable Functions and Connections to Learning With Errors Apollo Albright B. Gelfand Michael Dixon 16 0 0 17 Aug 2023
Learning Mixtures of Gaussians Using the DDPM Objective Kulin Shah Sitan Chen Adam R. Klivans DiffM 100 42 0 03 Jul 2023
SQ Lower Bounds for Learning Bounded Covariance GMMs Ilias Diakonikolas D. Kane Thanasis Pittas Nikos Zarifis 64 0 0 22 Jun 2023
Algorithmic Decorrelation and Planted Clique in Dependent Random Graphs: The Case of Extra Triangles Guy Bresler Chenghao Guo Yury Polyanskiy 64 2 0 17 May 2023
Near-Optimal Cryptographic Hardness of Agnostically Learning Halfspaces and ReLU Regression under Gaussian Marginals Ilias Diakonikolas D. Kane Lisheng Ren 76 29 0 13 Feb 2023
SQ Lower Bounds for Random Sparse Planted Vector Problem Jingqiu Ding Yiding Hua 49 4 0 26 Jan 2023
Understanding Impacts of Task Similarity on Backdoor Attack and Detection Di Tang Rui Zhu Xiaofeng Wang Haixu Tang Yi Chen AAML 105 5 0 12 Oct 2022
Sampling is as easy as learning the score: theory for diffusion models with minimal data assumptions Sitan Chen Sinho Chewi Jungshian Li Yuanzhi Li Adil Salim Anru R. Zhang DiffM 227 278 0 22 Sep 2022
Cryptographic Hardness of Learning Halfspaces with Massart Noise Ilias Diakonikolas D. Kane Pasin Manurangsi Lisheng Ren 93 25 0 28 Jul 2022
Hardness of Agnostically Learning Halfspaces from Worst-Case Lattice Problems Stefan Tiegel 70 17 0 28 Jul 2022
Learning (Very) Simple Generative Models Is Hard Sitan Chen Jungshian Li Yuanzhi Li 76 11 0 31 May 2022
Star-specific Key-homomorphic PRFs from Learning with Linear Regression V. Sehrawat Foo Yee Yeo D. Vassilyev 51 0 0 02 May 2022
Planting Undetectable Backdoors in Machine Learning Models S. Goldwasser Michael P. Kim Vinod Vaikuntanathan Or Zamir AAML 54 73 0 14 Apr 2022
Continuous LWE is as Hard as LWE & Applications to Learning Gaussian Mixtures A. Gupte Neekon Vafa Vinod Vaikuntanathan 103 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
Non-Gaussian Component Analysis via Lattice Basis Reduction Ilias Diakonikolas D. Kane 56 19 0 16 Dec 2021
Lattice-Based Methods Surpass Sum-of-Squares in Clustering Ilias Zadik M. Song Alexander S. Wein Joan Bruna 78 39 0 07 Dec 2021
On the Cryptographic Hardness of Learning Single Periodic Neurons M. Song Ilias Zadik Joan Bruna AAML 62 28 0 20 Jun 2021
The Fine-Grained Hardness of Sparse Linear Regression A. Gupte Vinod Vaikuntanathan 35 13 0 06 Jun 2021
On InstaHide, Phase Retrieval, and Sparse Matrix Factorization Sitan Chen Xiaoxiao Li Zhao Song Danyang Zhuo 68 13 0 23 Nov 2020