Offline Stochastic Optimization of Black-Box Objective Functions
Not on the map. Why?
Abstract (arXiv)
Many challenges in science and engineering, such as drug discovery and communication network design, involve optimizing complex and expensive black-box functions across vast search spaces. Thus, it is essential to leverage existing data to avoid costly active queries of these black-box functions. To this end, while Offline Black-Box Optimization (BBO) is effective for deterministic problems, it may fall short in capturing the stochasticity of real-world scenarios. To address this, we introduce Stochastic Offline BBO (SOBBO), which tackles both black-box objectives and uncontrolled uncertainties. We propose two solutions: for large-data regimes, a differentiable surrogate allows for gradient-based optimization, while for scarce-data regimes, we directly estimate gradients under conservative field constraints, improving robustness, convergence, and data efficiency. Numerical experiments demonstrate the effectiveness of our approach on both synthetic and real-world tasks.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 9 of its 54 references that are in the map. First posted on arXiv 3 Dec 2024.
Builds on
9 of 54 references.
References · 9
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
- 2016An overview of gradient descent optimization algorithmscited by 1,033
- 2018A Convergence Analysis of Gradient Descent for Deep Linear Neural Networkscited by 184
- 2020An Improved Analysis of Stochastic Gradient Descent with Momentumcited by 119
- 2021Conservative Objective Models for Effective Offline Model-Based Optimizationcited by 88
- 2022Generative Pretraining for Black-Box Optimizationcited by 36
- 2024Offline Model-Based Optimization via Policy-Guided Gradient Searchcited by 19
- 2019On the Adaptivity of Stochastic Gradient-Based Optimizationcited by 7
Built on by
Not cited yet.