6 papers · 1 filter
Quantifying Risk Under Evolving Uncertainty: Belief-Dependent Robustness for Safe Sequential Decision Making
Deep Kumar Ganguly, Jan Kretinsky
How cautious should an agent be while it is still learning its environment? We propose RATTL (Risk-Adversarial Total-Reward Learning), which ties caution to epistemic uncertainty:…
dtControl2+: Trading Optimality for Explainability in MDPs via Decision Trees
Tereza Kinská, Jan KÅetÃnský, Tobias Meggendorfer +2
Over the past decade, decision trees have been used to represent controllers (a.k.a. policies) in an explainable way, with dtControl2 as a current state-of-the-art tool. However, f…
Explainable Representation of Finite-Memory Policies for POMDPs using Decision Trees
Muqsit Azeem, Debraj Chakraborty, Sudeep Kanav +1
Partially Observable Markov Decision Processes (POMDPs) are a fundamental framework for decision-making under uncertainty and partial observability. Since in general optimal polici…
1-2-3-Go! Policy Synthesis for Parameterized Markov Decision Processes via Decision-Tree Learning and Generalization
Muqsit Azeem, Debraj Chakraborty, Sudeep Kanav +4
Despite the advances in probabilistic model checking, the scalability of the verification methods remains limited. In particular, the state space often becomes extremely large when…
Explaining Control Policies through Predicate Decision Diagrams
Debraj Chakraborty, Clemens Dubslaff, Sudeep Kanav +2
Safety-critical controllers of complex systems are hard to construct manually. Automated approaches such as controller synthesis or learning provide a tempting alternative but usua…
Learning Explainable and Better Performing Representations of POMDP Strategies
Alexander Bork, Debraj Chakraborty, Kush Grover +2
Strategies for partially observable Markov decision processes (POMDP) typically require memory. One way to represent this memory is via automata. We present a method to learn an au…