arXiv (OAI Expanded)
open access
Finite-Time Convergence of Single-Trajectory Chi-Square Robust Q-Learning With Linear Function Approximation
Distributionally robust reinforcement learning seeks policies that remain effective when the deployment environment differs from the one that generated the training data. We study model-free robust Q-learning with $χ^2$ uncertainty sets and linear function approximation, using data from a single tra
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
- Finite-Time Convergence of Single-Trajectory Chi-Square Robust Q-Learning With Linear Function Approximation#925066
- A Smooth Polynomial Lyapunov Certificate for Convergence of Q-Learning and Its Smooth Variants#987375
- Contraction-Aware Reinforcement Learning for Nonlinear Control with Statistical Robustness#612794
- Contraction-Aware Reinforcement Learning for Nonlinear Control with Statistical Robustness#611317
- Robust Adversarial Reinforcement Learning with Risk Sensitivity and Critic Consistency Regularization#1064211
Record · ID 920832
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