analiza aiqbench
ICMAPE addresses a critical gap in multi-agent systems by enabling decentralized pure exploration through Bayesian learning and inference-driven rewards, moving beyond traditional single-agent active testing frameworks. By converting confidence-based objectives into standard reinforcement learning signals, the method effectively reduces exploration steps while maintaining target accuracy on both synthetic benchmarks and real-world environmental monitoring tasks. This advancement strengthens the theoretical foundation for scalable, information-efficient multi-agent intelligence in complex, unknown environments.
ICMAPE: In-Context Multiagent Pure Exploration
arXiv:2609.33986v1 Announce Type: new Abstract: In some multi-agent systems, the quantity to be optimized is not an externally specified reward but the information acquired about unknown properties of the environment as done in active sequential hypothesis testing (ASHT) problems. However, the ASHT literature tends to focus on finite single-agent problems with well-specified models, while there is currently a gap for practical multi-agent methods that can perform active sequential testing. We fill this gap with ICMAPE, a Bayesian learning-based framework for decentralized multi-agent pure-exploration driven by inference objectives. ICMAPE converts the fixed-confidence identification objective into a reward derived from inference confidence, so that standard reinforcement learning machinery can be applied to decentralized pure exploration. It jointly learns a centralized neural inference network that estimates a posterior distribution over hypotheses from global trajectory data, and decentralized policies that select actions from local observation histories and learn when to stop collecting data once the target confidence is reached. On two synthetic benchmarks and a Maryland nitrate concentration monitoring task based on real-world data, ICMAPE-TD3 achieves target accuracy with fewer exploration steps.
Abstract:In some multi-agent systems, the quantity to be optimized is not an externally specified reward but the information acquired about unknown properties of the environment as done in active sequential hypothesis testing (ASHT) problems. However, the ASHT literature tends to focus on finite single-agent problems with well-specified models, while there is currently a gap for practical multi-agent methods that can perform active sequential testing. We fill this gap with ICMAPE, a Bayesian learning-based framework for decentralized multi-agent pure-exploration driven by inference objectives. ICMAPE converts the fixed-confidence identification objective into a reward derived from inference confidence, so that standard reinforcement learning machinery can be applied to decentralized pure exploration. It jointly learns a centralized neural inference network that estimates a posterior distribution over hypotheses from global trajectory data, and decentralized policies that select actions from local observation histories and learn when to stop collecting data once the target confidence is reached. On two synthetic benchmarks and a Maryland nitrate concentration monitoring task based on real-world data, ICMAPE-TD3 achieves target accuracy with fewer exploration steps.
Machine Learning (cs.LG)
arXiv:2609.33986 [cs.LG]
(or arXiv:2609.33986v1 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2609.33986 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 267 cuvinte
Subiecte conexe
Algorithm for Contextual Queueing Bandits with Rate-Optimal Queue Length Regret
arXiv · 9 iun. 2026

Deconfusing Corrigibility
AI Alignment Forum · 17 oct. 2026

Adaptive Parallel Reasoning: The Next Paradigm in Efficient Inference Scaling
BAIR Blog · 8 mai 2026

The Alignment Problem: Computer Science Meets Analytic Philosophy
LessWrong · 18 oct. 2026