Convex repeated games and Fenchel duality

Advances in Neural Information Processing Systems

Volumn , Issue , 2007, Pages 1265-1272

  Shalev Shwartz, Shai ^a   Singer, Yoram ^a,b  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b GOOGLE INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACT GAMES; ALGORITHMIC FRAMEWORK; BOOSTING ALGORITHM; FENCHEL DUALITY; ONLINE LEARNING; REPEATED GAMES; WEAK DUALITY;

CONVEX OPTIMIZATION; GAME THEORY;

ALGORITHMS;

EID: 84864036264     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. J. Borwein and A. Lewis. Convex Analysis and Nonlinear Optimization. Springer, 2006.
2. S. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press, 2004.
3. N. Cesa-Bianchi and G. Lugosi. Prediction, learning, and games. Cambridge University Press, 2006.
4. M. Collins, R.E. Schapire, and Y. Singer. Logistic regression, AdaBoost and Bregman distances. Machine Learning, 2002.
5. K. Crammer, O. Dekel, J. Keshet, S. Shalev-Shwartz, and Y. Singer. Online passive aggressive algorithms. JMLR, 7, Mar 2006.
6. Y. Freund and R.E. Schapire. A decision-theoretic generalization of on-line learning and an application to boosting. In EuroCOLT, 1995.
7. Y. Freund and R.E. Schapire. Game theory, on-line prediction and boosting. In COLT, 1996.
8. J. Friedman, T. Hastie, and R. Tibshirani. Additive logistic regression: a statistical view of boosting. Annals of Statistics, 28(2), 2000.
9. G. Gordon. Regret bounds for prediction problems. In COLT, 1999.
10. G. Gordon. No-regret algorithms for online convex programs. In NIPS, 2006.
11. A. J. Grove, N. Littlestone, and D. Schuurmans. General convergence results for linear discriminant updates. Machine Learning, 43(3), 2001.
12. J. Kivinen and M. Warmuth. Relative loss bounds for multidimensional regression problems. Journal of Machine Learning, 45(3),2001.
13. L. Mason, J. Baxter, P. Bartlett, and M. Frean. Functional gradient techniques for combining hypotheses. In Advances in Large Margin Classifiers. MIT Press, 1999.
14. Y. Nesterov. Primal-dual subgradient methods for convex problems. Technical report, Center for Operations Research and Econometrics (CORE), Catholic University of Louvain (UCL), 2005.
15. R. E. Schapire and Y. Singer. Improved boosting algorithms using confidence-rated predictions. Machine Learning, 37(3):1-40, 1999.
16. S. Shalev-Shwartz and Y. Singer. Convex repeated games and fenchel duality. Technical report, The Hebrew University, 2006.
17. S. Shalev-Shwartz and Y. Singer. Online learning meets optimization in the dual. In COLT, 2006.
18. J. Weston and C. Watkins. Support vector machines for multi-class pattern recognition. In ESANN, April 1999.
19. M. Zinkevich. Online convex programming and generalized infinitesimal gradient ascent. In ICML, 2003.