Lachlan Andrew
ABSTRACT
No abstract available.
- A. Blum and C. Burch, "On-line learning and the metrical task system problem," Machine Learning, vol. 39, pp. 35--58, 2000. Google Scholar
Digital Library
- 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.Google Scholar
- 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. Google ScholarDigital Library
- A. Blum, C. Burch, and A. Kalai, "Finely-competitive paging," in Proceedings of FOCS, 1999, pp. 450--457. Google ScholarDigital Library
- J. Abernethy, P. Bartlett, N. Buchbinder, and I. Stanton, "A regularization approach to metrical task systems," in Proceedings of ALT, 2010, pp. 270--284. Google ScholarDigital Library
- E. Hazan and C. Seshadhri, "Efficient learning algorithms for changing environments," in Proc. International Conference on Machine Learning. ACM, 2009, pp. 393--400. Google ScholarDigital Library
- A. Blum and Y. Mansour, "From external to internal regret," Learning Theory, pp. 1--10, 2005. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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.Google Scholar
- E. Hazan, A. Agarwal, and S. Kale, "Logarithmic regret algorithms for online convex optimization," Mach. Learn., vol. 69, pp. 169--192, Dec. 2007. Google ScholarDigital Library
- M. Lin, A. Wierman, L. L. H. Andrew, and E. Thereska, "Dynamic right-sizing for power-proportional data centers," in Proc. IEEE INFOCOM, 2011.Google ScholarCross Ref
Index Terms
- A tale of two metrics: simultaneous bounds on competitiveness and regret
Recommendations
A tale of two metrics: simultaneous bounds on competitiveness and regret
Performance evaluation reviewOnline Results for Black and White Bin Packing
In online bin packing problems, items of sizes in [0, 1] are to be partitioned into subsets of total size at most 1, called bins. We introduce a new variant where items are of two types, called black and white, and the item types must alternate in each ...
Online algorithms for 1-space bounded multi dimensional bin packing and hypercube packing
In this paper, we study 1-space bounded multi-dimensional bin packing and hypercube packing. A sequence of items arrive over time, each item is a d -dimensional hyperbox (in bin packing) or hypercube (in hypercube packing), and the length of each side ...
Comments