Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2407.13576 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909261691355136 |
|---|---|
| author | Rele, Rohan Zabinsky, Zelda Pedrielli, Giulia Aravkin, Aleksandr |
| author_facet | Rele, Rohan Zabinsky, Zelda Pedrielli, Giulia Aravkin, Aleksandr |
| contents | Black-box optimization is ubiquitous in machine learning, operations research and engineering simulation. Black-box optimization algorithms typically do not assume structural information about the objective function and thus must make use of stochastic information to achieve statistical convergence to a globally optimal solution. One such class of methods is multi-start algorithms which use a probabilistic criteria to: determine when to stop a single run of an iterative optimization algorithm, also called an inner search, when to perform a restart, or outer search, and when to terminate the entire algorithm. Zabinsky, Bulger & Khompatraporn introduced a record-value theoretic multi-start framework called Dynamic Multi-start Sequential Search (DMSS). We observe that DMSS performs poorly when the inner search method is a deterministic gradient-based search. In this thesis, we present an algorithmic modification to DMSS and empirically show that the Revised DMSS (RDMSS) algorithm can outperform DMSS in gradient-based settings for a broad class of objective test functions. We give a theoretical analysis of a stochastic process that was constructed specifically as an inner search stopping criteria within RDMSS. We discuss computational considerations of the RDMSS algorithm. Finally, we present numerical results to determine its effectiveness. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2407_13576 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A Stochastic Record-Value Approach to Global Simulation Optimization Rele, Rohan Zabinsky, Zelda Pedrielli, Giulia Aravkin, Aleksandr Optimization and Control Black-box optimization is ubiquitous in machine learning, operations research and engineering simulation. Black-box optimization algorithms typically do not assume structural information about the objective function and thus must make use of stochastic information to achieve statistical convergence to a globally optimal solution. One such class of methods is multi-start algorithms which use a probabilistic criteria to: determine when to stop a single run of an iterative optimization algorithm, also called an inner search, when to perform a restart, or outer search, and when to terminate the entire algorithm. Zabinsky, Bulger & Khompatraporn introduced a record-value theoretic multi-start framework called Dynamic Multi-start Sequential Search (DMSS). We observe that DMSS performs poorly when the inner search method is a deterministic gradient-based search. In this thesis, we present an algorithmic modification to DMSS and empirically show that the Revised DMSS (RDMSS) algorithm can outperform DMSS in gradient-based settings for a broad class of objective test functions. We give a theoretical analysis of a stochastic process that was constructed specifically as an inner search stopping criteria within RDMSS. We discuss computational considerations of the RDMSS algorithm. Finally, we present numerical results to determine its effectiveness. |
| title | A Stochastic Record-Value Approach to Global Simulation Optimization |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2407.13576 |