arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1402.3354math.OC
收藏

离散随机最优化的自适应搜索算法:一种光滑最佳响应方法

Adaptive Search Algorithms for Discrete Stochastic Optimization: A Smooth Best-Response Approach

Omid Namvar Gharehshiran, Vikram Krishnamurthy, George Yin

摘要:

本文考虑基于仿真的优化性能的状态切换随机系统在有限集的可行配置。受对策论中随机虚拟游戏学习规则的启发,提出了一种基于自适应模拟的搜索算法,该算法采用平滑的最佳响应采样策略,跟踪全局最优解集,但分散搜索,使大部分精力花在模拟全局最优解的系统性能上.即使观测数据是相关的(只要弱大数定律成立),该算法也会弱收敛到全局最优解集。数值算例表明,与文献中已有的几种随机搜索和纯探索方法相比,该方法在有限样本长度下具有更快的收敛速度.

英文摘要:

This paper considers simulation-based optimization of the performance of a regime-switching stochastic system over a finite set of feasible configurations. Inspired by the stochastic fictitious play learning rules in game theory, we propose an adaptive simulation-based search algorithm that uses a smooth best-response sampling strategy and tracks the set of global optima, yet distributes the search so that most of the effort is spent on simulating the system performance at the global optima. The algorithm converges weakly to the set of global optima even when the observation data is correlated (as long as a weak law of large numbers holds). Numerical examples show that the proposed scheme yields a faster convergence for finite sample lengths compared with several existing random search and pure exploration methods in the literature.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