Yang, Lin
112 publications
NeurIPS
2025
Breaking the Frozen Subspace: Importance Sampling for Low-Rank Optimization in LLM Pretraining
ICLR
2025
Large-Scale and Fine-Grained Vision-Language Pre-Training for Enhanced CT Image Understanding
NeurIPS
2025
LogicTree: Improving Complex Reasoning of LLMs via Instantiated Multi-Step Synthetic Logical Data
UAI
2025
Near-Optimal Regret Bounds for Federated Multi-Armed Bandits with Fully Distributed Communication
ICLR
2025
PathGen-1.6m: 1.6 Million Pathology Image-Text Pairs Generation Through Multi-Agent Collaboration
NeurIPS
2025
PathVQ: Reforming Computational Pathology Foundation Model for Whole Slide Image Analysis via Vector Quantization
NeurIPS
2025
Trajectory Graph Learning: Aligning with Long Trajectories in Reinforcement Learning Without Reward Design
NeurIPS
2025
VETA-DiT: Variance-Equalized and Temporally Adaptive Quantization for Efficient 4-Bit Diffusion Transformers
AISTATS
2024
Horizon-Free and Instance-Dependent Regret Bounds for Reinforcement Learning with General Function Approximation
NeurIPSW
2024
Misspecified $q$ -Learning with Sparse Linear Function Approximation: Tight Bounds on Approximation Error
AAAI
2024
PathAsst: A Generative Foundation AI Assistant Towards Artificial General Intelligence of Pathology
ECCV
2024
PathMMU: A Massive Multimodal Expert-Level Benchmark for Understanding and Reasoning in Pathology
COLT
2023
Contexts Can Be Cheap: Solving Stochastic Contextual Bandits with Linear Bandit Algorithms
NeurIPS
2023
Efficient Batched Algorithm for Contextual Linear Bandits with Large Action Space via Soft Elimination
NeurIPS
2022
Learning from Distributed Users in Contextual Linear Bandits Without Sharing the Context
NeurIPS
2021
Accommodating Picky Customers: Regret Bound and Exploration Complexity for Multi-Objective Reinforcement Learning
NeurIPS
2021
Breaking the Moments Condition Barrier: No-Regret Algorithm for Bandits with Super Heavy-Tailed Payoffs
ICML
2021
Randomized Exploration in Reinforcement Learning with General Value Function Approximation
NeurIPS
2020
Model-Based Multi-Agent RL in Zero-Sum Markov Games with Near-Optimal Sample Complexity
AISTATS
2020
Solving Discounted Stochastic Two-Player Games with Near-Optimal Time and Sample Complexity
AISTATS
2019
On Constrained Nonconvex Stochastic Optimization: A Case Study for Generalized Eigenvalue Decomposition
NeurIPS
2018
Dimensionality Reduction for Stationary Time Series via Stochastic Nonconvex Optimization
NeurIPS
2018
Near-Optimal Time and Sample Complexities for Solving Markov Decision Processes with a Generative Model
NeurIPS
2016
Combining Fully Convolutional and Recurrent Neural Networks for 3D Biomedical Image Segmentation