{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:45:00Z","timestamp":1725558300051},"publisher-location":"Berlin, Heidelberg","reference-count":41,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642137990"},{"type":"electronic","value":"9783642138003"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13800-3_7","type":"book-chapter","created":{"date-parts":[[2010,6,18]],"date-time":"2010-06-18T02:35:53Z","timestamp":1276828553000},"page":"82-96","source":"Crossref","is-referenced-by-count":11,"title":["Algorithm Selection as a Bandit Problem with Unbounded Losses"],"prefix":"10.1007","author":[{"given":"Matteo","family":"Gagliolo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00fcrgen","family":"Schmidhuber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","first-page":"65","volume-title":"Advances in Computers","author":"J.R. Rice","year":"1976","unstructured":"Rice, J.R.: The algorithm selection problem. In: Rubinoff, M., Yovits, M.C. (eds.) Advances in Computers, vol.\u00a015, pp. 65\u2013118. Academic Press, New York (1976)"},{"issue":"2","key":"7_CR2","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1023\/A:1019956318069","volume":"18","author":"R. Vilalta","year":"2002","unstructured":"Vilalta, R., Drissi, Y.: A perspective view and survey of meta-learning. Artif. Intell. Rev.\u00a018(2), 77\u201395 (2002)","journal-title":"Artif. Intell. Rev."},{"key":"7_CR3","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1007\/978-3-540-30115-8_15","volume-title":"Machine Learning: ECML 2004","author":"M. Gagliolo","year":"2004","unstructured":"Gagliolo, M., Zhumatiy, V., Schmidhuber, J.: Adaptive online time allocation to search algorithms. In: Boulicaut, J.-F., Esposito, F., Giannotti, F., Pedreschi, D. (eds.) ECML 2004. LNCS (LNAI), vol.\u00a03201, pp. 134\u2013143. Springer, Heidelberg (2004)"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/11550907_2","volume-title":"Artificial Neural Networks: Formal Models and Their Applications \u2013 ICANN 2005","author":"M. Gagliolo","year":"2005","unstructured":"Gagliolo, M., Schmidhuber, J.: A neural network model for inter-problem adaptive online time allocation. In: Duch, W., Kacprzyk, J., Oja, E., Zadro\u017cny, S. (eds.) ICANN 2005. LNCS, vol.\u00a03697, pp. 7\u201312. Springer, Heidelberg (2005)"},{"issue":"3-4","key":"7_CR5","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s10472-006-9036-z","volume":"47","author":"M. Gagliolo","year":"2006","unstructured":"Gagliolo, M., Schmidhuber, J.: Learning dynamic algorithm portfolios. Annals of Mathematics and Artificial Intelligence\u00a047(3-4), 295\u2013328 (2006); AI&MATH 2006 Special Issue","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"issue":"1","key":"7_CR6","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1137\/S0097539701398375","volume":"32","author":"P. Auer","year":"2003","unstructured":"Auer, P., Cesa-Bianchi, N., Freund, Y., Schapire, R.E.: The nonstochastic multiarmed bandit problem. SIAM J. Comput.\u00a032(1), 48\u201377 (2003)","journal-title":"SIAM J. Comput."},{"key":"7_CR7","first-page":"792","volume-title":"IJCAI 2007 \u2013 Twentieth International Joint Conference on Artificial Intelligence","author":"M. Gagliolo","year":"2007","unstructured":"Gagliolo, M., Schmidhuber, J.: Learning restart strategies. In: Veloso, M.M. (ed.) IJCAI 2007 \u2013 Twentieth International Joint Conference on Artificial Intelligence, January 2007, vol.\u00a01, pp. 792\u2013797. AAAI Press, Menlo Park (2007)"},{"key":"7_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/11503415_15","volume-title":"Learning Theory","author":"N. Cesa-Bianchi","year":"2005","unstructured":"Cesa-Bianchi, N., Mansour, Y., Stoltz, G.: Improved second-order bounds for prediction with expert advice. In: Auer, P., Meir, R. (eds.) COLT 2005. LNCS (LNAI), vol.\u00a03559, pp. 217\u2013232. Springer, Heidelberg (2005)"},{"issue":"4","key":"7_CR9","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1023\/A:1006350622830","volume":"24","author":"H.H. Hoos","year":"2000","unstructured":"Hoos, H.H., St\u00fctzle, T.: Local search algorithms for SAT: An empirical evaluation. Journal of Automated Reasoning\u00a024(4), 421\u2013481 (2000)","journal-title":"Journal of Automated Reasoning"},{"key":"7_CR10","unstructured":"Hutter, F., Hamadi, Y.: Parameter adjustment based on performance prediction: Towards an instance-aware problem solver. Technical Report MSR-TR-2005-125, Microsoft Research, Cambridge, UK (December 2005)"},{"key":"7_CR11","unstructured":"Petrik, M.: Statistically optimal combination of algorithms. Presented at SOFSEM 2005 - 31st Annual Conference on Current Trends in Theory and Practice of Informatics (2005)"},{"key":"7_CR12","unstructured":"F\u00fcrnkranz, J.: On-line bibliography on meta-learning. In: EU ESPRIT METAL Project (26.357): A Meta-Learning Assistant for Providing User Support in Machine Learning Mining (2001)"},{"issue":"3","key":"7_CR13","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1023\/B:MACH.0000015878.60765.42","volume":"54","author":"C. Giraud-Carrier","year":"2004","unstructured":"Giraud-Carrier, C., Vilalta, R., Brazdil, P.: Introduction to the special issue on meta-learning. Machine Learning\u00a054(3), 187\u2013193 (2004)","journal-title":"Machine Learning"},{"key":"7_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1007\/3-540-46135-3_37","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"K. Leyton-Brown","year":"2002","unstructured":"Leyton-Brown, K., Nudelman, E., Shoham, Y.: Learning the empirical hardness of optimization problems: The case of combinatorial auctions. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470, p. 556. Springer, Heidelberg (2002)"},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1007\/978-3-540-30201-8_33","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"E. Nudelman","year":"2004","unstructured":"Nudelman, E., Leyton-Brown, K., Hoos, H.H., Devkar, A., Shoham, Y.: Understanding random sat: Beyond the clauses-to-variables ratio. In: Wallace, M. (ed.) CP 2004. LNCS, vol.\u00a03258, pp. 438\u2013452. Springer, Heidelberg (2004)"},{"key":"7_CR16","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1126\/science.275.5296.51","volume":"275","author":"B.A. Huberman","year":"1997","unstructured":"Huberman, B.A., Lukose, R.M., Hogg, T.: An economic approach to hard computational problems. Science\u00a0275, 51\u201354 (1997)","journal-title":"Science"},{"issue":"1-2","key":"7_CR17","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0004-3702(00)00081-3","volume":"126","author":"C.P. Gomes","year":"2001","unstructured":"Gomes, C.P., Selman, B.: Algorithm portfolios. Artificial Intelligence\u00a0126(1-2), 43\u201362 (2001)","journal-title":"Artificial Intelligence"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Petrik, M., Zilberstein, S.: Learning static parallel portfolios of algorithms. In: Ninth International Symposium on Artificial Intelligence and Mathematics (2006)","DOI":"10.1007\/s10472-007-9050-9"},{"key":"7_CR19","unstructured":"Kautz, H.A., Horvitz, E., Ruan, Y., Gomes, C.P., Selman, B.: Dynamic restart policies. In: AAAI\/IAAI, pp. 674\u2013681 (2002)"},{"key":"7_CR20","volume-title":"Reinforcement learning: An introduction","author":"R. Sutton","year":"1998","unstructured":"Sutton, R., Barto, A.: Reinforcement learning: An introduction. MIT Press, Cambridge (1998)"},{"key":"7_CR21","first-page":"511","volume-title":"Proc. 17th ICML","author":"M.G. Lagoudakis","year":"2000","unstructured":"Lagoudakis, M.G., Littman, M.L.: Algorithm selection using reinforcement learning. In: Proc. 17th ICML, pp. 511\u2013518. Morgan Kaufmann, San Francisco (2000)"},{"key":"7_CR22","first-page":"719","volume-title":"Eighteenth national conference on Artificial intelligence","author":"L. Finkelstein","year":"2002","unstructured":"Finkelstein, L., Markovitch, S., Rivlin, E.: Optimal schedules for parallelizing anytime algorithms: the case of independent processes. In: Eighteenth national conference on Artificial intelligence, pp. 719\u2013724. AAAI Press, Menlo Park (2002)"},{"key":"7_CR23","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1613\/jair.1195","volume":"19","author":"L. Finkelstein","year":"2003","unstructured":"Finkelstein, L., Markovitch, S., Rivlin, E.: Optimal schedules for parallelizing anytime algorithms: The case of shared resources. Journal of Artificial Intelligence Research\u00a019, 73\u2013138 (2003)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"7_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/11672142_19","volume-title":"STACS 2006","author":"T. Sayag","year":"2006","unstructured":"Sayag, T., Fine, S., Mansour, Y.: Combining multiple heuristics. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol.\u00a03884, pp. 242\u2013253. Springer, Heidelberg (2006)"},{"key":"7_CR25","first-page":"1197","volume-title":"Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence","author":"M.J. Streeter","year":"2007","unstructured":"Streeter, M.J., Golovin, D., Smith, S.F.: Combining multiple heuristics online. In: Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, Vancouver, British Columbia, Canada, July 22-26, pp. 1197\u20131203. AAAI Press, Menlo Park (2007)"},{"key":"7_CR26","unstructured":"Streeter, M., Smith, S.F.: New techniques for algorithm portfolio design. In: UAI 2008: Proceedings of the 24th Conference on Uncertainty in Artificial Intelligence (2008)"},{"key":"7_CR27","doi-asserted-by":"crossref","unstructured":"Beck, C.J., Freuder, E.C.: Simple rules for low-knowledge algorithm selection. In: CPAIOR, pp. 50\u201364 (2004)","DOI":"10.1007\/978-3-540-24664-0_4"},{"issue":"4","key":"7_CR28","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1111\/j.1467-8640.2005.00278.x","volume":"21","author":"T. Carchrae","year":"2005","unstructured":"Carchrae, T., Beck, J.C.: Applying machine learning to low knowledge control of optimization algorithms. Computational Intelligence\u00a021(4), 373\u2013387 (2005)","journal-title":"Computational Intelligence"},{"key":"7_CR29","first-page":"1355","volume-title":"Twentieth National Conference on Artificial Intelligence","author":"V.A. Cicirello","year":"2005","unstructured":"Cicirello, V.A., Smith, S.F.: The max k-armed bandit: A new model of exploration applied to search heuristic selection. In: Twentieth National Conference on Artificial Intelligence, pp. 1355\u20131361. AAAI Press, Menlo Park (2005)"},{"key":"7_CR30","volume-title":"Twenty-First National Conference on Artificial Intelligence","author":"M.J. Streeter","year":"2006","unstructured":"Streeter, M.J., Smith, S.F.: An asymptotically optimal algorithm for the max k-armed bandit problem. In: Twenty-First National Conference on Artificial Intelligence. AAAI Press, Menlo Park (2006)"},{"issue":"1","key":"7_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1456650.1456656","volume":"41","author":"K.A. Smith-Miles","year":"2008","unstructured":"Smith-Miles, K.A.: Cross-disciplinary perspectives on meta-learning for algorithm selection. ACM Computing Surveys\u00a041(1), 1\u201325 (2008)","journal-title":"ACM Computing Surveys"},{"key":"7_CR32","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1090\/S0002-9904-1952-09620-8","volume":"58","author":"H. Robbins","year":"1952","unstructured":"Robbins, H.: Some aspects of the sequential design of experiments. Bulletin of the AMS\u00a058, 527\u2013535 (1952)","journal-title":"Bulletin of the AMS"},{"key":"7_CR33","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)"},{"issue":"1-2","key":"7_CR34","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1023\/A:1006314320276","volume":"24","author":"C.P. Gomes","year":"2000","unstructured":"Gomes, C.P., Selman, B., Crato, N., Kautz, H.: Heavy-tailed phenomena in satisfiability and constraint satisfaction problems. J. Autom. Reason.\u00a024(1-2), 67\u2013100 (2000)","journal-title":"J. Autom. Reason."},{"issue":"2-3","key":"7_CR35","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s10994-006-5001-7","volume":"66","author":"N. Cesa-Bianchi","year":"2007","unstructured":"Cesa-Bianchi, N., Mansour, Y., Stoltz, G.: Improved second-order bounds for prediction with expert advice. Machine Learning\u00a066(2-3), 321\u2013352 (2007)","journal-title":"Machine Learning"},{"key":"7_CR36","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/11894841_20","volume-title":"Algorithmic Learning Theory","author":"C. Allenberg","year":"2006","unstructured":"Allenberg, C., Auer, P., Gy\u00f6rfi, L., Ottucs\u00e1k, G.: Hannan consistency in on-line learning in case of unbounded losses under partial monitoring. In: Balc\u00e1zar, J.L., Long, P.M., Stephan, F. (eds.) ALT 2006. LNCS (LNAI), vol.\u00a04264, pp. 229\u2013243. Springer, Heidelberg (2006)"},{"issue":"2","key":"7_CR37","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.K.: The weighted majority algorithm. Inf. Comput.\u00a0108(2), 212\u2013261 (1994)","journal-title":"Inf. Comput."},{"key":"7_CR38","series-title":"Advances in Soft Computing","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1007\/978-3-540-85863-8_75","volume-title":"International Symposium on Distributed Computing and Artificial Intelligence 2008 (DCAI 2008)","author":"M. Gagliolo","year":"2008","unstructured":"Gagliolo, M., Schmidhuber, J.: Towards distributed algorithm portfolios. In: Corchado, J.M., et al. (eds.) International Symposium on Distributed Computing and Artificial Intelligence 2008 (DCAI 2008). Advances in Soft Computing, vol.\u00a050, pp. 634\u2013643. Springer, Heidelberg (2008)"},{"key":"7_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1007\/b103174","volume-title":"Theory and Applications of Satisfiability Testing","author":"C.M. Li","year":"2005","unstructured":"Li, C.M., Huang, W.: Diversification and determinism in local search for satisfiability. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol.\u00a03569, pp. 158\u2013172. Springer, Heidelberg (2005)"},{"key":"7_CR40","unstructured":"Hoos, H.H., St\u00fctzle, T.: SATLIB: An Online Resource for Research on SAT. In: Gent, I.P., et al. (eds.) SAT 2000, pp. 283\u2013292 (2000), http:\/\/www.satlib.org"},{"key":"7_CR41","unstructured":"Cesa-Bianchi, N.: Personal Communication (2008)"}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13800-3_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T13:05:32Z","timestamp":1685624732000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13800-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642137990","9783642138003"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13800-3_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}