IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v13y2025i17p2734-d1732441.html
   My bibliography  Save this article

Evolutionary Sampling for Knowledge Distillation in Multi-Agent Reinforcement Learning

Author

Listed:
  • Ha Young Jo

    (Convergence of AI, Chonnam National University, Gwangju 61186, Republic of Korea)

  • Man-Je Kim

    (Convergence of AI, Chonnam National University, Gwangju 61186, Republic of Korea)

Abstract

The Centralized Teacher with Decentralized Student (CTDS) framework is a multi-agent reinforcement learning (MARL) approach that utilizes knowledge distillation within the Centralized Training with Decentralized Execution (CTDE) paradigm. In this framework, a teacher module learns optimal Q -values using global observations and distills this knowledge to a student module that operates with only local information. However, CTDS has limitations including inefficient knowledge distillation processes and performance gaps between teacher and student modules. This paper proposes the evolutionary sampling method that employs genetic algorithms to optimize selective knowledge distillation in CTDS frameworks. Our approach utilizes a selective sampling strategy that focuses on samples with large Q -value differences between teacher and student models. The genetic algorithm optimizes adaptive sampling ratios through evolutionary processes, where the chromosome represent sampling ratio sequences. This evolutionary optimization discovers optimal adaptive sampling sequences that minimize teacher–student performance gaps. Experimental validation in the S t a r C r a f t Multi-Agent Challenge (SMAC) environment confirms that our method achieved superior performance compared to the existing CTDS methods. This approach addresses the inefficiency in knowledge distillation and performance gap issues while improving overall performance through the genetic algorithm.

Suggested Citation

  • Ha Young Jo & Man-Je Kim, 2025. "Evolutionary Sampling for Knowledge Distillation in Multi-Agent Reinforcement Learning," Mathematics, MDPI, vol. 13(17), pages 1-18, August.
  • Handle: RePEc:gam:jmathe:v:13:y:2025:i:17:p:2734-:d:1732441
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/13/17/2734/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/13/17/2734/
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:13:y:2025:i:17:p:2734-:d:1732441. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.