Skip to content

GPlaceRL: An Open-Source Graph Reinforcement Learning Framework for Detailed Placement

· 0 citations · 8 references

TL;DR

GPlaceRL is presented, an open-source graph reinforcement learning framework for detailed placement refinement that represents legalized placements as graphs and provides a modular environment for studying graph encoders, policy architectures, reward formulations, and local placement actions.

View source

Similar papers

Conference Aug 2026

Improving chip macro placement via GFlowNet-guided tree search

This study addresses the long-standing challenge of a core task in chip physical design, termed macro placement. The problem is characterized by an enormous combinatorial search space and a highly multimodal cost landscape. While recent learning-based approaches have shown promise, reinforcement-learning rollouts often...

Xiaodong Tang, Liling Sun, Yushu Liang · 0 citations
#machine learning Preprint Sep 2026

From Connectivity to Rewards: Dense Reward Learning with Directed State Graphs

The integration of graphs with Goal-Conditioned Hierarchical Reinforcement Learning (GCHRL) has received increasing attention, as graphs naturally encode task hierarchies for effective subgoal sampling. However, existing methods often overlook intrinsic connectivity information, failing to fully leverage the underlying...

Shuyuan Zhang, Zi-Han Wang, Xiao-Wen Chang et al. · 0 citations
#natural language process... Preprint Sep 2026

Expert-Space Exploration in MoE Reinforcement Learning

Reinforcement learning (RL) has become central to post-training of large language models. Recent advances in RL for Mixture-of-Experts (MoE) models have primarily focused on improving optimization stability and training efficiency, while treating the expert selection as a fixed component. Since routing determines the s...

Hong-Yi He, Zheng-Wen Lin, Xiao Liu et al. · 0 citations
#artificial intelligence Preprint Sep 2026

Deep Reinforcement Learning on Item-Compatibility Graphs for One-Dimensional Bin Packing

The one-dimensional bin packing problem (1D-BPP) is a classical NP-hard combinatorial optimization problem with applications ranging from logistics and manufacturing to cloud resource management. Although deep reinforcement learning (DRL) has become a competitive paradigm for data-driven optimization, most learned pack...

M. Aydın · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.