arXiv (All)
open access
Continuous-Time Policy Gradient from Discrete Data: Convergence Analysis and Model-Free Algorithms
Continuous-time reinforcement learning seeks an optimal policy under unknown dynamics driven by stochastic differential equations using observations collected at discrete times. We develop a policy gradient framework that combines rigorous convergence analysis with learning from discrete data. We fi
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Continuous-Time Policy Gradient from Discrete Data: Convergence Analysis and Model-Free Algorithms#1394231
- Policy Gradient Methods for Non-Markovian Reinforcement Learning#175266
- Continuous-Time q-Learning with Nonsmooth Value Functions: a BSDE Approach#1355102
- Critic-Free Policy Iteration for Continuous-Time Zero-Sum Games: A Policy-Space Riccati Approach#999085
- Model-free Reinforcement Learning for Continuous Time and State: A Stochastic Maximum Principle Approach#1143346
Record · ID 1412637
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive