default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHuizhuo Yuan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c8]Zixiang Chen, Yihe Deng, Huizhuo Yuan, Kaixuan Ji, Quanquan Gu:
Self-Play Fine-Tuning Converts Weak Language Models to Strong Language Models. ICML 2024- [c7]Yan Wang, Lihao Wang, Yuning Shen, Yiqun Wang, Huizhuo Yuan, Yue Wu, Quanquan Gu:
Protein Conformation Generation via Force-Guided SE(3) Diffusion Models. ICML 2024 - [i9]Zixiang Chen, Yihe Deng, Huizhuo Yuan, Kaixuan Ji, Quanquan Gu:
Self-Play Fine-Tuning Converts Weak Language Models to Strong Language Models. CoRR abs/2401.01335 (2024) - [i8]Huizhuo Yuan, Zixiang Chen, Kaixuan Ji, Quanquan Gu:
Self-Play Fine-Tuning of Diffusion Models for Text-to-Image Generation. CoRR abs/2402.10210 (2024) - [i7]Yan Wang, Lihao Wang, Yuning Shen, Yiqun Wang, Huizhuo Yuan, Yue Wu, Quanquan Gu:
Protein Conformation Generation via Force-Guided SE(3) Diffusion Models. CoRR abs/2403.14088 (2024) - [i6]Yue Wu, Zhiqing Sun, Huizhuo Yuan, Kaixuan Ji, Yiming Yang, Quanquan Gu:
Self-Play Preference Optimization for Language Model Alignment. CoRR abs/2405.00675 (2024) - [i5]Jiafan He, Huizhuo Yuan, Quanquan Gu:
Accelerated Preference Optimization for Large Language Model Alignment. CoRR abs/2410.06293 (2024) - 2023
- [c6]Zixiang Chen, Chris Junchi Li, Huizhuo Yuan, Quanquan Gu, Michael I. Jordan:
A General Framework for Sample-Efficient Function Approximation in Reinforcement Learning. ICLR 2023 - [c5]Chris Junchi Li, Huizhuo Yuan, Gauthier Gidel, Quanquan Gu, Michael I. Jordan:
Nesterov Meets Optimism: Rate-Optimal Separable Minimax Optimization. ICML 2023: 20351-20383 - [i4]Zixiang Chen, Huizhuo Yuan, Yongqian Li, Yiwen Kou, Junkai Zhang, Quanquan Gu:
Fast Sampling via De-randomization for Discrete Diffusion Models. CoRR abs/2312.09193 (2023) - 2020
- [i3]Xiang Zhou, Huizhuo Yuan, Chris Junchi Li, Qingyun Sun:
Stochastic Modified Equations for Continuous Limit of Stochastic ADMM. CoRR abs/2003.03532 (2020) - [i2]Huizhuo Yuan, Xiangru Lian, Ji Liu, Yuren Zhou:
Stochastic Recursive Momentum for Policy Gradient Methods. CoRR abs/2003.04302 (2020)
2010 – 2019
- 2019
- [c4]Yu Chen, Huizhuo Yuan, Yujun Li:
Object-Oriented State Abstraction in Reinforcement Learning for Video Games. CoG 2019: 1-4 - [c3]Huizhuo Yuan, Yuren Zhou, Chris Junchi Li, Qingyun Sun:
Differential Inclusions for Modeling Nonsmooth ADMM Variants: A Continuous Limit Theory. ICML 2019: 7232-7241 - [c2]Huizhuo Yuan, Xiangru Lian, Chris Junchi Li, Ji Liu, Wenqing Hu:
Efficient Smooth Non-Convex Stochastic Compositional Optimization via Stochastic Recursive Gradient Descent. NeurIPS 2019: 6926-6935 - [i1]Huizhuo Yuan, Xiangru Lian, Ji Liu:
Stochastic Recursive Variance Reduction for Efficient Smooth Non-Convex Compositional Optimization. CoRR abs/1912.13515 (2019) - 2018
- [c1]Huizhuo Yuan, Jinzhu Jia, Zhanxing Zhu:
SIPID: A deep learning framework for sinogram interpolation and image denoising in low-dose CT reconstruction. ISBI 2018: 1521-1524
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-19 21:45 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:
