Research map / Multi-agent systems and games / Cooperative multi-agent RL
Determinantal Reinforcement Learning
Takayuki Osogami, Rudy Raymond
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Replace free-energy RBM function approximator with log-determinant approximator | SARSA · Blocker task | learning speed to reach reward -0.7: approximately 10 times faster | Improved |
| Use determinant kernel with history-dependent time-series model instead of baselines | SARSA · Stochastic policy tasks 1-3 | average reward per step | Improved |
| Determinantal SARSA initial-condition sensitivity on blocker task | Determinantal SARSA · Blocker task | average reward: below -0.9 in one of 20 runs | Hurt |
Closest papers by meaning
- Optimistic Value Instructors for Cooperative Multi-Agent Reinforcement Learning (AAAI 2024 · similarity 0.86)
- Learning Joint Behaviors with Large Variations (AAAI 2025 · similarity 0.86)
- Controlling Behavioral Diversity in Multi-Agent Reinforcement Learning (ICML 2024 · similarity 0.86)
- Inverse Factorized Soft Q-Learning for Cooperative Multi-agent Imitation Learning (NeurIPS 2024 · similarity 0.86)
- Provable Partially Observable Reinforcement Learning with Privileged Information (NeurIPS 2024 · similarity 0.85)
- The Horizon Threshold in Cooperative Multi-Agent Reward-Free Exploration (NeurIPS 2026 · similarity 0.85)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
