随机内点抽样方法与优化
Randomized Interior Point methods for Sampling and Optimization
摘要:
我们提出了一个马尔可夫链(Dikin步行)的采样从凸体配备了一个自协调的障碍,其混合时间从“中心点”是强多项式的凸集的描述。该链的混合时间在凸集的仿射变换下是不变的,从而消除了首先将身体放置在各向同性位置的需要。这恢复和推广以前的结果从多面体到更一般的凸集。在每一个$n$维凸集上,存在一个自协调障碍,其“复杂性”是多项式有界的。因此,我们描述的快速混合马尔可夫链可以定义在任何凸集上。我们使用这些结果来设计一个算法,包括一个单一的随机行走优化一个线性函数的凸集。我们表明,这种随机游走达到一个近似的最佳点,在多项式时间与高概率和相应的目标值收敛的概率为1的最佳目标值的步骤趋于无穷大。一个技术贡献是一个家庭的下界等周常数(加权)黎曼流形上,内点方法执行一种最速下降。利用Barthe \cite{barthe}、Bobkov和Houdré关于(加权)黎曼流形乘积的等周性的结果,我们得到了关于凸集乘积上的Dikin游动的混合时间的比直接应用局部化引理得到的上界更精确的上界,自Lovász和Simonovits以来,凸集上所有随机游动的分析都依赖于局部化引理。
英文摘要:
We present a Markov chain (Dikin walk) for sampling from a convex body equipped with a self-concordant barrier, whose mixing time from a "central point" is strongly polynomial in the description of the convex set. The mixing time of this chain is invariant under affine transformations of the convex set, thus eliminating the need for first placing the body in an isotropic position. This recovers and extends previous results of from polytopes to more general convex sets. On every convex set of dimension $n$, there exists a self-concordant barrier whose "complexity" is polynomially bounded. Consequently, a rapidly mixing Markov chain of the kind we describe can be defined on any convex set. We use these results to design an algorithm consisting of a single random walk for optimizing a linear function on a convex set. We show that this random walk reaches an approximately optimal point in polynomial time with high probability and that the corresponding objective values converge with probability 1 to the optimal objective value as the number of steps tends to infinity. One technical contribution is a family of lower bounds for the isoperimetric constants of (weighted) Riemannian manifolds on which, interior point methods perform a kind of steepest descent. Using results of Barthe \cite{barthe} and Bobkov and Houdré, on the isoperimetry of products of (weighted) Riemannian manifolds, we obtain sharper upper bounds on the mixing time of Dikin walk on products of convex sets than the bounds obtained from a direct application of the Localization Lemma, on which, since (Lovász and Simonovits), the analyses of all random walks on convex sets have relied.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。