18 citations · 32 across the 18 of their papers we have counts for
Showing cs.LOShow all
3 papers · 1 filter
cs.LO2025
Formal Reasoning About Confidence and Automated Verification of Neural Networks
Mohammad Afzal, S. Akshay, Blaise Genest +1
In the last decade, a large body of work has emerged on robustness of neural networks, i.e., checking if the decision remains unchanged when the input is slightly perturbed. Howeve…
cs.LO2022
On Robustness for the Skolem, Positivity and Ultimate Positivity Problems
S. Akshay, Hugo Bazille, Blaise Genest +1
The Skolem problem is a long-standing open problem in linear dynamical systems: can a linear recurrence sequence (LRS) ever reach 0 from a given initial configuration? Similarly, t…
cs.LO2018★ 1 cited
Distribution-based objectives for Markov Decision Processes
S. Akshay, Blaise Genest, Nikhil Vyas
We consider distribution-based objectives for Markov Decision Processes (MDP). This class of objectives gives rise to an interesting trade-off between full and partial information.…