mlsanityData to 14 Oct 2026

MIRRAMS: Learning Robust Tabular Models under Unseen Missingness Shifts

arXiv 2507.08280 ↗First posted 11 Jul 2025stat.ML cs.LGcited by 2

Not on the map. Why?

Abstract (arXiv)

The presence of missing values often reflects variations in data collection policies, which may shift across time or locations, even when the underlying feature distribution remains stable. Such shifts in the missingness distribution between training and test inputs pose a significant challenge to achieving robust predictive performance. In this study, we propose a novel deep learning framework designed to address this challenge, particularly in the common yet challenging scenario where the test-time dataset is unseen. We begin by introducing a set of mutual information-based conditions, called MI robustness conditions, which guide the prediction model to extract label-relevant information. This promotes robustness against distributional shifts in missingness at test-time. To enforce these conditions, we design simple yet effective loss terms that collectively define our final objective, called MIRRAMS. Importantly, our method does not rely on any specific missingness assumption such as MCAR, MAR, or MNAR, making it applicable to a broad range of scenarios. Furthermore, it can naturally extend to cases where labels are also missing in training data, by generalizing the framework to a semi-supervised learning setting. Extensive experiments across multiple benchmark tabular datasets demonstrate that MIRRAMS consistently outperforms existing state-of-the-art baselines and maintains stable performance under diverse missingness conditions. Moreover, it achieves superior performance even in fully observed settings, highlighting MIRRAMS as a powerful, off-the-shelf framework for general-purpose tabular learning.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 19 of its 34 references that are in the map. First posted on arXiv 11 Jul 2025.

Builds on

19 of 34 references.

References · 19

  1. 2017Attention Is All You Needcited by 60,361
  2. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  3. 2018Representation Learning with Contrastive Predictive Codingcited by 7,777
  4. 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,166
  5. 2020FixMatch: Simplifying Semi-Supervised Learning with Consistency and Confidencecited by 2,085
  6. 2017Adversarial Discriminative Domain Adaptationcited by 1,311
  7. 2020What Makes for Good Views for Contrastive Learning?cited by 846
  8. 2021Revisiting Deep Learning Models for Tabular Datacited by 740
  9. 2022TabPFN: A Transformer That Solves Small Tabular Classification Problems in a Secondcited by 674
  10. 2020TabTransformer: Tabular Data Modeling Using Contextual Embeddingscited by 409
  11. 2021SAINT: Improved Neural Networks for Tabular Data via Row Attention and Contrastive Pre-Trainingcited by 319
  12. 2021Dash: Semi-Supervised Learning with Dynamic Thresholdingcited by 148
7 more
  1. 2023XTab: Cross-table Pretraining for Tabular Transformerscited by 81
  2. 2024SwitchTab: Switched Autoencoders Are Effective Tabular Learnerscited by 38
  3. 2023UniTabE: A Universal Pretraining Protocol for Tabular Foundation Model in Data Sciencecited by 29
  4. 2023ReConTab: Regularized Contrastive Representation Learning for Tabular Datacited by 25
  5. 2021Maximum Mean Discrepancy for Generalization in the Presence of Distribution and Missingness Shiftcited by 11
  6. 2024To Predict or Not To Predict? Proportionally Masked Autoencoders for Tabular Data Imputationcited by 5
  7. 2021Managing dataset shift by adversarial validation for credit scoringcited by 3

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 2.

2 papers.