Adjoint-differentiated Laplace approximation for multivariate probit?


I saw this work about speeding up sampling from models which use latent guassian variables using adjoint-differentiated Laplace approximation from some members of the stan dev team recently

Multivariate probit models augment the ordinal data with guassian latent variables and are quite slow in Stan, so this would be really useful. I use bgoodri’s parameterization of multivariate probit (+ extended to ordered multivariate probit and hierarchical, based on the same techniques) - would it be possible to code this model using the the adjoint-differentiated Laplace approximation?

1 Like

Good question. Tagging @charlesm93 and @avehtari, two of the authors of that new paper.

1 Like

@charlesm93 can comment on the actual code part, but I’ll provide couple references for equations, computational complexity and experimental results

Although the latter mentions EP in the title, it has useful information on practicality of Laplace approximation for Multinomial probit.

So it has been done before in other software, but probably requires non-small amount of work to be implemented in Stan. May also require sparse matrices to be fast.


Thanks, i’ll have a look at these. By the way, would this method also speed up sampling for models with large number of observations, but without high-dimensional matrices, like some other proposed algorithms (e.g. calibrated Gibbs, transport monte carlo, etc) do? or do they only offer benefit for models which use big correlation matrices?

As @avehtari said, we’re in the process of extending our prototype to accomodate more likelihoods. At this point, you’d need to do some coding in C++. But I’ll add the multivariate probit on our todo list.

1 Like