Minimax Policies for Combinatorial Prediction Games — mentioned by noelwelsh

Mon, 01 Aug 2011 15:01:16 GMT

I agree with the general thrust of what you're saying -- it's a hard problem and no amount of algorithmic finesse can get around the basic problem of the exponentially growing space. In the context of this post, however, I think you can still do a lot better than A/B testing or MVT :). Here's a paper that I think (I haven't read it in detail yet) addresses the problem you're talking about: http://arxiv.org/pdf/1105.4871v1 Another approach would be to model interactions as a (undirected?) Bayesian network and try to learn the structure of the network from data. I've had reasonable success…

Paper and discussion history. A mention is not an endorsement.

Minimax Policies for Combinatorial Prediction Games · HackerPapers discussions

Minimax Policies for Combinatorial Prediction Games — mentioned by noelwelsh