Hedging structured concepts

COLT 2010 - The 23rd Conference on Learning Theory

Volumn , Issue , 2010, Pages 93-105

  Koolen, Wouter M ^a   Warmuth, Manfred K ^b   Kivinen, Jyrki ^c  

^a Advanced Systems Research Centrum Wiskunde en Informatica   (Netherlands)

^b University of California Santa Cruz   (United States)

^c UNIVERSITY OF HELSINKI   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

CONVEX COMBINATIONS; CURRENT PARAMETERS; MULTIPLICATIVE UPDATES; NON NEGATIVES; ON-LINE ALGORITHMS; OPTIMAL REGRET; PARAMETER VECTORS; PARTIAL PERMUTATIONS;

ALGORITHMS; COMPUTATIONAL GEOMETRY; WOODEN FENCES;

PARAMETER ESTIMATION;

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

References (27)

1. Jacob Abernethy, Elad Hazan, and Alexander Rakhlin. Competing in the dark: An efficient algorithm for bandit linear optimization. In In Proceedings of the 21st Annual Conference on Learning Theory (COLT, 2008).
2. Jacob Abernethy and Manfred K. Warmuth. Repeated games against budgeted adversaries. Unpublished manuscript.
3. Jake Abernethy, Manfred K. Warmuth, and Joel Yellin. When random play is optimal against an adversary. Journal version of [AWY08], in progress.
4. Jacob Abernethy, Manfred K. Warmuth, and Joel Yellin. Optimal strategies for random walks. In Proceedings of The 21st Annual Conference on Learning Theory, pages 437-446, July 2008.
5. Olivier Bousquet and Manfred K. Warmuth. Tracking a small set of experts by mixing past posteriors. Journal of Machine Learning Research, 3:363-396, 2002.
6. Nicolò Cesa-Bianchi, Yoav Freund, David Haussler, David P. Helmbold, Robert E. Schapire, and Manfred K. Warmuth. How to use expert advice. Journal of the ACM, 44(3):427-485, May 1997.
7. Nicolò Cesa-Bianchi and Gábor Lugosi. Prediction, Learning, and Games. Cambridge University Press, 2006.
8. Nicolò Cesa-Bianchi and Gábor Lugosi. Combinatorial bandits. In Proceedings of the 22nd Annual Conference on Learning Theory, 2009.
9. Yoav Freund and Robert E. Schapire. A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55:119-139, 1997.
10. Dan Gusfield. Connectivity and edge-disjoint spanning trees. Information Processing Letters, 16(2):87-89, 1983.
11. David Haussler, Jyrki Kivinen, and Manfred K. Warmuth. Sequential prediction of individual sequences under general loss functions. IEEE Transactions on Information Theory, 44(5):1906-1925, 1998.
12. Marcus Hutter and Jan Poland. Adaptive online prediction by following the perturbed leader. Journal of Machine Learning Research, 6:639-660, April 2005.
13. Mark Herbster and Manfred K. Warmuth. Tracking the best expert. Machine Learning, 32:151-178, 1998.
14. Mark Herbster and Manfred K. Warmuth. Tracking the best linear predictor. Journal of Machine Learning Research, 1:281-309, 2001.
15. David P. Helmbold and Manfred K. Warmuth. Learning permutations with exponential weights. Journal of Machine Learning Research, 10:1705-1736, July 2009.
16. Mark Jerrum, Alistair Sinclair, and Eric Vigoda. A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries. Journal of the ACM, 51(4):671-697, 2004.
17. Adam Kalai. A perturbation that makes "Follow the Leader" equivalent to "Randomized Weighted Majority,". Private communication, December 2005.
18. Terry Koo, Amir Globerson, Xavier Carreras, and Michael Collins. Structured prediction models via the Matrix-Tree theorem. In Proceedings of the 2007 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning (EMNLP-CoNLL), pages 141-150, 2007.
19. Adam Kalai and Santosh Vempala. Efficient algorithms for online decision problems. Journal of Computer and System Sciences, 71(3):291-307, 2005.
20. Dima Kuzmin and Manfred K. Warmuth. Optimum follow the leader algorithm. In Proceedings of the 18th Annual Conference on Learning Theory (COLT '05), pages 684-686. Springer-Verlag, June 2005. Open problem.
21. Nick Littlestone and Manfred K. Warmuth. The weighted majority algorithm. Information and Computation, 108(2):212-261,
22. 1994. Preliminary version appeared in the Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, 1989.
23. Thomas L. Magnanti and Laurence A. Wolsey. Optimal trees. In M. Ball, T.L. Magnanti, C.L. Monma, and G. L. Nemhauser, editors, Network Models, Volume 7 of Handbooks in Operations Research and Management Science, pages 503-615. North-Holland, 1995.
24. Alexander Schrijver. Combinatorial Optimization - Polyhedra and Efficiency. Springer-Verlag, Berlin, 2003.
25. Eiji Takimoto and Manfred K. Warmuth. Path kernels and multiplicative updates. Journal of Machine Learning Research, 4:773-818, 2003.
26. Manfred K. Warmuth, Karen Glocer, and S.V.N. Vishwanathan. Entropy regularized LPBoost. In Yoav Freund, László Györfi, György Turán, and Thomas Zeugmann, editors, Proceedings of the 19th International Conference on Algorithmic Learning Theory (ALT '08), pages 256-271. Springer-Verlag, October 2008.
27. Manfred K. Warmuth and Dima Kuzmin. Randomized online PCA algorithms with regret bounds that are logarithmic in the dimension. Journal of Machine Learning Research, 9:2287-2320, October 2008.