← Search

Yingchen Xu

7 accepted papers

2025

Token Assorted: Mixing Latent and Text Tokens for Improved Language Model Reasoning

ICML 2025poster

Large Language Models (LLMs) excel at reasoning and planning when trained on chain-of-thought (CoT) data, where the step-by-step thought process is explicitly outlined by text tokens. However, this results in lengthy inputs where many words support textual coherence rather than core reasoning inform…

Cited by 10SourcePDFScholar
2025

Zero-Shot Whole-Body Humanoid Control via Behavioral Foundation Models

ICLR 2025poster

Unsupervised reinforcement learning (RL) aims at pre-training models that can solve a wide range of downstream tasks in complex environments. Despite recent advancements, existing approaches suffer from several limitations: they may require running an RL process on each task to achieve a satisfactor…

Cited by 4SourcePDFScholar
2024

H-GAP: Humanoid Control with a Generalist Planner

ICLR 2024spotlight

Humanoid control is an important research challenge offering avenues for integration into human-centric infrastructures and enabling physics-driven humanoid animations. The daunting challenges in this field stem from the difficulty of optimizing in high-dimensional action spaces and the instability…

Cited by 9SourcePDFScholar
2024

IQL-TD-MPC: Implicit Q-Learning for Hierarchical Model Predictive Control

ICRA 2024poster

Model-based reinforcement learning (RL) has shown great promise due to its sample efficiency, but still struggles with long-horizon sparse-reward tasks, especially in offline settings where the agent learns from a fixed dataset. We hypothesize that model-based RL agents struggle in these environment…

Cited by 9SourceScholar
2022

Learning General World Models in a Handful of Reward-Free Deployments

NeurIPS 2022accept

Building generally capable agents is a grand challenge for deep reinforcement learning (RL). To approach this challenge practically, we outline two key desiderata: 1) to facilitate generalization, exploration should be task agnostic; 2) to facilitate scalability, exploration policies should collect…

2018

LSH-SAMPLING BREAKS THE COMPUTATIONAL CHICKEN-AND-EGG LOOP IN ADAPTIVE STOCHASTIC GRADIENT ESTIMATION

ICLR 2018workshop

Stochastic Gradient Descent or SGD is the most popular optimization algorithm for large-scale problems. SGD estimates the gradient by uniform sampling with sample size one. There have been several other works that suggest faster epoch wise convergence by using weighted non-uniform sampling for bette…

Cited by 13SourceScholar