{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T08:36:37Z","timestamp":1774946197225,"version":"3.50.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2010,4,29]],"date-time":"2010-04-29T00:00:00Z","timestamp":1272499200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2010,9]]},"DOI":"10.1007\/s10994-010-5178-7","type":"journal-article","created":{"date-parts":[[2010,4,28]],"date-time":"2010-04-28T20:18:46Z","timestamp":1272485926000},"page":"245-272","source":"Crossref","is-referenced-by-count":75,"title":["Regret bounds for sleeping experts and bandits"],"prefix":"10.1007","volume":"80","author":[{"given":"Robert","family":"Kleinberg","sequence":"first","affiliation":[]},{"given":"Alexandru","family":"Niculescu-Mizil","sequence":"additional","affiliation":[]},{"given":"Yogeshwer","family":"Sharma","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,4,29]]},"reference":[{"key":"5178_CR1","unstructured":"Audibert, J.-Y., & Bubeck, S. (2009). Minimax policies for adversarial and stochastic bandits. In Proceedings of the 22nd conference on learning theory (COLT)."},{"key":"5178_CR2","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1023\/A:1013689704352","volume":"47","author":"P. Auer","year":"2002","unstructured":"Auer, P., Cesa-Bianchi, N., & Fischer, P. (2002a). Finite-time analysis of the multiarmed bandit problem. Machine Learning, 47, 235\u2013256.","journal-title":"Machine Learning"},{"key":"5178_CR3","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1137\/S0097539701398375","volume":"32","author":"P. Auer","year":"2002","unstructured":"Auer, P., Cesa-Bianchi, N., Freund, Y., & Schapire, R. E. (2002b). The nonstochastic multiarmed bandit problem. SIAM Journal on Computing, 32, 48\u201377.","journal-title":"SIAM Journal on Computing"},{"key":"5178_CR4","doi-asserted-by":"crossref","first-page":"357","DOI":"10.2748\/tmj\/1178243286","volume":"19","author":"K. Azuma","year":"1967","unstructured":"Azuma, K. (1967). Weighted sums of certain dependent random variables. Tohoku Mathematical Journal, 19, 357\u2013367.","journal-title":"Tohoku Mathematical Journal"},{"key":"5178_CR5","doi-asserted-by":"crossref","unstructured":"Blum, A., & Mansour, Y. (2005). From external to internal regret. In Proceedings of the 18th conference on learning theory (COLT) (pp.\u00a0621\u2013636).","DOI":"10.1007\/11503415_42"},{"key":"5178_CR6","doi-asserted-by":"crossref","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., Schapire, R. E., & Warmuth, M. K. (1997). How to use expert advice. Journal of ACM, 44, 427\u2013485.","journal-title":"Journal of ACM"},{"key":"5178_CR7","volume-title":"Elements of information theory","author":"T. M. Cover","year":"1999","unstructured":"Cover, T. M., & Thomas, J. A. (1999). Elements of information theory. New York: Wiley."},{"key":"5178_CR8","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1006\/game.1999.0738","volume":"29","author":"Y. Freund","year":"1999","unstructured":"Freund, Y., & Schapire, R. E. (1999). Adaptive game playing using multiplicative weights. Games and Economic Behavior, 29, 79\u2013103.","journal-title":"Games and Economic Behavior"},{"key":"5178_CR9","doi-asserted-by":"crossref","unstructured":"Freund, Y., Schapire, R. E., Singer, Y., & Warmuth, M. K. (1997). Using and combining predictors that specialize. In Proceedings of the 29th ACM symp. on theory of computing (STOC) (pp.\u00a0334\u2013343).","DOI":"10.1145\/258533.258616"},{"key":"5178_CR10","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"M. R. Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: a guide to the theory of NP-completeness. New York: Freeman."},{"key":"5178_CR11","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1111\/j.2517-6161.1979.tb01068.x","volume":"41","author":"J. C. Gittins","year":"1979","unstructured":"Gittins, J. C. (1979). Bandit processes and dynamic allocation indices. Journal of the Royal Statistical Society, Series B, 41, 148\u2013177.","journal-title":"Journal of the Royal Statistical Society, Series B"},{"key":"5178_CR12","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1093\/biomet\/66.3.561","volume":"66","author":"J. C. Gittins","year":"1979","unstructured":"Gittins, J. C., & Jones, D. M. (1979). A dynamic allocation index for the discounted multiarmed bandit problem. Biometrika, 66, 561\u2013565.","journal-title":"Biometrika"},{"key":"5178_CR13","first-page":"97","volume-title":"Contributions to the theory of games","author":"J. Hannan","year":"1957","unstructured":"Hannan, J. (1957). Approximation to Bayes risk in repeated plays. In M.\u00a0Dresher, A.\u00a0Tucker, & P.\u00a0Wolfe (Eds.), Contributions to the theory of games (pp. 97\u2013139). Princeton: Princeton University Press."},{"key":"5178_CR14","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","volume":"58","author":"W. Hoeffding","year":"1963","unstructured":"Hoeffding, W. (1963). Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 58, 13\u201330.","journal-title":"Journal of the American Statistical Association"},{"key":"5178_CR15","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/j.jcss.2004.10.016","volume":"71","author":"A. T. Kalai","year":"2005","unstructured":"Kalai, A. T., & Vempala, S. (2005). Efficient algorithms for on-line optimization. Journal of Computer and System Sciences, 71, 291\u2013307.","journal-title":"Journal of Computer and System Sciences"},{"key":"5178_CR16","unstructured":"Karp, R. M., & Kleinberg, R. (2007). Noisy binary search and its applications. In Proceedings of the 18th ACM-SIAM symp. discrete algorithms (SODA) (pp.\u00a0881\u2013890)."},{"key":"5178_CR17","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01192399","volume":"18","author":"A. Khintchine","year":"1923","unstructured":"Khintchine, A. (1923). \u00dcber dyadische Br\u00fcche. Mathematische Zeitschsift, 18, 109\u2013116.","journal-title":"Mathematische Zeitschsift"},{"key":"5178_CR18","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1016\/0196-8858(85)90002-8","volume":"6","author":"T. L. Lai","year":"1985","unstructured":"Lai, T. L., & Robbins, H. (1985). Asymptotically efficient adaptive allocations rules. Advances in Applied Mathematics, 6, 4\u201322.","journal-title":"Advances in Applied Mathematics"},{"key":"5178_CR19","unstructured":"Langford, J., & Zhang, T. (2007). The Epoch-Greedy algorithm for multiarmed bandits with side information. In Proceedings of the 21st conference on neural information processing systems (NIPS)."},{"key":"5178_CR20","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1006\/inco.1994.1009","volume":"108","author":"N. Littlestone","year":"1994","unstructured":"Littlestone, N., & Warmuth, M. K. (1994). The weighted majority algorithm. Information and Computation, 108, 212\u2013261. An extended abstract appeared in IEEE symposium on foundations of computer science, 1989 (pp.\u00a0256\u2013261).","journal-title":"Information and Computation"},{"key":"5178_CR21","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1090\/S0002-9904-1952-09620-8","volume":"58","author":"H. Robbins","year":"1952","unstructured":"Robbins, H. (1952). Some aspects of the sequential design of experiments. Bulletin of the American Mathematical Society, 58, 527\u2013535.","journal-title":"Bulletin of the American Mathematical Society"},{"key":"5178_CR22","doi-asserted-by":"crossref","unstructured":"Vovk, V. G. (1990). Aggregating strategies. In Proceedings of the 3rd conference on learning theory (COLT) (pp.\u00a0371\u2013386).","DOI":"10.1016\/B978-1-55860-146-8.50032-1"},{"key":"5178_CR23","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1006\/jcss.1997.1556","volume":"56","author":"V. G. Vovk","year":"1998","unstructured":"Vovk, V. G. (1998). A game of prediction with expert advice. Journal of Computer and System Sciences, 56, 153\u2013173. An extended abstract appeared in COLT, 1995 (pp.\u00a051\u201360).","journal-title":"Journal of Computer and System Sciences"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/link.springer.com\/content\/pdf\/10.1007\/s10994-010-5178-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/link.springer.com\/article\/10.1007\/s10994-010-5178-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/link.springer.com\/content\/pdf\/10.1007\/s10994-010-5178-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T08:08:20Z","timestamp":1740038900000},"score":1,"resource":{"primary":{"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/link.springer.com\/10.1007\/s10994-010-5178-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,4,29]]},"references-count":23,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2010,9]]}},"alternative-id":["5178"],"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1007\/s10994-010-5178-7","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,4,29]]}}}