Lin Yang
103 papers · 2015–2026 · 15 venues · across top CS/AI venues
This profile combines several different researchers. Authors are keyed by name, and this name's papers fall into 28 separate collaboration groups - the largest holds only 31% of them. Pick the group below that matches the researcher you mean. How a shared name is split.
Achievements are not shown for a combined profile - each one describes a single researcher's record, which this is not.
Which Lin Yang?
9 groups of papers that share co-authors internally but none with each other - each most likely a different researcher. Pick one to see its papers.
with Ruosong Wang, Mengdi Wang, Vladimir braverman
32 papers
· 2017–2025
· NeurIPS, ICML, AISTATS
Hide ▲
Misspecified Q-Learning with Sparse Linear Function Approximation: Tight Bounds on Approximation Error
ICLR 2025
Regret-Optimal List Replicable Bandit Learning: Matching Upper and Lower Bounds
ICLR 2025
Gap-Dependent Unsupervised Exploration for Reinforcement Learning
AISTATS 2022
Near-Optimal Sample Complexity Bounds for Constrained MDPs
NeurIPS 2022
On Improving Model-Free Algorithms for Decentralized Multi-Agent Reinforcement Learning
ICML 2022
Accommodating Picky Customers: Regret Bound and Exploration Complexity for Multi-Objective Reinforcement Learning
NeurIPS 2021
Provably Correct Optimization and Exploration with Non-linear Policies
ICML 2021
Randomized Exploration in Reinforcement Learning with General Value Function Approximation
ICML 2021
Is Long Horizon RL More Difficult Than Short Horizon RL?
NeurIPS 2020
Is Plug-in Solver Sample-Efficient for Feature-based Reinforcement Learning?
NeurIPS 2020
Model-Based Multi-Agent RL in Zero-Sum Markov Games with Near-Optimal Sample Complexity
NeurIPS 2020
Model-Based Reinforcement Learning with Value-Targeted Regression
ICML 2020
Model-Based Reinforcement Learning with Value-Targeted Regression
L4DC 2020
Nearly Linear Row Sampling Algorithm for Quantile Regression
ICML 2020
Obtaining Adjustable Regularization for Free via Iterate Averaging
ICML 2020
On Reward-Free Reinforcement Learning with Linear Function Approximation
NeurIPS 2020
Planning with General Objective Functions: Going Beyond Total Rewards
NeurIPS 2020
Preference-based Reinforcement Learning with Finite-Time Guarantees
NeurIPS 2020
Provably Efficient Exploration for Reinforcement Learning Using Unsupervised Learning
NeurIPS 2020
Reinforcement Learning in Feature Space: Matrix Bandit, Kernels, and Regret Bound
ICML 2020
Reinforcement Learning with General Value Function Approximation: Provably Efficient Approach via Bounded Eluder Dimension
NeurIPS 2020
Sketching Transformed Matrices with Applications to Natural Language Processing
AISTATS 2020
Solving Discounted Stochastic Two-Player Games with Near-Optimal Time and Sample Complexity
AISTATS 2020
Efficient Symmetric Norm Regression via Linear Sketching
NeurIPS 2019
On Constrained Nonconvex Stochastic Optimization: A Case Study for Generalized Eigenvalue Decomposition
AISTATS 2019
Online Factorization and Partition of Complex Networks by Random Walk
UAI 2019
Sample-Optimal Parametric Q-Learning Using Linearly Additive Features
ICML 2019
Dimensionality Reduction for Stationary Time Series via Stochastic Nonconvex Optimization
NeurIPS 2018
Matrix Norms in Data Streams: Faster, Multi-Pass and Row-Order
ICML 2018
Near-Optimal Time and Sample Complexities for Solving Markov Decision Processes with a Generative Model
NeurIPS 2018
The Physical Systems Behind Optimization Algorithms
NeurIPS 2018
On Quadratic Convergence of DC Proximal Newton Algorithm in Nonconvex Sparse Learning
NeurIPS 2017
19 papers whose co-authors appear nowhere else under this name
ImpRIF: Stronger Implicit Reasoning Leads to Better Complex Instruction Following
ACL 2026
Spatio-Temporal Difference Guided Motion Deblurring with the Complementary Vision Sensor
CVPR 2026
Boosting Multi-Domain Fine-Tuning of Large Language Models through Evolving Interactions between Samples
ICML 2025
CoCa-CXR: Contrastive Captioners Learn Strong Temporal Structures for Chest X-Ray Vision-Language Understanding
MICCAI 2025
Transfer Q-Learning with Composite MDP Structures
ICML 2025
LLMEmbed: Rethinking Lightweight LLM’s Genuine Function in Text Classification
ACL 2024
Does Sparsity Help in Learning Misspecified Linear Bandits?
ICML 2023
Horizon-free Learning for Markov Decision Processes and Games: Stochastically Bounded Rewards and Improved Bounds
ICML 2023
MetaVL: Transferring In-Context Learning Ability From Language Models to Vision-Language Models
ACL 2023
Replicability in Reinforcement Learning
NeurIPS 2023
Cross-Patch Dense Contrastive Learning for Semi-Supervised Segmentation of Cellular Nuclei in Histopathologic Images
CVPR 2022
Explainable Survival Analysis with Convolution-Involved Vision Transformer
AAAI 2022
Hybrid Curriculum Learning for Emotion Recognition in Conversation
AAAI 2022
Provably Feedback-Efficient Reinforcement Learning via Active Reward Learning
NeurIPS 2022
Q-learning with Logarithmic Regret
AISTATS 2021
The LeVoice Far-Field Speech Recognition System for VOiCES from a Distance Challenge 2019
Interspeech 2019
Quantization of Fully Convolutional Networks for Accurate Biomedical Image Segmentation
CVPR 2018
Super Characters: A Conversion from Sentiment Classification to Image Classification
EMNLP 2018
Fine-Grained Histopathological Image Analysis via Robust Segmentation and Large-Scale Retrieval
CVPR 2015