Lin Yang
Orcid: 0000-0003-4602-3366Affiliations:
- University of California, Los Angeles, CA, USA
According to our database1,
Lin Yang
authored at least 112 papers
between 2013 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
IEEE Trans. Wirel. Commun., October, 2024
Modeling Bellman-error with logistic distribution with applications in reinforcement learning.
Neural Networks, 2024
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
Proceedings of the International Conference on Smart Applications, 2024
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
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
CoRR, 2023
CoRR, 2023
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
Proceedings of the IEEE International Symposium on Information Theory, 2023
Proceedings of the International Conference on Machine Learning, 2023
Proceedings of the International Conference on Machine Learning, 2023
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
CoRR, 2022
CoRR, 2022
Provably Efficient Lifelong Reinforcement Learning with Linear Function Approximation.
CoRR, 2022
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022
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
Proceedings of the Tenth International Conference on Learning Representations, 2022
Proceedings of the 56th Annual Conference on Information Sciences and Systems, 2022
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022
2021
CoRR, 2021
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
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
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021
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
Proceedings of the 38th International Conference on Machine Learning, 2021
Proceedings of the 38th International Conference on Machine Learning, 2021
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021
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
J. Comput. Geom., 2020
CoRR, 2020
Is Long Horizon Reinforcement Learning More Difficult Than Short Horizon Reinforcement Learning?
CoRR, 2020
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020
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
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020
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
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020
Proceedings of the 2nd Annual Conference on Learning for Dynamics and Control, 2020
Proceedings of the 37th International Conference on Machine Learning, 2020
Proceedings of the 37th International Conference on Machine Learning, 2020
Proceedings of the 37th International Conference on Machine Learning, 2020
Proceedings of the 8th International Conference on Learning Representations, 2020
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
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020
2019
Math. Program., 2019
CoRR, 2019
CoRR, 2019
Proceedings of the Thirty-Fifth Conference on Uncertainty in Artificial Intelligence, 2019
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019
Proceedings of the 36th International Conference on Machine Learning, 2019
Proceedings of the 35th International Symposium on Computational Geometry, 2019
Proceedings of the 57th Annual Allerton Conference on Communication, 2019
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
Algorithmica, 2018
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
Proceedings of the 35th International Conference on Machine Learning, 2018
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018
2017
On Quadratic Convergence of DC Proximal Newton Algorithm for Nonconvex Sparse Learning in High Dimensions.
CoRR, 2017
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
Proceedings of the 34th International Conference on Machine Learning, 2017
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
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