{"type":"ScholarlyArticle","title":"Meta-Level Control of Anytime Algorithms with Online Performance Prediction","authors":[{"name":"Justin Svegliato","slug":"justin-svegliato","given":"Justin","family":"Svegliato","affiliation":"College of Information and Computer Sciences University of Massachusetts Amherst"},{"name":"Kyle Hollins Wray","slug":"kyle-hollins-wray","given":"Kyle Hollins","family":"Wray","affiliation":"College of Information and Computer Sciences University of Massachusetts Amherst"},{"name":"Shlomo Zilberstein","slug":"shlomo-zilberstein","given":"Shlomo","family":"Zilberstein","affiliation":"College of Information and Computer Sciences University of Massachusetts Amherst"}],"abstract":"Anytime algorithms enable intelligent systems to trade computation time with solution quality. To exploit this crucial ability in real-time decision-making, the system must decide when to interrupt the anytime algorithm and act on the current solution. Existing meta-level control techniques, however, address this problem by relying on significant offline work that diminishes their practical utility and accuracy. We formally introduce an online performance prediction framework that enables meta-level control to adapt to each instance of a problem without any preprocessing. Using this framework, we then present a meta-level control technique and two stopping conditions. Finally, we show that our approach outperforms existing techniques that require substantial offline work. The result is efficient nonmyopic meta-level control that reduces the overhead and increases the benefits of using anytime algorithms in intelligent systems.","doi":"10.24963/ijcai.2018/208","url":"https://ijcai.org/proceedings/2018/208","pdf":"https://ijcai.org/proceedings/2018/0208.pdf","markdown":"https://ijcai.org/proceedings/2018/208.md","bibtex":"https://ijcai.org/proceedings/2018/bibtex/208","volume":{"slug":"2018","title":"Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2018","url":"https://ijcai.org/proceedings/2018/","year":2018,"location":"Stockholm","dates":"13-19 July 2018","editors":"Jérôme Lang","isbn":"978-0-9992411-2-7","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2018"},"section":"Heuristic Search and Game Playing","track":"Main track","number":208,"pages":{"first":1499,"last":1505},"keywords":["Heuristic Search and Game Playing: Meta-Reasoning and Meta-heuristics","Planning and Scheduling: Real-time Planning"],"videos":[],"references":[{"position":1,"raw":"[Bartz-Beielstein and Markon, 2004] Thomas Bartz-Beielstein and Sandor Markon. Tuning search algorithms for real-world appli- cations: A regression tree based approach. In IEEE Congress on Evolutionary Computation, pages 1111-1118, 2004.","title":"Tuning search algorithms for real-world applications: A regression tree based approach","authors":"Thomas Bartz-Beielstein, Sandor Markon","year":"2004","venue":"IEEE Congress on Evolutionary Computation","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Bierwirth, 1995] Christian Bierwirth. A generalized permutation approach to job shop scheduling with genetic algorithms. Oper- ations Research Spectrum, 17(2-3):87-92, 1995.","title":"A generalized permutation approach to job shop scheduling with genetic algorithms","authors":"Christian Bierwirth","year":"1995","venue":"Operations Research Spectrum","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Boddy and Dean, 1994] Mark Boddy and Thomas L. Dean. Delib- eration scheduling for problem solving in time-constrained envi- ronments. Artificial Intelligence, 67(2):245-285, 1994.","title":"Deliberation scheduling for problem solving in time-constrained environments","authors":"Mark Boddy, Thomas L Dean","year":"1994","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Breese and Horvitz, 1991] John S. Breese and Eric J. Horvitz. Ideal reformulation of belief networks. In 6th Conf. on Uncer- tainty in Artificial Intelligence, pages 129-143, 1991.","title":"Ideal reformulation of belief networks","authors":"John S Breese, Eric J Horvitz","year":"1991","venue":"6th Conf. on Uncertainty in Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Burkard et al., 1997] Rainer E. Burkard, Stefan E. Karisch, and Franz Rendl. QAPLIB-A quadratic assignment problem library. Journal of Global Optimization, 10(4):391-403, 1997.","title":"QAPLIB-A quadratic assignment problem library","authors":"Rainer E Burkard, Stefan E Karisch, Franz Rendl","year":"1997","venue":"Journal of Global Optimization","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Dean and Boddy, 1988] Thomas L. Dean and Mark S. Boddy. An analysis of time-dependent planning. In 7th AAAI Nat'l Conf. on Artificial Intelligence, pages 49-54, 1988.","title":"An analysis of time-dependent planning","authors":"Thomas L Dean, Mark S Boddy","year":"1988","venue":"7th AAAI Nat'l Conf. on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Della Croce et al., 1995] Federico Della Croce, Roberto Tadei, and Giuseppe Volta. A genetic algorithm for the job shop prob- lem. Computers & Operations Research, 22(1):15-24, 1995.","title":"A genetic algorithm for the job shop problem","authors":"Federico Della Croce, Roberto Tadei, Giuseppe Volta","year":"1995","venue":"Computers & Operations Research","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Gilmore, 1962] Paul C. Gilmore. Optimal and suboptimal algo- rithms for the quadratic assignment problem. Journal of the Society for Industrial and Applied Mathematics, 10(2):305-313, 1962.","title":"Optimal and suboptimal algorithms for the quadratic assignment problem","authors":"C Paul, Gilmore","year":"1962","venue":"Journal of the Society for Industrial and Applied Mathematics","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Hansen and Zilberstein, 2001] Eric A. Hansen and Shlomo Zilber- stein. Monitoring and control of anytime algorithms: A dynamic programming approach. Artificial Intelligence, 126(1-2):139- 157, 2001.","title":"Monitoring and control of anytime algorithms: A dynamic programming approach","authors":"Eric A Hansen, Shlomo Zilberstein","year":"2001","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Hansen et al., 1997] Eric A. Hansen, Shlomo Zilberstein, and Vic- tor A. Danilchenko. Anytime heuristic search: First results. Tech- nical Report 97-50, Computer Science Department, University of Massachussetts Amherst, 1997.","title":"Anytime heuristic search: First results","authors":"Eric A Hansen, Shlomo Zilberstein, Victor A Danilchenko","year":"1997","venue":null,"doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Horvitz and Rutledge, 1991] Eric Horvitz and Geoffrey Rutledge. Time-dependent utility and action under uncertainty. In 7th Conf. on Uncertainty in Artificial Intelligence, pages 151-158, 1991.","title":"Time-dependent utility and action under uncertainty","authors":"Rutledge ; Horvitz, Eric Horvitz, Geoffrey Rutledge","year":"1991","venue":"7th Conf. on Uncertainty in Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Horvitz, 1987] Eric J. Horvitz. Reasoning about beliefs and ac- tions under computational resource constraints. In 3rd Workshop on Uncertainty in Artificial Intelligence, 1987.","title":"Reasoning about beliefs and actions under computational resource constraints","authors":"Eric J Horvitz","year":"1987","venue":"3rd Workshop on Uncertainty in Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Horvitz, 1988] Eric Horvitz. Reasoning under varying and uncer- tain resource constraints. In 7th AAAI Nat'l Conf. on Artificial Intelligence, pages 111-116, 1988.","title":"Reasoning under varying and uncertain resource constraints","authors":"Eric Horvitz","year":"1988","venue":"7th AAAI Nat'l Conf. on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Horvitz, 1990] Eric J. Horvitz. Computation and action under bounded resources. PhD thesis, Stanford University, CA, 1990.","title":"Computation and action under bounded resources","authors":"Eric J Horvitz","year":"1990","venue":null,"doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Huang et al., 2010] Ling Huang, Jinzhu Jia, Bin Yu, Byung-Gon Chun, Petros Maniatis, and Mayur Naik. Predicting execution time of computer programs using sparse polynomial regression. In 24th Conf. on Neural Information Processing Systems, pages 883-891, 2010.","title":"Predicting execution time of computer programs using sparse polynomial regression","authors":"Ling Huang, Jinzhu Jia, Bin Yu, Byung-Gon Chun, Petros Maniatis, Mayur Naik","year":"2010","venue":"24th Conf. on Neural Information Processing Systems","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Hutter et al., 2014] Frank Hutter, Lin Xu, Holger H. Hoos, and Kevin Leyton-Brown. Algorithm runtime prediction: Methods & evaluation. Artificial Intelligence, 206:79-111, 2014.","title":"Algorithm runtime prediction: Methods & evaluation","authors":"Frank Hutter, Lin Xu, H Holger, Kevin Hoos, Leyton-Brown","year":"2014","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Lin and Kernighan, 1973] Shen Lin and Brian W. Kernighan. An effective heuristic algorithm for the traveling-salesman problem. Operations Research, 21(2):498-516, 1973.","title":"An effective heuristic algorithm for the traveling-salesman problem","authors":"Shen Lin, Brian W Kernighan","year":"1973","venue":"Operations Research","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Luna et al., 2013] R. Luna, I. A. S ¸ucan, M. Moll, and L. E. Kavraki. Anytime solution optimization for sampling-based mo- tion planning. In IEEE Int'l Conf. on Robotics and Automation, pages 5068-5074, 2013.","title":"Anytime solution optimization for sampling-based motion planning","authors":"R Luna, I A . S ¸ucan, M Moll, L E Kavraki","year":"2013","venue":"IEEE Int'l Conf. on Robotics and Automation","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Misevičius, 2003] Alfonsas Misevičius. A modified simulated an- nealing algorithm for the quadratic assignment problem. Infor- matica, 14(4):497-514, 2003.","title":"Alfonsas Misevičius. A modified simulated annealing algorithm for the quadratic assignment problem","authors":"Misevičius","year":"2003","venue":"Informatica","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Nakano and Yamada, 1991] Ryohei Nakano and Takeshi Yamada. Conventional genetic algorithm for job shop problems. In 4th Int'l Conf. on Genetic Algorithms, pages 474-479, 1991.","title":"Conventional genetic algorithm for job shop problems","authors":"Yamada Nakano, Ryohei Nakano, Takeshi Yamada","year":"1991","venue":"4th Int'l Conf. on Genetic Algorithms","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Paul et al., 1991] C. J. Paul, Anurag Acharya, Bryan Black, and Jay K. Strosnider. Reducing problem-solving variance to improve predictability. Communications of the ACM, 34(8):80-93, 1991.","title":"Reducing problem-solving variance to improve predictability","authors":"C J Paul, Anurag Acharya, Bryan Black, Jay K Strosnider","year":"1991","venue":"Communications of the ACM","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Pineau et al., 2003] Joelle Pineau, Geoff Gordon, and Sebastian Thrun. Point-based value iteration: An anytime algorithm for POMDPs. In 18th Int'l Joint Conf. on Artificial Intelligence, pages 1025-1032, 2003.","title":"Point-based value iteration: An anytime algorithm for POMDPs","authors":"Joelle Pineau, Geoff Gordon, Sebastian Thrun","year":"2003","venue":"18th Int'l Joint Conf. on Artificial Intelligence","doi":null,"url":null,"internal_url":"/proceedings/2003/146"},{"position":23,"raw":"[Puigcerver, 2013] Joan Puigcerver. jsp-ga. GitHub Repository, https://github.com/jpuigcerver/jsp-ga, 2013.","title":"Joan Puigcerver. jsp-ga","authors":"Puigcerver","year":"2013","venue":null,"doi":null,"url":"https://github.com/jpuigcerver/jsp-ga,2013","internal_url":null},{"position":24,"raw":"[Ramos and Cozman, 2005] \"Fabio Tozeto Ramos and Fabio Gagliardi Cozman. Anytime anyspace probabilistic inference. Int'l Journal of Approximate Reasoning, 38(1):53 - 80, 2005.","title":"Fabio Tozeto Ramos and Fabio Gagliardi Cozman. Anytime anyspace probabilistic inference","authors":"Cozman Ramos","year":"2005","venue":"Int'l Journal of Approximate Reasoning","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Richter et al., 2010] Silvia Richter, Jordan Tyler Thayer, and Wheeler Ruml. The joy of forgetting: Faster anytime search via restarting. In 20th Int'l Conf. on Automated Planning and Scheduling, pages 137-144, 2010.","title":"The joy of forgetting: Faster anytime search via restarting","authors":"Silvia Richter, Jordan Tyler Thayer, Wheeler Ruml","year":"2010","venue":"20th Int'l Conf. on Automated Planning and Scheduling","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Richtsfeld et al., 2013] Andreas Richtsfeld, Michael Zillich, and Markus Vincze. Anytime perceptual grouping of 2D features into 3D basic shapes. In 9th Int'l Conf. on Computer Vision Systems, pages 73-82, 2013.","title":"Anytime perceptual grouping of 2D features into 3D basic shapes","authors":"Andreas Richtsfeld, Michael Zillich, Markus Vincze","year":"2013","venue":"9th Int'l Conf. on Computer Vision Systems","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Russell and Wefald, 1991] Stuart Russell and Eric Wefald. Princi- ples of metareasoning. Artificial Intelligence, 49:361-395, 1991.","title":"Principles of metareasoning","authors":"Stuart Russell, Eric Wefald","year":"1991","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Thrun et al., 2003] Sebastian Thrun, Dirk Hahnel, David Fergu- son, Michael Montemerlo, Rudolph Triebel, Wolfram Burgard, Christopher Baker, Zachary Omohundro, Scott Thayer, and William Whittaker. A system for volumetric robotic mapping of abandoned mines. In IEEE Int'l Conf. on Robotics and Au- tomation, pages 4270-4275, 2003.","title":"A system for volumetric robotic mapping of abandoned mines","authors":"Sebastian Thrun, Dirk Hahnel, David Ferguson, Michael Montemerlo, Rudolph Triebel, Wolfram Burgard, Christopher Baker, Zachary Omohundro, Scott Thayer, William Whittaker","year":"2003","venue":"IEEE Int'l Conf. on Robotics and Automation","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Wray et al., 2016] Kyle Hollins Wray, Dirk Ruiken, Roderic A. Grupen, and Shlomo Zilberstein. Log-space harmonic function path planning. In IEEE Int'l Conf. on Intelligent Robots and Sys- tems, pages 1511-1516, 2016.","title":"Log-space harmonic function path planning","authors":"Kyle Hollins Wray, Dirk Ruiken, Roderic A Grupen, Shlomo Zilberstein","year":"2016","venue":"IEEE Int'l Conf. on Intelligent Robots and Systems","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Xu et al., 2008] Lin Xu, Frank Hutter, Holger H. Hoos, and Kevin Leyton-Brown. Satzilla: Portfolio-based algorithm selection for SAT. Journal of Artificial Intelligence Research, 32:565-606, 2008.","title":"Satzilla: Portfolio-based algorithm selection for SAT","authors":"Lin Xu, Frank Hutter, H Holger, Kevin Hoos, Leyton-Brown","year":"2008","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":31,"raw":"[Zilberstein and Russell, 1995] Shlomo Zilberstein and Stuart J. Russell. Approximate reasoning using anytime algorithms. In S. Natarajan, editor, Imprecise and Approximate Computation, pages 43-62. Springer, 1995.","title":"Approximate reasoning using anytime algorithms","authors":"Shlomo Zilberstein, Stuart J Russell","year":"1995","venue":"Imprecise and Approximate Computation","doi":null,"url":null,"internal_url":null},{"position":32,"raw":"[Zilberstein, 1996] Shlomo Zilberstein. Using anytime algorithms in intelligent systems. AI Magazine, 17(3):73, 1996.","title":"Shlomo Zilberstein. Using anytime algorithms in intelligent systems","authors":"Zilberstein","year":"1996","venue":"AI Magazine","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}