Saved in:
Bibliographic Details
Main Authors: Duan, Wenchang, Yu, Yaoliang, He, Jiwan, Shi, Yi
Format: Preprint
Published: 2025
Subjects:
Online Access:https://arxiv.org/abs/2510.26389
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866918362735443968
author Duan, Wenchang
Yu, Yaoliang
He, Jiwan
Shi, Yi
author_facet Duan, Wenchang
Yu, Yaoliang
He, Jiwan
Shi, Yi
contents Recently, deep multi-agent reinforcement learning (MARL) has demonstrated promising performance for solving challenging tasks, such as long-term dependencies and non-Markovian environments. Its success is partly attributed to conditioning policies on large fixed context length. However, such large fixed context lengths may lead to limited exploration efficiency and redundant information. In this paper, we propose a novel MARL framework to obtain adaptive and effective contextual information. Specifically, we design a central agent that dynamically optimizes context length via temporal gradient analysis, enhancing exploration to facilitate convergence to global optima in MARL. Furthermore, to enhance the adaptive optimization capability of the context length, we present an efficient input representation for the central agent, which effectively filters redundant information. By leveraging a Fourier-based low-frequency truncation method, we extract global temporal trends across decentralized agents, providing an effective and efficient representation of the MARL environment. Extensive experiments demonstrate that the proposed method achieves state-of-the-art (SOTA) performance on long-term dependency tasks, including PettingZoo, MiniGrid, Google Research Football (GRF), and StarCraft Multi-Agent Challenge v2 (SMACv2).
format Preprint
id arxiv_https___arxiv_org_abs_2510_26389
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Adaptive Context Length Optimization with Low-Frequency Truncation for Multi-Agent Reinforcement Learning
Duan, Wenchang
Yu, Yaoliang
He, Jiwan
Shi, Yi
Machine Learning
Multiagent Systems
Recently, deep multi-agent reinforcement learning (MARL) has demonstrated promising performance for solving challenging tasks, such as long-term dependencies and non-Markovian environments. Its success is partly attributed to conditioning policies on large fixed context length. However, such large fixed context lengths may lead to limited exploration efficiency and redundant information. In this paper, we propose a novel MARL framework to obtain adaptive and effective contextual information. Specifically, we design a central agent that dynamically optimizes context length via temporal gradient analysis, enhancing exploration to facilitate convergence to global optima in MARL. Furthermore, to enhance the adaptive optimization capability of the context length, we present an efficient input representation for the central agent, which effectively filters redundant information. By leveraging a Fourier-based low-frequency truncation method, we extract global temporal trends across decentralized agents, providing an effective and efficient representation of the MARL environment. Extensive experiments demonstrate that the proposed method achieves state-of-the-art (SOTA) performance on long-term dependency tasks, including PettingZoo, MiniGrid, Google Research Football (GRF), and StarCraft Multi-Agent Challenge v2 (SMACv2).
title Adaptive Context Length Optimization with Low-Frequency Truncation for Multi-Agent Reinforcement Learning
topic Machine Learning
Multiagent Systems
url https://arxiv.org/abs/2510.26389