Pith. sign in

Optimizing Large-Scale Hyperparameters via Automated Learning Algorithm

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
abstract

Modern machine learning algorithms usually involve tuning multiple (from one to thousands) hyperparameters which play a pivotal role in terms of model generalizability. Black-box optimization and gradient-based algorithms are two dominant approaches to hyperparameter optimization while they have totally distinct advantages. How to design a new hyperparameter optimization technique inheriting all benefits from both approaches is still an open problem. To address this challenging problem, in this paper, we propose a new hyperparameter optimization method with zeroth-order hyper-gradients (HOZOG). Specifically, we first exactly formulate hyperparameter optimization as an A-based constrained optimization problem, where A is a black-box optimization algorithm (such as deep neural network). Then, we use the average zeroth-order hyper-gradients to update hyperparameters. We provide the feasibility analysis of using HOZOG to achieve hyperparameter optimization. Finally, the experimental results on three representative hyperparameter (the size is from 1 to 1250) optimization tasks demonstrate the benefits of HOZOG in terms of simplicity, scalability, flexibility, effectiveness and efficiency compared with the state-of-the-art hyperparameter optimization methods.

fields

cs.LG 1

years

2025 1

verdicts

CONDITIONAL 1

representative citing papers

qNBO: quasi-Newton Meets Bilevel Optimization

cs.LG · 2025-02-03 · conditional · novelty 6.0

qNBO coordinates lower-level quasi-Newton iterations with inverse Hessian-vector products to approximate bilevel hypergradients, giving BFGS and SR1 instantiations and a non-asymptotic BFGS convergence rate.

citing papers explorer

Showing 1 of 1 citing paper.

  • qNBO: quasi-Newton Meets Bilevel Optimization cs.LG · 2025-02-03 · conditional · none · ref 29 · internal anchor

    qNBO coordinates lower-level quasi-Newton iterations with inverse Hessian-vector products to approximate bilevel hypergradients, giving BFGS and SR1 instantiations and a non-asymptotic BFGS convergence rate.