1 citations · 1 across the 3 of their papers we have counts for
3 papers
cs.LG2025★ 1 cited
Minimizing the Weighted Number of Tardy Jobs: Data-Driven Heuristic for Single-Machine Scheduling
Nikolai Antonov, Prěmysl Šůcha, Mikoláš Janota +1
Existing research on single-machine scheduling is largely focused on exact algorithms, which perform well on typical instances but can significantly deteriorate on certain regions…
cs.LG2024
Understanding GNNs for Boolean Satisfiability through Approximation Algorithms
Jan Hůla, David Mojžíšek, Mikoláš Janota
The paper deals with the interpretability of Graph Neural Networks in the context of Boolean Satisfiability. The goal is to demystify the internal workings of these models and prov…
cs.LG2024
Towards an Understanding of Stepwise Inference in Transformers: A Synthetic Graph Navigation Model
Mikail Khona, Maya Okawa, Jan Hula +5
Stepwise inference protocols, such as scratchpads and chain-of-thought, help language models solve complex problems by decomposing them into a sequence of simpler subproblems. Desp…