Co-occurring keywords · papers mentioning both
Papers
Hardness of Learning Neural Networks under the Manifold Hypothesis
NeurIPS 2024
Computational Complexity of Learning Neural Networks: Smoothness and Degeneracy
NeurIPS 2023
Hardness of Learning Neural Networks with Natural Weights
NeurIPS 2020
Lower Bounds for Testing Graphical Models: Colorings and Antiferromagnetic Ising Models
JMLR 2020
Complexity Theoretic Limitations on Learning DNF’s
COLT 2016
Interactive Fingerprinting Codes and the Hardness of Preventing False Discovery
COLT 2015
Computational Limits for Matrix Completion
COLT 2014