1 citations · 3 across the 4 of their papers we have counts for
4 papers
Infinite Time Horizon Safety of Bayesian Neural Networks
Mathias Lechner, Đorđe Žikelić, Krishnendu Chatterjee +1
Bayesian neural networks (BNNs) place distributions over the weights of a neural network to model uncertainty in the data and the network's prediction. We consider the problem of v…
On Lexicographic Proof Rules for Probabilistic Termination
Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Petr Novotný +2
We consider the almost-sure (a.s.) termination problem for probabilistic programs, which are a stochastic extension of classical imperative programs. Lexicographic ranking function…
Stochastic Invariants for Probabilistic Termination
Krishnendu Chatterjee, Petr Novotný, Đorđe Žikelić
Termination is one of the basic liveness properties, and we study the termination problem for probabilistic programs with real-valued variables. Previous works focused on the quali…
Optimizing Expectation with Guarantees in POMDPs (Technical Report)
Krishnendu Chatterjee, Petr Novotný, Guillermo A. Pérez +2
A standard objective in partially-observable Markov decision processes (POMDPs) is to find a policy that maximizes the expected discounted-sum payoff. However, such policies may st…