Lin F. Yang
11 papers · 2017–2026 · 9 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+6 more ↓ Show less ↑
π Cross-Pollinator (8) π Academic Marathon (7) π§ Keyword Pioneer π Conference Polyglot (8) π Interdisciplinary Bridge
πΊοΈ
Taxonomy Completionist
(17)
π
Conference Polyglot
(8)
π
Grand Slam
π
Century Club
(10)
π
Trend Setter
β
The Questioner
Conferences
ICML (2)
NIPS (2)
AAAI (1)
AISTATS (1)
ALT (1)
COLT (1)
ICLR (1)
JMLR (1)
UAI (1)
Top co-authors
Keywords
sample complexity
(3)
regret bound
(2)
model-based reinforcement learning
(2)
generative model
(2)
nash equilibrium
(2)
multi-agent reinforcement learning
(2)
stochastic gradient descent
(1)
reinforcement learning
(1)
neural network compression
(1)
global convergence
(1)
pac bound
(1)
function approximation
(1)
nearest neighbor
(1)
value function
(1)
primal-dual framework
(1)
non-convex optimization
(1)
multi-agent learning
(1)
minimax bounds
(1)
sample efficiency
(1)
representation learning
(1)
Papers
Sample Complexity Bounds for Linear Constrained MDPs with a Generative Model
ALT 2026
Uniform Last-Iterate Guarantee for Bandits and Reinforcement Learning
NIPS 2024
Confident Natural Policy Gradient for Local Planning in $q_\pi$-realizable Constrained MDPs
NIPS 2024
Model-Based Multi-Agent RL in Zero-Sum Markov Games with Near-Optimal Sample Complexity
JMLR 2023
Theoretically Principled Deep RL Acceleration via Nearest Neighbor Function Approximation
AAAI 2021
Minimax sample complexity for turn-based stochastic game
UAI 2021
Model-Based Reinforcement Learning with a Generative Model is Minimax Optimal
COLT 2020
Is a Good Representation Sufficient for Sample Efficient Reinforcement Learning?
ICLR 2020
Towards a Theoretical Understanding of Hashing-Based Neural Nets
AISTATS 2019
Online Partial Least Square Optimization: Dropping Convexity for Better Efficiency and Scalability
ICML 2017
Clustering High Dimensional Dynamic Data Streams
ICML 2017