Re: Computational complexity of finding MLEs?
- From: hrubin@xxxxxxxxxxxxxxxxxxxx (Herman Rubin)
- Date: 17 Nov 2005 10:32:42 -0500
In article <1132193333.359929.12880@xxxxxxxxxxxxxxxxxxxxxxxxxxxx>,
Yaroslav Bulatov <yaroslavvb@xxxxxxxxx> wrote:
>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?
This is a situation which occurs often in complexity. It
is generally the case that there are special cases of highly
reduced complexity. Rational exponents with small powers
are easier to compute; for A*exp(-b*|x-c|^q), the situation
becomes markedly worse for q not an integer, and worse for
q < 1, and even worse for q < .5.
--
This address is for information only. I do not claim that these views
are those of the Statistics Department or of Purdue University.
Herman Rubin, Department of Statistics, Purdue University
hrubin@xxxxxxxxxxxxxxx Phone: (765)494-6054 FAX: (765)494-0558
.
- References:
- Computational complexity of finding MLEs?
- From: Yaroslav Bulatov
- Re: Computational complexity of finding MLEs?
- From: Herman Rubin
- Re: Computational complexity of finding MLEs?
- From: Yaroslav Bulatov
- Computational complexity of finding MLEs?
- Prev by Date: Load big file_out of memory?!
- Next by Date: Re: Testing randomness
- Previous by thread: Re: Computational complexity of finding MLEs?
- Next by thread: Testing randomness
- Index(es):
Relevant Pages
|