Rethinking density ratio estimation based hyper-parameter optimization

IF 6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Neural Networks Pub Date : 2024-11-20 DOI:10.1016/j.neunet.2024.106917
Zi-En Fan, Feng Lian, Xin-Ran Li
{"title":"Rethinking density ratio estimation based hyper-parameter optimization","authors":"Zi-En Fan,&nbsp;Feng Lian,&nbsp;Xin-Ran Li","doi":"10.1016/j.neunet.2024.106917","DOIUrl":null,"url":null,"abstract":"<div><div>Hyper-parameter optimization (HPO) aims to improve the performance of machine learning algorithms by identifying appropriate hyper-parameters. By converting the computation of expected improvement into density-ratio estimation problems, existing works use binary classifiers to estimate these ratio and determine the next point by maximizing the class posterior probabilities. However, these methods tend to treat different points equally and ignore some important regions, because binary classifiers are unable to capture more information about search spaces and highlight important regions. In this work, we propose a hyper-parameter optimization method by estimating ratios and selecting the next point using multi-class classifiers. First, we divide all samples into multiple classes and train multi-class classifiers. The decision boundaries of the trained classifiers allow for a finer partitioning of search spaces, offering richer insights into the distribution of hyper-parameters within search spaces. We then define an acquisition function as a weighted sum of multi-class classifiers’ outputs, with these weights determined by samples in each class. By assigning different weights to each class posterior probability in our acquisition function, points within search spaces are no longer treated equally. Experimental results on three representative tasks demonstrate that our method achieves a significant improvement in immediate regrets and convergence speed.</div></div>","PeriodicalId":49763,"journal":{"name":"Neural Networks","volume":"182 ","pages":"Article 106917"},"PeriodicalIF":6.0000,"publicationDate":"2024-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Neural Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0893608024008463","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Hyper-parameter optimization (HPO) aims to improve the performance of machine learning algorithms by identifying appropriate hyper-parameters. By converting the computation of expected improvement into density-ratio estimation problems, existing works use binary classifiers to estimate these ratio and determine the next point by maximizing the class posterior probabilities. However, these methods tend to treat different points equally and ignore some important regions, because binary classifiers are unable to capture more information about search spaces and highlight important regions. In this work, we propose a hyper-parameter optimization method by estimating ratios and selecting the next point using multi-class classifiers. First, we divide all samples into multiple classes and train multi-class classifiers. The decision boundaries of the trained classifiers allow for a finer partitioning of search spaces, offering richer insights into the distribution of hyper-parameters within search spaces. We then define an acquisition function as a weighted sum of multi-class classifiers’ outputs, with these weights determined by samples in each class. By assigning different weights to each class posterior probability in our acquisition function, points within search spaces are no longer treated equally. Experimental results on three representative tasks demonstrate that our method achieves a significant improvement in immediate regrets and convergence speed.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于超参数优化的密度比估算反思
超参数优化(HPO)旨在通过确定适当的超参数来提高机器学习算法的性能。通过将预期改进的计算转换为密度比估计问题,现有研究使用二元分类器来估计这些比值,并通过最大化类别后验概率来确定下一个点。然而,由于二元分类器无法捕捉搜索空间的更多信息并突出重要区域,这些方法往往会对不同点一视同仁,忽略一些重要区域。在这项工作中,我们提出了一种超参数优化方法,即使用多类分类器估算比率并选择下一个点。首先,我们将所有样本分为多个类别,并训练多类分类器。训练好的分类器的判定边界可以对搜索空间进行更精细的划分,从而提供对搜索空间内超参数分布的更丰富见解。然后,我们将获取函数定义为多类分类器输出的加权和,这些权重由每类样本决定。通过在我们的获取函数中为每个类别的后验概率分配不同的权重,搜索空间内的点不再被同等对待。三个代表性任务的实验结果表明,我们的方法显著改善了即时遗憾和收敛速度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Neural Networks
Neural Networks 工程技术-计算机:人工智能
CiteScore
13.90
自引率
7.70%
发文量
425
审稿时长
67 days
期刊介绍: Neural Networks is a platform that aims to foster an international community of scholars and practitioners interested in neural networks, deep learning, and other approaches to artificial intelligence and machine learning. Our journal invites submissions covering various aspects of neural networks research, from computational neuroscience and cognitive modeling to mathematical analyses and engineering applications. By providing a forum for interdisciplinary discussions between biology and technology, we aim to encourage the development of biologically-inspired artificial intelligence.
期刊最新文献
Enabling deformation slack in tracking with temporally even correlation filters. Outer synchronization and outer H synchronization for coupled fractional-order reaction-diffusion neural networks with multiweights. Corrigendum to "Hydra: Multi-head Low-rank Adaptation for Parameter Efficient Fine-tuning" [Neural Networks Volume 178, October (2024), 1-11/106414]]. Adaptive discrete-time neural prescribed performance control: A safe control approach. Disentangled latent energy-based style translation: An image-level structural MRI harmonization framework.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1