超越局部搜索的路径:随机不动点计算的一个近似紧界
Paths Beyond Local Search: A Nearly Tight Bound for Randomized Fixed-Point Computation
摘要:
1983年,Aldous证明了随机化可以加速局部搜索。例如,它将在[1:n]^d上的局部搜索的查询复杂度从Theta(n^{d-1})降低到O(d^{1/2}n^{d/2})。随机化是否有助于定点计算仍然是个未知数。受这个开放问题和最近的进展平衡计算的启发,我们一直着迷于以下问题:是一个固定点或平衡从根本上比局部最优更难找到?本文给出了[1:n]^d上离散Brouwer函数不动点的随机查询复杂度Ω(n)^{d-1}的一个近似紧界.由于[1:n]^d上全局优化的随机化查询复杂度是Theta(n^{d}),因此[1:n]^d上的随机化查询模型严格区分了这三个重要的搜索问题:全局优化比定点计算更难,定点计算比局部搜索更难。我们的结果确实证明了随机化对查询模型中的定点计算没有多大帮助;这个问题的确定性复杂度是Theta(n^{d-1})。
英文摘要:
In 1983, Aldous proved that randomization can speedup local search. For example, it reduces the query complexity of local search over [1:n]^d from Theta (n^{d-1}) to O (d^{1/2}n^{d/2}). It remains open whether randomization helps fixed-point computation. Inspired by this open problem and recent advances on equilibrium computation, we have been fascinated by the following question: Is a fixed-point or an equilibrium fundamentally harder to find than a local optimum? In this paper, we give a nearly-tight bound of Omega(n)^{d-1} on the randomized query complexity for computing a fixed point of a discrete Brouwer function over [1:n]^d. Since the randomized query complexity of global optimization over [1:n]^d is Theta (n^{d}), the randomized query model over [1:n]^d strictly separates these three important search problems: Global optimization is harder than fixed-point computation, and fixed-point computation is harder than local search. Our result indeed demonstrates that randomization does not help much in fixed-point computation in the query model; the deterministic complexity of this problem is Theta (n^{d-1}).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。