- Rating
- 2
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 3
Read review
Paper summary
This paper introduces MONA, a multi‑agent framework for analog layout refinement. MONA employs three specialized agents responsible for topology analysis, failure analysis, and candidate generation using Exploit, Diversify, and Explore strategies. A Verification Gate systematically accepts layout candidates that improve upon the best retained deliverable design. Both successful and failed evaluation trajectories are fed into a memory distiller to distill reusable design experience. Evaluated on six SKY130 analog layout tasks using an open‑source EDA flow, MONA achieves substantially higher deliverable‑layout success rates and figure‑of‑merit (FoM) compared with ALIGN, BO, and ICPI, while significantly reducing LLM token consumption.
Critical strengths
This work adopts a greedy-flavored monotonic acceptance strategy for the high cost analog layout design problem, which yields competitive performance under a limited evaluation budget. As demonstrated by the reported experimental results, MONA achieves strong empirical performance, and it may provide useful insights for future EDA-automation research.
Critical weaknesses
-
The paper exhibits limited conceptual novelty and largely resembles a solid system-level engineering assembly tailored for the EDA setting. Many building blocks, including complementary search strategies, multi-agent collaboration, and short-/long-term memory management, are well-known techniques from recent literature. While the monotonic optimization loop realized by the Verification Gate serves as its core innovation, substantial portions of the implementation amount to careful system-engineering adaptations for analog layout design. It remains hard to disentangle how much performance improvement comes from the newly-proposed monotonic paradigm versus existing agent-based components.
-
The experimental evaluation has several notable drawbacks. (1) Only six small-scale analog-circuit benchmarks are tested, which is insufficient to convincingly demonstrate the generalizability of the proposed method across broader analog-circuit families. (2) The fairness of token cost comparison between MONA and ICPI is not well justified. By design, MONA invokes multiple agents and generates three candidates per iteration. Even though token consumption per deliverable layout is reported, it is unclear why MONA achieves lower overall token overhead despite more LLM invocations. (3) Ablation studies are only conducted on top-level modules ALS and VAM. Many fine-grained sub-components underneath these modules remain untested, making it impossible to quantify the individual contribution of each sub-module.
Questions for authors
-
Could you clarify whether there exist realistic circuit scenarios where high‑quality final layouts can only be reached by iterating from intermediate low‑quality states? If such cases exist, how does MONA mitigate potential performance loss? This question concerns how the monotonic greedy‑style strategy escapes local optima.
-
The benchmark only contains six circuits. Are there fundamental barriers preventing evaluation on more open source analog layout tasks? What key factors make these six benchmarks representative enough to validate your monotonic layout optimization paradigm?