2016.1: Average-case complexity without the black swans
2016.1: Dennis Amelunxen and Martin Lotz (2016) Average-case complexity without the black swans.
Full text available as:
|PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader|
We introduce the concept of weak average-case analysis as an attempt to achieve theoretical complexity results that are closer to practical experience than those resulting from traditional approaches. This concept is accepted in other areas such as non-asymptotic random matrix theory and compressive sensing, and has a particularly convincing interpretation in the most common situation encountered for condition numbers, where it amounts to replacing a null set of ill-posed inputs by a ``numerical null set''. We illustrate the usefulness of these notions by considering three settings: (1) condition numbers that are inversely proportional to a distance of a homogeneous algebraic set of ill-posed inputs; (2) the running time of power iteration for computing a leading eigenvector of a Hermitian matrix; (3) Renegar's condition number for conic optimisation.
|Item Type:||MIMS Preprint|
|Uncontrolled Keywords:||Random matrix theory, computational complexity, average-case analysis, condition numbers, numerical complexity|
|Subjects:||MSC 2000 > 60 Probability theory and stochastic processes|
MSC 2000 > 65 Numerical analysis
MSC 2000 > 68 Computer science
|Deposited By:||Dr. Martin Lotz|
|Deposited On:||01 January 2016|