default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDan Qiao 0002
Person information
- affiliation: University of California Santa Barbara, Department of Computer Science, CA, USA
Other persons with the same name
- Dan Qiao — disambiguation page
- Dan Qiao 0001 — Southeast University, National Mobile Communications Research Laboratory, Nanjing, China
- Dan Qiao 0003
![[0000-0002-2364-6897]](https://dblp1.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-2364-6897")
— Chinese University of Hong Kong, School of Data Science, Shenzhen, 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
- 2024
[c7]Dan Qiao, Yu-Xiang Wang:
Near-Optimal Reinforcement Learning with Self-Play under Adaptivity Constraints. ICML 2024- 2023
- [c6]Dan Qiao, Yu-Xiang Wang:
Near-Optimal Differentially Private Reinforcement Learning. AISTATS 2023: 9914-9940 - [c5]Jianyu Xu, Dan Qiao, Yu-Xiang Wang:
Doubly Fair Dynamic Pricing. AISTATS 2023: 9941-9975 - [c4]Dan Qiao, Yu-Xiang Wang:
Near-Optimal Deployment Efficiency in Reward-Free Reinforcement Learning with Linear Function Approximation. ICLR 2023 - [c3]Dan Qiao, Yu-Xiang Wang:
Offline Reinforcement Learning with Differential Privacy. NeurIPS 2023 - 2022
- [c2]Dan Qiao, Ming Yin, Ming Min, Yu-Xiang Wang:
Sample-Efficient Reinforcement Learning with loglog(T) Switching Cost. ICML 2022: 18031-18061 - [c1]Fuheng Zhao, Dan Qiao, Rachel Redberg, Divyakant Agrawal, Amr El Abbadi, Yu-Xiang Wang:
Differentially Private Linear Sketches: Efficient Implementations and Applications. NeurIPS 2022
Informal and Other Publications
- 2024
- [i10]Dan Qiao, Yu-Xiang Wang:
Near-Optimal Reinforcement Learning with Self-Play under Adaptivity Constraints. CoRR abs/2402.01111 (2024) - [i9]Dan Qiao, Yu-Xiang Wang:
Differentially Private Reinforcement Learning with Self-Play. CoRR abs/2404.07559 (2024) - [i8]Dan Qiao, Kaiqi Zhang, Esha Singh, Daniel Soudry, Yu-Xiang Wang:
Stable Minima Cannot Overfit in Univariate ReLU Networks: Generalization by Large Step Sizes. CoRR abs/2406.06838 (2024) - 2023
- [i7]Dan Qiao, Ming Yin, Yu-Xiang Wang:
Logarithmic Switching Cost in Reinforcement Learning beyond Linear MDPs. CoRR abs/2302.12456 (2023) - 2022
- [i6]Dan Qiao, Ming Yin, Ming Min, Yu-Xiang Wang:
Sample-Efficient Reinforcement Learning with loglog(T) Switching Cost. CoRR abs/2202.06385 (2022) - [i5]Fuheng Zhao, Dan Qiao, Rachel Redberg, Divyakant Agrawal, Amr El Abbadi, Yu-Xiang Wang:
Differentially Private Linear Sketches: Efficient Implementations and Applications. CoRR abs/2205.09873 (2022) - [i4]Dan Qiao, Yu-Xiang Wang:
Offline Reinforcement Learning with Differential Privacy. CoRR abs/2206.00810 (2022) - [i3]Jianyu Xu, Dan Qiao, Yu-Xiang Wang:
Doubly Fair Dynamic Pricing. CoRR abs/2209.11837 (2022) - [i2]Dan Qiao, Yu-Xiang Wang:
Near-Optimal Deployment Efficiency in Reward-Free Reinforcement Learning with Linear Function Approximation. CoRR abs/2210.00701 (2022) - [i1]Dan Qiao, Yu-Xiang Wang:
Near-Optimal Differentially Private Reinforcement Learning. CoRR abs/2212.04680 (2022)
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-10-08 21:27 CEST 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:
