mlsanityData to 7 Oct 2026

Flexible Multiple-Objective Reinforcement Learning for Chip Placement

arXiv 2204.06407 ↗First posted 13 Apr 2022cs.LG cs.AIcited by 3

Not on the map. Why?

Abstract (arXiv)

Recently, successful applications of reinforcement learning to chip placement have emerged. Pretrained models are necessary to improve efficiency and effectiveness. Currently, the weights of objective metrics (e.g., wirelength, congestion, and timing) are fixed during pretraining. However, fixed-weighed models cannot generate the diversity of placements required for engineers to accommodate changing requirements as they arise. This paper proposes flexible multiple-objective reinforcement learning (MORL) to support objective functions with inference-time variable weights using just a single pretrained model. Our macro placement results show that MORL can generate the Pareto frontier of multiple objectives effectively.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 10 of its 29 references that are in the map. First posted on arXiv 13 Apr 2022.

Builds on

10 of 29 references.

References · 10

  1. 2017Proximal Policy Optimization Algorithmscited by 14,441
  2. 2015High-Dimensional Continuous Control Using Generalized Advantage Estimationcited by 1,916
  3. 2020Emergent Complexity and Zero-shot Transfer via Unsupervised Environment Designcited by 260
  4. 2021Deep learning: a statistical viewpointcited by 239
  5. 2019A Generalized Algorithm for Multi-Objective Reinforcement Learning and Policy Adaptationcited by 166
  6. 2020Chip Placement with Deep Reinforcement Learningcited by 83
  7. 2018Evolution-Guided Policy Gradient in Reinforcement Learningcited by 78
  8. 2017Hybrid Reward Architecture for Reinforcement Learningcited by 57
  9. 2018A Multi-Objective Deep Reinforcement Learning Frameworkcited by 22
  10. 2019The Deep Learning Revolution and Its Implications for Computer Architecture and Chip Designcited by 15

Built on by

Cited by year

Citing papers per year: 2022: 1; 2023: 0; 2024: 0; 2025: 2.

3 papers.