paper-with-me

홈 › Papers

SwiftCTS: Fast Cross-Design Prediction and Pareto Optimization of Clock Tree Metrics via Few-Shot Calibration

2026-06-09 · Barsat Khadka, Kawsher Roxy, Md Rubel Ahmed arxiv

Clock Tree Synthesis (CTS) is a computationally expensive stage in the physical design flow, requiring iterative EDA tool invocations to navigate a vast configuration space for optimal power, wirelength, and timing skew. Existing machine learning approaches require computationally expensive retraining or fine-tuning cycles to adapt to unseen macro architectures and are architecturally mismatched to the millions of evaluations demanded by exhaustive combinatorial search. We present SwiftCTS, a physics-informed surrogate framework that addresses both limitations simultaneously. By coupling lightweight, physics-grounded statistical features with gradient-boosted ensembles, SwiftCTS trains in under five seconds on a CPU and delivers sub-millisecond inference without GPU support. To handle out-of-distribution (OOD) designs without retraining or fine-tuning, we introduce a K-shot multiplicative calibration mechanism that anchors predictions to just one or two physical reference runs, reducing power prediction error from 24.5\% to 3.3\% and wirelength error from 56.6\% to under 1\% on unseen macros. Integrating this engine with an evolutionary optimizer, SwiftCTS evaluates 100,000 CTS configurations in under ten seconds, yielding Pareto-optimal frontiers that are physically validated within the OpenROAD flow. Closed-loop validation confirms prediction errors below 0.5\% for power and wirelength, and timing skew predictions within five picoseconds on an OOD benchmark, consistently outperforming default tool heuristics across all target metrics. Code publicly available at: \href{https://anonymous.4open.science/r/SwiftCTS-7E6E}{https://github.com/BarsatKhadka/SwiftCTS}

📄 PDF Abstract BibTeX arXiv:2606.11348

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

ParetoPilot: Zero-Surrogate Offline Multi-Objective Optimization via Infer-Perturb-Guide Diffusion

2026-06-03 · Ruiqing Sun, Sen Yang, Dawei Feng, Bo Ding 외 arxiv

Offline multi-objective optimization (Offline MOO) seeks Pareto-optimal designs from static datasets without additional environment interactions. Existing generative methods typically guide sampling with external surroga…

Pareto Q-Learning with Reward Machines

2026-06-17 · Arnaud Lequen, Clément Legrand-Lixon, Léo Saulières arxiv

We present Pareto Q-Learning with Reward Machines (PQLRM), a multi-objective reinforcement learning algorithm for tasks whose reward structure is specified by a set of reward machines (RMs). PQLRM combines Pareto Q-Learn…

Reinforcement Learning

Beyond Grids: Multi-objective Bayesian Optimization With Adaptive Discretization

2020-06-24 · Andi Nika, Sepehr Elahi, Çağın Ararat, Cem Tekin

We consider the problem of optimizing a vector-valued objective function $\boldsymbol{f}$ sampled from a Gaussian Process (GP) whose index set is a well-behaved, compact metric space $({\cal X},d)$ of designs. We assume …

Active LearningBayesian OptimizationGaussian Processes

ParetoFlow: Guided Flows in Multi-Objective Optimization

2024-12-04 · Ye Yuan, Can Chen, Christopher Pal, Xue Liu

In offline multi-objective optimization (MOO), we leverage an offline dataset of designs and their associated labels to simultaneously minimize multiple objectives. This setting more closely mirrors complex real-world pr…

Bayesian OptimizationEvolutionary Algorithms

Overcoming Brittleness in Pareto-Optimal Learning-Augmented Algorithms

2024-08-07 · Spyros Angelopoulos, Christoph Dürr, Alex Elenter, Yanni Lefki

The study of online algorithms with machine-learned predictions has gained considerable prominence in recent years. One of the common objectives in the design and analysis of such algorithms is to attain (Pareto) optimal…