Qiwen Cui

Orcid: 0000-0002-0193-6623

According to our database1, Qiwen Cui authored at least 19 papers between 2020 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
(N, K)-Puzzle: A Cost-Efficient Testbed for Benchmarking Reinforcement Learning Algorithms in Generative Language Model.
CoRR, 2024

Learning Optimal Tax Design in Nonatomic Congestion Games.
CoRR, 2024

Refined Sample Complexity for Markov Games with Independent Linear Function Approximation.
CoRR, 2024

2023
An Efficient Fisher Matrix Approximation Method for Large-Scale Neural Network Optimization.
IEEE Trans. Pattern Anal. Mach. Intell., May, 2023

Free from Bellman Completeness: Trajectory Stitching via Model-based Return-conditioned Supervised Learning.
CoRR, 2023

A Black-box Approach for Non-stationary Multi-agent Reinforcement Learning.
CoRR, 2023

Offline Congestion Games: How Feedback Type Affects Data Coverage Requirement.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

Breaking the Curse of Multiagents in a Large State Space: RL in Markov Games with Independent Linear Function Approximation.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

2022
When is Offline Two-Player Zero-Sum Markov Game Solvable?
CoRR, 2022

Near-Optimal Randomized Exploration for Tabular Markov Decision Processes.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

On Gap-dependent Bounds for Offline Reinforcement Learning.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Learning in Congestion Games with Bandit Feedback.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

When are Offline Two-Player Zero-Sum Markov Games Solvable?
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Provably Efficient Offline Multi-agent Reinforcement Learning via Strategy-wise Bonus.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

2021
Randomized Exploration for Reinforcement Learning with General Value Function Approximation.
CoRR, 2021

NG+ : A Multi-Step Matrix-Product Natural Gradient Method for Deep Learning.
CoRR, 2021

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

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

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


  Loading...