Algorithm selection by rational metareasoning as a model of human strategy selection

Selecting the right algorithm is an important problem in computer science, because the algorithm often has to exploit the structure of the input to be efficient. The human mind faces the same challenge. Therefore, solutions to the algorithm selection problem can inspire models of human strategy selection and vice versa. Here, we view the algorithm selection problem as a special case of metareasoning and derive a solution that outperforms existing methods in sorting algorithm selection. We apply our theory to model how people choose between cognitive strategies and test its prediction in a behavioral experiment. We find that people quickly learn to adaptively choose between cognitive strategies. People's choices in our experiment are consistent with our model but inconsistent with previous theories of human strategy selection. Rational metareasoning appears to be a promising framework for reverse-engineering how people choose among cognitive strategies and translating the results into better solutions to the algorithm selection problem.

[1]  D. Lindley,et al.  Bayes Estimates for the Linear Model , 1972 .

[2]  R. Geoff Dromey,et al.  An algorithm for the selection problem , 1986, Softw. Pract. Exp..

[3]  Eric J. Johnson,et al.  Adaptive Strategy Selection in Decision Making. , 1988 .

[4]  Stuart J. Russell,et al.  Principles of Metareasoning , 1989, Artif. Intell..

[5]  Michael I. Jordan,et al.  A Variational Approach to Bayesian Logistic Regression Models and their Extensions , 1997, AISTATS.

[6]  Jeff Shrager,et al.  SCADS: A Model of Children's Strategy Choices and Strategy Discoveries , 1998 .

[7]  R. Siegler Strategic development , 1999, Trends in Cognitive Sciences.

[8]  R. Selten,et al.  Bounded rationality: The adaptive toolbox , 2000 .

[9]  Michail G. Lagoudakis,et al.  Selecting the Right Algorithm , 2001 .

[10]  W. Hsu,et al.  Algorithm selection for sorting and probabilistic inference: a machine learning-based approach , 2003 .

[11]  I. Erev,et al.  On adaptation, maximization, and reinforcement learning among cognitive strategies. , 2005, Psychological review.

[12]  J. Rieskamp,et al.  SSL: a theory of how people learn to select strategies. , 2006, Journal of experimental psychology. General.

[13]  Kate Smith-Miles,et al.  Cross-disciplinary perspectives on meta-learning for algorithm selection , 2009, CSUR.

[14]  Varun Dutt,et al.  Instance-based learning: integrating sampling and repeated decisions from experience. , 2011, Psychological review.

[15]  David Tolpin,et al.  Selecting Computations: Theory and Applications , 2012, UAI.

[16]  William D. Penny,et al.  Efficient Posterior Probability Mapping Using Savage-Dickey Ratios , 2013, PloS one.

[17]  Julian N. Marewski,et al.  Strategy selection: An introduction to the modeling challenge. , 2014, Wiley interdisciplinary reviews. Cognitive science.

[18]  Thomas L. Griffiths,et al.  Rational Use of Cognitive Resources: Levels of Analysis Between the Computational and the Algorithmic , 2015, Top. Cogn. Sci..

[19]  Lars Kotthoff,et al.  Algorithm Selection for Combinatorial Search Problems: A Survey , 2012, AI Mag..