模块化更新下线性草图的最优性
Optimality of Linear Sketching under Modular Updates
摘要:
在二进制更新的背景下,我们研究了流算法和线性草图绘制算法之间的关系。我们表明,在$n$尺寸的输入,有效的流算法,可以处理$Ω(n^2)$更新的存在意味着有效的线性草图算法具有可比的成本。这改进了Li,Nguyen和Woodruff [LNW14]以及Ai,Hu,Li和Woodruff [AHLW16]的先前工作,该工作需要三倍指数的更新次数才能实现整数更新的类似结果。我们扩展我们的结果更新模$p$整数$p \ge 2$,近似而不是精确的计算。
英文摘要:
We study the relation between streaming algorithms and linear sketching algorithms, in the context of binary updates. We show that for inputs in $n$ dimensions, the existence of efficient streaming algorithms which can process $Ω(n^2)$ updates implies efficient linear sketching algorithms with comparable cost. This improves upon the previous work of Li, Nguyen and Woodruff [LNW14] and Ai, Hu, Li and Woodruff [AHLW16] which required a triple-exponential number of updates to achieve a similar result for updates over integers. We extend our results to updates modulo $p$ for integers $p \ge 2$, and to approximation instead of exact computation.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。