arXiv (All)
open access
Optimal Transport Meets Reinforcement Learning: A Survey
Reinforcement learning (RL) algorithms frequently compare probability distributions, such as state visitation distributions induced by policies and experts, action distributions from learned policies and offline datasets, or transition distributions from learned models and environments. However, com
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
- Finetuning with Sampling: SFT Learns Better Than You Think#1161030
- Finetuning with Sampling: SFT Learns Better Than You Think#1157488
- Evaluating covariate balance for long time horizon Markov decision processes#1070879
- Near-Optimal Sample Complexities of Divergence-based S-rectangular Distributionally Robust Reinforcement Learning#177060
- Kolmogorov Regression for Robust Diffusion Policies#282780
Record · ID 1156685
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