307 0

Full metadata record

DC FieldValueLanguage
dc.contributor.advisor조인휘-
dc.contributor.author마지흔-
dc.date.accessioned2023-05-11T11:41:35Z-
dc.date.available2023-05-11T11:41:35Z-
dc.date.issued2023. 2-
dc.identifier.urihttp://hanyang.dcollection.net/common/orgView/200000652062en_US
dc.identifier.urihttps://repository.hanyang.ac.kr/handle/20.500.11754/179418-
dc.description.abstractNowadays, traditional machine learning models and deep convolutional networks play an important role in various fields, such as classification tasks, image processing. A good hyperparameter configuration can allow the models to perform well, therefore, the choice of hyperparameters has a significant impact on the performance of the model. As a result, experts must spend a significant amount of time performing hyperparameter tuning when building a model to accomplish a task. While there are many algorithms for solving hyperparameter optimization (HPO), most methods require actual experimental results in each epoch to help perform the search. Therefore, to reduce the time and computational resources for searching, we propose a multi-agent Proximal Policy Optimization (MAPPO) reinforcement learning algorithm to solve the HPO problem in this paper. Our model uses the centralized training and decentralized execution framework, where each hyperparameter corresponds to an agent and all agents share the reward. We conducted experiments on HPOBench and the results show that our model can converge faster and achieve lower loss compared to other traditional methods.-
dc.publisher한양대학교-
dc.titleMulti Agent PPO-based Hyperparameter Optimization-
dc.typeTheses-
dc.contributor.googleauthor마지흔-
dc.sector.campusS-
dc.sector.daehak대학원-
dc.sector.department컴퓨터·소프트웨어학과-
dc.description.degreeMaster-
Appears in Collections:
GRADUATE SCHOOL[S](대학원) > COMPUTER SCIENCE(컴퓨터·소프트웨어학과) > Theses (Master)
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE