default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDXiaoyu Chen 0008
Person information
- affiliation: Peking University, Key Laboratory of Machine Perception, School of Intelligence Science and Technology, China
Other persons with the same name
- Xiaoyu Chen (aka: Xiao-Yu Chen, Xiao-yu Chen) — disambiguation page
- Xiaoyu Chen 0001 — Beihang University, Beijing, China
- Xiaoyu Chen 0002
![[0000-0002-4588-8475]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-4588-8475")
— China University of Geosciences, Wuhan, China (and 1 more) - Xiaoyu Chen 0003 — Nanjing University of Science and Technology, Jiangsu Key Laboratory of Spectral Imaging and Intelligent Sense,, China
- Xiaoyu Chen 0004 — Huawei Translation Service Center, Beijing, China
- Xiaoyu Chen 0005 — University at Buffalo, Department of Industrial and Systems Engineering, NY, USA (and 2 more)
- Xiaoyu Chen 0006 — TU Darmstadt, Eduard-Zintl-Institut für Anorganische und Physikalische Chemie, Germany
- Xiaoyu Chen 0007 — Shanghai University, School of Cultural Heritage and Information Management, Department of Library, Information and Archives, China (and 1 more)
- Xiaoyu Chen 0009 — Yanshan University, School of Information Science and Engineering, Hebei Key Laboratory of Information Transmission and Signal Processing, Qinhuangdao, China
- Xiaoyu Chen 0010 (aka: Xiao-yu Chen 0010) — Zhejiang University City College, School of Information and Electrical Engineering, Hangzhou, China (and 2 more)
- Xiaoyu Chen 0011 — Northeastern University, State Key Laboratory of Synthetical Automation for Process Industries, College of Information Science and Engineering, Shenyang, China (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Conference and Workshop Papers
- 2023
[c9]Haotian Ye, Xiaoyu Chen, Liwei Wang, Simon Shaolei Du:
On the Power of Pre-training for Generalization in RL: Provable Benefits and Hardness. ICML 2023: 39770-39800- 2022
- [c8]Xiaoyu Chen, Jiachen Hu, Lin Yang, Liwei Wang:
Near-Optimal Reward-Free Exploration for Linear Mixture MDPs with Plug-in Solver. ICLR 2022 - [c7]Xiaoyu Chen, Jiachen Hu, Chi Jin, Lihong Li, Liwei Wang:
Understanding Domain Randomization for Sim-to-real Transfer. ICLR 2022 - [c6]Xiaoyu Chen, Han Zhong, Zhuoran Yang, Zhaoran Wang, Liwei Wang:
Human-in-the-loop: Provably Efficient Preference-based Reinforcement Learning with General Function Approximation. ICML 2022: 3773-3793 - 2021
- [c5]Xiaoyu Chen, Jiachen Hu, Lihong Li, Liwei Wang:
Efficient Reinforcement Learning in Factored MDPs with Application to Constrained RL. ICLR 2021 - [c4]Jiachen Hu, Xiaoyu Chen, Chi Jin, Lihong Li, Liwei Wang:
Near-Optimal Representation Learning for Linear Bandits and Linear RL. ICML 2021: 4349-4358 - 2020
- [c3]Yuanhao Wang, Kefan Dong, Xiaoyu Chen, Liwei Wang:
Q-learning with UCB Exploration is Sample Efficient for Infinite-Horizon MDP. ICLR 2020 - [c2]Yuanhao Wang, Jiachen Hu, Xiaoyu Chen, Liwei Wang:
Distributed Bandit Learning: Near-Optimal Regret with Efficient Communication. ICLR 2020 - [c1]Xiaoyu Chen, Kai Zheng, Zixin Zhou, Yunchang Yang, Wei Chen, Liwei Wang:
(Locally) Differentially Private Combinatorial Semi-Bandits. ICML 2020: 1757-1767
Informal and Other Publications
- 2022
- [i9]Xiaoyu Chen, Han Zhong, Zhuoran Yang, Zhaoran Wang, Liwei Wang:
Human-in-the-loop: Provably Efficient Preference-based Reinforcement Learning with General Function Approximation. CoRR abs/2205.11140 (2022) - [i8]Haotian Ye, Xiaoyu Chen, Liwei Wang, Simon S. Du:
On the Power of Pre-training for Generalization in RL: Provable Benefits and Hardness. CoRR abs/2210.10464 (2022) - 2021
- [i7]Jiachen Hu, Xiaoyu Chen, Chi Jin, Lihong Li, Liwei Wang:
Near-optimal Representation Learning for Linear Bandits and Linear RL. CoRR abs/2102.04132 (2021) - [i6]Xiaoyu Chen, Jiachen Hu, Chi Jin, Lihong Li, Liwei Wang:
Understanding Domain Randomization for Sim-to-real Transfer. CoRR abs/2110.03239 (2021) - [i5]Xiaoyu Chen, Jiachen Hu, Lin F. Yang, Liwei Wang:
Near-Optimal Reward-Free Exploration for Linear Mixture MDPs with Plug-in Solver. CoRR abs/2110.03244 (2021) - 2020
- [i4]Xiaoyu Chen, Kai Zheng, Zixin Zhou, Yunchang Yang, Wei Chen, Liwei Wang:
(Locally) Differentially Private Combinatorial Semi-Bandits. CoRR abs/2006.00706 (2020) - [i3]Xiaoyu Chen, Jiachen Hu, Lihong Li, Liwei Wang:
Efficient Reinforcement Learning in Factored MDPs with Application to Constrained RL. CoRR abs/2008.13319 (2020) - 2019
- [i2]Kefan Dong, Yuanhao Wang, Xiaoyu Chen, Liwei Wang:
Q-learning with UCB Exploration is Sample Efficient for Infinite-Horizon MDP. CoRR abs/1901.09311 (2019) - [i1]Yuanhao Wang, Jiachen Hu, Xiaoyu Chen, Liwei Wang:
Distributed Bandit Learning: How Much Communication is Needed to Achieve (Near) Optimal Regret. CoRR abs/1904.06309 (2019)
Coauthor Index
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 2024-11-05 22:04 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:
