aiqbench analysis
This study introduces GIFT, a framework that integrates game-based informal learning with formal math tasks to enhance LLMs' generalization in planning, creativity, and social intelligence. The proposed Coordinated Subtask Training (CST) method addresses gradient blurring by using sequential subtask-specific updates, successfully preserving in-domain performance while boosting broader abilities. For researchers in multi-task reinforcement learning, this approach offers a practical pathway to improve model robustness without relying on costly annotations.
GIFT: Games as Informal Training for Generalizable LLMs
arXiv:2601.05633v2 Announce Type: replace Abstract: Recent LLMs excel at formal tasks such as mathematical reasoning and code generation, but still struggle with broader abilities such as planning, creativity, and social intelligence. Inspired by human learning, where formal instruction and informal experience jointly shape intelligence, we introduce informal learning into LLM training and use games as annotation-free, feedback-driven environments. To cover diverse abilities including abstract reasoning, planning, creativity, and social interaction, we combine formal math tasks with three representative game tasks, including Matrix Games, TicTacToe, and Who's the Spy. However, directly mixing these tasks under a unified RL objective can blur task-specific learning signals and provides no explicit guidance for coordinating task-gradient directions. To combat these, we propose Coordinated Subtask Training (CST), which replaces a single mixed update with sequential subtask-specific updates, separating heterogeneous RL signals while implicitly promoting coordination among subtasks. Experiments on ability-oriented benchmarks show that game-based informal learning improves generalization beyond formal training alone, while CST further enhances multi-task RL by preserving in-domain subtask performance and improving broader general abilities. Code and data are publicly available.
Abstract:Recent LLMs excel at formal tasks such as mathematical reasoning and code generation, but still struggle with broader abilities such as planning, creativity, and social intelligence. Inspired by human learning, where formal instruction and informal experience jointly shape intelligence, we introduce informal learning into LLM training and use games as annotation-free, feedback-driven environments. To cover diverse abilities including abstract reasoning, planning, creativity, and social interaction, we combine formal math tasks with three representative game tasks, including Matrix Games, TicTacToe, and Who's the Spy. However, directly mixing these tasks under a unified RL objective can blur task-specific learning signals and provides no explicit guidance for coordinating task-gradient directions. To combat these, we propose Coordinated Subtask Training (CST), which replaces a single mixed update with sequential subtask-specific updates, separating heterogeneous RL signals while implicitly promoting coordination among subtasks. Experiments on ability-oriented benchmarks show that game-based informal learning improves generalization beyond formal training alone, while CST further enhances multi-task RL by preserving in-domain subtask performance and improving broader general abilities. Code and data are publicly available.
Computation and Language (cs.CL)
arXiv:2601.05633 [cs.CL]
(or arXiv:2601.05633v2 [cs.CL] for this version)
https://doi.org/10.48550/arXiv.2601.05633 Focus to learn more arXiv-issued DOI via DataCite
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.
Full text under the publisher's open licence · 266 words
Related coverage
EIB-Net: Entropy-Guided Information Bottleneck for Generalizable AI-Generated Image Detection
arXiv · Sep 25, 2026
SelfOp: An Optimization Algorithm for Self-Improving Security Agents
arXiv · Sep 22, 2026
Latent PDE mapping for efficient physics-informed learning across geometries with limited data
arXiv · Jul 27, 2026
What Should SFT Learn? Conditional Information Gain for Generalizable Post-Training
arXiv · Oct 12, 2026