Salvato in:
Dettagli Bibliografici
Autori principali: Xia, Boyang, Tian, Weiyou, Ren, Qingnan, Huang, Jiaqi, Xiao, Jie, Lu, Shuo, Wang, Kai, Ai, Lynn, Yang, Eric, Shi, Bill
Natura: Preprint
Pubblicazione: 2026
Soggetti:
Accesso online:https://arxiv.org/abs/2602.08041
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866914314482352128
author Xia, Boyang
Tian, Weiyou
Ren, Qingnan
Huang, Jiaqi
Xiao, Jie
Lu, Shuo
Wang, Kai
Ai, Lynn
Yang, Eric
Shi, Bill
author_facet Xia, Boyang
Tian, Weiyou
Ren, Qingnan
Huang, Jiaqi
Xiao, Jie
Lu, Shuo
Wang, Kai
Ai, Lynn
Yang, Eric
Shi, Bill
contents Training large language model (LLM) agents for adversarial games is often driven by episodic objectives such as win rate. In long-horizon settings, however, payoffs are shaped by latent strategic externalities that evolve over time, so myopic optimization and variation-based regret analyses can become vacuous even when the dynamics are predictable. To solve this problem, we introduce Implicit Strategic Optimization (ISO), a prediction-aware framework in which each agent forecasts the current strategic context and uses it to update its policy online. ISO combines a Strategic Reward Model (SRM) that estimates the long-run strategic value of actions with iso-grpo, a context-conditioned optimistic learning rule. We prove sublinear contextual regret and equilibrium convergence guarantees whose dominant terms scale with the number of context mispredictions; when prediction errors are bounded, our bounds recover the static-game rates obtained when strategic externalities are known. Experiments in 6-player No-Limit Texas Hold'em and competitive Pokemon show consistent improvements in long-term return over strong LLM and RL baselines, and graceful degradation under controlled prediction noise.
format Preprint
id arxiv_https___arxiv_org_abs_2602_08041
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Implicit Strategic Optimization: Rethinking Long-Horizon Decision-Making in Adversarial Poker Environments
Xia, Boyang
Tian, Weiyou
Ren, Qingnan
Huang, Jiaqi
Xiao, Jie
Lu, Shuo
Wang, Kai
Ai, Lynn
Yang, Eric
Shi, Bill
Machine Learning
Artificial Intelligence
Computation and Language
Training large language model (LLM) agents for adversarial games is often driven by episodic objectives such as win rate. In long-horizon settings, however, payoffs are shaped by latent strategic externalities that evolve over time, so myopic optimization and variation-based regret analyses can become vacuous even when the dynamics are predictable. To solve this problem, we introduce Implicit Strategic Optimization (ISO), a prediction-aware framework in which each agent forecasts the current strategic context and uses it to update its policy online. ISO combines a Strategic Reward Model (SRM) that estimates the long-run strategic value of actions with iso-grpo, a context-conditioned optimistic learning rule. We prove sublinear contextual regret and equilibrium convergence guarantees whose dominant terms scale with the number of context mispredictions; when prediction errors are bounded, our bounds recover the static-game rates obtained when strategic externalities are known. Experiments in 6-player No-Limit Texas Hold'em and competitive Pokemon show consistent improvements in long-term return over strong LLM and RL baselines, and graceful degradation under controlled prediction noise.
title Implicit Strategic Optimization: Rethinking Long-Horizon Decision-Making in Adversarial Poker Environments
topic Machine Learning
Artificial Intelligence
Computation and Language
url https://arxiv.org/abs/2602.08041