paper-with-me

홈 › Papers

Energy-based Surprise Minimization for Multi-Agent Value Factorization

2020-09-16 · Karush Suri, Xiao Qi Shi, Konstantinos Plataniotis, Yuri Lawryshyn

Multi-Agent Reinforcement Learning (MARL) has demonstrated significant success in training decentralised policies in a centralised manner by making use of value factorization methods. However, addressing surprise across spurious states and approximation bias remain open problems for multi-agent settings. Towards this goal, we introduce the Energy-based MIXer (EMIX), an algorithm which minimizes surprise utilizing the energy across agents. Our contributions are threefold; (1) EMIX introduces a novel surprise minimization technique across multiple agents in the case of multi-agent partially-observable settings. (2) EMIX highlights a practical use of energy functions in MARL with theoretical guarantees and experiment validations of the energy operator. Lastly, (3) EMIX extends Maxmin Q-learning for addressing overestimation bias across agents in MARL. In a study of challenging StarCraft II micromanagement scenarios, EMIX demonstrates consistent stable performance for multiagent surprise minimization. Moreover, our ablation study highlights the necessity of the energy-based scheme and the need for elimination of overestimation bias in MARL. Our implementation of EMIX can be found at karush17.github.io/emix-web/.

📄 PDF Abstract BibTeX arXiv:2009.09842

Code (1)

karush17/emix pytorch

Tasks

Multi-agent Reinforcement LearningQ-LearningStarcraftStarcraft II

Methods 이 논문이 사용한 방법론

Q-Learning Q-Learning is an off-policy temporal difference control algorithm: $$Q\left(S\_{t}, A\_{t}\right) \leftarrow Q\left(S\_{t}, A\_{t}\right) + \alpha\left[R_{t+1} +…

Similar Papers 제목 키워드 기반

Surprise Minimizing Multi-Agent Learning with Energy-based Models

2021-09-29 · Karush Suri

Multi-Agent Reinforcement Learning (MARL) has demonstrated significant success by virtue of collaboration across agents. Recent work, on the other hand, introduces surprise which quantifies the degree of change in an age…

Multi-agent Reinforcement Learning

Graph Distance as Surprise: Free Energy Minimization in Knowledge Graph Reasoning

2025-12-01 · Gaganpreet Jhajj, Fuhua Lin arxiv

In this work, we propose that reasoning in knowledge graph (KG) networks can be guided by surprise minimization. Entities that are close in graph distance will have lower surprise than those farther apart. This connects …

Reinforcement Learning

Adapting Surprise Minimizing Reinforcement Learning Techniques for Transactive Control

2021-11-11 · William Arnold, Tarang Srivastava, Lucas Spangher, Utkarsha Agwan 외

Optimizing prices for energy demand response requires a flexible controller with ability to navigate complex environments. We propose a reinforcement learning controller with surprise minimizing modifications in its arch…

Navigatereinforcement-learningReinforcement LearningReinforcement Learning (RL)

Surprise Minimization Revision Operators

2021-11-21 · Adrian Haret

Prominent approaches to belief revision prescribe the adoption of a new belief that is as close as possible to the prior belief, in a process that, even in the standard case, can be described as attempting to minimize su…

TradeR: Practical Deep Hierarchical Reinforcement Learning for Trade Execution

2021-02-16 · Karush Suri, Xiao Qi Shi, Konstantinos Plataniotis, Yuri Lawryshyn

Advances in Reinforcement Learning (RL) span a wide variety of applications which motivate development in this area. While application tasks serve as suitable benchmarks for real world problems, RL is seldomly used in pr…

Hierarchical Reinforcement Learningreinforcement-learningReinforcement LearningReinforcement Learning (RL)