{"list":"other","total":69,"rows":[{"id":"1703.03400","title":"Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networks","created":"2017-03-09","cited_by_count":4897},{"id":"1705.10528","title":"Constrained Policy Optimization","created":"2017-05-30","cited_by_count":983},{"id":"2004.05439","title":"Meta-Learning in Neural Networks: A Survey","created":"2020-04-11","cited_by_count":950},{"id":"1909.05207","title":"Introduction to Online Convex Optimization","created":"2019-09-07","cited_by_count":803},{"id":"1901.08584","title":"Fine-Grained Analysis of Optimization and Generalization for Overparameterized Two-Layer Neural Networks","created":"2019-01-24","cited_by_count":566},{"id":"1611.02779","title":"RL$^2$: Fast Reinforcement Learning via Slow Reinforcement Learning","created":"2016-11-09","cited_by_count":503},{"id":"1707.09835","title":"Meta-SGD: Learning to Learn Quickly for Few-Shot Learning","created":"2017-07-31","cited_by_count":379},{"id":"1512.01629","title":"Risk-Constrained Reinforcement Learning with Percentile Risk Criteria","created":"2015-12-05","cited_by_count":337},{"id":"1805.07708","title":"A Lyapunov-based Approach to Safe Reinforcement Learning","created":"2018-05-20","cited_by_count":297},{"id":"1901.11275","title":"A Theory of Regularized Markov Decision Processes","created":"2019-01-31","cited_by_count":286},{"id":"1807.01281","title":"Human-level performance in first-person multiplayer games with population-based deep reinforcement learning","created":"2018-07-03","cited_by_count":264},{"id":"2005.06392","title":"On the Global Convergence Rates of Softmax Policy Gradient Methods","created":"2020-05-13","cited_by_count":264},{"id":"1808.01204","title":"Learning Overparameterized Neural Networks via Stochastic Gradient Descent on Structured Data","created":"2018-08-03","cited_by_count":261},{"id":"1906.04733","title":"DualDICE: Behavior-Agnostic Estimation of Discounted Stationary Distribution Corrections","created":"2019-06-10","cited_by_count":254},{"id":"1903.08738","title":"Batch Policy Learning under Constraints","created":"2019-03-20","cited_by_count":244},{"id":"1806.02450","title":"A Finite Time Analysis of Temporal Difference Learning With Linear Function Approximation","created":"2018-06-06","cited_by_count":229},{"id":"1810.12429","title":"Breaking the Curse of Horizon: Infinite-Horizon Off-Policy Estimation","created":"2018-10-29","cited_by_count":227},{"id":"2002.09434","title":"Few-Shot Learning via Learning the Representation, Provably","created":"2020-02-21","cited_by_count":214},{"id":"1505.06279","title":"The Benefit of Multitask Representation Learning","created":"2015-05-23","cited_by_count":195},{"id":"2006.11650","title":"On the Theory of Transfer Learning: The Importance of Task Diversity","created":"2020-06-20","cited_by_count":186},{"id":"1906.02717","title":"Adaptive Gradient-Based Meta-Learning Methods","created":"2019-06-06","cited_by_count":183},{"id":"1307.5449","title":"Non-stationary Stochastic Optimization","created":"2013-07-20","cited_by_count":175},{"id":"2102.06177","title":"Multi-Task Reinforcement Learning with Context-based Representations","created":"2021-02-11","cited_by_count":174},{"id":"2003.02189","title":"Exploration-Exploitation in Constrained MDPs","created":"2020-03-04","cited_by_count":149},{"id":"1805.12076","title":"Towards Understanding the Role of Over-Parametrization in Generalization of Neural Networks","created":"2018-05-30","cited_by_count":142},{"id":"1811.08888","title":"Stochastic Gradient Descent Optimizes Over-parameterized Deep ReLU Networks","created":"2018-11-21","cited_by_count":141},{"id":"1902.08438","title":"Online Meta-Learning","created":"2019-02-22","cited_by_count":137},{"id":"2003.00534","title":"Provably Efficient Safe Exploration via Primal-Dual Policy Optimization","created":"2020-03-01","cited_by_count":134},{"id":"2011.05869","title":"CRPO: A New Approach for Safe Reinforcement Learning with Convergence Guarantee","created":"2020-11-11","cited_by_count":134},{"id":"1804.07795","title":"Stochastic subgradient method converges on tame functions","created":"2018-04-20","cited_by_count":124},{"id":"2106.10783","title":"OptiDICE: Offline Policy Optimization via Stationary Distribution Correction Estimation","created":"2021-06-21","cited_by_count":121},{"id":"2002.09516","title":"Minimax-Optimal Off-Policy Evaluation with Linear Function Approximation","created":"2020-02-21","cited_by_count":120},{"id":"1501.06225","title":"Online Optimization : Competing with Dynamic Comparators","created":"2015-01-26","cited_by_count":99},{"id":"2008.06043","title":"Offline Meta-Reinforcement Learning with Advantage Weighting","created":"2020-08-13","cited_by_count":93},{"id":"1810.06784","title":"ProMP: Proximal Meta-Policy Search","created":"2018-10-16","cited_by_count":91},{"id":"2007.03479","title":"Dynamic Regret of Convex and Smooth Functions","created":"2020-07-07","cited_by_count":90},{"id":"2106.02684","title":"Learning Policies with Zero or Bounded Constraint Violation for Constrained MDPs","created":"2021-06-04","cited_by_count":80},{"id":"2110.03239","title":"Understanding Domain Randomization for Sim-to-real Transfer","created":"2021-10-07","cited_by_count":80},{"id":"1911.09101","title":"Safe Policies for Reinforcement Learning via Primal-Dual Methods","created":"2019-11-20","cited_by_count":79},{"id":"2102.04939","title":"RL for Latent MDPs: Regret Guarantees and a Lower Bound","created":"2021-02-09","cited_by_count":70},{"id":"1902.10644","title":"Provable Guarantees for Gradient-Based Meta-Learning","created":"2019-02-27","cited_by_count":67},{"id":"1605.04638","title":"Tracking Slowly Moving Clairvoyant: Optimal Dynamic Regret of Online Learning with True and Noisy Gradient","created":"2016-05-16","cited_by_count":66},{"id":"1909.03739","title":"Off-Policy Evaluation in Partially Observable Environments","created":"2019-09-09","cited_by_count":66},{"id":"1602.06661","title":"Error bounds, quadratic growth, and linear convergence of proximal methods","created":"2016-02-22","cited_by_count":60},{"id":"1910.01215","title":"ES-MAML: Simple Hessian-Free Meta Learning","created":"2019-09-25","cited_by_count":57},{"id":"1910.12156","title":"Convergent Policy Optimization for Safe Reinforcement Learning","created":"2019-10-26","cited_by_count":57},{"id":"1702.07121","title":"Consistent On-Line Off-Policy Evaluation","created":"2017-02-23","cited_by_count":51},{"id":"2109.06332","title":"Achieving Zero Constraint Violation for Constrained Reinforcement Learning via Primal-Dual Approach","created":"2021-09-13","cited_by_count":50},{"id":"1903.10399","title":"Learning-to-Learn Stochastic Gradient Descent with Biased Regularization","created":"2019-03-25","cited_by_count":49},{"id":"1901.09455","title":"Off-Policy Deep Reinforcement Learning by Bootstrapping the Covariate Shift","created":"2019-01-27","cited_by_count":47},{"id":"1608.03933","title":"Improved Dynamic Regret for Non-degenerate Functions","created":"2016-08-13","cited_by_count":46},{"id":"2101.10895","title":"A Primal-Dual Approach to Constrained Markov Decision Processes","created":"2021-01-26","cited_by_count":42},{"id":"2102.11050","title":"Online Learning via Offline Greedy Algorithms: Applications in Market Design and Optimization","created":"2021-02-18","cited_by_count":40},{"id":"2110.08923","title":"A Dual Approach to Constrained Markov Decision Processes with Entropy Regularization","created":"2021-10-17","cited_by_count":34},{"id":"1904.05526","title":"A Selective Overview of Deep Learning","created":"2019-04-10","cited_by_count":31},{"id":"2010.01062","title":"Exploration in Approximate Hyper-State Space for Meta Reinforcement Learning","created":"2020-10-02","cited_by_count":28},{"id":"2110.10117","title":"Beyond Exact Gradients: Convergence of Stochastic Soft-Max Policy Gradient Methods with Entropy Regularization","created":"2021-10-19","cited_by_count":25},{"id":"1411.1490","title":"Efficient Representations for Life-Long Learning and Autoencoding","created":"2014-11-06","cited_by_count":23},{"id":"1806.00202","title":"Online Learning with Inexact Proximal Online Gradient Descent Algorithms","created":"2018-06-01","cited_by_count":22},{"id":"2106.00099","title":"Multi-Objective SPIBB: Seldonian Offline Policy Improvement with Safety Constraints in Finite MDPs","created":"2021-05-31","cited_by_count":22},{"id":"1610.08628","title":"Regret Bounds for Lifelong Learning","created":"2016-10-27","cited_by_count":19},{"id":"2002.05135","title":"On the Convergence Theory of Debiased Model-Agnostic Meta-Reinforcement Learning","created":"2020-02-12","cited_by_count":19},{"id":"2108.09435","title":"Fairness-Aware Online Meta-learning","created":"2021-08-21","cited_by_count":19},{"id":"2205.15827","title":"Robust Anytime Learning of Markov Decision Processes","created":"2022-05-31","cited_by_count":16},{"id":"2108.08770","title":"Learning-to-learn non-convex piecewise-Lipschitz functions","created":"2021-08-19","cited_by_count":15},{"id":"1810.09346","title":"Adversarial Online Learning with noise","created":"2018-10-22","cited_by_count":7},{"id":"1710.05133","title":"Tracking Moving Agents via Inexact Online Gradient Descent Algorithm","created":"2017-10-14","cited_by_count":6},{"id":"1704.00196","title":"Faster Subgradient Methods for Functions with H\\\"olderian Growth","created":"2017-04-01","cited_by_count":5},{"id":"1805.04514","title":"Metatrace Actor-Critic: Online Step-size Tuning by Meta-gradient Descent for Reinforcement Learning Control","created":"2018-05-10","cited_by_count":5}],"next_cursor":null}