Do heckman / heckprob attempt to identify perfect prediction in the selection equation? From the output, it does not seem like they do; logit or probit output would have said something like "blah predicts success perfectly; it is dropped and this many observations not used". However heckman does not say that.
I think I am running into the issue with that, as Heckman model fails to converge (without the -difficult- option) or produces coefficients like 5 with a standard error of zero for a dummy variable in the selection equation. As normal(-5) is about the same as c(epsfloat), I suspect maximization just sends that parameter to a large enough value for the likelihood not to change... rather than attempting to remove it the way logit or probit do.
I think I am running into the issue with that, as Heckman model fails to converge (without the -difficult- option) or produces coefficients like 5 with a standard error of zero for a dummy variable in the selection equation. As normal(-5) is about the same as c(epsfloat), I suspect maximization just sends that parameter to a large enough value for the likelihood not to change... rather than attempting to remove it the way logit or probit do.
Comment