Foundation models have transformed language and vision by leveraging internet-scale data. For structured domains like tabular prediction, the shift to synthetic data has been equally impactful—models like TabPFN solve tabular classification using a transformer pretrained on a synthetic Bayesian prior. Yet, according to a new paper by Zighem, Abdelrahman, and Vie, published on arXiv, reinforcement learning (RL) remains a conspicuous gap in this landscape. The authors argue that sampling a synthetic Markov Decision Process (MDP) is as straightforward as sampling a synthetic tabular dataset, yet no in-context RL work treats prior design as a primary objective.
The Gap in Reinforcement Learning
The paper makes two central points. First, RL is missing a foundation model because the field has not focused on designing priors for synthetic MDPs, despite the feasibility. Second, MDPs admit a fixed-size sufficient statistic that is independent of the number of episodes observed and tabular in shape. This property makes MDPs directly amenable to the attention-based architectures used for tabular foundation models—simply replacing the supervised target with a policy head. Together, these points define an agenda for building an RL foundation model that could operate in-context, much like TabPFN does for tabular data.
Proof of Concept with Graph Attention Networks
As a proof of concept, the researchers trained a Graph Attention Network (GAT) entirely on synthetic MDPs. Without any task-specific fine-tuning, this model solved held-out tabular benchmarks in both online and offline settings. The results are striking:
| Setting | Method | Performance |
|---|---|---|
| Online | GAT (synthetic MDPs) | Far fewer episodes than UCB-VI and tabular Q-learning |
| Offline | GAT (synthetic MDPs) | Competitive with VI-LCB |
Online, the GAT required far fewer episodes to solve benchmarks compared to UCB-VI and tabular Q-learning. Offline, it performed competitively with VI-LCB, a standard algorithm for offline RL. This demonstrates that a model trained solely on synthetic MDPs can generalize to real tasks without task-specific tuning.
Implications for the Field
While this work is a proof of concept, it suggests that an RL foundation model is achievable using existing techniques. The approach mirrors the synthetic-data paradigm that powered TabPFN and its successors. By treating prior design as a primary objective, the RL community could create models that learn to make decisions in new environments with minimal additional data. For enterprise applications, such models could reduce the time and cost of training RL agents for custom tasks, though the paper does not explore specific industry use cases. The findings open a clear research agenda: develop foundation models for RL by leveraging synthetic MDPs and attention-based architectures.