A real number is recursively approximable if there is a computable sequence of rational numbers converging to it. If some extra condition to the convergence is added, then the limi...
The convergence of a class of combined spectral-finite difference methods using Hermite basis, applied to the Fokker-Planck equation, is studied. It is shown that the Hermite based...
Abstract. We present a new technique for analyzing the rate of convergence of local dynamics in bargaining networks. The technique reduces balancing in a bargaining network to opti...
Online learning algorithms have impressive convergence properties when it comes to risk minimization and convex games on very large problems. However, they are inherently sequenti...
Daniel Hsu, Nikos Karampatziakis, John Langford, A...
We demonstrate that the Linear Multidimensional Assignment Problem with iid random costs is polynomially "-approximable almost surely (a. s.) via a simple greedy heuristic, f...