LGETSTMar 20, 2025

A Statistical Analysis for Per-Instance Evaluation of Stochastic Optimizers: How Many Repeats Are Enough?

arXiv:2503.16589v12 citationsh-index: 13
Originality Incremental advance
AI Analysis

This work addresses the issue of reliable performance evaluation for researchers and practitioners using stochastic optimizers, but it is incremental as it builds on existing statistical methods for experiment design.

The paper tackles the problem of evaluating stochastic optimizers by analyzing how many repeated runs are needed to achieve accurate performance metrics, and it proposes an algorithm to adaptively determine the required number of repeats to ensure reliability in benchmarking and hyperparameter tuning.

A key trait of stochastic optimizers is that multiple runs of the same optimizer in attempting to solve the same problem can produce different results. As a result, their performance is evaluated over several repeats, or runs, on the problem. However, the accuracy of the estimated performance metrics depends on the number of runs and should be studied using statistical tools. We present a statistical analysis of the common metrics, and develop guidelines for experiment design to measure the optimizer's performance using these metrics to a high level of confidence and accuracy. To this end, we first discuss the confidence interval of the metrics and how they are related to the number of runs of an experiment. We then derive a lower bound on the number of repeats in order to guarantee achieving a given accuracy in the metrics. Using this bound, we propose an algorithm to adaptively adjust the number of repeats needed to ensure the accuracy of the evaluated metric. Our simulation results demonstrate the utility of our analysis and how it allows us to conduct reliable benchmarking as well as hyperparameter tuning and prevent us from drawing premature conclusions regarding the performance of stochastic optimizers.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes