$π$-Play: Multi-Agent Self-Play via Privileged Self-Distillation without External Data

TL;DR

π-Play combines self-play and privileged self-distillation, achieving 2-3x efficiency improvement in multi-agent evolution.

cs.LG 🔴 Advanced 2026-04-16 29 views
Yaocheng Zhang Yuanheng Zhu Wenyue Chong Songjun Tu Qichao Zhang Jiajun Chai Xiaohan Wang Wei Lin Guojun Yin Dongbin Zhao
multi-agent self-play privileged information self-distillation sparse rewards

Key Findings

Methodology

π-Play integrates self-play with privileged self-distillation. The examiner generates tasks and Question Construction Paths (QCPs), while the teacher uses QCPs as privileged context to guide the student through dense supervision. Alternating optimization enables efficient co-evolution.

Key Results

  • On multi-hop datasets like HotpotQA, π-Play outperforms fully supervised models with an average improvement of ~6.3%.
  • Compared to traditional self-play, π-Play achieves 2-3x higher evolutionary efficiency, especially in complex reasoning tasks.
  • Ablation studies confirm that QCP significantly enhances student learning efficiency.

Significance

π-Play addresses inefficiencies in traditional self-play caused by sparse rewards and introduces QCP as a novel source of privileged information. This framework opens new avenues for data-free reinforcement learning.

Technical Contribution

Introduces QCP-guided privileged self-distillation, transforming sparse rewards into dense feedback; designs a collaborative optimization mechanism among examiner, teacher, and student; achieves efficient multi-agent evolution without external data.

Novelty

First to use Question Construction Paths (QCP) as privileged information for self-distillation, significantly improving self-play efficiency and addressing the underutilization of intermediate artifacts.

Limitations

  • Relies on high-quality QCPs; suboptimal QCPs may hinder student learning.
  • Alternating optimization introduces computational overhead in resource-constrained environments.
  • Scalability to larger models remains untested.

Future Work

Future work could focus on automating QCP optimization, scaling to larger models, and exploring applications in multimodal tasks.

AI Executive Summary

π-Play is a novel multi-agent evolution framework that combines self-play with privileged self-distillation to address sparse rewards and data dependency issues. By introducing Question Construction Paths (QCPs) as privileged information, π-Play transforms sparse rewards into dense feedback, significantly improving student learning efficiency.

Experiments demonstrate π-Play's strong performance across datasets, particularly in multi-hop reasoning tasks, where it outperforms fully supervised models and achieves 2-3x higher evolutionary efficiency than traditional self-play. Ablation studies further validate the critical role of QCP in enhancing learning efficiency.

Despite its strong performance, π-Play's reliance on QCP quality and computational overhead are notable limitations. Future research could optimize QCP generation and explore its scalability to larger models and multimodal tasks.

Deep Analysis

Background

Multi-agent self-play has been widely used in reinforcement learning but suffers from inefficiencies due to sparse rewards and data dependency. Self-distillation offers dense supervision but often relies on external data or expert feedback.

Core Problem

Traditional self-play methods fail to efficiently utilize intermediate artifacts, leading to low learning efficiency. Additionally, obtaining high-quality privileged information often requires human intervention or external data, limiting scalability.

Innovation

π-Play introduces QCP as privileged information for self-distillation and designs a collaborative optimization mechanism among examiner, teacher, and student, transforming sparse rewards into dense feedback.

Methodology

  • �� The examiner generates tasks and QCPs, ensuring diversity and moderate difficulty.
  • �� The teacher uses QCPs to provide dense supervision to the student via reverse KL divergence.
  • �� The student learns through combined teacher guidance and reward signals.
  • �� Alternating optimization enables efficient co-evolution among agents.

Experiments

Experiments were conducted on datasets like NQ, TriviaQA, and HotpotQA, with baselines including ReAct and Dr.Zero. Metrics include exact match scores, and ablation studies validate QCP's role.

Results

π-Play achieves significant performance gains in multi-hop tasks, outperforming baselines by ~6.3% on average. Evolutionary efficiency improves by 2-3x compared to traditional self-play.

Applications

Applicable to data-free complex reasoning tasks such as question-answering systems and search engine optimization.

Limitations & Outlook

Dependence on QCP quality and computational overhead are key limitations. Scalability to larger models remains to be validated.

Plain Language Accessible to non-experts

Imagine π-Play as a teaching system: the examiner designs questions, the teacher uses the question's construction process (QCP) to guide the student, and the student learns through practice and feedback. QCP acts like a lesson plan, helping the student learn more efficiently.

ELI14 Explained like you're 14

Think of it like a puzzle game where the examiner creates challenges, the teacher gives hints based on how the puzzle was made, and you (the student) solve it while learning new tricks! That's the magic of π-Play!

Glossary

Self-Play

A method where models interact with themselves to generate training data.

Used to generate tasks and QCPs.

Privileged Information

Information accessible during training but not inference.

QCP is used as privileged information to guide the student.

Question Construction Path (QCP)

Records the reverse process of constructing a question from an answer.

Used as privileged information for self-distillation.

Self-Distillation

A model improves itself by learning from its teacher version.

The teacher uses QCP to provide dense supervision to the student.

Sparse Reward

A scenario in reinforcement learning where reward signals are infrequent.

Traditional self-play optimizes students only through sparse rewards.

Open Questions Unanswered questions from this research

  • 1 How to automate QCP optimization to enhance robustness.
  • 2 Potential applications of π-Play in multimodal tasks remain unexplored.
  • 3 Scalability to larger models requires further investigation.

Applications

Immediate Applications

Question-Answering Systems

Enhances reasoning capabilities without external data, suitable for search engines.

Educational Technology

Generates personalized learning tasks to help students learn efficiently.

Long-term Vision

General AI

Explores data-free learning methods through multi-agent co-evolution.

Abstract

Deep search agents have emerged as a promising paradigm for addressing complex information-seeking tasks, but their training remains challenging due to sparse rewards, weak credit assignment, and limited labeled data. Self-play offers a scalable route to reduce data dependence, but conventional self-play optimizes students only through sparse outcome rewards, leading to low learning efficiency. In this work, we observe that self-play naturally produces a question construction path (QCP) during task generation, an intermediate artifact that captures the reverse solution process. This reveals a new source of privileged information: self-play can provide high-quality privileged information for the self-distillation at low cost and at scale, without relying on human feedback or curated privileged information. Leveraging this insight, we propose Privileged Information Self-Play ($π$-Play), a novel multi-agent self-evolution framework combining self-play and self-distillation. In $π$-Play, an examiner generates tasks together with QCPs, and a teacher employs QCP as privileged context to densely supervise a student via self-distillation. This design transforms sparse-reward self-play into a dense-feedback co-evolution. Extensive experiments show that data-free $π$-Play surpasses fully supervised search agents and improves evolutionary efficiency by 2-3$\times$ over conventional self-play. Code is available at https://github.com/zhyaoch/pi-play.

cs.LG cs.CL