AdaOPC: A Self-Adaptive Mask Optimization Framework For Real Design Patterns

• URL: http://arxiv.org/abs/2303.12723v1
• Date: Wed, 15 Mar 2023 13:40:37 GMT
• Title: AdaOPC: A Self-Adaptive Mask Optimization Framework For Real Design Patterns
• Abstract summary: Optical proximity correction (OPC) is a widely-used resolution enhancement technique (RET) for printability optimization. We propose a self-adaptive OPC framework to improve efficiency. Experimental results show that our framework achieves substantial improvement in both performance and efficiency.
• Score: 13.03056139396295
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Optical proximity correction (OPC) is a widely-used resolution enhancement technique (RET) for printability optimization. Recently, rigorous numerical optimization and fast machine learning are the research focus of OPC in both academia and industry, each of which complements the other in terms of robustness or efficiency. We inspect the pattern distribution on a design layer and find that different sub-regions have different pattern complexity. Besides, we also find that many patterns repetitively appear in the design layout, and these patterns may possibly share optimized masks. We exploit these properties and propose a self-adaptive OPC framework to improve efficiency. Firstly we choose different OPC solvers adaptively for patterns of different complexity from an extensible solver pool to reach a speed/accuracy co-optimization. Apart from that, we prove the feasibility of reusing optimized masks for repeated patterns and hence, build a graph-based dynamic pattern library reusing stored masks to further speed up the OPC flow. Experimental results show that our framework achieves substantial improvement in both performance and efficiency.

Related papers

• VQA for Dynamic Portfolio Optimization: Sampling Strategies, Optimizer Scheduling, and Hardware-Aware Ansatz Design [0.0]
  Variational quantum algorithms are increasingly explored for optimization problems at scales relevant to near-term quantum devices.<n>Their practical performance depends strongly on design choices such as the objective, classical, and ansatz layout before and after hardware transpilation.<n>We study these factors for dynamic portfolio optimization, a multi-period financial problem balancing return, risk, transaction costs, cash-interest effects, and constraints.
  arXiv  Detail & Related papers  (2026-06-08T19:25:39Z)
• LithoGRPO: Fast Inverse Lithography via GRPO Reinforced Flow Matching [51.14153938143746]
  Inverse Lithography Technology (ILT) generates optimized masks that enhance the fidelity of pattern transfer onto wafers.<n>We introduce LithoGRPO, an ILT framework that integrates the flow-matching paradigm with GRPO-based reinforcement learning (RL) fine-tuning.<n>To improve RL sampling efficiency, we propose a fast shot-counting algorithm for manufacturability evaluation, achieving over 130x speedup.
  arXiv  Detail & Related papers  (2026-05-29T18:01:59Z)
• VisPCO: Visual Token Pruning Configuration Optimization via Budget-Aware Pareto-Frontier Learning for Vision-Language Models [74.05545957865228]
  Visual token pruning methods effectively mitigate the quadratic computational growth caused by processing high-resolution images and video frames in vision-language models (VLMs)<n>We introduce, a novel framework that formulates visual token pruning as a Pareto configuration optimization problem to automatically identify optimal configurations.<n>Our approach employs continuous relaxation and straight-through estimators to enable gradient-based search, solved via the Augmented Lagrangian method.
  arXiv  Detail & Related papers  (2026-04-16T16:21:05Z)
• MorphOPC: Advancing Mask Optimization with Multi-scale Hierarchical Morphological Learning [11.329737398904875]
  Optical proximity correction (OPC) is widely used to ensure pattern fidelity and manufacturability.<n>Recent generative mask optimization models can synthesize near-optimal masks, serving as fast machine learning (ML) surrogates for traditional OPC.<n>We propose textitMorphOPC, a multi-scale hierarchical model with neural morphological modules to learn these transformations.
  arXiv  Detail & Related papers  (2026-04-13T14:40:34Z)
• TIDE: Tuning-Integrated Dynamic Evolution for LLM-Based Automated Heuristic Design [7.264986493460248]
  TIDE is a Tuning-Integrated Dynamic Evolution framework designed to decouple structural reasoning from parameter optimization.<n> experiments across nine optimization problems demonstrate that TIDE significantly outperforms state-of-the-art tuning methods.
  arXiv  Detail & Related papers  (2026-01-29T04:00:02Z)
• Compiler Optimization via LLM Reasoning for Efficient Model Serving [7.257845254223727]
  We introduce a compilation framework (dubbed REASONING COMPILER) that formulates optimization as a sequential, context-aware decision process.<n>We achieve substantial speedups with markedly fewer samples than leading neural compilers.
  arXiv  Detail & Related papers  (2025-06-02T07:02:46Z)
• Make Optimization Once and for All with Fine-grained Guidance [78.14885351827232]
  Learning to Optimize (L2O) enhances optimization efficiency with integrated neural networks. L2O paradigms achieve great outcomes, e.g., refitting, generating unseen solutions iteratively or directly. Our analyses explore general framework for learning optimization, called Diff-L2O, focusing on augmenting solutions from a wider view.
  arXiv  Detail & Related papers  (2025-03-14T14:48:12Z)
• AI-Driven Optimization of Hardware Overlay Configurations [0.0]
  This paper presents an AI-driven approach to optimizing FPGA overlay configurations. By leveraging machine learning techniques, we predict the feasibility and efficiency of different configurations before hardware compilation.
  arXiv  Detail & Related papers  (2025-03-08T22:34:47Z)
