paper-with-me

홈 › Papers

PhysEDA: Physics-Aware Learning Framework for Efficient EDA With Manhattan Distance Decay

2026-05-11 · Zetao Yang arxiv

Electronic design automation (EDA) addresses placement, routing, timing analysis, and power-integrity verification for integrated circuits. Learning methods -- attention (Transformer) and reinforcement learning (RL) -- have recently emerged on EDA tasks, yet face two common bottlenecks: vanilla attention's quadratic complexity limits scaling, and data-scarce models overfit statistical noise and amplify weak long-range correlations against the underlying physics. We observe that EDA tasks share a physical prior -- pairwise electrical and routing interactions decay exponentially along Manhattan distance -- and integrate it as a unified inductive bias into both architecture and training. We propose PhysEDA, comprising two components Physics-Structured Linear Attention (PSLA) folds the separable Manhattan decay into the linear-attention kernel as a multiplicative bias, reducing complexity from quadratic to linear; Potential-Based Reward Shaping (PBRS) constructs a physical potential from the same kernel, providing dense reward signal under sparse RL while preserving the optimal policy via the policy-invariance theorem. Across three EDA scenarios -- decoupling-capacitor placement, macro placement, and IR-drop prediction -- PhysEDA improves zero-shot cross-scale transfer by 56.8% and achieves 14x inference speedup with 98.5% memory savings on 100x100 grids; PBRS adds another 10.8% in sparse-reward DPP.

📄 PDF Abstract BibTeX arXiv:2605.10547

Code (0)

등록된 구현이 없습니다.

Tasks

Reinforcement Learning

Similar Papers 제목 키워드 기반

Quasi Manhattan Wasserstein Distance

2023-10-19 · Evan Unit Lim

The Quasi Manhattan Wasserstein Distance (QMWD) is a metric designed to quantify the dissimilarity between two matrices by combining elements of the Wasserstein Distance with specific transformations. It offers improved …

Fast and explainable clustering in the Manhattan and Tanimoto distance

2026-01-13 · Stefan Güttel, Kaustubh Roy arxiv

The CLASSIX algorithm is a fast and explainable approach to data clustering. In its original form, this algorithm exploits the sorting of the data points by their first principal component to truncate the search for near…

Metric Transforms and Low Rank Matrices via Representation Theory of the Real Hyperrectangle

2020-11-23 · Josh Alman, Timothy Chu, Gary Miller, Shyam Narayanan 외

In this paper, we develop a new technique which we call representation theory of the real hyperrectangle, which describes how to compute the eigenvectors and eigenvalues of certain matrices arising from hyperrectangles. …

BIG-bench Machine LearningLEMMA

MDM: Manhattan Distance Mapping of DNN Weights for Parasitic-Resistance-Resilient Memristive Crossbars

2025-11-06 · Matheus Farias, Wanghley Martins, H. T. Kung arxiv

Manhattan Distance Mapping (MDM) is a post-training deep neural network (DNN) weight mapping technique for memristive bit-sliced compute-in-memory (CIM) crossbars that reduces parasitic resistance (PR) nonidealities. PR …

Developing Distance-Aware Physics-Constrained Probabilistic Frameworks for Industrial Prognostics

2025-12-09 · Waleed Razzaq, Yun-Bo Zhao arxiv

Development of reliable and physically interpretable probabilistic frameworks for industrial prognostics remain nascent, and existing literature is often insensitive as inputs move away from the training manifold. In thi…