2 papers
cs.LG2025
LeanTree: Accelerating White-Box Proof Search with Factorized States in Lean 4
Matěj Kripner, Michal Šustr, Milan Straka
Automated theorem proving (ATP) has been a classical problem in artificial intelligence since its inception, yet it remains challenging due to its vast state and action space. Larg…
cs.GT2025
Meta-Learning in Self-Play Regret Minimization
David Sychrovský, Martin Schmid, Michal Šustr +1
Regret minimization is a general approach to online optimization which plays a crucial role in many algorithms for approximating Nash equilibria in two-player zero-sum games. The l…