arXiv (All)
open access
Provably Efficient Reinforcement Learning in Continuous-Time Episodic MDPs with Poisson Decision Epochs
Many real-world reinforcement learning (RL) problems evolve in continuous time, where decisions occur at irregular, event-driven intervals rather than at fixed discrete steps. We study episodic continuous-time Markov Decision Processes (MDPs) in which decision epochs are governed by a homogeneous Po
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
- DashVMC: Real-Time Discrete World Model Control in Geometry Dash#1145170
- Learning Commute-Time-Preserving World Models for Planning#1156645
- When to Commit and When to Defer: Maturing Markov Decision Processes under Refining Information and Expiring Opportunities#1117473
- Groupwise Agentic Grading and Advantage Redistribution for Code Agent RL#1116908
- Fit, Form, and Function: A Minimal Structural Condition for Admissible Continuation#730406
Record · ID 1048873
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