Cover Image

Optimistic Policy Optimization is Provably Efficient in Non-stationary MDPs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Zhong, Han, Chen, Zhongren, Yang, Zhuoran, Wang, Zhaoran, Szepesvári, Csaba
Format:	Preprint
Published:	2021
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Provably Efficient Exploration in Policy Optimization
by: Cai, Qi, et al.
Published: (2019)

Confident Natural Policy Gradient for Local Planning in $q_π$-realizable Constrained MDPs
by: Tian, Tian, et al.
Published: (2024)

Optimistic Actor-Critic with Parametric Policies for Linear Markov Decision Processes
by: Lin, Max Qiushi, et al.
Published: (2026)

Reinforcement Learning from Partial Observation: Linear Function Approximation with Provable Sample Efficiency
by: Cai, Qi, et al.
Published: (2022)

Contrastive UCB: Provably Efficient Contrastive Self-Supervised Learning in Online Reinforcement Learning
by: Qiu, Shuang, et al.
Published: (2022)

Sharper Guarantees for Misspecified Kernelized Bandit Optimization
by: Maran, Davide, et al.
Published: (2026)

Pessimism in the Face of Confounders: Provably Efficient Offline Reinforcement Learning in Partially Observable Markov Decision Processes
by: Lu, Miao, et al.
Published: (2022)

Embed to Control Partially Observed Systems: Representation Learning with Provable Sample Efficiency
by: Wang, Lingxiao, et al.
Published: (2022)

Sample-efficient Learning of Infinite-horizon Average-reward MDPs with General Function Approximation
by: He, Jianliang, et al.
Published: (2024)

Trajectory Data Suffices for Statistically Efficient Learning in Offline RL with Linear $q^π$-Realizability and Concentrability
by: Tkachuk, Volodymyr, et al.
Published: (2024)

Provably Efficient Algorithms for S- and Non-Rectangular Robust MDPs with General Parameterization
by: Satheesh, Anirudh, et al.
Published: (2026)

Quantile-Optimal Policy Learning under Unmeasured Confounding
by: Chen, Zhongren, et al.
Published: (2025)

Optimistically Optimistic Exploration for Provably Efficient Infinite-Horizon Reinforcement and Imitation Learning
by: Moulin, Antoine, et al.
Published: (2025)

Double Duality: Variational Primal-Dual Policy Optimization for Constrained Reinforcement Learning
by: Li, Zihao, et al.
Published: (2024)

Rectifying Regression in Reinforcement Learning
by: Ayoub, Alex, et al.
Published: (2025)

Sharp analysis of linear ensemble sampling
by: Akhavan, Arya, et al.
Published: (2026)

Revisiting Weighted Strategy for Non-stationary Parametric Bandits and MDPs
by: Wang, Jing, et al.
Published: (2026)

Policy learning "without" overlap: Pessimism and generalized empirical Bernstein's inequality
by: Jin, Ying, et al.
Published: (2022)

Variational Transport: A Convergent Particle-BasedAlgorithm for Distributional Optimization
by: Yang, Zhuoran, et al.
Published: (2020)

Learning to Reason Efficiently with Discounted Reinforcement Learning
by: Ayoub, Alex, et al.
Published: (2025)

Balancing optimism and pessimism in offline-to-online learning
by: Sentenac, Flore, et al.
Published: (2025)

Ensemble sampling for linear bandits: small ensembles suffice
by: Janz, David, et al.
Published: (2023)

Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs
by: Huang, Ruiquan, et al.
Published: (2026)

Ordering-based Conditions for Global Convergence of Policy Gradient Methods
by: Mei, Jincheng, et al.
Published: (2025)

A Mean-Field Analysis of Neural Stochastic Gradient Descent-Ascent for Functional Minimax Optimization
by: Zhu, Yuchen, et al.
Published: (2024)

Regret Minimization via Saddle Point Optimization
by: Kirschner, Johannes, et al.
Published: (2024)

Provably Efficient RL for Linear MDPs under Instantaneous Safety Constraints in Non-Convex Feature Spaces
by: Roknilamouki, Amirhossein, et al.
Published: (2025)

Exploration via linearly perturbed loss minimisation
by: Janz, David, et al.
Published: (2023)

Optimistic Model Rollouts for Pessimistic Offline Policy Optimization
by: Zhai, Yuanzhao, et al.
Published: (2024)

Provable Statistical Rates for Consistency Diffusion Models
by: Dou, Zehao, et al.
Published: (2024)

The Sample Complexity of Online Strategic Decision Making with Information Asymmetry and Knowledge Transportability
by: Hu, Jiachen, et al.
Published: (2025)

Stochastic Gradient Succeeds for Bandits
by: Mei, Jincheng, et al.
Published: (2024)

Reparameterization Proximal Policy Optimization
by: Zhong, Hai, et al.
Published: (2025)

Reparameterization Flow Policy Optimization
by: Zhong, Hai, et al.
Published: (2026)

Beyond Statistical Learning: Exact Learning Is Essential for General Intelligence
by: György, András, et al.
Published: (2025)

Overcoming Non-stationary Dynamics with Evidential Proximal Policy Optimization
by: Akgül, Abdullah, et al.
Published: (2025)

Optimistic Policy Regularization
by: Pham, Mai, et al.
Published: (2026)

Provably Efficient RL under Episode-Wise Safety in Constrained MDPs with Linear Function Approximation
by: Kitamura, Toshinori, et al.
Published: (2025)

Eluder dimension: localise it!
by: Bakhtiari, Alireza, et al.
Published: (2026)

Learning What to Recommend: Minimax Optimal Simple Regret in Logistic Bandits
by: Liu, Shuai, et al.
Published: (2026)