paper-with-me

Papers

Exploiting Model Equivalences for Solving Interactive Dynamic Influence Diagrams

2014-01-18 · Yifeng Zeng, Prashant Doshi

We focus on the problem of sequential decision making in partially observable environments shared with other agents of uncertain types having similar or conflicting objectives. This problem has been previously formalized by multiple frameworks one of which is the interactive dynamic influence diagram (I-DID), which generalizes the well-known influence diagram to the multiagent setting. I-DIDs are graphical models and may be used to compute the policy of an agent given its belief over the physical state and others models, which changes as the agent acts and observes in the multiagent setting. As we may expect, solving I-DIDs is computationally hard. This is predominantly due to the large space of candidate models ascribed to the other agents and its exponential growth over time. We present two methods for reducing the size of the model space and stemming its exponential growth. Both these methods involve aggregating individual models into equivalence classes. Our first method groups together behaviorally equivalent models and selects only those models for updating which will result in predictive behaviors that are distinct from others in the updated model space. The second method further compacts the model space by focusing on portions of the behavioral predictions. Specifically, we cluster actionally equivalent models that prescribe identical actions at a single time step. Exactly identifying the equivalences would require us to solve all models in the initial set. We avoid this by selectively solving some of the models, thereby introducing an approximation. We discuss the error introduced by the approximation, and empirically demonstrate the improved efficiency in solving I-DIDs due to the equivalences.

📄 PDF Abstract BibTeX arXiv:1401.4600

Code (0)

등록된 구현이 없습니다.

Tasks

Decision MakingSequential Decision Making

Similar Papers 제목 키워드 기반

More Efficient Exploration with Symbolic Priors on Action Sequence Equivalences

2021-10-20 · Toby Johnstone, Nathan Grinsztajn, Johan Ferret, Philippe Preux

Incorporating prior knowledge in reinforcement learning algorithms is mainly an open question. Even when insights about the environment dynamics are available, reinforcement learning is traditionally used in a tabula ras…

Efficient ExplorationOpen-Ended Question Answeringreinforcement-learningReinforcement Learning+1

Solving Tree Problems with Category Theory

2018-10-16 · Rafik Hadfi

Artificial Intelligence (AI) has long pursued models, theories, and techniques to imbue machines with human-like general intelligence. Yet even the currently predominant data-driven approaches in AI seem to be lacking hu…

Influence-Based Multi-Agent Exploration

2019-10-12 · ICLR 2020 1 · Tonghan Wang, Jianhao Wang, Yi Wu, Chongjie Zhang

Intrinsically motivated reinforcement learning aims to address the exploration challenge for sparse-reward tasks. However, the study of exploration methods in transition-dependent multi-agent settings is largely absent f…

reinforcement-learningReinforcement LearningReinforcement Learning (RL)

Smart Expansion Techniques for ASP-based Interactive Configuration

2025-07-28 · Lucia Balážová, Richard Comploi-Taupe, Susana Hahn, Nicolas Rühling 외 arxiv

Product configuration is a successful application of Answer Set Programming (ASP). However, challenges are still open for interactive systems to effectively guide users through the configuration process. The aim of our w…

Policy-Space Search: Equivalences, Improvements, and Compression

2024-03-28 · Frederico Messa, André Grahl Pereira

Fully-observable non-deterministic (FOND) planning is at the core of artificial intelligence planning with uncertainty. It models uncertainty through actions with non-deterministic effects. A* with Non-Determinism (AND*)…

Heuristic Search