A tale of two metrics: Simultaneous bounds on competitiveness and regret

Performance Evaluation Review

Volumn 41, Issue 1 SPEC. ISS., 2013, Pages 329-330

  Andrew, Lachlan ^a   Barman, Siddharth ^b   Liggett, Katrina ^b   Lin, Minghong ^b   Meyerson, Adam ^c   Roytman, Alan ^d   Wierman, Adam ^b  

^a SWINBURNE UNIVERSITY OF TECHNOLOGY   (Australia)

^b CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

^c GOOGLE INC   (United States)

^d UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84880243031     PISSN: 01635999     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2494232.2465533     Document Type: Conference Paper

References (11)

1. A. Blum and C. Burch, "On-line learning and the metrical task system problem," Machine Learning, vol. 39, pp. 35-58, 2000.
2. N. Buchbinder, S. Chen, J. Naor, and O. Shamir, "Unified algorithms for online learning and competitive analysis," in Proc. Conf. on Learning Techniques (COLT), 2012.
3. A. Blum, S. Chawla, and A. Kalai, "Static optimality and dynamic search-optimality in lists and trees," in Proceedings of SODA, 2002, pp. 1-8.
4. A. Blum, C. Burch, and A. Kalai, "Finely-competitive paging," in Proceedings of FOCS, 1999, pp. 450-457.
5. J. Abernethy, P. Bartlett, N. Buchbinder, and I. Stanton, "A regularization approach to metrical task systems," in Proceedings of ALT, 2010, pp. 270-284.
6. E. Hazan and C. Seshadhri, "Efficient learning algorithms for changing environments," in Proc. International Conference on Machine Learning. ACM, 2009, pp. 393-400.
7. A. Blum and Y. Mansour, "From external to internal regret," Learning Theory, pp. 1-10, 2005.
8. A. Blum, H. Karloff, Y. Rabani, and M. Saks, "A decomposition theorem and bounds for randomized server problems," in Proc. IEEE Symp. Foundations of Computer Science (FOCS), 1992.
9. M. Zinkevich, "Online convex programming and generalized infinitesimal gradient ascent," in Proc. Int. Conf. Machine Learning (ICML), T. Fawcett and N. Mishra, Eds. AAAI Press, 2003, pp. 928-936.
10. E. Hazan, A. Agarwal, and S. Kale, "Logarithmic regret algorithms for online convex optimization," Mach. Learn., vol. 69, pp. 169-192, Dec. 2007.
11. M. Lin, A. Wierman, L. L. H. Andrew, and E. Thereska, "Dynamic right-sizing for power-proportional data centers," in Proc. IEEE INFOCOM, 2011.