3 citations · 10 across the 13 of their papers we have counts for
15 papers
FoSeRL: Formal Sequential Robustness Certification for Reinforcement Learning Policies
Sara Taheri, Deep Kumar Ganguly, Jan Křetínský +1
Even a few action perturbations can substantially degrade the performance of a deployed decision policy. Certifying the resulting return loss is challenging in stochastic environme…
Robust Risk Under Evolving Uncertainty: A Wasserstein Counterpart of the Entropic Value-at-Risk
Deep Kumar Ganguly, Jan Křetínský
An agent still learning its environment should be cautious while ignorant and bold once confident. The entropic value-at-risk captures this through a robust-optimization identity--…
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…
Explainably Safe Reinforcement Learning
Sabine Rieder, Stefan Pranger, Debraj Chakraborty +2
Trust in a decision-making system requires both safety guarantees and the ability to interpret and understand its behavior. This is particularly important for learned systems, whos…
Stopping Criteria for Value Iteration on Concurrent Stochastic Reachability and Safety Games
Marta Grobelna, Jan Křetínský, Maximilian Weininger
We consider two-player zero-sum concurrent stochastic games (CSGs) played on graphs with reachability and safety objectives. These include degenerate classes such as Markov decisio…
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…
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…
Gaussian-Based and Outside-the-Box Runtime Monitoring Join Forces
Vahid Hashemi, Jan Křetínský, Sabine Rieder +2
Since neural networks can make wrong predictions even with high confidence, monitoring their behavior at runtime is important, especially in safety-critical domains like autonomous…
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…
QuADTool: Attack-Defense-Tree Synthesis, Analysis and Bridge to Verification
Florian Dorfhuber, Julia Eisentraut, Katharina Klioba +1
Ranking risks and countermeasures is one of the foremost goals of quantitative security analysis. One of the popular frameworks, used also in industrial practice, for this task are…
stl2vec: Semantic and Interpretable Vector Representation of Temporal Logic
Gaia Saveri, Laura Nenzi, Luca Bortolussi +1
Integrating symbolic knowledge and data-driven learning algorithms is a longstanding challenge in Artificial Intelligence. Despite the recognized importance of this task, a notable…
Tools at the Frontiers of Quantitative Verification
Roman Andriushchenko, Alexander Bork, Carlos E. Budde +20
The analysis of formal models that include quantitative aspects such as timing or probabilistic choices is performed by quantitative verification tools. Broad and mature tool suppo…
Monitizer: Automating Design and Evaluation of Neural Network Monitors
Muqsit Azeem, Marta Grobelna, Sudeep Kanav +3
The behavior of neural networks (NNs) on previously unseen types of data (out-of-distribution or OOD) is typically unpredictable. This can be dangerous if the network's output is u…
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…