Convergence rate analysis for optimal computing budget allocation algorithms

Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review

View graph of relations

Author(s)

Related Research Unit(s)

Detail(s)

Original languageEnglish
Article number111042
Journal / PublicationAutomatica
Volume153
Online published14 Apr 2023
Publication statusPublished - Jul 2023

Abstract

Ordinal optimization (OO) is a widely-studied technique for optimizing discrete-event dynamic systems (DEDS). It evaluates the performance of the system designs in a finite set by sampling and aims to correctly make ordinal comparison of the designs. A well-known method in OO is the optimal computing budget allocation (OCBA). It builds the optimality conditions for the number of samples allocated to each design, and the sample allocation that satisfies the optimality conditions is shown to asymptotically maximize the probability of correct selection for the best design. In this paper, we investigate two popular OCBA algorithms. With known variances for samples of each design, we characterize their convergence rates with respect to different performance measures. We first demonstrate that the two OCBA algorithms achieve the optimal convergence rate under measures of probability of correct selection and expected opportunity cost. It fills the void of convergence analysis for OCBA algorithms. Next, we extend our analysis to the measure of cumulative regret, a main measure studied in the field of machine learning. We show that with minor modification, the two OCBA algorithms can reach the optimal convergence rate under cumulative regret. It indicates the potential of broader use of algorithms designed based on the OCBA optimality conditions. © 2023 Elsevier Ltd

Research Area(s)

  • Discrete-event dynamic system, Optimal computing budget allocation, Optimal convergence rate, Ordinal optimization, Ranking and selection

Citation Format(s)

Convergence rate analysis for optimal computing budget allocation algorithms. / Li, Yanwen; Gao, Siyang.
In: Automatica, Vol. 153, 111042, 07.2023.

Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review