{"list":"other","total":57,"rows":[{"id":"1509.02971","title":"Continuous control with deep reinforcement learning","created":"2015-09-09","cited_by_count":3407},{"id":"1312.5602","title":"Playing Atari with Deep Reinforcement Learning","created":"2013-12-19","cited_by_count":3274},{"id":"1806.07572","title":"Neural Tangent Kernel: Convergence and Generalization in Neural Networks","created":"2018-06-20","cited_by_count":2621},{"id":"1912.06680","title":"Dota 2 with Large Scale Deep Reinforcement Learning","created":"2019-12-13","cited_by_count":1103},{"id":"1811.03962","title":"A Convergence Theory for Deep Learning via Over-Parameterization","created":"2018-11-09","cited_by_count":787},{"id":"1709.06560","title":"Deep Reinforcement Learning that Matters","created":"2017-09-19","cited_by_count":754},{"id":"1811.03804","title":"Gradient Descent Finds Global Minima of Deep Neural Networks","created":"2018-11-09","cited_by_count":574},{"id":"1703.05449","title":"Minimax Regret Bounds for Reinforcement Learning","created":"2017-03-16","cited_by_count":503},{"id":"1807.03765","title":"Is Q-learning Provably Efficient?","created":"2018-07-10","cited_by_count":487},{"id":"1610.03295","title":"Safe, Multi-Agent, Reinforcement Learning for Autonomous Driving","created":"2016-10-11","cited_by_count":311},{"id":"1610.09512","title":"Contextual Decision Processes with Low Bellman Rank are PAC-Learnable","created":"2016-10-29","cited_by_count":292},{"id":"1306.0940","title":"(More) Efficient Reinforcement Learning via Posterior Sampling","created":"2013-06-04","cited_by_count":233},{"id":"1701.01724","title":"DeepStack: Expert-Level Artificial Intelligence in No-Limit Poker","created":"2017-01-06","cited_by_count":233},{"id":"2102.00815","title":"Bellman Eluder Dimension: New Rich Classes of RL Problems, and Sample-Efficient Algorithms","created":"2021-02-01","cited_by_count":223},{"id":"2002.09434","title":"Few-Shot Learning via Learning the Representation, Provably","created":"2020-02-21","cited_by_count":214},{"id":"1905.10389","title":"Reinforcement Learning in Feature Space: Matrix Bandit, Kernels, and Regret Bound","created":"2019-05-24","cited_by_count":201},{"id":"1901.00210","title":"Tighter Problem-Dependent Regret Bounds in Reinforcement Learning without Domain Knowledge using Value Function Bounds","created":"2019-01-01","cited_by_count":195},{"id":"2003.00153","title":"Learning Near Optimal Policies with Low Inherent Bellman Error","created":"2020-02-29","cited_by_count":181},{"id":"2103.10897","title":"Bilinear Classes: A Structural Framework for Provable Generalization in RL","created":"2021-03-19","cited_by_count":178},{"id":"1901.09018","title":"Provably efficient RL with Rich Observations via Latent State Decoding","created":"2019-01-25","cited_by_count":169},{"id":"1909.01150","title":"Neural Policy Gradient Methods: Global Optimality and Rates of Convergence","created":"2019-08-29","cited_by_count":159},{"id":"1904.12191","title":"Linearized two-layers neural networks in high dimension","created":"2019-04-27","cited_by_count":155},{"id":"1811.08888","title":"Stochastic Gradient Descent Optimizes Over-parameterized Deep ReLU Networks","created":"2018-11-21","cited_by_count":141},{"id":"1910.03016","title":"Is a Good Representation Sufficient for Sample Efficient Reinforcement Learning?","created":"2019-10-07","cited_by_count":140},{"id":"1810.05369","title":"Regularization Matters: Generalization and Optimization of Neural Nets v.s. their Induced Kernel","created":"2018-10-12","cited_by_count":131},{"id":"2101.02195","title":"Provably Efficient Reinforcement Learning with Linear Function Approximation Under Adaptivity Constraints","created":"2021-01-06","cited_by_count":124},{"id":"2106.06530","title":"Label Noise SGD Provably Prefers Flat Global Minimizers","created":"2021-06-11","cited_by_count":121},{"id":"1912.04136","title":"Optimism in Reinforcement Learning with Generalized Linear Function Approximation","created":"2019-12-09","cited_by_count":111},{"id":"1904.00687","title":"On the Power and Limitations of Random Features for Understanding Neural Networks","created":"2019-04-01","cited_by_count":103},{"id":"1706.03175","title":"Recovery Guarantees for One-hidden-layer Neural Networks","created":"2017-06-10","cited_by_count":94},{"id":"1803.01088","title":"Practical Contextual Bandits with Regression Oracles","created":"2018-03-03","cited_by_count":93},{"id":"1905.10337","title":"What Can ResNet Learn Efficiently, Going Beyond Kernels?","created":"2019-05-24","cited_by_count":91},{"id":"2006.08680","title":"Shape Matters: Understanding the Implicit Bias of the Noise Covariance","created":"2020-06-15","cited_by_count":88},{"id":"1711.00501","title":"Learning One-hidden-layer Neural Networks with Landscape Design","created":"2017-11-01","cited_by_count":81},{"id":"1910.01619","title":"Beyond Linearization: On Quadratic and Higher-Order Approximation of Wide Neural Networks","created":"2019-10-03","cited_by_count":79},{"id":"1803.00606","title":"On Oracle-Efficient PAC RL with Rich Observations","created":"2018-03-01","cited_by_count":71},{"id":"2007.06738","title":"Implicit Bias in Deep Linear Classification: Initialization Scale vs Training Accuracy","created":"2020-07-13","cited_by_count":71},{"id":"2010.01374","title":"Exponential Lower Bounds for Planning in MDPs With Linearly-Realizable Optimal Action-Value Functions","created":"2020-10-03","cited_by_count":71},{"id":"1906.02870","title":"Worst-Case Regret Bounds for Exploration via Randomized Value Functions","created":"2019-06-07","cited_by_count":57},{"id":"1905.07325","title":"Lexicographic and Depth-Sensitive Margins in Homogeneous and Non-Homogeneous Deep Models","created":"2019-05-17","cited_by_count":53},{"id":"2006.13436","title":"Towards Understanding Hierarchical Learning: Benefits of Neural Representations","created":"2020-06-24","cited_by_count":46},{"id":"2007.01452","title":"Modeling from Features: a Mean-field Framework for Over-parameterized Deep Neural Networks","created":"2020-07-03","cited_by_count":44},{"id":"1906.10306","title":"Neural Proximal/Trust Region Policy Optimization Attains Globally Optimal Policy","created":"2019-06-25","cited_by_count":43},{"id":"1703.01014","title":"Active Learning for Cost-Sensitive Classification","created":"2017-03-03","cited_by_count":41},{"id":"2103.12690","title":"An Exponential Lower Bound for Linearly-Realizable MDPs with Constant Suboptimality Gap","created":"2021-03-23","cited_by_count":40},{"id":"2005.10804","title":"Reinforcement Learning with General Value Function Approximation: Provably Efficient Approach via Bounded Eluder Dimension","created":"2020-05-21","cited_by_count":37},{"id":"2102.04168","title":"Provable Model-based Nonlinear Bandit and Reinforcement Learning: Shelve Optimism, Embrace Virtual Curvature","created":"2021-02-08","cited_by_count":32},{"id":"1806.01492","title":"Near-Optimal Time and Sample Complexities for Solving Discounted Markov Decision Process with a Generative Model","created":"2018-06-05","cited_by_count":22},{"id":"1909.02506","title":"$\\sqrt{n}$-Regret for Learning in Markov Decision Processes with Function Approximation and Low Bellman Rank","created":"2019-09-05","cited_by_count":20},{"id":"1307.4847","title":"Efficient Reinforcement Learning in Deterministic Systems with Value Function Generalization","created":"2013-07-18","cited_by_count":19},{"id":"2002.07125","title":"Agnostic Q-learning with Function Approximation in Deterministic Systems: Tight Bounds on Approximation Error and Sample Complexity","created":"2020-02-17","cited_by_count":19},{"id":"1501.07320","title":"Tensor Factorization via Matrix Factorization","created":"2015-01-29","cited_by_count":15},{"id":"2010.11356","title":"Beyond Lazy Training for Over-parameterized Tensor Decomposition","created":"2020-10-22","cited_by_count":15},{"id":"2107.04518","title":"Optimal Gradient-based Algorithms for Non-concave Bandit Optimization","created":"2021-07-09","cited_by_count":15},{"id":"1907.00485","title":"Robust and Resource Efficient Identification of Two Hidden Layer Neural Networks","created":"2019-06-30","cited_by_count":10},{"id":"1908.10479","title":"Exploration-Enhanced POLITEX","created":"2019-08-27","cited_by_count":8},{"id":"2106.07814","title":"Sample Efficient Reinforcement Learning In Continuous State Spaces: A Perspective Beyond Linearity","created":"2021-06-15","cited_by_count":6}],"next_cursor":null}