Computationally Efficient Estimation of Large Probit Models
Patrick Ding, Guido Imbens, Zhaonan Qu, Yinyu Ye

TL;DR
This paper introduces a fast, deterministic EM algorithm using expectation propagation for estimating large probit models, enabling analysis of high-dimensional correlated discrete data efficiently.
Contribution
It develops a novel EM algorithm that leverages expectation propagation and a symmetry-based transformation to efficiently estimate large probit models with many alternatives.
Findings
Enables analysis of over 100 alternatives in probit models.
Provides a deterministic alternative to sampling-based methods.
Applied to hotel search data to reveal ordering effects.
Abstract
Probit models are useful for modeling correlated discrete responses in many disciplines, including consumer choice data in economics and marketing. However, the Gaussian latent variable feature of probit models coupled with identification constraints pose significant computational challenges for its estimation and inference, especially when the dimension of the discrete response variable is large. In this paper, we propose a computationally efficient Expectation-Maximization (EM) algorithm for estimating large probit models. Our work is distinct from existing methods in two important aspects. First, instead of simulation or sampling methods, we apply and customize expectation propagation (EP), a deterministic method originally proposed for approximate Bayesian inference, to estimate moments of the truncated multivariate normal (TMVN) in the E (expectation) step. Second, we take…
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.
Taxonomy
TopicsTarget Tracking and Data Fusion in Sensor Networks · Fault Detection and Control Systems
