Lin Yang

Orcid: 0000-0003-4602-3366

Affiliations:
  • University of California, Los Angeles, CA, USA


According to our database1, Lin Yang authored at least 112 papers between 2013 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Federated Learning With Massive Random Access.
IEEE Trans. Wirel. Commun., October, 2024

Modeling Bellman-error with logistic distribution with applications in reinforcement learning.
Neural Networks, 2024

A collective AI via lifelong learning and sharing at the edge.
Nat. Mac. Intell., 2024

Misspecified Q-Learning with Sparse Linear Function Approximation: Tight Bounds on Approximation Error.
CoRR, 2024

Confident Natural Policy Gradient for Local Planning in q<sub>π</sub>-realizable Constrained MDPs.
CoRR, 2024

Learning for Bandits under Action Erasures.
CoRR, 2024

Don't Forget to Connect! Improving RAG with Graph-based Reranking.
CoRR, 2024

Provably Correct SGD-Based Exploration for Generalized Stochastic Bandit Problem.
Proceedings of the International Conference on Smart Applications, 2024

Delayed MDPs with Feature Mapping.
Proceedings of the International Joint Conference on Neural Networks, 2024

Horizon-Free and Instance-Dependent Regret Bounds for Reinforcement Learning with General Function Approximation.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2024

Multi-Agent Bandit Learning through Heterogeneous Action Erasure Channels.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2024

2023
Model-Based Multi-Agent RL in Zero-Sum Markov Games with Near-Optimal Sample Complexity.
J. Mach. Learn. Res., 2023

Adaptive Liquidity Provision in Uniswap V3 with Deep Reinforcement Learning.
CoRR, 2023

Scaling Distributed Multi-task Reinforcement Learning with Experience Sharing.
CoRR, 2023

Replicability in Reinforcement Learning.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Tackling Heavy-Tailed Rewards in Reinforcement Learning with Function Approximation: Minimax Optimal and Instance-Dependent Regret Bounds.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Efficient Batched Algorithm for Contextual Linear Bandits with Large Action Space via Soft Elimination.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Multi-Arm Bandits over Action Erasure Channels.
Proceedings of the IEEE International Symposium on Information Theory, 2023

Does Sparsity Help in Learning Misspecified Linear Bandits?
Proceedings of the International Conference on Machine Learning, 2023

Distributed Contextual Linear Bandits with Minimax Optimal Communication Cost.
Proceedings of the International Conference on Machine Learning, 2023

Provably Efficient Lifelong Reinforcement Learning with Linear Representation.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

Contexts can be Cheap: Solving Stochastic Contextual Bandits with Linear Bandit Algorithms.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

MetaVL: Transferring In-Context Learning Ability From Language Models to Vision-Language Models.
Proceedings of the 61st Annual Meeting of the Association for Computational Linguistics (Volume 2: Short Papers), 2023

2022
Compression for Multi-Arm Bandits.
IEEE J. Sel. Areas Inf. Theory, December, 2022

Universal Streaming of Subset Norms.
Theory Comput., 2022

Near Sample-Optimal Reduction-based Policy Learning for Average Reward MDP.
CoRR, 2022

From Local to Global: Spectral-Inspired Graph Neural Networks.
CoRR, 2022

Learning in Distributed Contextual Linear Bandits Without Sharing the Context.
CoRR, 2022

Provably Efficient Lifelong Reinforcement Learning with Linear Function Approximation.
CoRR, 2022

Near-Optimal Sample Complexity Bounds for Constrained MDPs.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Provably Feedback-Efficient Reinforcement Learning via Active Reward Learning.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Learning from Distributed Users in Contextual Linear Bandits Without Sharing the Context.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

On Improving Model-Free Algorithms for Decentralized Multi-Agent Reinforcement Learning.
Proceedings of the International Conference on Machine Learning, 2022

Near-Optimal Reward-Free Exploration for Linear Mixture MDPs with Plug-in Solver.
Proceedings of the Tenth International Conference on Learning Representations, 2022

