Zaiwei Chen

Orcid: 0000-0001-9915-5595

According to our database1, Zaiwei Chen authored at least 22 papers between 2019 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A Lyapunov Theory for Finite-Sample Guarantees of Markovian Stochastic Approximation.
Oper. Res., 2024

Last-Iterate Convergence of Payoff-Based Independent Learning in Zero-Sum Stochastic Games.
CoRR, 2024

Approximate Global Convergence of Independent Learning in Multi-Agent Systems.
CoRR, 2024

2023
Target Network and Truncation Overcome the Deadly Triad in \(\boldsymbol{Q}\)-Learning.
SIAM J. Math. Data Sci., December, 2023

Global Convergence of Localized Policy Iteration in Networked Multi-Agent Reinforcement Learning.
Proc. ACM Meas. Anal. Comput. Syst., March, 2023

Two-Timescale Q-Learning with Function Approximation in Zero-Sum Stochastic Games.
CoRR, 2023

Concentration of Contractive Stochastic Approximation: Additive and Multiplicative Noise.
CoRR, 2023

Convergence rates for localized actor-critic in networked Markov potential games.
Proceedings of the Uncertainty in Artificial Intelligence, 2023

A Finite-Sample Analysis of Payoff-Based Independent Learning in Zero-Sum Stochastic Games.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

2022
A Unified Lyapunov Framework for Finite-Sample Analysis of Reinforcement Learning Algorithms.
SIGMETRICS Perform. Evaluation Rev., December, 2022

Stationary Behavior of Constant Stepsize SGD Type Algorithms: An Asymptotic Characterization.
Proc. ACM Meas. Anal. Comput. Syst., 2022

Finite-Sample Analysis of Off-Policy Natural Actor-Critic With Linear Function Approximation.
IEEE Control. Syst. Lett., 2022

Target Network and Truncation Overcome The Deadly triad in Q-Learning.
CoRR, 2022

Finite-sample analysis of nonlinear stochastic approximation with applications in reinforcement learning.
Autom., 2022

Sample Complexity of Policy-Based Methods under Off-Policy Sampling and Linear Function Approximation.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

2021
Nested Vehicle Routing Problem: Optimizing Drone-Truck Surveillance Operations.
CoRR, 2021

A Lyapunov Theory for Finite-Sample Guarantees of Asynchronous Q-Learning and TD-Learning Variants.
CoRR, 2021

Finite-Sample Analysis of Off-Policy TD-Learning via Generalized Bellman Operators.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Finite-Sample Analysis of Off-Policy Natural Actor-Critic Algorithm.
Proceedings of the 38th International Conference on Machine Learning, 2021

2020
Finite-Sample Analysis of Stochastic Approximation Using Smooth Convex Envelopes.
CoRR, 2020

Finite-Sample Analysis of Contractive Stochastic Approximation Using Smooth Convex Envelopes.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

2019
Finite-Time Analysis of Q-Learning with Linear Function Approximation.
CoRR, 2019


  Loading...