default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRunlong Zhou
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c5]Runlong Zhou, Simon S. Du, Beibin Li:
Reflect-RL: Two-Player Online RL Fine-Tuning for LMs. ACL (1) 2024: 995-1015- [c4]Zhaoyi Zhou, Chuning Zhu, Runlong Zhou, Qiwen Cui, Abhishek Gupta, Simon Shaolei Du:
Free from Bellman Completeness: Trajectory Stitching via Model-based Return-conditioned Supervised Learning. ICLR 2024 - [i9]Runlong Zhou, Simon S. Du, Beibin Li:
Reflect-RL: Two-Player Online RL Fine-Tuning for LMs. CoRR abs/2402.12621 (2024) - [i8]Natalia Zhang, Xinqi Wang, Qiwen Cui, Runlong Zhou, Sham M. Kakade, Simon S. Du:
Multi-Agent Reinforcement Learning from Human Feedback: Data Coverage and Algorithmic Techniques. CoRR abs/2409.00717 (2024) - [i7]Ruizhe Shi, Runlong Zhou, Simon S. Du:
The Crucial Role of Samplers in Online Direct Preference Optimization. CoRR abs/2409.19605 (2024) - [i6]Xiyu Zhai, Runlong Zhou, Liao Zhang, Simon Shaolei Du:
Transformers are Efficient Compilers, Provably. CoRR abs/2410.14706 (2024) - 2023
- [j1]Runlong Zhou, Zelin He, Yuandong Tian, Yi Wu, Simon Shaolei Du:
Understanding Curriculum Learning in Policy Optimization for Online Combinatorial Optimization. Trans. Mach. Learn. Res. 2023 (2023) - [c3]Runlong Zhou, Ruosong Wang, Simon Shaolei Du:
Horizon-Free and Variance-Dependent Reinforcement Learning for Latent Markov Decision Processes. ICML 2023: 42698-42723 - [c2]Runlong Zhou, Zihan Zhang, Simon Shaolei Du:
Sharp Variance-Dependent Bounds in Reinforcement Learning: Best of Both Worlds in Stochastic and Deterministic Environments. ICML 2023: 42878-42914 - [i5]Runlong Zhou, Zihan Zhang, Simon S. Du:
Sharp Variance-Dependent Bounds in Reinforcement Learning: Best of Both Worlds in Stochastic and Deterministic Environments. CoRR abs/2301.13446 (2023) - [i4]Zhaoyi Zhou, Chuning Zhu, Runlong Zhou, Qiwen Cui, Abhishek Gupta, Simon Shaolei Du:
Free from Bellman Completeness: Trajectory Stitching via Model-based Return-conditioned Supervised Learning. CoRR abs/2310.19308 (2023) - 2022
- [i3]Runlong Zhou, Yuandong Tian, Yi Wu, Simon S. Du:
Understanding Curriculum Learning in Policy Optimization for Solving Combinatorial Optimization Problems. CoRR abs/2202.05423 (2022) - [i2]Runlong Zhou, Ruosong Wang, Simon S. Du:
Horizon-Free Reinforcement Learning for Latent Markov Decision Processes. CoRR abs/2210.11604 (2022) - 2021
- [c1]Jean Tarbouriech, Runlong Zhou, Simon S. Du, Matteo Pirotta, Michal Valko, Alessandro Lazaric:
Stochastic Shortest Path: Minimax, Parameter-Free and Towards Horizon-Free Regret. NeurIPS 2021: 6843-6855 - [i1]Jean Tarbouriech, Runlong Zhou, Simon S. Du, Matteo Pirotta, Michal Valko, Alessandro Lazaric:
Stochastic Shortest Path: Minimax, Parameter-Free and Towards Horizon-Free Regret. CoRR abs/2104.11186 (2021)
Coauthor Index
aka: Simon Shaolei Du
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:54 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
