Online Convex Programming and Generalized Infinitesimal Gradient Ascent

Proceedings, Twentieth International Conference on Machine Learning

Volumn 2, Issue , 2003, Pages 928-935

  Zinkevich, Martin ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COSTS; ERROR ANALYSIS; FUNCTIONS; LEAST SQUARES APPROXIMATIONS; OPTIMIZATION; PROBABILITY; PROBLEM SOLVING; REGRESSION ANALYSIS;

CONVEX PROGRAMMING; GENERALIZED INFINITESIMAL GRADIENT ASCENT (GIGA); SUPPORT VECTOR MACHINES (SVM);

LEARNING SYSTEMS;

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

References (27)

1. Amari, S. (1998). Natural gradient works efficiently in learning. Neural Computation, 10, 251-276.
2. Bansal, N., Blum, A., Chawla, S., & Meyerson, A. (2003). Online oblivious routing. Fifteenth ACM Symposium on Parallelism in Algorithms and Architecture.
3. Blackwell, D. (1956). An analog of the minimax theorem for vector payoffs. South Pacific J. of Mathematics, 1-8.
4. Boot, J. (2003). Quadratic programming: Algorithms, anomalies, applications. Rand McNally & Co.
5. Boser, B., Guyon, I., & Vapnik, V. (1992). A training algorithm for optimal margin classifiers. Proceedings of the Fifth Annual Conference on Computational Learning Theory.
6. Boyd, S., & Vandenberghe, L. (2003). Convex optimization. In press, available at http://www.Stanford.edu/~boyd/cvxbook.html.
7. Cameron, N. (1985). Introduction to linear and convex programming. Cambridge University Press.
8. Cesa-Bianchi, N., Long, P., & Warmuth, M. K. (1994). Worst-case quadratic bounds for on-line prediction of linear functions by gradient descent. IEEE Transactions on Neural Networks, 7, 604-619.
9. Della Pietra, S., Della Pietra, V., & Lafferty, J. (1999). Duality and auxilary functions for Bregman distances (Technical Report CMU-CS-01-109). Carnegie Mellon University.
10. Foster, D. (1999). A proof of calibration via Black-well's approachability theorem. Games and Economic Behavior (pp. 73-79).
11. Foster, D., & Vohra, R. (1999). Regret in the on-line decision problem. Games and Economic Behavior, 29, 7-35.
12. Freund, Y., & Schapire, R. (1999). Adaptive game playing using multiplicative weights. Games and Economic Behavior (pp. 79-103).
13. Fudenberg, D., & Levine, D. (1995). Universal consistency and cautious fictitious play. Journal of Economic Dynamics and Control, 19, 1065-1089.
14. Fudenberg, D., & Levine, D. (1997). Conditional universal consistency. Available at http://ideas.repec.org/s/cla/levarc.html.
15. Gordon, G. (1999). Approximate solutions to markov decision processes. Doctoral dissertation, Carnegie Mellon University.
16. Hannan, J. (1957). Approximation to bayes risk in repeated play. Annals of Mathematics Studies, 39, 97-139.
17. Hart, S., & Mas-Colell, A. (2000). A simple adaptive procedure leading to correlated equilibrium. Econometrica, 68, 1127-1150.
18. Hart, S., & Mas-Colell, A. (2001). A general class of adaptive strategies. Journal of Economic Theory, 98, 26-54.
19. Hastie, T., Tibishirani, R., & Friedman, J. (2001). The elements of statistical learning. Springer.
20. Herbster, M., & Warmuth, M. K. (2001). Tracking the best linear predictor. Journal of Machine Learning Research, 1, 281-309.
21. Kalai, A., & Vempala, S. (2002). Geometric algorithms for online optimization (Technical Report). MIT.
22. Kivinen, J., & Warmuth, M. (1997). Exponentiated gradient versus gradient descent for linear predictors. Information and Computation, 132, 1-64.
23. Kivinen, J., & Warmuth, M. (2001). Relative loss bounds for multidimensional regression problems. Machine Learning Journal, 45, 301-329.
24. Littlestone, N., & Warmuth, M. K. (1989). The weighted majority algorithm. Proceedings of the Second Annual Conference on Computational Learning Theory.
25. Mahony, R., & Williamson, R. (2001). Prior knowledge and preferential structures in gradient descent algorithms. Journal of Machine Learning Research, 1, 311-355.
26. Singh, S., Kearns, M., & Mansour, Y. (2000). Nash convergence of gradient dynamics in general-sum games. Proceedings of the Sixteenth Conference in Uncertainty in Artificial Intelligence (pp. 541-548).
27. Zinkevich, M. (2003). Online convex programming and generalized infinitesimal gradient ascent (Technical Report CMU-CS-03-110). CMU.