computational hardness

Deviation Dynamics in Cardinal Hedonic Games AAAI 2026 Information-computation gaps in quantum learning via low-degree likelihood COLT 2026 On the Hardness of Learning Regular Expressions ALT 2026 The Monotonicity of the Franz–Parisi Potential Is Equivalent to Low-Degree MMSE Lower Bounds: Extended Abstract COLT 2026 Computational Intractability of Strategizing against Online Learners COLT 2025 An Exercise in Tournament Design: When Some Matches Must Be Scheduled AAAI 2024 Computational-Statistical Gaps for Improper Learning in Sparse Linear Regression COLT 2024 Improved Hardness Results for Learning Intersections of Halfspaces COLT 2024 Adaptive Data Analysis in a Balanced Adversarial Model NeurIPS 2023 Computational Asymmetries in Robust Classification ICML 2023 Hardness of Agnostically Learning Halfspaces from Worst-Case Lattice Problems COLT 2023 Hardness of Learning AES Key (Student Abstract) AAAI 2023 SQ Lower Bounds for Random Sparse Planted Vector Problem ALT 2023 Algorithms and Hardness for Learning Linear Thresholds from Label Proportions NeurIPS 2022 On the well-spread property and its relation to linear regression COLT 2022 The Franz-Parisi Criterion and Computational Trade-offs in High Dimensional Statistics NeurIPS 2022 Adversarially Robust Learning Could Leverage Computational Hardness. ALT 2020 Open Problem: Average-Case Hardness of Hypergraphic Planted Clique Detection COLT 2020 The Complexity of Adversarially Robust Proper Learning of Halfspaces with Agnostic Noise NeurIPS 2020 Approximation and Hardness of Shift-Bribery AAAI 2019 Can Adversarially Robust Learning LeverageComputational Hardness? ALT 2019 Lower bounds for testing graphical models: colorings and antiferromagnetic Ising models COLT 2019 On the Hardness of Probabilistic Inference Relaxations AAAI 2019 Optimal Average-Case Reductions to Sparse PCA: From Weak Assumptions to Strong Hardness COLT 2019 Time/Accuracy Tradeoffs for Learning a ReLU with respect to Gaussian Marginals NeurIPS 2019