Signals 4 · free daily AI digest

NashDreamer: Model-Based Reinforcement Learning for Zero-Sum Imperfect-Information Games

Paper recorded by Signals 4 on 2026-09-01 in cs.LG. Abstract reproduced from arXiv; link to the original below.

Published 2026-09-01 on arXiv · recorded by Signals 4 on 2026-09-02

Category: cs.LG · 机器学习 · first seen 2026-09-02

Abstract

Model-based reinforcement learning (MBRL) has achieved remarkable results in single-agent domains, yet its extension to competitive imperfect information games (IIGs) remains underexplored. In multi-agent settings, opponent-induced non-stationarity complicates the learning process, and decentralized model learning faces severe identifiability barriers, which we argue make centralized model learnin

Read on arXiv →

#158 most recent of 215 cs.LG papers we have recorded · ↑ newer: Gradient-Update Mismatch: Rethinking Conflict-Free Training of Physics · ↓ older: Variable Selection for Feature-Based Newsvendor
Cite this page: NashDreamer: Model-Based Reinforcement Learning for Zero-Sum Imperfect-Information Games: the #158 most recent of 215 cs.LG papers we have recorded (as of 2026-09-01). Source: Signals 4 (Signals API) — https://data.jiangzhang.ca/signals4/t/papers/nashdreamer-model-based-reinforcement-learning-for-zero-sum-imperfect-informatio.html
Free to quote with attribution to “Signals 4 (Signals API)”. Machine-readable: papers.json
Related: More cs.LG papers · arXiv signals · All papers · Today in AI
Get 4 AI signals a day by email — free.
Subscribe free → See all plans →
Get 4 AI signals a day by email — free
All models · All repos · By company · Daily editions