Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Vint Lee

dblp:359/9404 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 2 first-author · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Generative modeling · 70% Reinforcement learning · 30%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Electronic design automation · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Generative modeling
diffusion model
0.912025
Chip Placement with Diffusion Models · ICML 2025
Machine learning › Generative modeling › diffusion model
guided sampling
0.912025
Chip Placement with Diffusion Models · ICML 2025
Electronic design automation › physical design › placement › module placement
macro placement
0.912025
Chip Placement with Diffusion Models · ICML 2025
Electronic design automation
physical design
0.912025
Chip Placement with Diffusion Models · ICML 2025
Machine learning › Reinforcement learning
model-based reinforcement learning
0.812024
DreamSmooth: Improving Model-based Reinforcement Learning via Reward Smoothing · ICLR 2024

Methods — techniques the papers use, named apart from their topics

synthetic dataset generation · 1.7diffusion model · 1.7reward prediction · 0.8planning with imaginary trajectories · 0.8
YearPublicationVenuePosition
2025 Chip Placement with Diffusion Models
abstract
Macro placement is a vital step in digital circuit design that defines the physical location of large collections of components, known as macros, on a 2D chip. Because key performance metrics of the chip are determined by the placement, optimizing it is crucial. Existing learning-based methods typically fall short because of their reliance on reinforcement learning (RL), which is slow and struggles to generalize, requiring online training on each new circuit. Instead, we train a diffusion model capable of placing new circuits zero-shot, using guided sampling in lieu of RL to optimize placement quality. To enable such models to train at scale, we designed a capable yet efficient architecture for the denoising model, and propose a novel algorithm to generate large synthetic datasets for pre-training. To allow zero-shot transfer to real circuits, we empirically study the design decisions of our dataset generation algorithm, and identify several key factors enabling generalization. When trained on our synthetic data, our models generate high-quality placements on unseen, realistic circuits, achieving competitive performance on placement benchmarks compared to state-of-the-art methods.
Vint Lee, Leena Elzeiny, Chun Deng, Pieter Abbeel, John Wawrzynek
ICML1
2024 DreamSmooth: Improving Model-based Reinforcement Learning via Reward Smoothing
abstract
Model-based reinforcement learning (MBRL) has gained much attention for its ability to learn complex behaviors in a sample-efficient way: planning actions by generating imaginary trajectories with predicted rewards. Despite its success, we found that surprisingly, reward prediction is often a bottleneck of MBRL, especially for sparse rewards that are challenging (or even ambiguous) to predict. Motivated by the intuition that humans can learn from rough reward estimates, we propose a simple yet effective reward smoothing approach, DreamSmooth, which learns to predict a temporally-smoothed reward, instead of the exact reward at the given timestep. We empirically show that DreamSmooth achieves state-of-the-art performance on long-horizon sparse-reward tasks both in sample efficiency and final performance without losing performance on common benchmarks, such as Deepmind Control Suite and Atari benchmarks.
Vint Lee, Pieter Abbeel, Youngwoon Lee
ICLR1