Optimization via Strategic Law of Large Numbers
通过策略性大数定律进行优化AI 解读 ↓
← 返回论文列表与筛选
阅读说明
本页整理公开书目信息，不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成，未完成全文核验，可能有误；具体假设、证明与结论请核对原文。摘要保留来源文本，未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要；缺少可靠材料时保留待补状态。
本页为预印本版本；arXiv 收录、作者填写的期刊信息以及作者既有发表经历，都不单独证明本篇已接收。作者发表记录按 OpenAlex 身份与完整姓名、本站覆盖期刊 ISSN 及正式卷期核对，只展示已核实例，档案仍可能误合并。
引用量采用 OpenAlex 单条关联记录，不合计多个记录；关联记录可能包含正式发表版本，不等于此版本单独引用。缺失不视为零，引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配，同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列，再参考通用方法与发表日期。
分类依据与纠错
AI 根据所提供的论文材料归类：摘要讨论通用全局优化与决策策略，没有明确的经济计量领域目标。
反馈分类问题
正在核对关联版本…
代码、数据与补充材料
正在核对对应版本的资源…
通过策略性大数定律进行优化
- 研究问题
- 如何利用带策略的双臂决策过程，在有界矩形域内优化连续函数，并区分理论最优策略与可实施算法的局部、全局收敛保证？
- 方法与思路
- 作者以策略性大数定律和抛物型偏微分方程刻画最优策略，再提出按偏导符号逐坐标选择双臂的战略蒙特卡洛优化算法。
- 材料陈述的贡献
- 摘要称简化策略从单一起点可收敛至局部最优，起点集合增长时可收敛至全局最优，并报告在所选测试函数上的良好数值表现。
- 阅读关注点
- 应核对连续函数框架与梯度算法各自所需条件、起点增长规则及收敛概念，并检查数值比较是否统一计算预算和调参方式。
- 阅读边界
- 依据 arXiv 预印本摘要，不能确认同行评审或期刊接收；有限起点的数值成功不等于普遍全局保证，优于其他算法是作者实验陈述。
原文摘要
This paper proposes a unified framework for the global optimization of a continuous function in a bounded rectangular domain. Specifically, we show that: (1) under the optimal strategy for a two-armed decision model, the sample mean converges to a global optimizer under the Strategic Law of Large Numbers, and (2) a sign-based strategy built upon the solution of a parabolic PDE is asymptotically optimal. Motivated by this result, we propose a class of {\bf S}trategic {\bf M}onte {\bf C}arlo {\bf O}ptimization (SMCO) algorithms, which uses a simple strategy that makes coordinate-wise two-armed decisions based on the signs of the partial gradient of the original function being optimized over (without the need of solving PDEs). While this simple strategy is not generally optimal, we show that it is sufficient for our SMCO algorithm to converge to local optimizer(s) from a single starting point, and to global optimizers under a growing set of starting points. Numerical studies demonstrate the suitability of our SMCO algorithms for global optimization, and illustrate the promise of our theoretical framework and practical approach. For a wide range of test functions with challenging optimization landscapes (including ReLU neural networks with square and hinge loss), our SMCO algorithms converge to the global maximum accurately and robustly, using only a small set of starting points (at most 100 for dimensions up to 1000) and a small maximum number of iterations (200). In fact, our algorithms outperform many state-of-the-art global optimizers, as well as local algorithms augmented with the same set of starting points as ours.