16 search results - page 3 / 4 » No-regret learning in convex games |
SIAMJO
2008
13 years 6 months ago
2008
This paper concerns a fractional function of the form xT a/ xT Bx, where B is positive definite. We consider the game of choosing x from a convex set, to maximize the function, an...
ML
2010
ACM
13 years 1 months ago
2010
ACM
Traditional classification methods assume that the training and the test data arise from the same underlying distribution. However, in several adversarial settings, the test set is...
ICML
2007
IEEE
14 years 7 months ago
2007
IEEE
Given observed data and a collection of parameterized candidate models, a 1- confidence region in parameter space provides useful insight as to those models which are a good fit t...
NIPS
2008
13 years 7 months ago
2008
Bartlett et al (2006) recently proved that a ground condition for convex surrogates, classification calibration, ties up the minimization of the surrogates and classification risk...
COLT
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. We provide a natural learning process in which the joint frequency of empirical play converges into the set of convex combinations of Nash equilibria. In this process, al...