Going Meta: Back to the Expectations
Abstract
It is time to use the great implementation achievements and have a look back at the ideas which were treated as pure theory. One of these ideas concerns with metareasoning and it has been under focus in the rest of paper. A classification for types of metareasoning has been proposed. In recent years, only (the ones that here named as) pre-metareasoning and para-metareasoning have been studied. The first one is for predicting the best computation path for having better performance programs. The second, mostly known as interruptible anytime algorithm, is to limit the computation time externally when the approximate answer is better than nothing. One other type of metareasoning (called here as post-meta reasoning) is discussed in a case study. It has been shown as an effective method for reducing error in selflocalization. Post-metareasoning argued as useful when the effectiveness of reasoning methods are not known.
Keywords
metareasoning, para-metareasoning, pre-metareasoning, post-metareasoning, self-localization
