Showing cs.AIShow all
2 papers · 1 filter
cs.AI2026
Neurosymbolic Reasoning with Incremental Knowledge for Sample Efficient Hierarchical Reinforcement Learning
Subrat Prasad Panda, Blaise Genest, Arvind Easwaran
(Flat) Reinforcement Learning (RL) agents face significant challenges in environments with sparse rewards that require long-horizon reasoning. A compelling approach to improve samp…
cs.AI2025
Solution-aware vs global ReLU selection: partial MILP strikes back for DNN verification
Yuke Liao, Blaise Genest, Kuldeep Meel +1
To handle complex instances, we revisit a divide-and-conquer approach to break down the complexity: instead of few complex BaB calls, we rely on many small {\em partial} MILP calls…