Maksymilian Manko

The Two-Hump Problem: Bridging the Difficulty Gap in Mathematical Reinforcement Learning

Mathematical search problems present a unique challenge for Reinforcement Learning (RL) due to vast search spaces and sparse rewards. In previous works, the Andrews-Curtis (AC) conjecture was established as an illustrative example of such problems. In this work, we identify a critical structural bar…