Re: Computational complexity of finding MLEs?
- From: "Yaroslav Bulatov" <yaroslavvb@xxxxxxxxx>
- Date: 16 Nov 2005 18:08:53 -0800
But how do we know that we even need to compute derivatives of the
log-likelihood function? For instance, we can estimate the mean
parameter of the Normal distribution by just averaging the observations
together. As opposed to logistic regression, where we may have to
compute derivatives and iterate several times. Are we able to rule out
the existence of a a special purpose efficient algorithm (like for
estimating mean of the Normal distribution) for cases where Newton-type
methods are typically used?
.
- Follow-Ups:
- Re: Computational complexity of finding MLEs?
- From: Herman Rubin
- Re: Computational complexity of finding MLEs?
- References:
- Computational complexity of finding MLEs?
- From: Yaroslav Bulatov
- Re: Computational complexity of finding MLEs?
- From: Herman Rubin
- Computational complexity of finding MLEs?
- Prev by Date: n years probabilities
- Next by Date: CFP: Special Issue on random sets and imprecise probabilities
- Previous by thread: Re: Computational complexity of finding MLEs?
- Next by thread: Re: Computational complexity of finding MLEs?
- Index(es):
Loading