The Plateau Problem in the Heteroskedastic Probit Model
Eric Freeman, Luke Keele, David Park, Julia Salzman, Brendan Weickert
Abstract
Open-access reader
Eric Freeman, Luke Keele, David Park, Julia Salzman, Brendan Weickert
Abstract
Open-access reader
In parameter determination for the heteroskedastic probit model, both in simulated data and in actual data, we observe a failure of traditional local search methods to converge consistently to a single parameter vector, in contrast to the typical situation for the regular probit model. We identify features of the heteroskedastic probit log likelihood function that we argue tend to lead to this failure, and suggest ways to amend the local search methods to remedy the problem.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In parameter determination for the heteroskedastic probit model, both in simulated data and in actual data, we observe a failure of traditional local search methods to converge consistently to a single parameter vector, in contrast to the typical situation for the regular probit model. We identify features of the heteroskedastic probit log likelihood function that we argue tend to lead to this failure, and suggest ways to amend the local search methods to remedy the problem.
Key concepts: Heteroscedasticity, Ordered probit, Probit model, Probit, Econometrics, Multinomial probit, Plateau (mathematics), Multivariate probit model