簡易檢索 / 詳目顯示

研究生: 陳國軒
Chen, Kuo-Shiuan
論文名稱: 應用於半監督深度學習光刻模擬之圖取樣與主動學習演算法
Graph Sampling and Active Learning for Semi- Supervised Deep Learning-Based Lithography Simulation
指導教授: 林嘉文
Lin, Chia-Wen
邵皓強
Shao, Hao-Chiang
口試委員: 方邵云
Fang, Shao-Yun
張世杰
Chang, Shih-Chien
學位類別: 碩士
Master
系所名稱: 電機資訊學院 - 電機工程學系
Department of Electrical Engineering
論文出版年: 2021
畢業學年度: 109
語文別: 英文
論文頁數: 60
中文關鍵詞: 半監督深度學習光刻模擬圖取樣主動學習
外文關鍵詞: Graph Sampling, Active Learning, Semi- Supervised, Lithography Simulation
相關次數: 點閱:2下載:0
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報
  • 因為對設計的 IC 圖的非線性形狀失真進行建模過於復雜這個事實,促使
    開發基於學習的預仿真模型。此類模型通常由成對訓練樣本驅動,每個訓
    練樣本由版圖圖案和版圖光刻結果的掃描電子顯微鏡 (SEM) 圖像組成,我
    們通常稱為布局圖-SEM 影像對(layout-SEM pair)。對於一個新的製程,
    收集訓練數據(layout-SEM pair)來獲得預仿真模型既費時又費錢。因此,
    我們提出了一種基於深度學習的主動學習使用圖結構來減少足以製造用於
    獲取其 IC 產品的真實電路輪廓的佈局數量。

    在本文中,我們分析了不同的採樣標準,包括一種基於密度的標準,並
    設計了一種新的主動方法,該方法可以通過利用兩個子網絡、一個自動編
    碼器(Autoencoder) 和一個預訓練的佈局到 SEM 預測模型(LithoNet) 來評
    估佈局的潛在新穎性。一個自動編碼器(Autoencoder) 特徵表示訓練樣本
    的布局圖之間的全局結構相似性,而佈局到 SEM 預測模型(LithoNet) 的
    特徵來描述布局圖到SEM的非線性局部變形。 通過這種設計,所提出的方
    法可以在沒有任何佈局集群或標籤信息的情況下,從一組新佈局模式中找
    到具有代表性的抽樣。最後,我們設計了 IC 製造過程中遇到的實際實驗
    來證明我們方法的有效性,實驗結果表明識別的佈局新穎性可用於微調基
    於學習的預仿真模型和提高其性能。


    It is too complicated to model the non-linear shape distortion of the metal layer between the IC layout design and its fabrication result. This difficulty urges the development of learning-based IC pre-simulation models. Such models are usually driven by pairwise training samples, the so-called layoutSEM pair, each consisting of a layout pattern and the scanning electron microscope (SEM) image of the lithography result of the layout.
    However, it is time-consuming and expensive to collect an enough amount of training data (layout-SEM pair) for developing a pre-simulation model for a new fabrication process. Therefore, in this paper we propose a deep learning-based active learning algorithm to select layouts, which are worthy and informative enough to be fabricated for acquiring their ground-truth
    SEM images from their IC products, based on the graph structure characterizing the data manifold of the whole layout sample space.
    Our graph structure is defined according to latent features extracted by two different subnetworks. One subnetwork characterizes the global structure similarity between the given layout and training samples, and the other embeds local structures into an attention-guided latent code depicting the
    local deformation. Therefore, a graph defined by these two latent codes can effectively describe both normal regular layout samples, which are usually clustered in the feature space, and novel layout samples, which tend to locate sparsely in the feature space and tend to be far away from regular samples. Hence, through this design, the proposed method can be find the most representative samples, novel or not, from a pool of new unseen layout patterns without any layout clustering or labeling information. At the end, we design several experiment sets to prove our method’s effectiveness and
    practicability in the IC manufacturing. Experiment results demonstrate that the identified layout novelties can be used to fine-tune a learning-based presimulation model and boost its performance. We also compared our method with other active learning sampling strategies. Our method outperforms previous state-of-the-art sampling methods and active learning strategies in
    almost all aspects.

    1. Introduction 7 2. Related Work 12 2.1 Pre-simulation Models 12 2.2 Active learning 13 2.3 Sampling on graph 15 3. Proposed Method 16 3.1 Overview 16 3.2 One-time sampling 17 3.2.1 Build graph 19 3.2.2 Split graph 20 3.2.3 Explore and sampling 23 3.2.4 Mini-step sampling 29 3.3 Incremental sampling 32 3.3.1 Learned score 34 3.3.2 Continue sampling 37 3.3.3 Update weight 37 4 Experiment 38 4.1 Dataset and Network Configuration 38 4.2 Experimental implementation 40 4.3 Compare to other Active learning 41 4.4 Hyperparameter 45 4.5 Compare to other graph explore method 48 4.6 Compare to different split graph method 52 5 Conclusion 52

    [1] H. Yang, S. Li, Z. Deng, Y. Ma, B. Yu, and E. F. Young, “Ganopc: Mask optimization with lithography-guided generative adversarial
    nets,” IEEE Trans. Comput.-Aided Design Integr. Circuits Syst., vol. 39, no. 10, pp. 2822–2834, 2019.
    [2] W. Ye, M. B. Alawieh, Y. Lin, and D. Z. Pan, “Lithogan: End-to-end lithography modeling with generative adversarial networks,” in Proc. ACM/IEEE Design Autom. Conf., 2019, pp. 1–6.
    [3] H.-C. Shao, C.-Y. Peng, J.-R. Wu, C.-W. Lin, S.-Y. Fang, P.-Y. Tsai, and Y.-H. Liu, “From ic layout to die photo: A cnn-based data-driven approach,” IEEE Trans. Comput.-Aided Design Integr. Circuits Syst., 2020.
    [4] B. Settles, “Active learning literature survey,” 2009.
    [5] D. D. Lewis, “A sequential algorithm for training text classifiers: Corrigendum and additional data,” in ACM SIGIR Forum, vol. 29, no. 2. ACM New York, NY, USA, 1995, pp. 13–19
    [6] A. J. Joshi, F. Porikli, and N. Papanikolopoulos, “Multi-class active learning for image classification,” in 2009 IEEE Conference on Computer Vision and Pattern Recognition. IEEE, 2009, pp. 2372–2379.
    [7] S. Tong and D. Koller, “Support vector machine active learning with applications to text classification,” J. Mach. Learn. Res., vol. 2, no. Nov, pp. 45–66, 2001.
    [8] K. Brinker, “Incorporating diversity in active learning with support vector machines,” in Proceedings of the 20th international conference on machine learning (ICML-03), 2003, pp. 59–66.
    [9] Y. Yang, Z. Ma, F. Nie, X. Chang, and A. G. Hauptmann, “Multi-class active learning by uncertainty sampling with diversity maximization,”Int. J. Comput. Vis., vol. 113, no. 2, pp. 113–127, 2015.
    [10] Y. Guo, “Active instance sampling via matrix partition.” in NIPS, 2010, pp. 802–810.
    [11] O. Sener and S. Savarese, “Active learning for convolutional neural networks: A core-set approach,” arXiv preprint arXiv:1708.00489, 2017.
    [12] Y. Lin, M. Li, Y. Watanabe, T. Kimura, T. Matsunawa, S. Nojima, and D. Z. Pan, “Data efficient lithography modeling with transfer learning and active data selection,” IEEE Trans. Comput.-Aided Design Integr Circuits Syst., vol. 38, no. 10, pp. 1900–1913, 2018.
    [13] C. Zhuo, K. Agarwal, D. Blaauw, and D. Sylvester, “Active learning framework for post-silicon variation extraction and test cost reduction,” in Proc. IEEE/ACM Int. Conf. Comput.-Aided Design. IEEE, 2010, pp. 508–515.
    [14] E. D. Kolaczyk and G. Cs´ardi, Statistical analysis of network data with R. Springer, 2014, vol. 65.
    [15] N. Metropolis, A. W. Rosenbluth, M. N. Rosenbluth, A. H. Teller, and E. Teller, “Equation of state calculations by fast computing machines,” The journal of chemical physics, vol. 21, no. 6, pp. 1087–1092, 1953.
    [16] D. Aldous and J. Fill, “Reversible markov chains and random walks on graphs,” 2002.
    [17] Z. Zhou, J. Shin, L. Zhang, S. Gurudu, M. Gotway, and J. Liang, “Finetuning convolutional neural networks for biomedical image analysis: actively and incrementally,” in Proc. IEEE Conf. Comput. Vis. Pattern Recognit., 2017, pp. 7340–7351.
    [18] P. Ji, T. Zhang, H. Li, M. Salzmann, and I. Reid, “Deep subspace clustering networks,” arXiv preprint arXiv:1709.02508, 2017.
    [19] R. Ying, R. He, K. Chen, P. Eksombatchai, W. L. Hamilton, and
    J. Leskovec, “Graph convolutional neural networks for web-scale recommender systems,” in Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2018, pp.974–983.
    [20] W. L. Hamilton, R. Ying, and J. Leskovec, “Inductive representation learning on large graphs,” arXiv preprint arXiv:1706.02216, 2017.
    [21] S. Roshanfekr, S. Esmaeili, H. Ataeian, N. M. Khas, and A. Amiri,“Ugrwo-sampling: A modified random walk under-sampling approach based on graphs to imbalanced data classification,” arXiv preprint arXiv:2002.03521, 2020.
    [22] A. Grover and J. Leskovec, “node2vec: Scalable feature learning for networks,” in Proceedings of the 22nd ACM SIGKDD international conference on Knowledge discovery and data mining, 2016, pp. 855–864.
    [23] T. Wang, Y. Chen, Z. Zhang, T. Xu, L. Jin, P. Hui, B. Deng, and X. Li, “Understanding graph sampling algorithms for social network analysis,” in 2011 31st international conference on distributed computing systems workshops. IEEE, 2011, pp. 123–128.
    [24] H. Shomorony and A. S. Avestimehr, “Sampling large data on graphs,”in 2014 IEEE Global Conference on Signal and Information Processing(GlobalSIP). IEEE, 2014, pp. 933–936.
    [25] S. Ebert, M. Fritz, and B. Schiele, “Ralf: A reinforced active learning formulation for object class recognition,” in 2012 IEEE Conference on Computer Vision and Pattern Recognition. IEEE, 2012, pp. 3626–3633.
    [26] H.-C. Shao, “Contour-to-contour distance,”
    https://www.mathworks.com/matlabcentral/fileexchange/75551-
    contour-to-contour-distance.
    [27] Z. Wang, A. C. Bovik, H. R. Sheikh, E. P. Simoncelli et al., “Image quality assessment: from error visibility to structural similarity,” IEEE Trans. Image Process., vol. 13, no. 4, pp. 600–612, 2004.
    [28] Z. Xu, K. Yu, V. Tresp, X. Xu, and J. Wang, “Representative sampling for text classification using support vector machines,” in European conference on information retrieval. Springer, 2003, pp. 393–407.
    [29] J. Zhou and S. Sun, “Improved margin sampling for active learning,” in Chinese Conference on Pattern Recognition. Springer, 2014, pp.120–129.
    [30] S. Paul, J. H. Bappy, and A. K. Roy-Chowdhury, “Efficient selection of informative and diverse training samples with applications in scene classification,” in 2016 IEEE International Conference on Image Processing (ICIP). IEEE, 2016, pp. 494–498.

    QR CODE