In the "progress on Loki" thread I created recently, I have written about my SPSA evaluation, texel tuning framework, which IMO works quite nicely. I think the gain from tuning the evaluation function of Loki was around 100-150 elo, and now I am beginning to think about search tuning.
I know some different gradient descent algorithms, but the problem is: I can't think of a way to calculate some sort of error function of the search... How do other people do it? By self-play?
I also know genetic algorithms can be used, but it seems a little cumbersome to convert every value to a string of bits (which also sets a boundary to the size of the parameter), so I think there are better ways to do this.
How are search parameters tuned normally?
Thanks in advance