Re: [computer-go] RE: Bayesian Pattern Ranking for Move Predictionin the Game of Go

[John Tromp <John.Tromp@xxxxxx>]

Thore Graepel wrote:
> Hi,
>
> I would like to let you know about a paper on move prediction using
> Bayesian pattern ranking that we just submitted to the NIPS conference.
>
> http://research.microsoft.com/~thoreg/papers/gopat-draft.pdf
dear Thore,

Thanks for making that available. Fascinating stuff.

Btw, I found some typos in the paper:
 the definition of h_a should list the domain as \cal{D}, not \hat{\cal{G}}.
 at the bottom of that page you say patterns are added to B,
 if they're not new.

I do have some problems understanding section 3
(not having a good statistics background)

What is diag()?
In P(v|c,s), what does random variable s represent?
Is it dependent on v or not?
Are latent scores depending only on a pattern, or also in the context
they occur in?
What does random variable x represent in equation (1)?
In the first line of (1), are the x() functions the random variables over
which the probability is defined?

As you can tell, I'd love to see this section expanded and accessible
to statistics dummies like me:)
I'll try to read some of Tom Minka's thesis to see if that clarifies matters.

Have you asked Frank how his prediction relates to yours?

And is any of the software that you wrote for harvesting and learning
available?

thanks!

regards,
-John
_______________________________________________
computer-go mailing list
computer-go@xxxxxxxxxxxxxxxxx
http://www.computer-go.org/mailman/listinfo/computer-go/