RePAIR: Predictive Self-Supervised Representation Learning in Chess

• URL: http://arxiv.org/abs/2606.11860v1
• Date: Wed, 10 Jun 2026 09:36:31 GMT
• Title: RePAIR: Predictive Self-Supervised Representation Learning in Chess
• Abstract summary: We introduce Representation Prediction via Autoencoding using Iterative Refinement (RePAIR)<n>We demonstrate how it can be used to encode objects in sequential data like consecutive chess positions into compact yet meaningful representations.
• Score: 2.1665689529884697
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In this paper, we introduce Representation Prediction via Autoencoding using Iterative Refinement (RePAIR) - a novel self-supervised representation learning architecture that synthesizes Masked Autoencoders (MAE), Joint Embedding Predictive Architectures (JEPA), and Bidirectional Encoder Representations from Transformers (BERT). We demonstrate how it can be used to encode objects in sequential data like consecutive chess positions into compact yet meaningful representations. The basic principle of the architecture is to mask large portions of a sequence of latent states, similar to BERT and MAE. Then, we apply a lightweight Predictor to the latent representations that repairs gaps in the sequence in a lower-dimensional embedding space akin to JEPA. Our experiments in the domain of chess show that the Encoder refines the board representations such that meaningful chess concepts emerge clustered in the latent space. Furthermore, reconstructions of the masked board states show that the model is able to reason about the piece movements without relying on costly reinforcement learning methods. Lastly, we find that the resulting representation space allows for quick and intuitive dissections of chess games by observing the game path trajectories in this semantically rich space.

Related papers

• Unified Driving Tokens: Representation- and Geometry-Guided Discrete Tokenizer for Driving World Models and Planning [13.385292682258147]
  We present a representation-guided and geometry-enhanced tokenizer that learns discrete tokens under joint supervision.<n> Experiments on NAVSIM show improved reconstruction fidelity and representation consistency, competitive planning performance under a fixed decoder, and better generative quality under matched settings.
  arXiv  Detail & Related papers  (2026-06-01T09:02:32Z)
• Chessformer: A Unified Architecture for Chess Modeling [8.811775497383227]
  Chess has long served as a canonical testbed for artificial intelligence, but modeling approaches for its central tasks have diverged.<n>We introduce Chessformer, a unified architecture that advances the state of the art on all three central goals in chess modeling.
  arXiv  Detail & Related papers  (2026-05-18T20:27:01Z)
• VQRAE: Representation Quantization Autoencoders for Multimodal Understanding, Generation and Reconstruction [83.50898344094153]
  VQRAE produces Continuous semantic features for image understanding and tokens for visual generation within a unified tokenizer.<n>Design enables negligible semantic information for maintaining the ability of multimodal understanding, discrete tokens.<n>VQRAE presents competitive performance on several benchmarks of visual understanding, generation and reconstruction.
  arXiv  Detail & Related papers  (2025-11-28T17:26:34Z)
• MapBERT: Bitwise Masked Modeling for Real-Time Semantic Mapping Generation [15.116320098263149]
  MapBERT is a novel framework designed to model the distribution of unseen spaces.<n>We show that MapBERT achieves state-of-the-art semantic map generation.<n> Experiments on Gibson benchmarks show that MapBERT achieves state-of-the-art semantic map generation.
  arXiv  Detail & Related papers  (2025-06-09T01:55:55Z)
• "Principal Components" Enable A New Language of Images [79.45806370905775]
  We introduce a novel visual tokenization framework that embeds a provable PCA-like structure into the latent token space.<n>Our approach achieves state-of-the-art reconstruction performance and enables better interpretability to align with the human vision system.
  arXiv  Detail & Related papers  (2025-03-11T17:59:41Z)
• Gaussian Masked Autoencoders [74.2341070024126]
  This paper explores Masked Autoencoders (MAE) with Gaussian Splatting.<n>Our approach, named Gaussian Masked Autoencoder, or GMAE, aims to learn semantic abstractions and spatial understanding jointly.
  arXiv  Detail & Related papers  (2025-01-06T18:59:57Z)
• UGMAE: A Unified Framework for Graph Masked Autoencoders [67.75493040186859]
  We propose UGMAE, a unified framework for graph masked autoencoders. We first develop an adaptive feature mask generator to account for the unique significance of nodes. We then design a ranking-based structure reconstruction objective joint with feature reconstruction to capture holistic graph information.
  arXiv  Detail & Related papers  (2024-02-12T19:39:26Z)
• Understanding Masked Autoencoders From a Local Contrastive Perspective [80.57196495601826]
  Masked AutoEncoder (MAE) has revolutionized the field of self-supervised learning with its simple yet effective masking and reconstruction strategies. We introduce a new empirical framework, called Local Contrastive MAE, to analyze both reconstructive and contrastive aspects of MAE.
  arXiv  Detail & Related papers  (2023-10-03T12:08:15Z)
• Context Autoencoder for Self-Supervised Representation Learning [64.63908944426224]
  We pretrain an encoder by making predictions in the encoded representation space. The network is an encoder-regressor-decoder architecture. We demonstrate the effectiveness of our CAE through superior transfer performance in downstream tasks.
  arXiv  Detail & Related papers  (2022-02-07T09:33:45Z)
• Hierarchical Variational Autoencoder for Visual Counterfactuals [79.86967775454316]
  Conditional Variational Autos (VAE) are gathering significant attention as an Explainable Artificial Intelligence (XAI) tool. In this paper we show how relaxing the effect of the posterior leads to successful counterfactuals. We introduce VAEX an Hierarchical VAE designed for this approach that can visually audit a classifier in applications.
  arXiv  Detail & Related papers  (2021-02-01T14:07:11Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.