几个基本元推理问题的定义及其复杂性
Definition and Complexity of Some Basic Metareasoning Problems
摘要:
在大多数现实世界中,由于有限的时间或其他资源,代理不能执行所有潜在有用的审议和信息收集行动。这就导致了选择这些行为的元推理问题。在人工智能领域,元推理的决策论方法已经得到了研究,但是关于元推理的复杂性的理论结果还很少。我们得出硬度结果的三个设置,最真实的元推理系统将不得不包括特殊情况。在第一种情况下,代理必须决定如何在运行于不同问题实例上的任意时刻算法之间分配其审议时间。我们证明这是$\mathcal{NP}$ -完备的。在第二种情况下,智能体必须(动态地)在它必须选择的多个行动中分配其审议或信息收集资源。我们表明,这是$\mathcal{NP}$ -硬,即使评估每个单独的行动是非常简单的。在第三种情况下,智能体必须(动态地)选择有限数量的审议或信息收集行动来消除世界状态的歧义。我们表明,这是$\mathcal{NP}$ -硬下的自然限制,和$\mathcal{PSPACE}$ -硬一般。
英文摘要:
In most real-world settings, due to limited time or other resources, an agent cannot perform all potentially useful deliberation and information gathering actions. This leads to the metareasoning problem of selecting such actions. Decision-theoretic methods for metareasoning have been studied in AI, but there are few theoretical results on the complexity of metareasoning. We derive hardness results for three settings which most real metareasoning systems would have to encompass as special cases. In the first, the agent has to decide how to allocate its deliberation time across anytime algorithms running on different problem instances. We show this to be $\mathcal{NP}$-complete. In the second, the agent has to (dynamically) allocate its deliberation or information gathering resources across multiple actions that it has to choose among. We show this to be $\mathcal{NP}$-hard even when evaluating each individual action is extremely simple. In the third, the agent has to (dynamically) choose a limited number of deliberation or information gathering actions to disambiguate the state of the world. We show that this is $\mathcal{NP}$-hard under a natural restriction, and $\mathcal{PSPACE}$-hard in general.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。