default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYaqi Duan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j5]Zitian Huo
, Yaqi Duan, Dongdong Zhan, Xizhen Xu, Nairen Zheng, Jing Cai, Ruifang Sun, Jianping Wang, Fang Cheng, Zhan Gao, Caixia Xu, Wanlin Liu, Yuting Dong, Sailong Ma, Qian Zhang, Yiyun Zheng, Liping Lou, Dong Kuang, Qian Chu, Jun Qin, Guoping Wang, Yi Wang:
Proteomic Stratification of Prognosis and Treatment Options for Small Cell Lung Cancer. Genom. Proteom. Bioinform. 22(1) (2024)- [i13]Yaqi Duan, Martin J. Wainwright:
Taming "data-hungry" reinforcement learning? Stability in continuous state-action spaces. CoRR abs/2401.05233 (2024) - 2023
- [j4]Chengzhuo Ni, Yaqi Duan, Munther A. Dahleh, Mengdi Wang, Anru R. Zhang:
Learning Good State and Action Representations for Markov Decision Process via Tensor Decomposition. J. Mach. Learn. Res. 24: 115:1-115:53 (2023) - [j3]Aihua Mao, Zihui Du, Junhui Hou, Yaqi Duan, Yong-Jin Liu, Ying He:
PU-Flow: A Point Cloud Upsampling Network With Normalizing Flows. IEEE Trans. Vis. Comput. Graph. 29(12): 4964-4977 (2023) - [c10]Aihua Mao, Yaqi Duan, Yu-Hui Wen, Zihui Du, Hongmin Cai, Yong-Jin Liu:
Invertible Residual Neural Networks with Conditional Injector and Interpolator for Point Cloud Upsampling. IJCAI 2023: 1267-1275 - [c9]Yaqi Duan, Martin J. Wainwright:
A finite-sample analysis of multi-step temporal difference estimates. L4DC 2023: 612-624 - 2022
- [b1]Yaqi Duan:
Policy Evaluation in Batch Reinforcement Learning. Princeton University, USA, 2022 - [j2]Yaqi Duan, Jinglong Chen, Tianci Zhang, Shuilong He, Yong Feng, Jingsong Xie, Wenrong Xiao:
High-temperature augmented neighborhood metric learning for cross-domain fault diagnosis with imbalanced data. Knowl. Based Syst. 257: 109930 (2022) - [c8]Ming Yin, Yaqi Duan, Mengdi Wang, Yu-Xiang Wang:
Near-optimal Offline Reinforcement Learning with Linear Representation: Leveraging Variance Information with Pessimism. ICLR 2022 - [i12]Yaqi Duan, Kaizheng Wang:
Adaptive and Robust Multi-task Learning. CoRR abs/2202.05250 (2022) - [i11]Ming Yin, Yaqi Duan, Mengdi Wang, Yu-Xiang Wang:
Near-optimal Offline Reinforcement Learning with Linear Representation: Leveraging Variance Information with Pessimism. CoRR abs/2203.05804 (2022) - [i10]Yaqi Duan, Martin J. Wainwright:
Policy evaluation from a single path: Multi-step methods, mixing and mis-specification. CoRR abs/2211.03899 (2022) - 2021
- [c7]Yaqi Duan, Chi Jin, Zhiyuan Li:
Risk Bounds and Rademacher Complexity in Batch Reinforcement Learning. ICML 2021: 2892-2902 - [c6]Botao Hao, Yaqi Duan, Tor Lattimore, Csaba Szepesvári, Mengdi Wang:
Sparse Feature Selection Makes Batch Reinforcement Learning More Sample Efficient. ICML 2021: 4063-4073 - [c5]Botao Hao, Xiang Ji, Yaqi Duan, Hao Lu, Csaba Szepesvári, Mengdi Wang:
Bootstrapping Fitted Q-Evaluation for Off-Policy Inference. ICML 2021: 4074-4084 - [c4]Chengzhuo Ni, Anru R. Zhang, Yaqi Duan, Mengdi Wang:
Learning Good State and Action Representations via Tensor Decomposition. ISIT 2021: 1682-1687 - [i9]Botao Hao, Xiang Ji, Yaqi Duan, Hao Lu, Csaba Szepesvári, Mengdi Wang:
Bootstrapping Statistical Inference for Off-Policy Evaluation. CoRR abs/2102.03607 (2021) - [i8]Yaqi Duan, Chi Jin, Zhiyuan Li:
Risk Bounds and Rademacher Complexity in Batch Reinforcement Learning. CoRR abs/2103.13883 (2021) - [i7]Chengzhuo Ni, Anru Zhang, Yaqi Duan, Mengdi Wang:
Learning Good State and Action Representations via Tensor Decomposition. CoRR abs/2105.01136 (2021) - [i6]Aihua Mao, Zihui Du, Junhui Hou, Yaqi Duan, Yong-Jin Liu, Ying He:
PU-Flow: a Point Cloud Upsampling Networkwith Normalizing Flows. CoRR abs/2107.05893 (2021) - [i5]Yaqi Duan, Mengdi Wang, Martin J. Wainwright:
Optimal policy evaluation using kernel-based temporal difference methods. CoRR abs/2109.12002 (2021) - 2020
- [j1]Yaqi Duan, Mengdi Wang, Zaiwen Wen, Yaxiang Yuan:
Adaptive Low-Nonnegative-Rank Approximation for State Aggregation of Markov Chains. SIAM J. Matrix Anal. Appl. 41(1): 244-278 (2020) - [c3]Yaqi Duan, Zeyu Jia, Mengdi Wang:
Minimax-Optimal Off-Policy Evaluation with Linear Function Approximation. ICML 2020: 2701-2709 - [i4]Yaqi Duan, Mengdi Wang:
Minimax-Optimal Off-Policy Evaluation with Linear Function Approximation. CoRR abs/2002.09516 (2020) - [i3]Botao Hao, Yaqi Duan, Tor Lattimore, Csaba Szepesvári, Mengdi Wang:
Sparse Feature Selection Makes Batch Reinforcement Learning More Sample Efficient. CoRR abs/2011.04019 (2020)
2010 – 2019
- 2019
- [c2]Yaqi Duan, Zheng Tracy Ke, Mengdi Wang:
State Aggregation Learning from Markov Transition Data. NeurIPS 2019: 4488-4497 - [c1]Yifan Sun, Yaqi Duan, Hao Gong, Mengdi Wang:
Learning low-dimensional state embeddings and metastable clusters from time series data. NeurIPS 2019: 4563-4572 - [i2]Yifan Sun, Yaqi Duan, Hao Gong, Mengdi Wang:
Learning low-dimensional state embeddings and metastable clusters from time series data. CoRR abs/1906.00302 (2019) - 2018
- [i1]Yaqi Duan, Zheng Tracy Ke, Mengdi Wang:
State Aggregation Learning from Markov Transition Data. CoRR abs/1811.02619 (2018)
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-06 21:34 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:
