mlsanityData to 14 Oct 2026

A Statistical Analysis for Per-Instance Evaluation of Stochastic Optimizers: Avoiding Unreliable Conclusions

arXiv 2503.16589 ↗First posted 20 Mar 2025cs.LG cs.ET math.STcited by 1

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 7 of its 41 references that are in the map. First posted on arXiv 20 Mar 2025.

Builds on

7 of 41 references.

References · 7

  1. 2021Learning to Schedule Heuristics in Branch-and-Boundcited by 46
  2. 2017Best practices for comparing optimization algorithmscited by 10
  3. 2023All-to-all reconfigurability with sparse and higher-order Ising machinescited by 10
  4. 2020Logically Synthesized, Hardware-Accelerated, Restricted Boltzmann Machines for Combinatorial Optimization and Integer Factorizationcited by 4
  5. 2024Computing High-Degree Polynomial Gradients in Memorycited by 3
  6. 2024Benchmarking the Operation of Quantum Heuristics and Ising Machines: Scoring Parameter Setting Strategies on Optimization Applicationscited by 3
  7. 2023Memristor-based hardware and algorithms for higher-order Hopfield optimization solver outperforming quadratic Ising machinescited by 2

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.