← Search

Jakub Svoboda

3 accepted papers

2026

Reinforcement Learning for Reachability: Guaranteeing Asymptotic Optimality

ICML 2026poster

{\em Reinforcement learning} (RL) for {\em reachability specifications} is fundamental in sequential decision-making, yet theoretical guarantees remain less explored. A recent work achieves {\em asymptotic convergence} to optimal policies. However, this approach provides limited insight into converg…

Cited by 0SourceScholar
2025

Linear Equations with Min and Max Operators: Computational Complexity

AAAI 2025technical

We consider a class of optimization problems defined by a system of linear equations with min and max operators. This class of optimization problems has been studied under restrictive conditions, such as, (C1) the halting or stability condition; (C2) the non-negative coefficients condition…

Cited by 0SourcePDFScholar
2024

Reinforcement Learning from Reachability Specifications: PAC Guarantees with Expected Conditional Distance

ICML 2024poster

Reinforcement Learning (RL) from temporal logical specifications is a fundamental problem in sequential decision making. One of the basic and core such specification is the reachability specification that requires a target set to be eventually visited. Despite strong empirical results for RL from su…

Cited by 0SourcePDFScholar