Routing Dense Layouts with History-Aware Offline Reinforcement Learning using LSTM

• URL: http://arxiv.org/abs/2609.08232v1
• Date: Tue, 08 Sep 2026 04:23:56 GMT
• Title: Routing Dense Layouts with History-Aware Offline Reinforcement Learning using LSTM
• Abstract summary: We present a history-aware offline RL policy which predicts iterative cost weights in dense regimes to improve convergence across placement densities.<n>Our policy reduces design rule violations (DRVs) by an average of 92% over the top public baseline while simultaneously reducing runtime by 10%.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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 for each routing iteration, we find that this technique struggles with high-density designs where routing solutions are significantly harder. To address this, we present a history-aware offline RL policy which predicts iterative cost weights in these dense regimes to improve convergence across placement densities by utilizing readily available features from the router. Our policy uses conservative Q-learning similarly to prior work; however, our key insight is that addition of a lightweight LSTM architecture and additional features can retain sequence context and improve routing convergence across multiple densities and route guide qualities. Our policy can be integrated into any cost-based router with minimal pipeline changes, as it does not interfere with the core search algorithm. We evaluate our policy on held-out density and adjustment settings, including difficult operating points induced by dense placement and low guide quality. Our policy reduces design rule violations (DRVs) by an average of 92% over the top public baseline while simultaneously reducing runtime by 10%.

Related papers

• The Routing Plateau: Understanding and Breaking the Accuracy Limits of LLM Routers [19.847272668359707]
  LLM routing is a popular approach to improve the cost-quality trade-off of LLM services by dynamically selecting a model for each query.<n>Recent work has explored a broad range of routing methods, including clustering-based routers, learned classifiers, pairwise ranking, and confidence-based approaches.<n>Our study reveals a consistent phenomenon that we call the routing plateau: many methods, including kNN, achieve very similar accuracy and converge to a narrow performance range that remains far below the oracle router.
  arXiv  Detail & Related papers  (2026-05-27T19:29:01Z)
• TRACE: Traceroute-based Internet Route change Analysis with Ensemble Learning [0.046603287532620725]
  This study introduces TRACE, a MachineLearningpipeline designed to identify route changes using only traceroute latency data.<n>We propose a robust feature engineering strategy that captures temporal dynamics using rolling statistics and aggregated context patterns.
  arXiv  Detail & Related papers  (2026-03-21T13:02:16Z)
• Efficient and Interpretable Multi-Agent LLM Routing via Ant Colony Optimization [58.59491516762626]
  We propose AMRO-S, an efficient and interpretable routing framework for Multi-Agent Systems (MAS)<n>AMRO-S models MAS routing as a semantic-conditioned path selection problem, enhancing routing performance through three key mechanisms.<n>Extensive experiments on five public benchmarks and high-concurrency stress tests demonstrate that AMRO-S consistently improves the quality--cost trade-off over strong routing baselines.
  arXiv  Detail & Related papers  (2026-03-13T12:26:05Z)
• Blockchain-Enabled Routing for Zero-Trust Low-Altitude Intelligent Networks [77.17664010626726]
  We focus on the routing with multiple UAV clusters in low-altitude intelligent networks (LAINs)<n>To minimize the damage caused by potential threats, we present the zero-trust architecture with the software-defined perimeter and blockchain techniques.<n>We show that the proposed framework reduces the average E2E delay by 59% and improves the TSR by 29% on average compared to benchmarks.
  arXiv  Detail & Related papers  (2026-02-27T04:30:35Z)
• A Curriculum-Based Deep Reinforcement Learning Framework for the Electric Vehicle Routing Problem [0.4666493857924357]
  Electric vehicle routing problem with time windows (EVRPTW) is a complex optimization problem in sustainable logistics.<n>We propose a curriculum-based deep reinforcement learning (CB-DRL) framework designed to resolve this instability.
  arXiv  Detail & Related papers  (2026-01-21T14:42:33Z)
• CONCUR: A Framework for Continual Constrained and Unconstrained Routing [79.85419373937765]
  AI tasks differ in complexity and are best addressed with different computation strategies.<n>Most prior methods build the routing framework by training a single model across all strategies.<n>We propose CONCUR, a continual routing framework that supports both constrained and unconstrained routing.
  arXiv  Detail & Related papers  (2025-12-10T07:30:13Z)
• Dr.LLM: Dynamic Layer Routing in LLMs [55.11953638340419]
  Dr.LLM is a retrofittable framework that equips pretrained models with lightweight per-layer routers deciding to skip, execute, or repeat a block.<n>On ARC (logic) and DART (math), Dr.LLM improves accuracy by up to +3.4%p while saving 5 layers per example on average.
  arXiv  Detail & Related papers  (2025-10-14T17:51:26Z)
• xRouter: Training Cost-Aware LLMs Orchestration System via Reinforcement Learning [104.63494870852894]
  We present x, a tool-calling-based routing system in which a learned router can either answer directly or invoke one or more external models.<n>Our implementation encompasses the full reinforcement learning framework, including reward and cost accounting.<n>Across diverse benchmarks, x achieves strong cost-performance trade-offs.
  arXiv  Detail & Related papers  (2025-10-09T16:52:01Z)
• Action-Quantized Offline Reinforcement Learning for Robotic Skill Learning [68.16998247593209]
  offline reinforcement learning (RL) paradigm provides recipe to convert static behavior datasets into policies that can perform better than the policy that collected the data. In this paper, we propose an adaptive scheme for action quantization. We show that several state-of-the-art offline RL methods such as IQL, CQL, and BRAC improve in performance on benchmarks when combined with our proposed discretization scheme.
  arXiv  Detail & Related papers  (2023-10-18T06:07:10Z)
• Track-Assignment Detailed Routing Using Attention-based Policy Model With Supervision [0.27998963147546135]
  We propose a machine learning driven method for solving the track-assignment detailed routing problem. Our approach adopts an attention-based reinforcement learning (RL) policy model. We show that especially for complex problems, our supervised RL method provides good quality solution.
  arXiv  Detail & Related papers  (2020-10-26T16:40:11Z)
• Attention Routing: track-assignment detailed routing using attention-based reinforcement learning [0.23453441553817037]
  We propose a new router: attention router, which is the first attempt to solve the track-assignment detailed routing problem using reinforcement learning. The attention router and its baseline genetic router are applied to solve different commercial advanced technologies analog circuits problem sets.
  arXiv  Detail & Related papers  (2020-04-20T17:50:13Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.