Doubly Pessimistic Algorithms for Strictly Safe Off-Policy Optimization.
Proceedings of the 56th Annual Conference on Information Sciences and Systems, 2022

Gap-Dependent Unsupervised Exploration for Reinforcement Learning.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

Solving Multi-Arm Bandit Using a Few Bits of Communication.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

2021
Decentralized Cooperative Multi-Agent Reinforcement Learning with Exploration.
CoRR, 2021

Online Sub-Sampling for Reinforcement Learning with General Function Approximation.
CoRR, 2021

Provably Breaking the Quadratic Error Compounding Barrier in Imitation Learning, Optimally.
CoRR, 2021

A Provably Efficient Algorithm for Linear Markov Decision Process with Low Switching Cost.
CoRR, 2021

Minimax sample complexity for turn-based stochastic game.
Proceedings of the Thirty-Seventh Conference on Uncertainty in Artificial Intelligence, 2021

Breaking the Moments Condition Barrier: No-Regret Algorithm for Bandits with Super Heavy-Tailed Payoffs.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Accommodating Picky Customers: Regret Bound and Exploration Complexity for Multi-Objective Reinforcement Learning.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

On the Value of Interaction and Function Approximation in Imitation Learning.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Global Neighbor Sampling for Mixed CPU-GPU Training on Giant Graphs.
Proceedings of the KDD '21: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2021

Randomized Exploration in Reinforcement Learning with General Value Function Approximation.
Proceedings of the 38th International Conference on Machine Learning, 2021

Provably Correct Optimization and Exploration with Non-linear Policies.
Proceedings of the 38th International Conference on Machine Learning, 2021

Safe Reinforcement Learning with Linear Function Approximation.
Proceedings of the 38th International Conference on Machine Learning, 2021

Settling the Horizon-Dependence of Sample Complexity in Reinforcement Learning.
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

Q-learning with Logarithmic Regret.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

Theoretically Principled Deep RL Acceleration via Nearest Neighbor Function Approximation.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
The one-way communication complexity of dynamic time warping distance.
J. Comput. Geom., 2020

Episodic Linear Quadratic Regulators with Low-rank Transitions.
CoRR, 2020

Random Walk Bandits.
CoRR, 2020

Provably Efficient Reinforcement Learning with General Value Function Approximation.
CoRR, 2020

Is Long Horizon Reinforcement Learning More Difficult Than Short Horizon Reinforcement Learning?
CoRR, 2020

Provably Efficient Exploration for RL with Unsupervised Learning.
CoRR, 2020

Deep Reinforcement Learning with Linear Quadratic Regulator Regions.
CoRR, 2020

Preference-based Reinforcement Learning with Finite-Time Guarantees.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Planning with General Objective Functions: Going Beyond Total Rewards.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Reinforcement Learning with General Value Function Approximation: Provably Efficient Approach via Bounded Eluder Dimension.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

On Reward-Free Reinforcement Learning with Linear Function Approximation.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Is Long Horizon RL More Difficult Than Short Horizon RL?
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Toward the Fundamental Limits of Imitation Learning.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Provably Efficient Exploration for Reinforcement Learning Using Unsupervised Learning.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Is Plug-in Solver Sample-Efficient for Feature-based Reinforcement Learning?
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Model-Based Reinforcement Learning with Value-Targeted Regression.
Proceedings of the 2nd Annual Conference on Learning for Dynamics and Control, 2020

Reinforcement Learning in Feature Space: Matrix Bandit, Kernels, and Regret Bound.
Proceedings of the 37th International Conference on Machine Learning, 2020

Obtaining Adjustable Regularization for Free via Iterate Averaging.
Proceedings of the 37th International Conference on Machine Learning, 2020

Model-Based Reinforcement Learning with Value-Targeted Regression.
Proceedings of the 37th International Conference on Machine Learning, 2020

Is a Good Representation Sufficient for Sample Efficient Reinforcement Learning?
Proceedings of the 8th International Conference on Learning Representations, 2020

Model-Based Reinforcement Learning with a Generative Model is Minimax Optimal.
Proceedings of the Conference on Learning Theory, 2020

Solving Discounted Stochastic Two-Player Games with Near-Optimal Time and Sample Complexity.
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

Sketching Transformed Matrices with Applications to Natural Language Processing.
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

2019
Misspecified nonconvex statistical optimization for sparse phase retrieval.
Math. Program., 2019

Does Knowledge Transfer Always Help to Learn a Better Policy?
CoRR, 2019

Continuous Control with Contexts, Provably.
CoRR, 2019

On the Optimality of Sparse Model-Based Planning for Markov Decision Processes.
CoRR, 2019

Feature-Based Q-Learning for Two-Player Stochastic Games.
CoRR, 2019

Reinforcement Leaning in Feature Space: Matrix Bandit, Kernels, and Regret Bound.
CoRR, 2019

Sample-Optimal Parametric Q-Learning with Linear Transition Models.
CoRR, 2019

Online Factorization and Partition of Complex Networks by Random Walk.
Proceedings of the Thirty-Fifth Conference on Uncertainty in Artificial Intelligence, 2019

Efficient Symmetric Norm Regression via Linear Sketching.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Sample-Optimal Parametric Q-Learning Using Linearly Additive Features.
Proceedings of the 36th International Conference on Machine Learning, 2019

The One-Way Communication Complexity of Dynamic Time Warping Distance.
Proceedings of the 35th International Symposium on Computational Geometry, 2019

Learning to Control in Metric Space with Optimal Regret.
Proceedings of the 57th Annual Allerton Conference on Communication, 2019

Towards a Theoretical Understanding of Hashing-Based Neural Nets.
Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, 2019

On Constrained Nonconvex Stochastic Optimization: A Case Study for Generalized Eigenvalue Decomposition.
Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, 2019

2018
On Landscape of Lagrangian Functions and Stochastic Search for Constrained Nonconvex Optimization.
CoRR, 2018

Sensitivity Sampling Over Dynamic Geometric Data Streams with Applications to k-Clustering.
CoRR, 2018

Scalable streaming tools for analyzing N-body simulations: Finding halos and investigating excursion sets in one pass.
Astron. Comput., 2018

New Bounds for the CLIQUE-GAP Problem Using Graph Decomposition Theory.
Algorithmica, 2018

The Physical Systems Behind Optimization Algorithms.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Near-Optimal Time and Sample Complexities for Solving Markov Decision Processes with a Generative Model.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Dimensionality Reduction for Stationary Time Series via Stochastic Nonconvex Optimization.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Matrix Norms in Data Streams: Faster, Multi-Pass and Row-Order.
Proceedings of the 35th International Conference on Machine Learning, 2018

Revisiting Frequency Moment Estimation in Random Order Streams.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Approximate Convex Hull of Data Streams.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017
Misspecified Nonconvex Statistical Optimization for Phase Retrieval.
CoRR, 2017

Dynamic Factorization and Partition of Complex Networks.
CoRR, 2017

On Quadratic Convergence of DC Proximal Newton Algorithm for Nonconvex Sparse Learning in High Dimensions.
CoRR, 2017

Streaming symmetric norms via measure concentration.
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

On Quadratic Convergence of DC Proximal Newton Algorithm in Nonconvex Sparse Learning.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Online Partial Least Square Optimization: Dropping Convexity for Better Efficiency and Scalability.
Proceedings of the 34th International Conference on Machine Learning, 2017

Clustering High Dimensional Dynamic Data Streams.
Proceedings of the 34th International Conference on Machine Learning, 2017

2016
Sketches for Matrix Norms: Faster, Smaller and More General.
CoRR, 2016

Streaming Space Complexity of Nearly All Functions of One Variable on Frequency Vectors.
Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2016

2015
Streaming Symmetric Norms via Measure Concentration.
CoRR, 2015

Streaming Algorithms for Halo Finders.
Proceedings of the 11th IEEE International Conference on e-Science, 2015

2014
New Time-Space Upperbounds for Directed Reachability in High-genus and H-minor-free Graphs.
Electron. Colloquium Comput. Complex., 2014

2013
Mathematical Theories of Interaction with Oracles.
PhD thesis, 2013


  Loading...