Contrastive Sparse Autoencoders for Interpreting Planning of Chess-Playing Agents

Yoann Poupart
6/6/2024
cs.AI

No official code found. Best implementation: Xmaster6y/lczero-planning (2 stars, MIT, last commit 2024-07-25).

Abstract

AI led chess systems to a superhuman level, yet these systems heavily rely on black-box algorithms. This is unsustainable in ensuring transparency to the end-user, particularly when these systems are responsible for sensitive decision-making. Recent interpretability work has shown that the inner representations of Deep Neural Networks (DNNs) were fathomable and contained human-understandable concepts. Yet, these methods are seldom contextualised and are often based on a single hidden state, which makes them unable to interpret multi-step reasoning, e.g. planning. In this respect, we propose contrastive sparse autoencoders (CSAE), a novel framework for studying pairs of game trajectories. Using CSAE, we are able to extract and interpret concepts that are meaningful to the chess-agent plans. We primarily focused on a qualitative analysis of the CSAE features before proposing an automated feature taxonomy. Furthermore, to evaluate the quality of our trained CSAE, we devise sanity checks to wave spurious correlations in our results.

View on arXivView PDF

Code Implementations(1)

MIT

Interpreting planning in LeelaChessZero networks.

20Shell, PythonApr 30, 20242 years agoMIT

Similar Papers

Cite this paper

@article{poupart2024contrastive,
  title  = {Contrastive Sparse Autoencoders for Interpreting Planning of Chess-Playing Agents},
  author = {Yoann Poupart},
  year   = {2024},
  eprint = {2406.04028},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2406.04028v1}
}

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/2406.04028.svg)](https://codeofpaper.com/paper/2406.04028)

Discussion