arXiv (All)
open access
Convex-Concave Reinforcement Learning
Policy learning drives many of the most consequential and heavily-invested applications of reinforcement learning today. Yet the core optimization problem it rests on (maximizing expected return) is notoriously non-convex, even under a direct policy parameterization, and the field has largely respon
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
- A Geometric Perspective on Reward Function Updates in Inverse Reinforcement Learning#1324642
- Efficient Hypergradient Descent for Inverse Reinforcement Learning#444626
- Evolving Support Priorities in Empathetic Reinforcement Learning#1119322
- Passivity-Centric Safe Reinforcement Learning for Contact-Rich Robotic Tasks#821687
- Malliavin Calculus for Counterfactual Gradient Estimation in Adaptive Inverse Reinforcement Learning#1048318
Record · ID 1233147
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