113 citations · 317 across the 70 of their papers we have counts for
11 papers · 1 filter
On the -adic zeros of the Tribonacci sequence
Yuri Bilu, Florian Luca, Joris Nieuwveld +2
In this paper, we refute some conjectures of Marques and Lengyel concerning the -adic valuations of members of the Tribonacci sequence.
When are Local Queries Useful for Robust Learning?
Pascale Gourdeau, Varun Kanade, Marta Kwiatkowska +1
Distributional assumptions have been shown to be necessary for the robust learnability of concept classes when considering the exact-in-the-ball robust risk and access to random ex…
Bounding the Escape Time of a Linear Dynamical System over a Compact Semialgebraic Set
Julian D'Costa, Engel Lefaucheux, Eike Neumann +2
We study the Escape Problem for discrete-time linear dynamical systems over compact semialgebraic sets. We establish a uniform upper bound on the number of iterations it takes for…
What's Decidable about Discrete Linear Dynamical Systems?
Toghrul Karimov, Edon Kelmendi, Joël Ouaknine +1
We survey the state of the art on the algorithmic analysis of discrete linear dynamical systems, focussing in particular on reachability, model-checking, and invariant-generation q…
Probabilistic Automata of Bounded Ambiguity
Nathanaël Fijalkow, Cristian Riveros, James Worrell
Probabilistic automata are an extension of nondeterministic finite automata in which transitions are annotated with probabilities. Despite its simplicity, this model is very expres…
Sample Complexity Bounds for Robustly Learning Decision Lists against Evasion Attacks
Pascale Gourdeau, Varun Kanade, Marta Kwiatkowska +1
A fundamental problem in adversarial machine learning is to quantify how much training data is needed in the presence of evasion attacks. In this paper we address this issue within…