Efficient learning algorithms for changing environments

ACM International Conference Proceeding Series

Volumn 382, Issue , 2009, Pages

  Hazan, Elad ^a   Seshadhri, C ^a  

^a IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVITY; BEST DECISION; CHANGING ENVIRONMENT; COMPUTATIONAL OVERHEADS; DYNAMIC ALGORITHM; EFFICIENT LEARNING; LEARNING SCENARIOS; ONLINE LEARNING; ONLINE PORTFOLIOS; PERFORMANCE METRICES; TRANSFORM ALGORITHM;

ADAPTIVE ALGORITHMS; CARBON FIBER REINFORCED PLASTICS; COMPUTATIONAL EFFICIENCY; CONVEX OPTIMIZATION; EDUCATION; INTERNET; OPTIMIZATION; ROBOT LEARNING; STANDARDS;

LEARNING ALGORITHMS;

EID: 70049085900     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1553374.1553425     Document Type: Conference Paper

References (14)

1. Agarwal, A., Hazan, E., Kale, S., & Schapire, R. (2006). Algorithms for portfolio management based on the newton method. Proceedings of the 23rd International Conference on Machine Learning (ICML) (pp. 9-16).
2. Blum, A., & Mansour, Y. (2007). From external to internal regret. The Journal of Machine Learning Research, 8, 1307-1324.
3. Bousquet, O., & Warmuth, M. K. (2003). Tracking a small set of experts by mixing past posteriors. J. Mach. Learn. Res., 3, 363-396.
4. Cesa-Bianchi, N., & Lugosi, G. (2006). Prediction, learning, and games. Cambridge University Press.
5. Cover, T. (1991). Universal portfolios. Math. Finance, 1, 1-19.
6. Freund, Y., Schapire, R. E., Singer, Y., & Warmuth., M. K. (1997). Using and combining predictors that specialize. In Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing (pp. 334-343).
7. Gopalan, P., Jayram, T. S., Krauthgamer, R., & Kumar, R. (2007). Estimating the sortedness of a data stream. SODA (pp. 318-327). SIAM.
8. Hazan, E., Kalai, A., Kale, S., & Agarwal, A. (2006). Logarithmic regret algorithms for online convex optimization. Proceedings of 19th Annual Conference on Learning Theory, (COLT) (pp. 499-513).
9. Hazan, E., & Seshadhri, C. (2007). Adaptive algorithms for online decision problems. Electronic Colloquium on Computational Complexity (ECCC), 14.
10. Herbster, M., & Warmuth, M. K. (1998). Tracking the best expert. Mach. Learn., 32, 151-178.
11. Kozat, S., & Singer, A. (2007). Universal constant rebalanced portfolios with switching. IEEE International Conference on Acoustics, Speech and Signal Processing, (ICASSP) (pp. 1129-1132).
12. Lehrer, E. (2003). A wide range no-regret theorem. Games and Economic Behavior, 42, 101-115.
13. Woodruff, D. (2007). personal communications.
14. Zinkevich, M. (2003). Online convex programming and generalized innitesimal gradient ascent. Proceedings of the Twentieth International Conference (ICML) (pp. 928-936).