arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1003.4942cs.DScs.CG
收藏

基于半空间插值和多尺度Monge分解的近似动态规划

Approximate Dynamic Programming using Halfspace Queries and Multiscale Monge decomposition

Gary L. Miller, Richard Peng, Russell Schwartz, Charalampos E. Tsourakakis

摘要:

令$P=(P_1, P_2, \ldots, P_n)$、所有$i$的$P_i \in \field{R}$为信号,并令$C$为常数。在这项工作中,我们的目标是找到一个函数$F:[n]\rightarrow \field{R}$,优化以下目标函数:$$ \min_{F} \sum_{i=1}^n (P_i-F_i)^2 + C\times |\{i:F_i \neq F_{i+1} \} | $$上述优化问题减少到解决以下递归,这可以有效地完成使用动态规划在$O(n^2)$时间:$$ OPT_i = \min_{0 \leq j \leq i-1} [ OPT_j + \sum_{k=j+1}^i (P_k - (\sum_{m=j+1}^i P_m)/(i-j) )^2 ]+ C $$在我们希望用另一个信号$F$来近似原始信号$P$的应用中自然出现上述递归,该另一个信号理想地由几个分段常数组成片段这样的应用包括数据库(例如,直方图构造),语音识别,生物学(例如,去噪aCGH数据)应用和更多。在这项工作中,我们提出了两个新的技术,优化动态规划,可以处理成本函数不处理其他标准方法。我们的第一个算法的基础是一个恒定的目标函数,可以有效地近似使用最先进的方法进行范围搜索的变化的定义。我们的技术近似的最佳值,我们的目标函数内添加$ε$误差和运行在$\tilde{O}(n^{1.5} \log{(\frac{U}ε))}$时间,其中$U = \max_i f_i$。我们提供的第二个算法在$ε$的因子内解决了类似的递归,并在$O(n \log^2n / ε)$中运行。我们的算法引入的新技术是分解成一个小的(对数)数量的蒙赫优化子问题,我们可以加快使用现有的技术的初始问题。

英文摘要:

Let $P=(P_1, P_2, \ldots, P_n)$, $P_i \in \field{R}$ for all $i$, be a signal and let $C$ be a constant. In this work our goal is to find a function $F:[n]\rightarrow \field{R}$ which optimizes the following objective function: $$ \min_{F} \sum_{i=1}^n (P_i-F_i)^2 + C\times |\{i:F_i \neq F_{i+1} \} | $$ The above optimization problem reduces to solving the following recurrence, which can be done efficiently using dynamic programming in $O(n^2)$ time: $$ OPT_i = \min_{0 \leq j \leq i-1} [ OPT_j + \sum_{k=j+1}^i (P_k - (\sum_{m=j+1}^i P_m)/(i-j) )^2 ]+ C $$ The above recurrence arises naturally in applications where we wish to approximate the original signal $P$ with another signal $F$ which consists ideally of few piecewise constant segments. Such applications include database (e.g., histogram construction), speech recognition, biology (e.g., denoising aCGH data) applications and many more. In this work we present two new techniques for optimizing dynamic programming that can handle cost functions not treated by other standard methods. The basis of our first algorithm is the definition of a constant-shifted variant of the objective function that can be efficiently approximated using state of the art methods for range searching. Our technique approximates the optimal value of our objective function within additive $ε$ error and runs in $\tilde{O}(n^{1.5} \log{(\frac{U}ε))}$ time, where $U = \max_i f_i$. The second algorithm we provide solves a similar recurrence within a factor of $ε$ and runs in $O(n \log^2n / ε)$. The new technique introduced by our algorithm is the decomposition of the initial problem into a small (logarithmic) number of Monge optimization subproblems which we can speed up using existing techniques.

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

↑