FAST: Similarity-based Knowledge Transfer for Efficient Policy Learning

Alessandro Capurso, Elia Piccoli, Davide Bacciu
7/27/2025
cs.LGcs.AI

No official code found. Best implementation: Jek9884/FAST (1 star, MIT, last commit 2025-08-17).

Abstract

Transfer Learning (TL) offers the potential to accelerate learning by transferring knowledge across tasks. However, it faces critical challenges such as negative transfer, domain adaptation and inefficiency in selecting solid source policies. These issues often represent critical problems in evolving domains, i.e. game development, where scenarios transform and agents must adapt. The continuous release of new agents is costly and inefficient. In this work we challenge the key issues in TL to improve knowledge transfer, agents performance across tasks and reduce computational costs. The proposed methodology, called FAST - Framework for Adaptive Similarity-based Transfer, leverages visual frames and textual descriptions to create a latent representation of tasks dynamics, that is exploited to estimate similarity between environments. The similarity scores guides our method in choosing candidate policies from which transfer abilities to simplify learning of novel tasks. Experimental results, over multiple racing tracks, demonstrate that FAST achieves competitive final performance compared to learning-from-scratch methods while requiring significantly less training steps. These findings highlight the potential of embedding-driven task similarity estimations.

View on arXivView PDF

Code Implementations(1)

Jek9884/FASTCommunity63%
MIT

This is the implementation of the paper titled: "FAST: Similarity-based Knowledge Transfer for Efficient Policy Learning" accepted by IEEE Conference on Games (CoG) 2025

12Python, Jupyter NotebookMay 29, 20251 years agoMIT

Similar Papers

Cite this paper

@article{capurso2025fast,
  title  = {FAST: Similarity-based Knowledge Transfer for Efficient Policy Learning},
  author = {Alessandro Capurso and Elia Piccoli and Davide Bacciu},
  year   = {2025},
  eprint = {2507.20433},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2507.20433v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2507.20433.svg)](https://codeofpaper.com/paper/2507.20433)

Discussion