Pith. sign in

REVIEW 1 cited by

Optimizing Large-Scale Hyperparameters via Automated Learning Algorithm

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2102.09026 v1 pith:2MVB3RX5 submitted 2021-02-17 cs.LG

classification cs.LG
keywords optimizationhyperparameterhozoghyperparametersproblemalgorithmalgorithmsapproaches
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. qNBO: quasi-Newton Meets Bilevel Optimization

    cs.LG 2025-02 conditional novelty 6.0 of 10

    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.

Pith tools