INCONVENIENT is introduced, a benchmark designed to study robustness to convenience-sample bias and provides explicit control over both the direction and severity of relationship shifts, enabling a systematic assessment of robustness to convenience sampling.
Abstract
Machine learning models for tabular prediction typically assume that training data are representative of the population on which they will be deployed. In practice, however, data are often collected based on convenience, availability, or cost, resulting in systematic sampling biases that can distort feature--target relationships and undermine real-world generalization. Existing tabular distribution-shift benchmarks primarily construct out-of-distribution (OOD) settings by partitioning observations across naturally occurring domains. While such partitions may induce changes in P(Y | X), the resulting shifts are neither explicitly controlled nor isolated, and the evaluation distributions themselves are often not representative of the broader target population. We introduce INCONVENIENT, a benchmark designed to study robustness to convenience-sample bias. Rather than relying on naturally occurring domain partitions, INCONVENIENT directly perturbs feature--target relationships in the training distribution while preserving the original population distribution as the deployment environment. This setting more closely reflects real-world scenarios in which models are developed from unrepresentative samples and subsequently deployed on a broader population. The distinction is particularly relevant for large language models (LLMs), whose pretraining may encode population-level knowledge that extends beyond the relationships observed in a biased training dataset. Unlike existing distribution-shift benchmarks, INCONVENIENT provides explicit control over both the direction and severity of relationship shifts, enabling a systematic assessment of robustness to convenience sampling. The benchmark comprises 200 tabular classification and regression datasets spanning diverse application domains and generates around 15,500 shifted training distributions which lead to substantial downstream degradation.
Tabular foundation models (TFMs) achieve strong predictive performance by conditioning on labeled demonstrations provided in context, without any parameter update. Yet how individual demonstrations shape a given prediction remains poorly understood. This gap matters in practice: the context is often assembled from what...
Yacine Benihaddadene, Milan Bhan, Eliot Dugelay et al.· 0 citations
This short survey organises representative methods around representative methods around reconstruction and generation, rebalancing and representation calibration, learning with limited supervision, adaptation across domains and modalities, and reliability under distribution change.
This paper develops theoretical bounds on the unfairness and expected loss at deployment, and derives sufficient conditions under which fairness and accuracy can be perfectly transferred via invariant representation learning, and designs a learning algorithm such that fair ML models learned with training data still hav...
Test-time adaptation (TTA) is a strategy that leverages unlabeled test data to adjust a pretrained model, improving robustness against distribution shifts. Recent advances in this research area are mostly driven by heuristic or empirical approaches with limited theoretical guidance. In particular, there is little theor...
Song-Ming Zhang, Yu-Xiao Luo, Si-Ran Chen et al.· IEEE Transactions on Neural...· 0 citations
Machine learning models often suffer performance degradation under subpopulation shift, particularly when spurious correlations cause models to rely on shortcut features that fail to generalize across subgroups. A recent line of work mitigates this issue by using loss-based signals to identify informative samples, but...
Sungho Jo, Seonghwi Kim, Wonsang Yun et al.· 0 citations
Related blog posts
MIT News · Artificial Intelligence· news.mit.eduAug 27, 2026
A new machine-learning framework aims to improve the success rate of computational protein design while moving away from results that reproduce sequences found in nature.