• Pattern Tree: Enhancing Efficiency in Quantum Circuit Optimization Based on Pattern-matching [3.2801774304960447]
  We propose a novel framework for quantum circuit optimization based on pattern matching to enhance its efficiency. We show that pattern-tree-based pattern matching can reduce execution time by an average of 20% on a well-accepted benchmark set.
  arXiv  Detail & Related papers  (2024-12-09T07:21:11Z)
• BPQP: A Differentiable Convex Optimization Framework for Efficient End-to-End Learning [17.662882719189373]
  We introduce BPQP, a differentiable convex optimization framework for efficient end-to-end learning. To enhance efficiency, we reformulate the backward pass as a simplified and decoupled quadratic programming problem. Extensive experiments on both simulated and real-world datasets demonstrate that BPQP achieves a significant improvement in efficiency.
  arXiv  Detail & Related papers  (2024-11-28T17:31:15Z)
• Backpropagation of Unrolled Solvers with Folded Optimization [55.04219793298687]
  The integration of constrained optimization models as components in deep networks has led to promising advances on many specialized learning tasks. One typical strategy is algorithm unrolling, which relies on automatic differentiation through the operations of an iterative solver. This paper provides theoretical insights into the backward pass of unrolled optimization, leading to a system for generating efficiently solvable analytical models of backpropagation.
  arXiv  Detail & Related papers  (2023-01-28T01:50:42Z)
• An Empirical Evaluation of Zeroth-Order Optimization Methods on AI-driven Molecule Optimization [78.36413169647408]
  We study the effectiveness of various ZO optimization methods for optimizing molecular objectives. We show the advantages of ZO sign-based gradient descent (ZO-signGD) We demonstrate the potential effectiveness of ZO optimization methods on widely used benchmark tasks from the Guacamol suite.
  arXiv  Detail & Related papers  (2022-10-27T01:58:10Z)
• A Pareto-optimal compositional energy-based model for sampling and optimization of protein sequences [55.25331349436895]
  Deep generative models have emerged as a popular machine learning-based approach for inverse problems in the life sciences. These problems often require sampling new designs that satisfy multiple properties of interest in addition to learning the data distribution.
  arXiv  Detail & Related papers  (2022-10-19T19:04:45Z)
• Efficient Non-Parametric Optimizer Search for Diverse Tasks [93.64739408827604]
  We present the first efficient scalable and general framework that can directly search on the tasks of interest. Inspired by the innate tree structure of the underlying math expressions, we re-arrange the spaces into a super-tree. We adopt an adaptation of the Monte Carlo method to tree search, equipped with rejection sampling and equivalent- form detection.
  arXiv  Detail & Related papers  (2022-09-27T17:51:31Z)
• Large Scale Mask Optimization Via Convolutional Fourier Neural Operator and Litho-Guided Self Training [54.16367467777526]
  We present a Convolutional Neural Operator (CFCF) that can efficiently learn mask tasks. For the first time, our machine learning-based framework outperforms state-of-the-art numerical mask dataset.
  arXiv  Detail & Related papers  (2022-07-08T16:39:31Z)
• Batched Data-Driven Evolutionary Multi-Objective Optimization Based on Manifold Interpolation [6.560512252982714]
  We propose a framework for implementing batched data-driven evolutionary multi-objective optimization. It is so general that any off-the-shelf evolutionary multi-objective optimization algorithms can be applied in a plug-in manner. Our proposed framework is featured with a faster convergence and a stronger resilience to various PF shapes.
  arXiv  Detail & Related papers  (2021-09-12T23:54:26Z)
• LinEasyBO: Scalable Bayesian Optimization Approach for Analog Circuit Synthesis via One-Dimensional Subspaces [11.64233949999656]
  We propose a fast and robust Bayesian optimization approach via one-dimensional subspaces for analog circuit synthesis. Our proposed algorithm can accelerate the optimization procedure by up to 9x and 38x compared to LP-EI and REMBOpBO respectively when the batch size is 15.
  arXiv  Detail & Related papers  (2021-09-01T21:25:25Z)
• A self-adapting super-resolution structures framework for automatic design of GAN [15.351639834230383]
  We introduce a new super-resolution image reconstruction generative adversarial network framework. We use a Bayesian optimization method used to optimize the hyper parameters of the generator and discriminator. Our method adopts Bayesian optimization as a optimization policy of GAN in our model.
  arXiv  Detail & Related papers  (2021-06-10T19:11:29Z)
• A Framework for Discovering Optimal Solutions in Photonic Inverse Design [0.0]
  Photonic inverse design has emerged as an indispensable engineering tool for complex optical systems. Finding solutions approaching global optimum may present a computationally intractable task. We develop a framework that allows expediting the search of solutions close to global optimum on complex optimization spaces.
  arXiv  Detail & Related papers  (2021-06-03T22:11:03Z)
• Optimization-Inspired Learning with Architecture Augmentations and Control Mechanisms for Low-Level Vision [74.9260745577362]
  This paper proposes a unified optimization-inspired learning framework to aggregate Generative, Discriminative, and Corrective (GDC) principles. We construct three propagative modules to effectively solve the optimization models with flexible combinations. Experiments across varied low-level vision tasks validate the efficacy and adaptability of GDC.
  arXiv  Detail & Related papers  (2020-12-10T03:24:53Z)

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.