On Mon, Jun 20, 2011 at 6:00 PM, Nick Wedd <[email protected]> wrote: > On 20/06/2011 21:03, Richard B Segal wrote: >> >> Hi All, >> >> As my scalability paper has come up several times in the last few weeks >> I thought it would be useful to give a brief overview of the results >> relevant to the current conversation and provide additional insights. >> >> The first set of experiments analyzed the scalability of Fuego on a >> single core machine without multithreading. The experiments consisted of >> 1,000 self-play games where one player received N minutes for all moves, >> and the second player receiving 2*N minutes for all moves. The resulting >> scaling graph looks qualitatively similar to the recent scaling graph >> posted for Pachi. The important observation is that the ELO gained >> between each successive doubling decreases as search time increases. If >> we assume this trend continues, then the ELO gained for each doubling >> will converge to zero forcing absolute performance to level off. > > Just a mathematical niggle here - > " ELO gained between each successive doubling decreases as search time > increases" does not imply convergence to an asymptote. An example of a > function to illustrate this is log(log(N)).
Yes, I was about to say the same thing. The existence of an asymptote is a feature of the model that was chosen to fit the curve (an exponential). I am suspicious of this type of extrapolation. Álvaro. _______________________________________________ Computer-go mailing list [email protected] http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
