arXiv (All)
open access
A Geometric Perspective on Reward Function Updates in Inverse Reinforcement Learning
Inverse Reinforcement Learning (IRL) is classically solved using Lagrangian optimisation, by jointly optimising a primal-dual problem with gradient descent to obtain the optimal reward function parameters and corresponding optimal policy. While this algorithmic view of IRL has been highly influentia
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
- Efficient Hypergradient Descent for Inverse Reinforcement Learning#444626
- Malliavin Calculus for Counterfactual Gradient Estimation in Adaptive Inverse Reinforcement Learning#1048318
- Disagreement-Regularized Imitation Learning for Image-Based Continuous Control with Gaussian and Beta Policies#1143008
- Convex-Concave Reinforcement Learning#1233147
- Learning in Inverse Games: Tractable Training with Probabilistic Guarantees#1188159
Record · ID 1324642
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