paper-with-me

Papers

Strategically Efficient Exploration in Competitive Multi-agent Reinforcement Learning

2021-07-30 · Robert Loftin, Aadirupa Saha, Sam Devlin, Katja Hofmann

High sample complexity remains a barrier to the application of reinforcement learning (RL), particularly in multi-agent systems. A large body of work has demonstrated that exploration mechanisms based on the principle of optimism under uncertainty can significantly improve the sample efficiency of RL in single agent tasks. This work seeks to understand the role of optimistic exploration in non-cooperative multi-agent settings. We will show that, in zero-sum games, optimistic exploration can cause the learner to waste time sampling parts of the state space that are irrelevant to strategic play, as they can only be reached through cooperation between both players. To address this issue, we introduce a formal notion of strategically efficient exploration in Markov games, and use this to develop two strategically efficient learning algorithms for finite Markov games. We demonstrate that these methods can be significantly more sample efficient than their optimistic counterparts.

📄 PDF Abstract BibTeX arXiv:2107.14698

Code (1)

microsoft/strategically_efficient_rl 공식 구현 tf

Tasks

Efficient ExplorationMulti-agent Reinforcement Learningreinforcement-learningReinforcement LearningReinforcement Learning (RL)

Similar Papers 제목 키워드 기반

Reward-Free Attacks in Multi-Agent Reinforcement Learning

2021-12-02 · Ted Fujimoto, Timothy Doster, Adam Attarian, Jill Brandenberger 외

We investigate how effective an attacker can be when it only learns from its victim's actions, without access to the victim's reward. In this work, we are motivated by the scenario where the attacker wants to behave stra…

Multi-agent Reinforcement Learningreinforcement-learningReinforcement LearningReinforcement Learning (RL)

Geometry-Aware Reinforcement Learning for 2D Irregular Nesting

2026-06-09 · Auguste Lehuger, Guillaume Henon-Just arxiv

Traditional heuristic solvers for the 2D irregular nesting problem share a fundamental limitation: they are blind to polygon geometry, relying on guided brute-force to navigate the continuous placement space with minimal…

Reinforcement Learning

Hypothesis Network Planned Exploration for Rapid Meta-Reinforcement Learning Adaptation

2023-11-07 · Maxwell Joseph Jacobson, Yexiang Xue

Meta Reinforcement Learning (Meta RL) trains agents that adapt to fast-changing environments and tasks. Current strategies often lose adaption efficiency due to the passive nature of model exploration, causing delayed un…

Meta Reinforcement Learningreinforcement-learningReinforcement Learning

Curriculum-Based Multi-Tier Semantic Exploration via Deep Reinforcement Learning

2025-09-11 · Abdel Hakim Drid, Vincenzo Suriani, Daniele Nardi, Abderrezzak Debilou arxiv

Navigating and understanding complex and unknown environments autonomously demands more than just basic perception and movement from embodied agents. Truly effective exploration requires agents to possess higher-level co…

Reinforcement Learning

Data-Augmented Game Starts for Accelerating Self-Play Exploration in Imperfect Information Games

2026-05-14 · JB Lanier, Nathan Monette, Pierre Baldi, Roy Fox arxiv

Finding approximate equilibria for large-scale imperfect-information competitive games such as StarCraft, Dota, and CounterStrike remains computationally infeasible due to sparse rewards and challenging exploration over …

Reinforcement Learning