Pith. sign in

REVIEW 1 cited by

Adapting Zeroth Order Algorithms for Comparison-Based Optimization

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 2210.05824 v2 pith:6WDLNRYO submitted 2022-10-11 math.OC

classification math.OC
keywords algorithmsoptimizationcomparison-basedfieldaccessadaptingadjacentapplications
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Comparison-Based Optimization (CBO) is an optimization paradigm that assumes only very limited access to the objective function f(x). Despite the growing relevance of CBO to real-world applications, this field has received little attention as compared to the adjacent field of Zeroth-Order Optimization (ZOO). In this work we propose a relatively simple method for converting ZOO algorithms to CBO algorithms, thus greatly enlarging the pool of known algorithms for CBO. Via PyCUTEst, we benchmarked these algorithms against a suite of unconstrained problems. We then used hyperparameter tuning to determine optimal values of the parameters of certain algorithms, and utilized visualization tools such as heat maps and line graphs for purposes of interpretation. All our code is available at https://github.com/ishaslavin/Comparison_Based_Optimization.

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. Fully Adaptive Zeroth-Order Method for Minimizing Functions with Compressible Gradients

    math.OC 2025-01 conditional novelty 6.0 of 10

    ZORO-FA is a fully adaptive zeroth-order method that provably finds eps-stationary points in O(s(log n)/eps^2) function evaluations when gradients are sufficiently compressible, and O(n^2/eps^2) otherwise.

Pith tools