Copertina

Policy Mirror Descent with Temporal Difference Learning: Sample Complexity under Online Markov Data

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Li, Wenye, Chen, Hongxu, Liu, Jiacai, Wei, Ke
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Optimization and Control Machine Learning
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

On the Convergence of Policy Mirror Descent with Temporal Difference Evaluation
di: Liu, Jiacai, et al.
Pubblicazione: (2025)

Elementary Analysis of Policy Gradient Methods
di: Liu, Jiacai, et al.
Pubblicazione: (2024)

On the Convergence of Policy in Unregularized Policy Mirror Descent
di: Lin, Dachao, et al.
Pubblicazione: (2022)

On the Convergence of Projected Policy Gradient for Any Constant Step Sizes
di: Liu, Jiacai, et al.
Pubblicazione: (2023)

Convergence of Policy Mirror Descent Beyond Compatible Function Approximation
di: Sherman, Uri, et al.
Pubblicazione: (2025)

Parameter-free Mirror Descent
di: Jacobsen, Andrew, et al.
Pubblicazione: (2022)

Mirror Descent on Riemannian Manifolds
di: Jiang, Jiaxin, et al.
Pubblicazione: (2026)

A Mirror Descent Perspective of Smoothed Sign Descent
di: Wang, Shuyang, et al.
Pubblicazione: (2024)

Value Mirror Descent for Reinforcement Learning
di: Jia, Zhichao, et al.
Pubblicazione: (2026)

Decentralized Non-convex Stochastic Optimization with Heterogeneous Variance
di: Chen, Hongxu, et al.
Pubblicazione: (2026)

Mirror Descent on Reproducing Kernel Banach Spaces
di: Kumar, Akash, et al.
Pubblicazione: (2024)

Mirror and Preconditioned Gradient Descent in Wasserstein Space
di: Bonet, Clément, et al.
Pubblicazione: (2024)

The Sample Complexity of Gradient Descent in Stochastic Convex Optimization
di: Livni, Roi
Pubblicazione: (2024)

Implicit Bias and Convergence of Matrix Stochastic Mirror Descent
di: Akhtiamov, Danil, et al.
Pubblicazione: (2026)

Gauss-Newton Temporal Difference Learning with Nonlinear Function Approximation
di: Ke, Zhifa, et al.
Pubblicazione: (2023)

A Novel Framework for Policy Mirror Descent with General Parameterization and Linear Convergence
di: Alfano, Carlo, et al.
Pubblicazione: (2023)

Mirror Descent-Type Algorithms for the Variational Inequality Problem with Functional Constraints
di: Alkousa, Mohammad S., et al.
Pubblicazione: (2026)

Optimal Sample Complexity for Average Reward Markov Decision Processes
di: Wang, Shengbo, et al.
Pubblicazione: (2023)

Zeroth-Order Stochastic Mirror Descent Algorithms for Minimax Excess Risk Optimization
di: Gu, Zhihao, et al.
Pubblicazione: (2024)

Provable and Practical Online Learning Rate Adaptation with Hypergradient Descent
di: Chu, Ya-Chi, et al.
Pubblicazione: (2025)

The Sample Complexity of Online Reinforcement Learning: A Multi-model Perspective
di: Muehlebach, Michael, et al.
Pubblicazione: (2025)

Mirror Descent-Ascent for mean-field min-max problems
di: Lascu, Razvan-Andrei, et al.
Pubblicazione: (2024)

Achieving Instance-dependent Sample Complexity for Constrained Markov Decision Process
di: Jiang, Jiashuo, et al.
Pubblicazione: (2024)

Federated Temporal Difference Learning with Linear Function Approximation under Environmental Heterogeneity
di: Wang, Han, et al.
Pubblicazione: (2023)

Identification and Adaptive Control of Markov Jump Systems: Sample Complexity and Regret Bounds
di: Sattar, Yahya, et al.
Pubblicazione: (2021)

Learning Provably Improves the Convergence of Gradient Descent
di: Song, Qingyu, et al.
Pubblicazione: (2025)

Soft Robust MDPs and Risk-Sensitive MDPs: Equivalence, Policy Gradient, and Sample Complexity
di: Zhang, Runyu, et al.
Pubblicazione: (2023)

Online Reinforcement Learning in Markov Decision Process Using Linear Programming
di: Leon, Vincent, et al.
Pubblicazione: (2023)

A connection between Tempering and Entropic Mirror Descent
di: Chopin, Nicolas, et al.
Pubblicazione: (2023)

Scaling Laws for Gradient Descent and Sign Descent for Linear Bigram Models under Zipf's Law
di: Kunstner, Frederik, et al.
Pubblicazione: (2025)

Can Temporal-Difference and Q-Learning Learn Representation? A Mean-Field Theory
di: Zhang, Yufeng, et al.
Pubblicazione: (2020)

Global Convergence of Natural Policy Gradient with Hessian-aided Momentum Variance Reduction
di: Feng, Jie, et al.
Pubblicazione: (2024)

Achieving $ε^{-2}$ Sample Complexity for Single-Loop Actor-Critic under Minimal Assumptions
di: Hamza, Ishaq, et al.
Pubblicazione: (2026)

Finite-Time Complexity of Online Primal-Dual Natural Actor-Critic Algorithm for Constrained Markov Decision Processes
di: Zeng, Sihan, et al.
Pubblicazione: (2021)

Sample Complexity of Distributionally Robust Average-Reward Reinforcement Learning
di: Chen, Zijun, et al.
Pubblicazione: (2025)

Implicit Bias of Spectral Descent and Muon on Multiclass Separable Data
di: Fan, Chen, et al.
Pubblicazione: (2025)

Implicit Bias of Mirror Flow on Separable Data
di: Pesme, Scott, et al.
Pubblicazione: (2024)

An Improved Finite-time Analysis of Temporal Difference Learning with Deep Neural Networks
di: Ke, Zhifa, et al.
Pubblicazione: (2024)

Stochastic Gradient Descent with Adaptive Data
di: Che, Ethan, et al.
Pubblicazione: (2024)

Online Markov Decision Processes with Terminal Law Constraints
di: Moreno, Bianca Marin, et al.
Pubblicazione: (2026)