Get our free extension to see links to code for papers anywhere online!

Add to Chrome

Add to Firefox

Picture for Lin F. Yang

Lin F. Yang

Near Sample-Optimal Reduction-based Policy Learning for Average Reward MDP

Dec 01, 2022
Jinghan Wang, Mengdi Wang, Lin F. Yang

Figure 1 for Near Sample-Optimal Reduction-based Policy Learning for Average Reward MDP

Figure 2 for Near Sample-Optimal Reduction-based Policy Learning for Average Reward MDP

Figure 3 for Near Sample-Optimal Reduction-based Policy Learning for Average Reward MDP

Access Paper or Ask Questions

Contexts can be Cheap: Solving Stochastic Contextual Bandits with Linear Bandit Algorithms

Nov 08, 2022
Osama A. Hanna, Lin F. Yang, Christina Fragouli

Figure 1 for Contexts can be Cheap: Solving Stochastic Contextual Bandits with Linear Bandit Algorithms

Access Paper or Ask Questions

Near-Optimal Sample Complexity Bounds for Constrained MDPs

Jun 13, 2022
Sharan Vaswani, Lin F. Yang, Csaba Szepesvári

Figure 1 for Near-Optimal Sample Complexity Bounds for Constrained MDPs

Figure 2 for Near-Optimal Sample Complexity Bounds for Constrained MDPs

Access Paper or Ask Questions

Learning in Distributed Contextual Linear Bandits Without Sharing the Context

Jun 08, 2022
Osama A. Hanna, Lin F. Yang, Christina Fragouli

Access Paper or Ask Questions

Provably Efficient Lifelong Reinforcement Learning with Linear Function Approximation

Jun 01, 2022
Sanae Amani, Lin F. Yang, Ching-An Cheng

Access Paper or Ask Questions

Distributed Contextual Linear Bandits with Minimax Optimal Communication Cost

May 26, 2022
Sanae Amani, Tor Lattimore, András György, Lin F. Yang

Figure 1 for Distributed Contextual Linear Bandits with Minimax Optimal Communication Cost

Figure 2 for Distributed Contextual Linear Bandits with Minimax Optimal Communication Cost

Access Paper or Ask Questions

Settling the Horizon-Dependence of Sample Complexity in Reinforcement Learning

Nov 01, 2021
Yuanzhi Li, Ruosong Wang, Lin F. Yang

Access Paper or Ask Questions