Fast variational Bayes methods for multinomial probit models
원문 초록
The multinomial probit model is often used to analyze choice behaviour. However, estimation with existing Markov chain Monte Carlo (MCMC) methods is computationally costly, which limits its applicability to large choice data sets. This paper proposes a variational Bayes method that is accurate and fast, even when a large number of choice alternatives and observations are considered. Variational methods usually require an analytical expression for the unnormalized posterior density and an adequate choice of variational family. Both are challenging to specify in a multinomial probit, which has a posterior that requires identifying restrictions and is augmented with a large set of latent utilities. We employ a spherical transformation on the covariance matrix of the latent utilities to construct an unnormalized augmented posterior that identifies the parameters, and use the conditional posterior of the latent utilities as part of the variational family. The proposed method is faster than MCMC, and can be made scalable to both a large number of choice alternatives and a large number of observations. The accuracy and scalability of our method is illustrated in numerical experiments and real purchase data with one million observations.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Interpretable Bayesian Tensor Network Kernel Machines with Automatic Rank and Feature Selection
Scalable Bayesian Low-Rank Adaptation of Large Language Models via Stochastic Variational Subspace Inference
Variational Inference with Mixtures of Isotropic Gaussians
Amortized variational transdimensional inference
Synonymous Variational Inference for Perceptual Image Compression
Bayesian Meta-Reinforcement Learning with Laplace Variational Recurrent Networks
토론
이 논문과 연결된 포럼 글이 아직 없습니다.