Online linear optimization and adaptive routing

Journal of Computer and System Sciences

Volumn 74, Issue 1, 2008, Pages 97-114

  Awerbuch, Baruch ^a   Kleinberg, Robert ^b  

^a Johns Hopkins University   (United States)

^b Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

Adaptive routing; Multi armed bandit problems; Online learning; Online optimization

Indexed keywords

ADAPTIVE ALGORITHMS; LINEAR PROGRAMMING; OPTIMIZATION; PROBLEM SOLVING; ROUTING ALGORITHMS;

ADAPTIVE ROUTING.; MULTI-ARMED BANDIT PROBLEMS; ONLINE LEARNING; ONLINE OPTIMIZATION;

ONLINE SYSTEMS;

EID: 35448960376     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2007.04.016     Document Type: Article

References (25)

1. Agrawal R. The continuum-armed bandit problem. SIAM J. Control Optim. 33 (1995) 1926-1951
2. Auer P., Cesa-Bianchi N., Freund Y., and Schapire R. The nonstochastic multiarmed bandit problem. SIAM J. Comput. 32 1 (2002) 48-77
3. B. Awerbuch, D. Holmer, H. Rubens, R. Kleinberg, Provably competitive adaptive routing, in: Proceedings of the 31st IEEE INFOCOM, vol. 1, Miami, 2005, pp. 631-641
4. B. Awerbuch, R. Kleinberg, Adaptive routing with end-to-end feedback: Distributed learning and geometric approaches, in: Proceedings of the 36th ACM Symposium on Theory of Computing, Chicago, 2004, pp. 45-53
5. B. Awerbuch, Y. Mansour, Adapting to a reliable network path, in: Proceedings of the 22nd Annual Symposium on Principles of Distributed Computing, Boston, 2003, pp. 360-367
6. Bareiss E.H. Sylverter's identity and multistep integers preserving Gaussian elimination. Math. Comp. 22 (1968) 565-578
7. J. Barnett, N. Srebro, Personal communication, February 2005
8. Bellman R. On a routing problem. Quart. Appl. Math. 16 1 (1958) 87-90
9. Berry D., and Fristedt B. Bandit Problems: Sequential Allocation of Experiments (1985), Chapman and Hall, London
10. Chen Y., Bindel D., Song H., and Katz R.H. An algebraic approach to practical and scalable overlay network monitoring. SIGCOMM '04: Proceedings of the 2004 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (2004), ACM Press, New York, NY 55-66
11. Cormen T.H., Leiserson C.E., Rivest R.L., and Stein C. Introduction to Algorithms. second ed. (2001), MIT Press, Cambridge, MA
12. V. Dani, T. Hayes, Robbing the bandit: Less regret in online geometric optimization against an adaptive adversary, in: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, Miami, 2006, pp. 937-943
13. A. Flaxman, A. Kalai, H.B. McMahan, Online convex optimization in the bandit setting: Gradient descent without a gradient, in: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, Vancouver, 2005, pp. 385-394
14. Ford L.R., and Fulkerson D.R. Flows in Networks (1962), Princeton University Press, Princeton
15. Freund Y., and Schapire R. A decision-theoretic generalization of on-line learning and an application to boosting. J. Comput. System Sci. 55 1 (1997) 119-139
16. Gittins J.C., and Jones D.M. A dynamic allocation index for the sequential design of experiments. In: Gani J., Sakadi K., and Vinczo I. (Eds). Progress in Statistics (1974), North-Holland, Amsterdam 241-266
17. Hannan J. Approximation to Bayes risk in repeated play. Contrib. Theory Games 3 (1957) 97-139
18. Kalai A., and Vempala S. Efficient algorithms for online decision problems. J. Comput. System Sci. 71 (2005) 291-307
19. Kleinberg R. Nearly tight bounds for the continuum-armed bandit problem. In: Saul L.K., Weiss Y., and Bottou L. (Eds). Advances in Neural Information Processing Systems 17, Proceedings of NIPS 2004 (2005), MIT Press, Cambridge, MA 697-704
20. Lai T.L., and Robbins H. Asymptotically efficient adaptive allocations rules. Adv. in Appl. Math. 6 (1985) 4-22
21. Littlestone N., and Warmuth M. The weighted majority algorithm. Inform. and Comput. 108 2 (1994) 212-260
22. McMahan H.B., and Blum A. Online geometric optimization in the bandit setting against an adaptive adversary. Proceedings of the 17th Annual Conference on Learning Theory, COLT. Lecture Notes in Comput. Sci. vol. 3120 (2004), Springer-Verlag 109-123
23. Shavitt Y., Sun X., Wool A., and Yener B. Computing the unmeasured: An algebraic approach to Internet mapping. IEEE J. Select. Areas Commun. 22 1 (2004) 67-78
24. Takimoto E., and Warmuth M. Path kernels and multiplicative updates. J. Mach. Learn. Res. 4 (2003) 773-818
25. M. Zinkevich, Online convex programming and generalized infinitesimal gradient ascent, in: Proceedings of the 20th International Conference on Machine Learning, 2003, pp. 928-936