DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Yun, Se-Young | - |
dc.contributor.advisor | 윤세영 | - |
dc.contributor.author | Cho, Sangwook | - |
dc.date.accessioned | 2023-06-22T19:31:16Z | - |
dc.date.available | 2023-06-22T19:31:16Z | - |
dc.date.issued | 2022 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=997686&flag=dissertation | en_US |
dc.identifier.uri | http://hdl.handle.net/10203/308191 | - |
dc.description | 학위논문(석사) - 한국과학기술원 : 김재철AI대학원, 2022.2,[v, 35 p. :] | - |
dc.description.abstract | Nowadays, Deep Neural Networks (DNNs) have achieved numerous success in various computer vision tasks such as image classification, image segmentation and object detection. Since DNNs are over-parameterized, they are prone to overfitting when corrupted labels are included. This phenomenon is named as memorization of noisy labels. In this paper, we propose ENLAS (Ensemble of Loss Magnitude and Alignment Score): Robust Learning via Ensemble Framework for Handling Noisy Labels. ENLAS is mainly composed of three parts: 1) Feature extractor, 2) Gaussian-Mixture-Models, 3) Importance factor. ENLAS takes advantage of both loss magnitude and alignment score by ensemble without additional hyperparameter. In addition, the quality of feature extractor is maintained regardless of noise ratio by utilizing gradually increasing threshold. Under the proposed framework, we conduct experiments with respect to various noise rate in CIFAR-10 and CIFAR-100. Experimental results validate that ENLAS outperforms other baseline methods on various benchmark datasets. | - |
dc.language | eng | - |
dc.publisher | 한국과학기술원 | - |
dc.title | ENLAS | - |
dc.title.alternative | 라벨 노이즈 상황에서 앙상블 구조를 활용한 강건 학습 방법론 | - |
dc.type | Thesis(Master) | - |
dc.identifier.CNRN | 325007 | - |
dc.description.department | 한국과학기술원 :김재철AI대학원, | - |
dc.contributor.alternativeauthor | 조상욱 | - |
dc.title.subtitle | robust learning via ensemble framework for handling noisy labels | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.