Re: [Computer-go] Monte-Carlo Tree Search as Regularized Policy Optimization

2020-07-16 Thread Rémi Coulom
This looks very interesting.

>From a quick glance, it seems the improvement is mainly when the number of
playouts is small. Also they don't test on the game of Go. Has anybody
tried it?

I will take a deeper look later.

On Thu, Jul 16, 2020 at 9:49 AM Ray Tayek  wrote:

>
> https://old.reddit.com/r/MachineLearning/comments/hrzooh/r_montecarlo_tree_search_as_regularized_policy/
>
>
> --
> Honesty is a very expensive gift. So, don't expect it from cheap people -
> Warren Buffett
> http://tayek.com/
>
> ___
> Computer-go mailing list
> Computer-go@computer-go.org
> http://computer-go.org/mailman/listinfo/computer-go
>
___
Computer-go mailing list
Computer-go@computer-go.org
http://computer-go.org/mailman/listinfo/computer-go


[Computer-go] Monte-Carlo Tree Search as Regularized Policy Optimization

2020-07-16 Thread Ray Tayek

https://old.reddit.com/r/MachineLearning/comments/hrzooh/r_montecarlo_tree_search_as_regularized_policy/


--
Honesty is a very expensive gift. So, don't expect it from cheap people - 
Warren Buffett
http://tayek.com/

___
Computer-go mailing list
Computer-go@computer-go.org
http://computer-go.org/mailman/listinfo/computer-go