I've been playing with an alpha beta searcher to see if it's feasible
using play-outs as an evaluation function in a program that does an
alpha beta global search.
I'm using the heavy play-out version of Lazarus and doing tests of up
to 3 ply searches on 9x9. The old 1500 ELO rated AnchorMan is a
Jason House wrote:
Given that doing one parameter at a time may be less ideal, I don't
know if my method would really inherit those properties or not.
Probably not, because the Hessian has significant non-diagonal values.
But I expect it would still converge in less iterations than MM.
On Dec 21, 2007 10:03 AM, Álvaro Begué <[EMAIL PROTECTED]> wrote:
> I am sure MM is a perfectly good algorithm for this purpose, but it has
> the serious down side that I don't understand it. :) I do understand the
> general idea behind it and how it works in some simple cases, but I don't
> know
On Dec 21, 2007 8:53 AM, Rémi Coulom <[EMAIL PROTECTED]> wrote:
> Hi,
>
> Minorization-maximization is a simple optimization method, and I agree
> that it is likely that more efficient algorithms can be applied.
>
> Newton's method implies estimating the inverse of the Hessian matrix.
> Really com
On Dec 21, 2007 8:53 AM, Rémi Coulom <[EMAIL PROTECTED]> wrote:
> Hi,
>
> Minorization-maximization is a simple optimization method, and I agree
> that it is likely that more efficient algorithms can be applied.
>
> Newton's method implies estimating the inverse of the Hessian matrix.
> Really com
Hi,
Minorization-maximization is a simple optimization method, and I agree
that it is likely that more efficient algorithms can be applied.
Newton's method implies estimating the inverse of the Hessian matrix.
Really computing the inverse has a cost cubic in the size of the matrix,
so it is
