Co-occurring keywords · papers mentioning both
Papers
Exponential Hardness of Reinforcement Learning with Linear Function Approximation
COLT 2023
Phase transition for detecting a small community in a large network
ICLR 2023
Computational-Statistical Gap in Reinforcement Learning
COLT 2022
Statistical Query Algorithms and Low Degree Tests Are Almost Equivalent
COLT 2021
Computational and Statistical Tradeoffs in Inferring Combinatorial Structures of Ising Model
ICML 2020
Universality of Computational Lower Bounds for Submatrix Detection
COLT 2019
Reducibility and Computational Lower Bounds for Problems with Planted Sparse Structure
COLT 2018
Computational Lower Bounds for Community Detection on Random Graphs
COLT 2015
Label optimal regret bounds for online local learning
COLT 2015
Sum-of-Squares Lower Bounds for Sparse PCA
NeurIPS 2015
Structure learning of antiferromagnetic Ising models
NeurIPS 2014
Information-theoretic lower bounds on the oracle complexity of convex optimization
NeurIPS 2009