default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTian Xu 0003
Person information
- affiliation: Nanjing University, National Key Laboratory for Novel Software Technology, China
Other persons with the same name
- Tian Xu (aka: Xu Tian) — disambiguation page
- Tian Xu 0001 (aka: Tian (Linger) Xu) — Indiana University at Bloomington, IN, USA (and 1 more)
- Tian Xu 0002 — University of Glasgow, UK
- Tian Xu 0004
![[0000-0002-9486-9609]](/web/20190509160520*/https://medium.com/@ddrogan/libertys-https-dblp.org/img/orcid-mark.12x12.png "0000-0002-9486-9609")
— Harbin Institute of Technology, School of Materials Science and Engineering, School of Mechatronics Engineering, China
Other persons with a similar name
- Xue Tian
- Xue-Wei Tian
- Tian-Jie Xu
- Tian-Xing Xu
- Tian-Zhou Xu
- Tian'ao Xu
- Tianchen Xu (aka: Tian-Chen Xu) — University of Macau, Faculty of Science and Technology, China
- Yi Tian Xu
- Yu-Tian Xu 0001 (aka: Yutian Xu 0001) — Harbin Institute of Technology, School of Mechanical Engineering and Automation, China
- Tian Xue
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
2020 – today
- 2026
[j5]Tian Xu, Zhilong Zhang, Zexuan Chen, Ruishuo Chen, Yihao Sun, Yang Yu:
Adversarial Imitation Learning With General Function Approximation: Theoretical Analysis and Practical Algorithms. IEEE Trans. Pattern Anal. Mach. Intell. 48(6): 6380-6392 (2026)- [i18]Tian Xu, Chenyang Wang, Xiaochen Zhai, Ziniu Li, Yi-Chen Li, Yang Yu:
Non-Adversarial Imitation Learning Provably Free of Compounding Errors: The Role of Bellman Constraints. CoRR abs/2603.22713 (2026) - [i17]Peng-Yuan Wang, Ziniu Li, Tian Xu, Bohan Yang, Tian-Shuo Liu, ChenYang Wang, Xiong-Hui Chen, Yi-Chen Li, Tianyun Yang, Congliang Chen, Yang Yu:
Off-Policy Value-Based Reinforcement Learning for Large Language Models. CoRR abs/2603.23355 (2026) - [i16]Ruo-Tong Chen, Ke Xue, Chengrui Gao, Yunqi Shi, Tian Xu, Peng Xie, Siyuan Xu, Mingxuan Yuan, Chao Qian, Zhi-Hua Zhou:
How Can Reinforcement Learning Achieve Expert-level Placement? CoRR abs/2604.25191 (2026) - 2025
- [j4]Jing-Cheng Pang, Tian Xu, Shengyi Jiang, Yu-Ren Liu, Yang Yu:
Reinforcement Learning With Sparse-Executing Action via Sparsity Regularization. IEEE Trans. Neural Networks Learn. Syst. 36(9): 16072-16084 (2025) - [c10]Ziniu Li, Congliang Chen, Tian Xu, Zeyu Qin, Jiancong Xiao, Zhi-Quan Luo, Ruoyu Sun:
Preserving Diversity in Supervised Fine-Tuning of Large Language Models. ICLR 2025 - [c9]Zhilong Zhang, Tian Xu, Xinghao Du, Xingchen Cao, Yihao Sun, Yang Yu:
Improving Reward Model Generalization from Adversarial Process Enhanced Preferences. ICML 2025 - [i15]Yi-Chen Li, Tian Xu, Yang Yu, Xuqin Zhang, Xiong-Hui Chen, Zhongxiang Ling, Ningjing Chao, Lei Yuan, Zhi-Hua Zhou:
Generalist Reward Models: Found Inside Large Language Models. CoRR abs/2506.23235 (2025) - 2024
- [j3]Fan-Ming Luo, Tian Xu, Hang Lai, Xiong-Hui Chen, Weinan Zhang, Yang Yu:
A survey on model-based reinforcement learning. Sci. China Inf. Sci. 67(2) (2024) - [j2]Chengxing Jia, Fuxiang Zhang, Tian Xu, Jing-Cheng Pang, Zongzhang Zhang, Yang Yu:
Model gradient: unified model and policy learning in model-based reinforcement learning. Frontiers Comput. Sci. 18(4): 184339 (2024) - [c8]Chengxing Jia, Chenxiao Gao, Hao Yin, Fuxiang Zhang, Xiong-Hui Chen, Tian Xu, Lei Yuan, Zongzhang Zhang, Zhi-Hua Zhou, Yang Yu:
Policy Rehearsing: Training Generalizable Policies for Reinforcement Learning. ICLR 2024 - [c7]Ziniu Li, Tian Xu, Yang Yu:
When is RL better than DPO in RLHF? A Representation and Optimization Perspective. Tiny Papers @ ICLR 2024 - [c6]Fan-Ming Luo, Tian Xu, Xingchen Cao, Yang Yu:
Reward-Consistent Dynamics Models are Strongly Generalizable for Offline Reinforcement Learning. ICLR 2024 - [c5]Xingchen Cao, Fan-Ming Luo, Junyin Ye, Tian Xu, Zhilong Zhang, Yang Yu:
Limited Preference Aided Imitation Learning from Imperfect Demonstrations. ICML 2024: 5584-5607 - [c4]Ziniu Li, Tian Xu, Yushun Zhang, Zhihang Lin, Yang Yu, Ruoyu Sun, Zhi-Quan Luo:
ReMax: A Simple, Effective, and Efficient Reinforcement Learning Method for Aligning Large Language Models. ICML 2024: 29128-29163 - [i14]Ziniu Li, Congliang Chen, Tian Xu, Zeyu Qin, Jiancong Xiao, Ruoyu Sun, Zhi-Quan Luo:
Entropic Distribution Matching in Supervised Fine-tuning of LLMs: Less Overfitting and Better Diversity. CoRR abs/2408.16673 (2024) - 2023
- [c3]Ziniu Li, Tian Xu, Zeyu Qin, Yang Yu, Zhi-Quan Luo:
Imitation Learning from Imperfection: Theoretical Justifications and Algorithms. NeurIPS 2023 - [c2]Tian Xu, Ziniu Li, Yang Yu, Zhi-Quan Luo:
Provably Efficient Adversarial Imitation Learning with Unknown Transitions. UAI 2023: 2367-2378 - [i13]Ziniu Li, Tian Xu, Yang Yu, Zhi-Quan Luo:
Theoretical Analysis of Offline Imitation With Supplementary Dataset. CoRR abs/2301.11687 (2023) - [i12]Tian Xu, Ziniu Li, Yang Yu, Zhi-Quan Luo:
Provably Efficient Adversarial Imitation Learning with Unknown Transitions. CoRR abs/2306.06563 (2023) - [i11]Fan-Ming Luo, Tian Xu, Xingchen Cao, Yang Yu:
Reward-Consistent Dynamics Models are Strongly Generalizable for Offline Reinforcement Learning. CoRR abs/2310.05422 (2023) - [i10]Ziniu Li, Tian Xu, Yushun Zhang, Yang Yu, Ruoyu Sun, Zhi-Quan Luo:
ReMax: A Simple, Effective, and Efficient Reinforcement Learning Method for Aligning Large Language Models. CoRR abs/2310.10505 (2023) - [i9]Ziniu Li, Tian Xu, Yang Yu:
Policy Optimization in RLHF: The Impact of Out-of-preference Data. CoRR abs/2312.10584 (2023) - 2022
- [j1]Tian Xu, Ziniu Li, Yang Yu:
Error Bounds of Imitating Policies and Environments for Reinforcement Learning. IEEE Trans. Pattern Anal. Mach. Intell. 44(10): 6968-6980 (2022) - [i8]Ziniu Li, Tian Xu, Yang Yu, Zhi-Quan Luo:
Rethinking ValueDice: Does It Really Improve Performance? CoRR abs/2202.02468 (2022) - [i7]Ziniu Li, Tian Xu, Yang Yu:
A Note on Target Q-learning For Solving Finite MDPs with A Generative Oracle. CoRR abs/2203.11489 (2022) - [i6]Fan-Ming Luo, Tian Xu, Hang Lai, Xiong-Hui Chen, Weinan Zhang, Yang Yu:
A Survey on Model-based Reinforcement Learning. CoRR abs/2206.09328 (2022) - [i5]Tian Xu, Ziniu Li, Yang Yu, Zhi-Quan Luo:
Understanding Adversarial Imitation Learning in Small Sample Regime: A Stage-coupled Analysis. CoRR abs/2208.01899 (2022) - 2021
- [i4]Jing-Cheng Pang, Tian Xu, Shengyi Jiang, Yu-Ren Liu, Yang Yu:
Sparsity Prior Regularized Q-learning for Sparse Action Tasks. CoRR abs/2105.08666 (2021) - [i3]Tian Xu, Ziniu Li, Yang Yu:
Nearly Minimax Optimal Adversarial Imitation Learning with Known and Unknown Transitions. CoRR abs/2106.10424 (2021) - 2020
- [c1]Tian Xu, Ziniu Li, Yang Yu:
Error Bounds of Imitating Policies and Environments. NeurIPS 2020 - [i2]Tian Xu, Ziniu Li, Yang Yu:
Error Bounds of Imitating Policies and Environments. CoRR abs/2010.11876 (2020)
2010 – 2019
- 2019
- [i1]Tian Xu, Ziniu Li, Yang Yu:
On Value Discrepancy of Imitation Learning. CoRR abs/1911.07027 (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 2026-07-10 01:21 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
