Optimization via the strategic law of large numbers
Proceedings of the National Academy of Sciences · 27.01.2026 · 123 (4)
DOI: 10.1073/pnas.2519845123 ↗Kurz gefasst
Fachartikel in der Zeitschrift Proceedings of the National Academy of Sciences, online erschienen am 22.01.2026. Verfasst von Xiaohong Chen und 4 weiteren Autor:innen. Beteiligte Einrichtung: Department of Economics, Yale University, New Haven, CT 06511. Die Arbeit wurde bisher 2-mal zitiert (Crossref) und nennt 33 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-NC-ND 4.0).
Abstract (Originalsprache)
This paper proposes a framework for the global optimization of a possibly multimodal continuous function in a bounded rectangular domain. We first show that global optimization is equivalent to an optimal (sampling) strategy formation in a two-armed decision model with known distributions, based on the strategic law of large numbers we establish. There are many optimal strategies in general. We show that a concrete strategy using the sign of the partial gradient of the unique solution to a parabolic partial differential equation (PDE) is asymptotically optimal. Motivated by these results, we propose a class of Strategic Monte Carlo Optimization (SMCO) algorithms, which uses a simple strategy that makes coordinate-wise two-armed decisions based on the signs of the partial gradient (or practically the first difference) of the objective function, without the need of solving PDEs. Under some sufficient conditions, we establish that our SMCO algorithm converges to a local optimizer from a single starting point, and to a global optimizer under a growing set of starting points. Extensive numerical studies demonstrate the suitability of our SMCO algorithms for global optimization well beyond the theoretical guarantees established herein. For a wide range of deterministic and random test functions with challenging landscapes (multimodal, nondifferentiable, discontinuous), our SMCO algorithms perform robustly well, even in high-dimensional ( d = 200 ∼ 1 , 000 ) settings. In fact, our algorithms outperform many state-of-the-art global optimizers, as well as local algorithms (with the same set of starting points as ours).
Schlagwörter
Stichwörter der Autor:innen
Autor:innen und Institutionen
- Department of Economics, Yale University, New Haven, CT 06511.
- Zhongtai Securities Institute for Financial Studies, State Key Laboratory of Cryptography and Digital Economy Security, Shandong University, Jinan 250100, China.
- Department of Economics, University of Pennsylvania, Philadelphia, PA 19104.
- Department of Statistics and Data Sciences, Jiaotong University, Xi'an 710049, China.
- Department of Mathematical Statistics, School of Statistics and Mathematics, Shandong University of Finance and Economics, Jinan 250014, China.
ORCID-Profile: Xiaohong Chen, Wayne Yuan Gao
Zitieren
APA
Chen, X., Chen, Z., Gao, W. Y., Yan, X., & Zhang, G. (2026). Optimization via the strategic law of large numbers. Proceedings of the National Academy of Sciences, 123(4). https://doi.org/10.1073/pnas.2519845123
Vancouver
Chen X, Chen Z, Gao WY, Yan X, Zhang G. Optimization via the strategic law of large numbers. Proceedings of the National Academy of Sciences. 2026;123(4). doi:10.1073/pnas.2519845123
BibTeX
@article{Chen2026,
author = {Chen, Xiaohong and Chen, Zengjing and Gao, Wayne Yuan and Yan, Xiaodong and Zhang, Guodong},
title = {Optimization via the strategic law of large numbers},
journal = {Proceedings of the National Academy of Sciences},
year = {2026},
volume = {123},
number = {4},
doi = {10.1073/pnas.2519845123}
}
EUVIMED