2025/01/14 by Teng Lian, Jian-Qiang Hu, Lian, Teng +5
Computer Science · Engineering · Mathematics · #Advanced Optimization Algorithms Research #Blind Source Separation Techniques #Computation (stat.CO) #FOS: Computer and information sciences #Machine Learning (stat.ML) #VLSI and FPGA Design Techniques
paper · pdf · doi:10.48550/arxiv.2501.07795
openalex publication_date 2025/01/14 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Black-box optimization is often encountered for decision-making in complex systems management, where the knowledge of system is limited. Under these circumstances, it is essential to balance the utilization of new information with computational efficiency. In practice, decision-makers often face the dual tasks of optimization and statistical inference for the optimal performance, in order to achieve it with a high reliability. Our goal is to address the dual tasks in an online fashion. Wu et al (2022) [arXiv preprint: 2210.06737] point out that the sample average of performance estimates generated by the optimization algorithm needs not to admit a central limit theorem. We propose an algorithm that not only tackles this issue, but also provides an online consistent estimator for the variance of the performance. Furthermore, we characterize the convergence rate of the coverage probabilities of the asymptotic confidence intervals.