Fast local search methods for solving limited memory influence diagrams
International Journal of Approximate Reasoning(2016)
摘要
Limited memory influence diagrams are graph-based models that describe decision problems with limited information such as planning with teams and/or agents with imperfect recall. Solving a (limited memory) influence diagram is an NP-hard problem, often approached through local search. In this work we give a closer look at k-neighborhood local search approaches. We show that finding a k-neighboring strategy that improves on the current solution is W[1]-hard and hence unlikely to be polynomial-time tractable. We also show that finding a strategy that resembles an optimal strategy (but may have low expected utility) is NP-hard. We then develop fast schema to perform approximate k-local search; experiments show that our methods improve on current local search algorithms both with respect to time and to accuracy.
更多查看译文
关键词
Influence diagrams,Probabilistic graphical models,Decision making,Local search,Parameterized complexity
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络