arXiv (All)
open access
Routing Dense Layouts with History-Aware Offline Reinforcement Learning using LSTM
Detailed routing remains a dominant runtime bottleneck in physical design due to increasing complexity of design rules. Modern routers can struggle to resolve persistent violations under dense operating conditions. While recent work leverages reinforcement learning (RL) to dynamically select costs f
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- TOUR: A Trajectory-Level Unlearning Benchmark for Offline Reinforcement Learning#394431
- REFINEPPO: Learning Continuous Control Policies by Iterative Action Refinement#1035078
- Official Review · ICLR 2025#787007
- Policy Plasticity Matters in Offline-to-Online Reinforcement Learning: Refitting Offline Policies for Online Adaptation#1117839
- Elucidating the Design Space of Regression-based Diffusion Reinforcement Learning#1118156
Record · ID 985604
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive