{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T07:07:08Z","timestamp":1774940828161,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642158827","type":"print"},{"value":"9783642158834","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15883-4_20","type":"book-chapter","created":{"date-parts":[[2010,8,17]],"date-time":"2010-08-17T05:29:46Z","timestamp":1282022986000},"page":"305-320","source":"Crossref","is-referenced-by-count":11,"title":["Online Learning in Adversarial Lipschitz Environments"],"prefix":"10.1007","author":[{"given":"Odalric-Ambrym","family":"Maillard","sequence":"first","affiliation":[]},{"given":"R\u00e9mi","family":"Munos","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546921","volume-title":"Prediction, Learning, and Games","author":"N. Cesa-Bianchi","year":"2006","unstructured":"Cesa-Bianchi, N., Lugosi, G.: Prediction, Learning, and Games. Cambridge University Press, New York (2006)"},{"key":"20_CR2","first-page":"322","volume-title":"Proceedings of the 36th Annual Symposium on Foundations of Computer Science","author":"P. Auer","year":"1995","unstructured":"Auer, P., Cesa-bianchi, N., Freund, Y., Schapire, R.E.: Gambling in a rigged casino: The adversarial multi-armed bandit problem. In: Proceedings of the 36th Annual Symposium on Foundations of Computer Science, pp. 322\u2013331. IEEE Computer Society Press, Los Alamitos (1995)"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Auer, P., Cesa-bianchi, N., Freund, Y., Schapire, R.E.: The non-stochastic multiarmed bandit problem. SIAM Journal on Computing 32 (2002)","DOI":"10.1137\/S0097539701398375"},{"issue":"1-3","key":"20_CR4","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.tcs.2008.02.024","volume":"397","author":"J. Poland","year":"2008","unstructured":"Poland, J.: Nonstochastic bandits: Countable decision set, unbounded costs and reactive environments. Theor. Comput. Sci.\u00a0397(1-3), 77\u201393 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"20_CR5","first-page":"345","volume-title":"Advances in Neural Information Processing Systems 20","author":"V. Dani","year":"2008","unstructured":"Dani, V., Hayes, T., Kakade, S.: The price of bandit information for online optimization. In: Platt, J., Koller, D., Singer, Y., Roweis, S. (eds.) Advances in Neural Information Processing Systems 20, pp. 345\u2013352. MIT Press, Cambridge (2008)"},{"key":"20_CR6","unstructured":"Abernethy, J., Hazan, E., Rakhlin, A.: Competing in the dark: An efficient algorithm for bandit linear optimization. In: Servedio, R.A., Zhang, T. (eds.) Conference on Learning Theory, pp. 263\u2013274. Omnipress (2008)"},{"key":"20_CR7","unstructured":"Cesa-Bianchi, N., Lugosi, G.: Combinatorial bandits. In: Conference on Learning Theory (2009)"},{"key":"20_CR8","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1145\/1390156.1390212","volume-title":"Proceedings of the 25th International Conference on Machine learning","author":"S.M. Kakade","year":"2008","unstructured":"Kakade, S.M., Shalev-Shwartz, S., Tewari, A.: Efficient bandit algorithms for online multiclass prediction. In: Proceedings of the 25th International Conference on Machine learning, pp. 440\u2013447. ACM, New York (2008)"},{"key":"20_CR9","unstructured":"Auer, P.: Using confidence bounds for exploitation-exploration trade-offs. Journal of Machine Learning Research, 397\u2013422 (2002)"},{"key":"20_CR10","unstructured":"Dani, V., Hayes, T.P., Kakade, S.M.: Stochastic linear optimization under bandit feedback (2008) (in submission)"},{"key":"20_CR11","unstructured":"Zinkevich, M.: Online convex programming and generalized infinitesimal gradient ascent. In: International Conference on Machine learning, pp. 928\u2013936 (2003)"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Hazan, E., Agarwal, A., Kale, S.: Logarithmic regret algorithms for online convex optimization. In: Conference on Learning Theory, pp. 499\u2013513 (2006)","DOI":"10.1007\/11776420_37"},{"key":"20_CR13","volume-title":"Advances in Neural Information Processing Systems","author":"P. Bartlett","year":"2007","unstructured":"Bartlett, P., Hazan, E., Rakhlin, A.: Adaptive online gradient descent. In: Platt, J.C., Koller, D., Singer, Y., Roweis, S.T. (eds.) Advances in Neural Information Processing Systems. MIT Press, Cambridge (2007)"},{"key":"20_CR14","unstructured":"Shalev-Shwartz, S.: Online Learning: Theory, Algorithms, and Applications. PhD thesis (July 2007)"},{"key":"20_CR15","first-page":"385","volume-title":"Proceedings of the sixteenth annual ACM-SIAM Symposium on Discrete algorithms","author":"A.D. Flaxman","year":"2005","unstructured":"Flaxman, A.D., Kalai, A.T., McMahan, H.B.: Online convex optimization in the bandit setting: gradient descent without a gradient. In: Proceedings of the sixteenth annual ACM-SIAM Symposium on Discrete algorithms, pp. 385\u2013394. SIAM, Philadelphia (2005)"},{"key":"20_CR16","unstructured":"Abernethy, J.D., Bartlett, P., Rakhlin, A., Tewari, A.: Optimal strategies and minimax lower bounds for online convex games. Technical Report UCB\/EECS-2008-19, EECS Department, University of California, Berkeley (February 2008)"},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"Kleinberg, R., Slivkins, A., Upfal, E.: Multi-armed bandit problems in metric spaces. In: Proceedings of the 40th ACM Symposium on Theory of Computing, pp. 681\u2013690 (2008)","DOI":"10.1145\/1374376.1374475"},{"key":"20_CR18","unstructured":"Bubeck, S., Munos, R., Stoltz, G., Szepesv\u00e1ri, C.: Online optimization of X-armed bandits. In: Advances in Neural Information Processing Systems (2008)"},{"key":"20_CR19","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1006\/inco.1994.1009","volume":"108","author":"N. Littlestone","year":"1994","unstructured":"Littlestone, N., Warmuth, M.: The weighted majority algorithm. Information and Computation\u00a0108, 212\u2013261 (1994)","journal-title":"Information and Computation"},{"issue":"3","key":"20_CR20","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1145\/258128.258179","volume":"44","author":"N. Cesa-Bianchi","year":"1997","unstructured":"Cesa-Bianchi, N., Freund, Y., Haussler, D., Helmbold, D.P., Shapire, R., Warmuth, M.: How to use expert advice. Journal of the ACM\u00a044(3), 427\u2013485 (1997)","journal-title":"Journal of the ACM"},{"key":"20_CR21","doi-asserted-by":"crossref","unstructured":"Auer, P., Cesa-bianchi, N., Gentile, C.: Adaptive and self-confident on-line learning algorithms. Journal of Computer and System Sciences 64 (2000)","DOI":"10.1006\/jcss.2001.1795"},{"key":"20_CR22","unstructured":"Stoltz, G.: Incomplete information and internal regret in prediction of individual sequences. PhD thesis (2005)"},{"key":"20_CR23","volume-title":"Markov Chain Monte Carlo in Practice","author":"W. Gilks","year":"1996","unstructured":"Gilks, W., Richardson, S., Spiegelhalter, D.: Markov Chain Monte Carlo in Practice. Chapman Hall\/CRC, Boca Raton (1996)"},{"key":"20_CR24","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1020281327116","volume":"50","author":"C. Andrieu","year":"2003","unstructured":"Andrieu, C., De Freitas, N., Doucet, A., Jordan, M.: An introduction to mcmc for machine learning. Journal of Machine Learning Research\u00a050, 5\u201343 (2003)","journal-title":"Journal of Machine Learning Research"},{"key":"20_CR25","doi-asserted-by":"crossref","DOI":"10.1090\/mbk\/058","volume-title":"Markov Chains and Mixing Times","author":"D.A. Levin","year":"2008","unstructured":"Levin, D.A., Peres, Y., Wilmer, E.L.: Markov Chains and Mixing Times. American Mathematical Society, Providence (2008)"},{"key":"20_CR26","doi-asserted-by":"crossref","unstructured":"Douc, R., Guillin, A., Marin, J., Robert, C.: Minimum variance importance sampling via population monte carlo. Esaim P&S 11 (2007)","DOI":"10.1051\/ps:2007028"},{"key":"20_CR27","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1007\/978-1-4684-9393-1","volume-title":"Feynman-Kac formulae : genealogical and interacting particle systems with applications\/Pierre Del Moral","author":"P. Moral Del","year":"2004","unstructured":"Del Moral, P.: Feynman-Kac formulae: genealogical and interacting particle systems with applications\/Pierre Del Moral, p. 555. Springer, Heidelberg (2004)"},{"key":"20_CR28","volume-title":"Pattern Recognition and Machine Learning (Information Science and Statistics)","author":"C.M. Bishop","year":"2006","unstructured":"Bishop, C.M.: Pattern Recognition and Machine Learning (Information Science and Statistics). Springer, Heidelberg (2006)"},{"key":"20_CR29","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0711-5","volume-title":"A Probabilistic Theory of Pattern Recognition","author":"L. Devroye","year":"1996","unstructured":"Devroye, L., Gy\u00f6rfi, L., Lugosi, G.: A Probabilistic Theory of Pattern Recognition. Springer, New York (1996)"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15883-4_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:42:13Z","timestamp":1606167733000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15883-4_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642158827","9783642158834"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15883-4_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}