用生成强化学习提升光刻逆向设计,更快更准找到最优掩模。
Pushing the Limits of Inverse Lithography with Generative Reinforcement Learning
- 将掩模生成转为条件采样,生成器提出多个候选初始解。
- 在LithoBench上EPE违规减少3nm tolerance下超2倍吞吐,ICCAD13案例提速3倍。
- 适合半导体光刻优化场景,尤其需要快速高精度掩模设计的团队。
逆向光刻(ILT)对现代半导体制造至关重要,但其高度非凸的目标函数常导致优化陷入次优局部极小值。生成式AI被用于为ILT提供初始解,但多数方法训练确定性图像到图像转换器模仿次优数据集,难以在精炼阶段摆脱非凸陷阱。本文将掩模合成重新定义为条件采样:生成器学习在给定设计条件下生成掩模分布,并提出多个候选方案。生成器先通过WGAN加重构损失预训练,再使用基于组相对策略优化(GRPO)和ILT引导的模仿损失微调。推理时,批量采样少量掩模,快速并行执行批处理ILT精炼,评估光刻指标(如EPE、工艺窗口),选择最优候选。在\texttt{LithoBench}数据集上,该混合框架在3\,nm容差下降低EPE违规,吞吐量约为强数值基线的两倍,同时提升最终掩模质量。在\texttt{ICCAD13}竞赛案例中,EPE性能提升超20%,相比当前最优数值求解器提速3倍。通过学习生成利于ILT优化的初始解,本方法有效缓解非凸性问题,超越传统求解器与通用生成式AI的能力边界。
原文摘要 · Abstract (English)
Inverse lithography (ILT) is critical for modern semiconductor manufacturing but suffers from highly non-convex objectives that often trap optimization in poor local minima. Generative AI has been explored to warm-start ILT, yet most approaches train deterministic image-to-image translators to mimic sub-optimal datasets, providing limited guidance for escaping non-convex traps during refinement. We reformulate mask synthesis as conditional sampling: a generator learns a distribution over masks conditioned on the design and proposes multiple candidates. The generator is first pretrained with WGAN plus a reconstruction loss, then fine-tuned using Group Relative Policy Optimization (GRPO) with an ILT-guided imitation loss. At inference, we sample a small batch of masks, run fast batched ILT refinement, evaluate lithography metrics (e.g., EPE, process window), and select the best candidate. On \texttt{LithoBench} dataset, the proposed hybrid framework reduces EPE violations under a 3\,nm tolerance and roughly doubles throughput versus a strong numerical ILT baseline, while improving final mask quality. We also present over 20\% EPE improvement on \texttt{ICCAD13} contest cases with 3$\times$ speedup over the SOTA numerical ILT solver. By learning to propose ILT-friendly initializations, our approach mitigates non-convexity and advances beyond what traditional solvers or GenAI can achieve.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。