← Search

Yuan Pu

5 accepted papers

2026

One Model for All Tasks: Leveraging Efficient World Models in Multi-Task Planning

ICLR 2026poster

In heterogeneous multi-task decision-making, tasks not only exhibit diverse observation and action spaces but also vary substantially in their underlying complexities. While conventional multi-task world models like UniZero excel in single-task settings, we find that when handling a broad and divers…

Cited by 0SourceScholar
2025

Circuit Representation Learning with Masked Gate Modeling and Verilog-AIG Alignment

ICLR 2025poster

Understanding the structure and function of circuits is crucial for electronic design automation (EDA). Circuits can be formulated as And-Inverter graphs (AIGs), enabling efficient implementation of representation learning through graph neural networks (GNNs). Masked modeling paradigms have been pr…

2024

Trajectory Flow Matching with Applications to Clinical Time Series Modelling

NeurIPS 2024spotlight

Modeling stochastic and irregularly sampled time series is a challenging problem found in a wide range of applications, especially in medicine. Neural stochastic differential equations (Neural SDEs) are an attractive modeling technique for this problem, which parameterize the drift and diffusion ter…

Cited by 7SourcePDFScholar
2023

FastGR: Global Routing on CPU-GPU with Heterogeneous Task Graph Scheduler (Extended Abstract)

IJCAI 2023poster

Running time is a key metric across the standard physical design flow stages. However, with the rapid growth in design sizes, routing runtime has become the runtime bottleneck in the physical design flow. To improve the effectiveness of the modern global router, we propose a global routing framework…

Cited by 0SourcePDFScholar
2023

LightZero: A Unified Benchmark for Monte Carlo Tree Search in General Sequential Decision Scenarios

NeurIPS 2023spotlight

Building agents based on tree-search planning capabilities with learned models has achieved remarkable success in classic decision-making problems, such as Go and Atari. However, it has been deemed challenging or even infeasible to extend Monte Carlo Tree Search (MCTS) based algorithms to diverse re…