Scalable Variational Inference for Multinomial Probit Models under Large Choice Sets and Sample Sizes
Gyeongjun Kim, Yeseul Kang, Lucas Kock, Prateek Bansal, Keemin Sohn

TL;DR
This paper presents a scalable variational inference method for multinomial probit models that significantly reduces computational costs while maintaining accuracy, enabling analysis of large choice sets and samples.
Contribution
Introduces a neural embedding-based conditional variational inference approach for MNP models, improving scalability and efficiency over traditional methods.
Findings
Achieves parameter recovery comparable to MCMC methods.
Calibrates models with 20 alternatives and one million observations in about 28 minutes.
Performs approximately 36 times faster than existing benchmarks.
Abstract
The multinomial probit (MNP) model is widely used to analyze categorical outcomes due to its ability to capture flexible substitution patterns among alternatives. Conventional likelihood based and Markov chain Monte Carlo (MCMC) estimators become computationally prohibitive in high dimensional choice settings. This study introduces a fast and accurate conditional variational inference (CVI) approach to calibrate MNP model parameters, which is scalable to large samples and large choice sets. A flexible variational distribution on correlated latent utilities is defined using neural embeddings, and a reparameterization trick is used to ensure the positive definiteness of the resulting covariance matrix. The resulting CVI estimator is similar to a variational autoencoder, with the variational model being the encoder and the MNP's data generating process being the decoder. Straight through…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
