加速粗粒度Optimization的流形学习
Manifold Learning for Accelerating Coarse-Grained Optimization
摘要:
为解决没有导数信息的高维最优化问题而提出的算法经常遇到“维数灾难”,随着参数空间的维数增加而变得无效。有效地低维的此类问题的子类的一个特征是,只有少数参数(或其组合)对于优化是重要的,并且必须详细地探索。提前知道这些参数/组合将大大简化问题及其解决方案。我们提出了一个有效的(粗粒度的,“趋势”)优化器的数据驱动的建设,从合奏的简短的模拟突发与“内部”优化算法的基础上,有可能加快探索的参数空间。这个“有效的优化器”的轨迹很快被吸引到一个由少数相关参数组合参数化的慢流形上。我们获得这个低维的参数化,有效的优化流形上的飞行使用数据挖掘/流形学习技术的模拟(内部优化器迭代)的结果突发合奏,并利用它本地“跳”沿此流形前进。因此,我们可以将参数空间的探索偏向少数重要的方向,并通过这种“包装算法”,加快传统优化算法的收敛速度。
英文摘要:
Algorithms proposed for solving high-dimensional optimization problems with no derivative information frequently encounter the "curse of dimensionality," becoming ineffective as the dimension of the parameter space grows. One feature of a subclass of such problems that are effectively low-dimensional is that only a few parameters (or combinations thereof) are important for the optimization and must be explored in detail. Knowing these parameters/ combinations in advance would greatly simplify the problem and its solution. We propose the data-driven construction of an effective (coarse-grained, "trend") optimizer, based on data obtained from ensembles of brief simulation bursts with an "inner" optimization algorithm, that has the potential to accelerate the exploration of the parameter space. The trajectories of this "effective optimizer" quickly become attracted onto a slow manifold parameterized by the few relevant parameter combinations. We obtain the parameterization of this low-dimensional, effective optimization manifold on the fly using data mining/manifold learning techniques on the results of simulation (inner optimizer iteration) burst ensembles and exploit it locally to "jump" forward along this manifold. As a result, we can bias the exploration of the parameter space towards the few, important directions and, through this "wrapper algorithm," speed up the convergence of traditional optimization algorithms.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。