[Computer-go] Possible approach to prove CLOP convergence?

Rémi Coulom Remi.Coulom at free.fr
Wed Nov 9 01:57:04 PST 2011

I have no idea. I did not really spend any time trying to prove mathematically that CLOP works. Another source of ideas might be that paper about a similar method, where they propose a proof of convergence:
But the algorithm is extremely complicated, and I did not understand that proof (they don't give details, only theorems). I wonder how they can have theorems that have no probabilities or expectations in them, when they have noisy measurements. I expect any convergence proof should be a proof of stochastic convergence (ie, almost sure, with probability one, ...).


On 9 nov. 2011, at 01:34, Brian Sheppard wrote:

> Is it possible that convergence properties of CLOP can be established by
> relating it to Boosted Regression?
> The successive exponential weights remind me of boosting...
> Brian
> _______________________________________________
> Computer-go mailing list
> Computer-go at dvandva.org
> http://dvandva.org/cgi-bin/mailman/listinfo/computer-go

More information about the Computer-go mailing list