A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Universal Scalable Robust Solvers from Computational Information Games and fast eigenspace adapted Multiresolution Analysis
[article]
2017
arXiv
pre-print
We show how the discovery of robust scalable numerical solvers for arbitrary bounded linear operators can be automated as a Game Theory problem by reformulating the process of computing with partial information and limited resources as that of playing underlying hierarchies of adversarial information games. When the solution space is a Banach space B endowed with a quadratic norm ·, the optimal measure (mixed strategy) for such games (e.g. the adversarial recovery of u∈ B, given partial
arXiv:1703.10761v2
fatcat:2qkxmnmwdrg35jcpaybamfg7eq