Yingbin Liang
2 indexed papers
Publications per year
Top categories
Frequent co-authors
Research Timeline
This paper demonstrates that transformer-based policies can provably learn complex tree search mechanisms, such as depth-first search, purely through reinforcement learning in a stochastic environment.
This paper demonstrates that transformer-based policies can provably learn complex tree search mechanisms, such as depth-first search, purely through reinforcement learning in a stochastic environment.
Papers
Agentic Transformers Provably Learn to Search via Reinforcement Learning
This paper demonstrates that transformer-based policies can provably learn complex tree search mechanisms, such as depth-first search, purely through reinforcement learning in a stochastic environment…