Showing 1–20 of 39 results
/ Date/ Name
Nov 1, 2021Settling the Horizon-Dependence of Sample Complexity in Reinforcement LearningNov 3, 2019Enhanced Convolutional Neural Tangent KernelsJun 13, 2019The Communication Complexity of OptimizationOct 7, 2019Is a Good Representation Sufficient for Sample Efficient Reinforcement Learning?Jun 19, 2020On Reward-Free Reinforcement Learning with Linear Function ApproximationOct 4, 2019Efficient Symmetric Norm Regression via Linear SketchingMay 21, 2020Reinforcement Learning with General Value Function Approximation: Provably Efficient Approach via Bounded Eluder DimensionOct 22, 2020Planning with Submodular Objective FunctionsNov 19, 2018Classical Algorithms from Quantum and Arthur-Merlin Communication ProtocolsMay 1, 2020Is Long Horizon Reinforcement Learning More Difficult Than Short Horizon Reinforcement Learning?Mar 8, 2021Instabilities of Offline RL with Pre-Trained Neural RepresentationJul 17, 2016An Improved Algorithm for Incremental DFS Tree in Undirected GraphsSep 27, 2016Exponential Separations in the Energy Complexity of Leader ElectionOct 22, 2020What are the Statistical Limits of Offline RL with Linear Function Approximation?Jun 4, 2017Nearly Optimal Sampling Algorithms for Combinatorial Pure ExplorationOct 30, 2019Continuous Control with Contexts, ProvablyJan 24, 2019Fine-Grained Analysis of Optimization and Generalization for Overparameterized Two-Layer Neural NetworksMay 14, 2019Dimensionality Reduction for Tukey RegressionMar 23, 2021An Exponential Lower Bound for Linearly-Realizable MDPs with Constant Suboptimality GapJan 13, 2018Tight Bounds for $\ell_p$ Oblivious Subspace Embeddings