Towards a Relationship-Aware Transformer for Tabular Data

Andrei V. Konstantinov, Valerii A. Zuev, Lev V. Utkin
12/8/2025
cs.LG

No confident code implementation found for this paper.

Abstract

Deep learning models for tabular data typically do not allow for imposing a graph of external dependencies between samples, which can be useful for accounting for relatedness in tasks such as treatment effect estimation. Graph neural networks only consider adjacent nodes, making them difficult to apply to sparse graphs. This paper proposes several solutions based on a modified attention mechanism, which accounts for possible relationships between data points by adding a term to the attention matrix. Our models are compared with each other and the gradient boosting decision trees in a regression task on synthetic and real-world datasets, as well as in a treatment effect estimation task on the IHDP dataset.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{konstantinov2025towards,
  title  = {Towards a Relationship-Aware Transformer for Tabular Data},
  author = {Andrei V. Konstantinov and Valerii A. Zuev and Lev V. Utkin},
  year   = {2025},
  eprint = {2512.07310},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2512.07310v1}
}

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

Discussion