No-regret algorithms for online convex programs

Advances in Neural Information Processing Systems

Volumn , Issue , 2007, Pages 489-496

  Gordon, Geoffrey J ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY SEARCH TREES; CONVEX PROGRAMS; EDGE LENGTH; EXPERT ADVICE; EXTENSIVE-FORM GAMES; GENERAL CLASS; LAGRANGIAN; LEARNING RULES; LEARNING TO PLAY; LINEAR CLASSIFIERS; POTENTIAL FUNCTION; REBALANCING; SHORTEST PATH;

BINARY TREES; TREES (MATHEMATICS);

LEARNING ALGORITHMS;

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

References (17)

1. Geoffrey J. Gordon. Approximate Solutions to Markov Decision Processes. PhD thesis, Carnegie Mellon University, 1999.
2. James F. Hannan. Approximation to Bayes risk in repeated play. InM. Dresher, A. Tucker, and P. Wolfe, editors, Contributions to the Theory of Games, volume 3, pages 97-139. Princeton University Press, 1957.
3. Martin Zinkevich. Online convex programming and generalized infinitesimal gradient ascent. In Proceedings of the Twentieth International Conference on Machine Learning. AAAI Press, 2003.
4. Adam Kalai and Santosh Vempala. Geometric algorithms for online optimization. Technical Report MIT-LCS-TR-861, Massachusetts Institute of Technology, 2002.
5. Yoav Freund and Robert E. Schapire. A decision-theoretic generalization of on-line learning and an application to boosting. In EuroCOLT 95, pages 23-37. Springer-Verlag, 1995.
6. Geoffrey J. Gordon. No-regret algorithms for structured prediction problems. Technical Report CMU-CALD-05-112, Carnegie Mellon University, 2005.
7. Nicolò Cesa-Bianchi and Gábor Lugosi. Potential-based algorithms in on-line prediction and game theory. Machine Learning, 51:239-261, 2003.
8. David Blackwell. An analogue of the minimax theorem for vector payoffs. Pacific Journal of Mathematics, 6(1):1-8, 1956.
9. Shai Shalev-Shwartz and Yoram Singer. Convex repeated games and Fenchel duality. In B. Schölkopf, J.C. Platt, and T. Hofmann, editors, Advances in Neural Information Processing Systems, volume 19, Cambridge, MA, 2007. MIT Press.
10. David P. Helmbold and Robert E. Schapire. Predicting nearly as well as the best pruning of a decision tree. In Proceedings of COLT, pages 61-68, 1995.
11. Eiji Takimoto andManfredWarmuth. Path kernels and multiplicative updates. In COLT, 2002.
12. R. Tyrell Rockafellar. Convex Analysis. Princeton University Press, New Jersey, 1970.
13. Nick Littlestone and Manfred Warmuth. The weighted majority algorithm. Technical Report UCSC-CRL-91-28, University of California Santa Cruz, 1992.
14. Sergiu Hart and Andreu Mas-Colell. A simple adaptive procedure leading to correlated equilibrium. Econometrica, 68(5):1127-1150, 2000.
15. H. Brendan McMahan, Geoffrey J. Gordon, and Avrim Blum. Planning in the presence of cost functions controlled by an adversary. In Proceedings of the Twentieth International Conference on Machine Learning, 2003.
16. David P. Helmbold and Robert E. Schapire. Predicting nearly as well as the best pruning of a decision tree. In COLT, 1995.
17. D. Koller, N. Meggido, and B. von Stengel. Efficient computation of equilibria for extensive two-person games. Games and Economic Behaviour, 14(2), 1996.