Inverse reinforcement learning in contextual MDPs
From MaRDI portal
Publication:2071371
Cites work
- A Linearly Convergent Variant of the Conditional Gradient Algorithm under Strong Convexity, with Applications to Online and Stochastic Optimization
- A Stochastic Approximation Method
- Convex optimization: algorithms and complexity
- scientific article; zbMATH DE number 3790208 (Why is no real title available?)
- scientific article; zbMATH DE number 53598 (Why is no real title available?)
- scientific article; zbMATH DE number 700091 (Why is no real title available?)
- scientific article; zbMATH DE number 7014212 (Why is no real title available?)
- scientific article; zbMATH DE number 3340881 (Why is no real title available?)
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- Near-optimal reinforcement learning in polynomial time
- Random gradient-free minimization of convex functions
Cited in
(8)- Inverse reinforcement learning from summary data
- A survey of inverse reinforcement learning: challenges, methods and progress
- Analysis of Inverse Reinforcement Learning with Perturbed Demonstrations
- ISO Learning Approximates a Solution to the Inverse-Controller Problem in an Unsupervised Behavioral Paradigm
- Infinite Time Horizon Maximum Causal Entropy Inverse Reinforcement Learning
- Model-free inverse reinforcement learning with multi-intention, unlabeled, and overlapping demonstrations
- Inverse reinforcement learning through logic constraint inference
- Correction to: ``Model-free inverse reinforcement learning with multi-intention, unlabeled, and overlapping demonstrations
This page was built for publication: Inverse reinforcement learning in contextual MDPs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2071371)