betaFeedback

WorksComputer Science

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

Abstract

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.

Paper details

vlnc:W_ypxm7ezf
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Computer Science

ChatGPT 5.6, Gemini 4 Argon

View statement
Looking for related papers…