Universality in Numerical Computations with Random Data. Case Studies

Abstract

The authors present evidence for universality in numerical computations with random data. Given a (possibly stochastic) numerical algorithm with random input data, the time (or number of iterations) to convergence (within a given tolerance) is a random variable, called the halting time. Two-component universality is observed for the fluctuations of the halting time, i.e., the histogram for the halting times, centered by the sample average and scaled by the sample variance, collapses to a universal curve, independent of the input data distribution, as the dimension increases. Thus, up to two components, the sample average and the sample variance, the statistics for the halting time are universally prescribed. The case studies include six standard numerical algorithms, as well as a model of neural computation and decision making. A link to relevant software is provided in for the reader who would like to do computations of his'r own.

References in corpus (2)

• Numerical solution of Dyson Brownian motion and a sampling scheme for invariant matrix ensembles
• Sampling unitary invariant ensembles

Cited by in corpus (11)

• Some Open Problems in Random Matrix Theory and the Theory of Integrable Systems. II
• Universal halting times in optimization and machine learning
• Gaussian Determinantal Processes: a new model for directionality in data
• Smoothed Analysis for the Conjugate Gradient Algorithm
• Universality for the Toda algorithm to compute the largest eigenvalue of a random matrix
• On the condition number of the critically-scaled Laguerre Unitary Ensemble
• Fifty Years of KdV: An Integrable System
• Universality in numerical computation with random data. Case studies, analytic results and some speculations
• A Probabilistic Analysis of the Neumann Series Iteration
• Universality for eigenvalue algorithms on sample covariance matrices
• Universal statistics of incubation periods and other detection times via diffusion models