Research on Deep Neural Network Hyperparameter Optimization Method Based on Improved Tree Seed Algorithm

The performance of deep neural networks greatly depends on how their hyperparameters are set. However, tuning these hyperparameters by hand takes much time and is not efficient. To solve this problem, this paper presents a method for deep neural network hyperparameter optimization. This method uses an improved Tree Seed Algorithm (GTSA). Standard TSA has drawbacks in the complex and high-dimensional hyperparameter search space. We introduced a self-adaptive nonlinear step size dynamic adjustment mechanism and a dynamic seed number method based on multiple distributions. The first mechanism aims to balance the algorithm's global search and local search abilities. The second mechanism aims to increase population diversity and help the algorithm escape local optima. To test GTSA's effectiveness, we first evaluated its performance on the CEC 2014 test suite. The experimental results showed that GTSA has superior optimization performance on various benchmark functions. Then, we applied GTSA to optimize the hyperparameters of a convolutional neural network on the CIFAR-10 dataset. Compared to methods like Random Search, Bayesian Optimization, and Particle Swarm Optimization, GTSA significantly improved test accuracy and optimization efficiency. The experimental results prove that GTSA is an effective and competitive method for deep neural network hyperparameter optimization.

Authors

Institutions

Publication Details

Published
2025-05-09
DOI
https://doi.org/10.1109/cisce65916.2025.11065322
Citations
1
Primary Topic
E-commerce and Technology Innovations
Type
article
Field-Weighted Citation Impact
2.45
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Research on Deep Neural Network Hyperparameter Optimization Method Based on Improved Tree Seed Algorithm

Hanjie Xu, Rui Li, Qiyu Chen
1 citations
E-commerce and Technology Innovations
2.45
article

Research on Deep Neural Network Hyperparameter Optimization Method Based on Improved Tree Seed Algorithm

Hanjie Xu, Rui Li, Qiyu Chen
article en
1 citations

Abstract

The performance of deep neural networks greatly depends on how their hyperparameters are set. However, tuning these hyperparameters by hand takes much time and is not efficient. To solve this problem, this paper presents a method for deep neural network hyperparameter optimization. This method uses an improved Tree Seed Algorithm (GTSA). Standard TSA has drawbacks in the complex and high-dimensional hyperparameter search space. We introduced a self-adaptive nonlinear step size dynamic adjustment mechanism and a dynamic seed number method based on multiple distributions. The first mechanism aims to balance the algorithm's global search and local search abilities. The second mechanism aims to increase population diversity and help the algorithm escape local optima. To test GTSA's effectiveness, we first evaluated its performance on the CEC 2014 test suite. The experimental results showed that GTSA has superior optimization performance on various benchmark functions. Then, we applied GTSA to optimize the hyperparameters of a convolutional neural network on the CIFAR-10 dataset. Compared to methods like Random Search, Bayesian Optimization, and Particle Swarm Optimization, GTSA significantly improved test accuracy and optimization efficiency. The experimental results prove that GTSA is an effective and competitive method for deep neural network hyperparameter optimization.

Boston University (US), Northeastern University (US), Anhui Xinhua University (CN), Guangzhou Xinhua University
Openalex Percentile: Top 10%
E-commerce and Technology Innovations
2.45
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.