Everything About ___
Live briefing

Everything about GHK algorithm

Importance sampling method

The GHK algorithm is an importance sampling method for simulating choice probabilities in the multivariate probit model. These simulated probabilities can be used to recover parameter estimates from the maximized likelihood equation using any one of the usual well known maximization methods. Train has well documented steps for implementing this algorithm for a multinomial probit model. What follows here will apply to the binary multivariate probit model. Wikipedia →

🧭 Start here: a 6-step reading path

  1. Read the overview: GHK algorithmA 5-minute orientation
  2. Read the landmark paper: Transitive Closure Algorithm using Binary OR Operation: Primes Algorithm, GHK AlgorithmCited 0 times
  3. Go sideways: Multivariate normal distributionA closely related topic
  4. Go sideways: Folded normal distributionA closely related topic

šŸ“– Definitions

No dictionary entry for this exact phrase.

šŸ—‚ļø The subject at a glance

No outline available.

šŸ† Landmark papers (most cited)

šŸ“š Books worth reading

Open Library didn't respond; try again in a moment.

šŸ”— Related topics