MatrixFormer: A Foundation Model for Matrix Completion

arXiv:2610.06751 · cs.LG, cs.AI · Submitted 2026-10-05 · Read on arXiv

cs.LG, cs.AI

Submitted: 2026-10-05

Updated: 2026-10-05

Comments: 17 pages, 5 figures

Code: https://github.com/anadim/llm-benchmark-matrix

License: http://creativecommons.org/licenses/by/4.0/

The gist: Matrix completion underlies problems from tabular imputation to causal inference, yet existing tabular foundation models treat it as entry-by-entry prediction, repeating context for every target and

Terminology

Abstract

Matrix completion underlies problems from tabular imputation to causal inference, yet existing tabular foundation models treat it as entry-by-entry prediction, repeating context for every target and discarding the matrix's two-dimensional structure. We introduce MatrixFormer, a pre-trained matrix-native transformer that predicts a full distribution for every missing entry in a single forward pass. MatrixFormer is trained entirely on synthetic low-rank and latent-factor matrices under diverse missingness patterns. Applied zero-shot and with the same model weights, MatrixFormer achieves competitive performance on causal inference panel-data tasks, language-model benchmark-score completion, tabular imputation, and recommendation systems matrix completion. These results position MatrixFormer as a general-purpose foundation model for matrix completion.

Sources

Related papers