Near-Optimal Reinforcement Learning with Multi-Step Transition Lookahead
Theorists prove multi-step lookahead RL planning is NP-hard for every fixed rational discount factor yet give a randomized polynomial-time approximation scheme.
1 stories, newest first · one card per story
Theorists prove multi-step lookahead RL planning is NP-hard for every fixed rational discount factor yet give a randomized polynomial-time approximation scheme.
Today 1.5K readers · 2.4K views · 757 reads · all time 189K views