Embedding Foundation Model Predictions in Discrete-Choice Models with Structural Guarantees
Not on the map. Why?
Abstract (arXiv)
Tabular foundation models achieve strong accuracy on choice prediction tasks, but their predictions often violate the economic logic those tasks require: raising a price can increase predicted demand, implied willingness-to-pay estimates are frequently negative or implausible, and unavailable alternatives receive nonzero probability. We propose a two-stage adapter that takes a foundation model's predicted choice probabilities as a precomputed feature and embeds them inside a multinomial logit's utility. In Stage 1, we fit the multinomial logit's structural coefficients by maximum likelihood with sign constraints; in Stage 2, we freeze those coefficients and fit a small neural correction operating on the foundation model's predictions. We prove that this composition exactly preserves the multinomial logit's marginal rate of substitution, so analytically computable value-of-time becomes a mathematical guarantee rather than an empirical accident. Across three datasets and two foundation models, the adapter gains 6.4 percentage points (pp) of test accuracy on average over the multinomial logit and up to 12.8 pp, maintains 100% cost monotonicity, and produces values of time within the published transportation-economics range on the transportation datasets. Performance degrades gracefully under foundation-model context restriction, retaining at least 6 pp of accuracy gain even at 10% of the original foundation-model context.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 10 of its 25 references that are in the map. First posted on arXiv 24 Jun 2026.
Builds on
10 of 25 references.
References · 10
- 2015Distilling the Knowledge in a Neural Networkcited by 10,324
- 2017On Calibration of Modern Neural Networkscited by 4,960
- 2015Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classificationcited by 3,611
- 2022TabPFN: A Transformer That Solves Small Tabular Classification Problems in a Secondcited by 674
- 2019Unconstrained Monotonic Neural Networkscited by 92
- 2025Mitra: Mixed Synthetic Priors for Enhancing Tabular Foundation Modelscited by 77
- 2021Choice modelling in the age of machine learning -- discussion papercited by 26
- 2020A Neural-embedded Choice Model: TasteNet-MNL Modeling Taste Heterogeneity with Flexibility and Interpretabilitycited by 22
- 2025Advancing Constrained Monotonic Neural Networks: Achieving Universal Approximation Beyond Bounded Activationscited by 8
- 2026Auditing and Fixing Economic Validity in Tabular Foundation Models for Discrete Choicecited by 6
Built on by
Citing papers per year: 2026: 3.
3 papers.