跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.18545 · v1

From smoothed analysis to backward error: The power of adaptive perturbations

首次提交 2026-11-14 02:50
版本更新 2026-11-14 02:50
雷达观测 2026-11-16 13:44
arXiv ↗PDF ↗

摘要

Smoothed analysis has become a central tool in theoretical computer science, often allowing for significant improvements to worst-case running times if we settle for a solution to a small random perturbation of the problem instance. This is closely related to the classical concept of backward error in numerical analysis, which allows an algorithm to return a solution to an arbitrary perturbation of the problem. Despite the qualitative similarity of these concepts, we show that they can exhibit large quantitative differences. Notably, we prove that, while a linear system with any n×nn \times n matrix AA can be solved to backward error εε using O(log⁡(n)/ε)O(\log(n) / ε) matrix-vector products with AA, any algorithm that solves a random εε-sized perturbation of AA requires Ω(n)Ω(n) matrix-vector products. This means that a useful perturbation for solving a linear system in backward error must be adaptive to the input. Interestingly, however, randomness is still essential: we show that any deterministic method that attains small backward error for all linear systems provably requires Ω(n)Ω(n) matrix-vector products, resulting in the first separation between randomized and deterministic algorithms in a natural computational model for solving linear systems. Finally, we show that matrix structure can significantly affect backward error complexity. For example, we show a deterministic O(1/ε)O(1/ε) matrix-vector product algorithm for symmetric linear systems.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-14 02:50 · 最新观测版本

From smoothed analysis to backward error: The power of adaptive perturbations

Smoothed analysis has become a central tool in theoretical computer science, often allowing for significant improvements to worst-case running times if we settle for a solution to a small random perturbation of the problem instance. This is closely related to the classical concept of backward error in numerical analysis, which allows an algorithm to return a solution to an arbitrary perturbation of the problem. Despite the qualitative similarity of these concepts, we show that they can exhibit large quantitative differences. Notably, we prove that, while a linear system with any n×nn \times n matrix AA can be solved to backward error εε using O(log⁡(n)/ε)O(\log(n) / ε) matrix-vector products with AA, any algorithm that solves a random εε-sized perturbation of AA requires Ω(n)Ω(n) matrix-vector products. This means that a useful perturbation for solving a linear system in backward error must be adaptive to the input. Interestingly, however, randomness is still essential: we show that any deterministic method that attains small backward error for all linear systems provably requires Ω(n)Ω(n) matrix-vector products, resulting in the first separation between randomized and deterministic algorithms in a natural computational model for solving linear systems. Finally, we show that matrix structure can significantly affect backward error complexity. For example, we show a deterministic O(1/ε)O(1/ε) matrix-vector product algorithm for symmetric linear systems.

查看此版本解读 →查看此版本原文 ↗