← Search

Tian Xu

15 accepted papers

2026

Non-Adversarial Imitation Learning Provably Free of Compounding Errors: The Role of Bellman Constraints

ICML 2026poster

Adversarial imitation learning (AIL) achieves high-quality imitation by mitigating compounding errors in behavioral cloning (BC), but often exhibits training instability due to adversarial optimization. To avoid this issue, a class of non-adversarial Q-based imitation learning (IL) methods, represen…

Cited by 0SourceScholar
2026

PromptDepth: Efficient and Promptable Geometric 3D Vision Model for Embodied Intelligence

CVPR 2026

Vision models for embodied intelligence require efficient 3D comprehension and interaction with objects within the scene. Existing 3D reconstruction models either overlook instance-level perception or rely on time-consuming offline reasoning, showing a less adaptability in real-time embodied scenari

Cited by 0SourceScholar
2026

Provably Efficient Policy-Reward Co-Pretraining for Adversarial Imitation Learning

ICML 2026poster

Adversarial imitation learning (AIL) demonstrates superior expert sample efficiency compared to behavioral cloning (BC), yet requires substantial online environment interaction. While recent empirical work has explored initializing AIL algorithms with BC-pretrained policies to address this limitatio…

Cited by 0SourceScholar
2025

A Climbing Robot for Tube-Sheet Inspection Based on Planar Parallel Mechanisms

RA-L 2025

This paper introduces a novel climbing robot for tube-sheet inspection (CRTI) that uses inner wall grippers (IWGs) to grasp tubes, enabling it to hang and crawl beneath the tube-sheet plane. The robot is designed primarily for inspecting steam generators in nuclear power plants. The CRTI based on a

Cited by 1SourceScholar
2025

Collaborative Motion Planning for Multi-Manipulator Systems Through Reinforcement Learning and Dynamic Movement Primitives

ICRA 2025

Robotic tasks often require multiple manipulators to enhance task efficiency and speed, but this increases complexity in terms of collaboration, collision avoidance, and the expanded state-action space. To address these challenges, we propose a multi-level approach combining Reinforcement Learning (

Cited by 3SourceScholar
2025

Improving Reward Model Generalization from Adversarial Process Enhanced Preferences

ICML 2025poster

In sequential decision-making, the reward function serves as the primary supervision signal, guiding agents to acquire the desired behaviors. Traditional reward modeling methods rely heavily on human expertise, limiting their scalability. Automated preference generation from suboptimal demonstration…

Cited by 0SourcePDFScholar
2025

Preserving Diversity in Supervised Fine-Tuning of Large Language Models

ICLR 2025poster

Large Language Models (LLMs) typically rely on Supervised Fine-Tuning (SFT) to specialize in downstream tasks, with the Cross Entropy (CE) loss being the de facto choice. However, CE maximizes the likelihood of observed data without accounting for alternative possibilities. As such, CE usually lead…

Cited by 0SourcePDFScholar
2024

Limited Preference Aided Imitation Learning from Imperfect Demonstrations

ICML 2024poster

Imitation learning mimics high-quality policies from expert data for sequential decision-making tasks. However, its efficacy is hindered in scenarios where optimal demonstrations are unavailable, and only imperfect demonstrations are present. To address this issue, introducing additional limited hum…

Cited by 1SourcePDFScholar
2024

Policy Rehearsing: Training Generalizable Policies for Reinforcement Learning

ICLR 2024poster

Human beings can make adaptive decisions in a preparatory manner, i.e., by making preparations in advance, which offers significant advantages in scenarios where both online and offline experiences are expensive and limited. Meanwhile, current reinforcement learning methods commonly rely on numerous…

Cited by 4SourcePDFScholar
2024

Provably and Practically Efficient Adversarial Imitation Learning with General Function Approximation

NeurIPS 2024poster

As a prominent category of imitation learning methods, adversarial imitation learning (AIL) has garnered significant practical success powered by neural network approximation. However, existing theoretical studies on AIL are primarily limited to simplified scenarios such as tabular and linear functi…

Cited by 1SourcePDFScholar
2024

ReMax: A Simple, Effective, and Efficient Reinforcement Learning Method for Aligning Large Language Models

ICML 2024poster

Reinforcement Learning from Human Feedback (RLHF) is key to aligning Large Language Models (LLMs), typically paired with the Proximal Policy Optimization (PPO) algorithm. While PPO is a powerful method designed for general reinforcement learning tasks, it is overly sophisticated for LLMs, leading to…

2024

Reward-Consistent Dynamics Models are Strongly Generalizable for Offline Reinforcement Learning

ICLR 2024spotlight

Learning a precise dynamics model can be crucial for offline reinforcement learning, which, unfortunately, has been found to be quite challenging. Dynamics models that are learned by fitting historical transitions often struggle to generalize to unseen transitions. In this study, we identify a hidde…

2023

Imitation Learning from Imperfection: Theoretical Justifications and Algorithms

NeurIPS 2023spotlight

Imitation learning (IL) algorithms excel in acquiring high-quality policies from expert data for sequential decision-making tasks. But, their effectiveness is hampered when faced with limited expert data. To tackle this challenge, a novel framework called (offline) IL with supplementary data has bee…

2023

Provably Efficient Adversarial Imitation Learning with Unknown Transitions

UAI 2023poster

Imitation learning (IL) has proven to be an effective method for learning good policies from expert demonstrations. Adversarial imitation learning (AIL), a subset of IL methods, is particularly promising, but its theoretical foundation in the presence of unknown transitions has yet to be fully devel…