Hypernetwork parameter optimization of QMIX based on differential evolution

Q-value Mixing (QMIX) is a widely used algorithm for multi-agent reinforcement learning. However, multi-agent environments are quite complex and have high-dimensional action and state spaces, which leads to lower exploration efficiency and sparse global reward in the early stage of QMIX. To address the issue, we proposed an efficient hypernetwork parameters optimization method of QMIX based on differential evolution (DE-QMIX). DE-QMIX encodes the hypernetwork parameters of QMIX as population individuals, and obtains the best hypernetwork parameters by performing mutation, crossover, and selection operations on these individuals. The hypernetworks adjust parameters through the gradient descent method and feed the updated parameter information back to the current population to improve the overall efficiency of DE-QMIX. By optimizing the hypernetwork parameters, the joint action-value function <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"> <mml:mrow> <mml:msub> <mml:mi>Q</mml:mi> <mml:mrow> <mml:mi>t</mml:mi> <mml:mi>o</mml:mi> <mml:mi>t</mml:mi> <mml:mi>a</mml:mi> <mml:mi>l</mml:mi> </mml:mrow> </mml:msub> </mml:mrow> </mml:math> fitted from the mixing network can more accurately reflect the decision quality of the entire multi-agent system, which can guide the individual agent to reduce invalid or inefficient action selection during exploration and speed up the learning process of agents. The improvement of the <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"> <mml:mrow> <mml:msub> <mml:mi>Q</mml:mi> <mml:mrow> <mml:mi>t</mml:mi> <mml:mi>o</mml:mi> <mml:mi>t</mml:mi> <mml:mi>a</mml:mi> <mml:mi>l</mml:mi> </mml:mrow> </mml:msub> </mml:mrow> </mml:math> will guide the agent to choose better actions and improve the global reward. Our experiments on the StarCraft Multi-Agent Challenge (SMAC) platform have demonstrated that DE-QMIX achieves a higher average winning rate and global reward than QMIX and other existing approaches such as Multi-Agent Variational Exploration (MAVEN), Value-Decomposition Networks (VDN), and Joint Q-Function Transformation (QTRAN).

Authors

Institutions

Publication Details

Journal
Intelligent Data Analysis
Published
2025-12-11
DOI
https://doi.org/10.1177/1088467x251399305
Primary Topic
Reinforcement Learning in Robotics
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Hypernetwork parameter optimization of QMIX based on differential evolution

Zijian Cao, Feng Tian, Chuan Heng Foh, Zhihao Zhang et al.
Intelligent Data Analysis
Reinforcement Learning in Robotics
article

Hypernetwork parameter optimization of QMIX based on differential evolution

Zijian Cao, Feng Tian, Chuan Heng Foh, Zhihao Zhang, Li Xiao, Chuhang Qiao, Baolong Su
article en

Abstract

Q-value Mixing (QMIX) is a widely used algorithm for multi-agent reinforcement learning. However, multi-agent environments are quite complex and have high-dimensional action and state spaces, which leads to lower exploration efficiency and sparse global reward in the early stage of QMIX. To address the issue, we proposed an efficient hypernetwork parameters optimization method of QMIX based on differential evolution (DE-QMIX). DE-QMIX encodes the hypernetwork parameters of QMIX as population individuals, and obtains the best hypernetwork parameters by performing mutation, crossover, and selection operations on these individuals. The hypernetworks adjust parameters through the gradient descent method and feed the updated parameter information back to the current population to improve the overall efficiency of DE-QMIX. By optimizing the hypernetwork parameters, the joint action-value function <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"> <mml:mrow> <mml:msub> <mml:mi>Q</mml:mi> <mml:mrow> <mml:mi>t</mml:mi> <mml:mi>o</mml:mi> <mml:mi>t</mml:mi> <mml:mi>a</mml:mi> <mml:mi>l</mml:mi> </mml:mrow> </mml:msub> </mml:mrow> </mml:math> fitted from the mixing network can more accurately reflect the decision quality of the entire multi-agent system, which can guide the individual agent to reduce invalid or inefficient action selection during exploration and speed up the learning process of agents. The improvement of the <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"> <mml:mrow> <mml:msub> <mml:mi>Q</mml:mi> <mml:mrow> <mml:mi>t</mml:mi> <mml:mi>o</mml:mi> <mml:mi>t</mml:mi> <mml:mi>a</mml:mi> <mml:mi>l</mml:mi> </mml:mrow> </mml:msub> </mml:mrow> </mml:math> will guide the agent to choose better actions and improve the global reward. Our experiments on the StarCraft Multi-Agent Challenge (SMAC) platform have demonstrated that DE-QMIX achieves a higher average winning rate and global reward than QMIX and other existing approaches such as Multi-Agent Variational Exploration (MAVEN), Value-Decomposition Networks (VDN), and Joint Q-Function Transformation (QTRAN).

Intelligent Data Analysis
University of Surrey (GB), Xi'an Technological University (CN), Duke Kunshan University (CN)
Openalex Percentile: Top 79%
Reinforcement Learning in Robotics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.