arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2111.02101math.OCeess.SP
收藏

时变最优化问题的流解法

Streaming Solutions for Time-Varying Optimization Problems

Tomer Hamam, Justin Romberg

摘要:

本文研究具有$ \sum_{t=1}^Tf(\mathbf{x}_{t-1},\mathbf{x}_t)$形式目标的流最优化问题。特别地,我们感兴趣的是变量的第$t$帧的解$\hat{\mathbf{x} }_{t|T}$如何随着$T$的增加而改变。虽然增加$T$和添加一个新的功能和一组新的变量一般会改变解决方案无处不在,我们给出的条件下,$\hat{\mathbf{x} }_{t|T}$收敛到极限点$\mathbf{x}^*_t$的线性速率为$T\rightarrow\infty$。因此,我们能够推导出理论上的保证,算法的内存有限,显示限制的解决方案更新,只有少数帧在过去的牺牲几乎没有任何准确性。我们还提出了一个新的有效的牛顿在线算法(NOA),这些结果的启发,更新的解决方案与固定的复杂性$ \mathcal{O}( {3Bn^3})$,独立的$T$,其中$B$对应于在过去的变量更新多远,和$n$是一个单一的块向量的大小。两个流优化的例子,在线重建从非均匀样本和非齐次泊松强度估计,支持的理论结果,并显示该算法可以在实践中使用。

英文摘要:

This paper studies streaming optimization problems that have objectives of the form $ \sum_{t=1}^Tf(\mathbf{x}_{t-1},\mathbf{x}_t)$. In particular, we are interested in how the solution $\hat{\mathbf{x} }_{t|T}$ for the $t$th frame of variables changes as $T$ increases. While incrementing $T$ and adding a new functional and a new set of variables does in general change the solution everywhere, we give conditions under which $\hat{\mathbf{x} }_{t|T}$ converges to a limit point $\mathbf{x}^*_t$ at a linear rate as $T\rightarrow\infty$. As a consequence, we are able to derive theoretical guarantees for algorithms with limited memory, showing that limiting the solution updates to only a small number of frames in the past sacrifices almost nothing in accuracy. We also present a new efficient Newton online algorithm (NOA), inspired by these results, that updates the solution with fixed complexity of $ \mathcal{O}( {3Bn^3})$, independent of $T$, where $B$ corresponds to how far in the past the variables are updated, and $n$ is the size of a single block-vector. Two streaming optimization examples, online reconstruction from non-uniform samples and non-homogeneous Poisson intensity estimation, support the theoretical results and show how the algorithm can be used in practice.

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

↑