8 search results - page 1 / 2 » Generalized Sampling and Variance in Counterfactual Regret M... |
AAAI
2012
11 years 7 months ago
2012
In large extensive form games with imperfect information, Counterfactual Regret Minimization (CFR) is a popular, iterative algorithm for computing approximate Nash equilibria. Whi...
ATAL
2010
Springer
13 years 5 months ago
2010
Springer
Games are used to evaluate and advance Multiagent and Artificial Intelligence techniques. Most of these games are deterministic with perfect information (e.g. Chess and Checkers)....
COLT
1999
Springer
13 years 9 months ago
1999
Springer
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
JMLR
2010
12 years 11 months ago
2010
Concentration inequalities that incorporate variance information (such as Bernstein's or Bennett's inequality) are often significantly tighter than counterparts (such as...
CDC
2010
IEEE
12 years 11 months ago
2010
IEEE
This work deals with trajectory optimization for a network of robotic sensors sampling a spatio-temporal random field. We examine the problem of minimizing over the space of networ...