Critical branching processes in digital memcomputing machines

Memcomputing is a novel computing paradigm that employs time non-locality (memory) to solve combinatorial optimization problems. It can be realized in practice by means of non-linear dynamical systems whose point attractors represent the solutions of the original problem. It has been previously shown that during the solution search memcomputing machines go through a transient phase of avalanches (instantons) that promote dynamical long-range order. By employing mean-field arguments we predict that the distribution of the avalanche sizes follows a Borel distribution typical of critical branching processes with exponent $\tau= 3/2$. We corroborate this analysis by solving various random 3-SAT instances of the Boolean satisfiability problem. The numerical results indicate a power-law distribution with exponent $\tau = 1.51 \pm 0.02$, in very good agreement with the mean-field analysis. This indicates that memcomputing machines self-tune to a critical state in which avalanches are characterized by a branching process, and that this state persists across the majority of their evolution.

[1]  J. Tanner,et al.  A derivation of the Borel distribution , 1961 .

[2]  G. Pruessner.  Self-Organised Criticality: Theory, Models and Characterisation , 2012 .

[3]  M. A. Muñoz,et al.  Simple unified view of branching process statistics: Random walks in balanced logarithmic potentials. , 2016, Physical review. E.

[4]  Fabio L. Traversa,et al.  Topological Field Theory and Computing with Instantons , 2016, ArXiv.

[5]  Isaac L. Chuang,et al.  Quantum Computation and Quantum Information (10th Anniversary edition) , 2011 .

[6]  Fabio L. Traversa,et al.  Evidence of an exponential speed-up in the solution of hard optimization problems , 2017, Complex..

[7]  Fabio L. Traversa,et al.  Instantons in self-organizing logic gates , 2017, ArXiv.

[8]  Robert A. Nawrocki,et al.  A Mini Review of Neuromorphic Architectures and Implementations , 2016, IEEE Transactions on Electron Devices.

[9]  Massimiliano Di Ventra,et al.  Polynomial-time solution of prime factorization and NP-hard problems with digital memcomputing machines , 2015, Chaos.

[10]  E. Lu,et al.  Avalanches and the Distribution of Solar Flares , 1991 .

[11]  Fabio L. Traversa,et al.  Taming a nonconvex landscape with dynamical long-range order: Memcomputing Ising benchmarks. , 2018, Physical review. E.

[12]  Ericka Stricklin-Parker,et al.  Ann , 2005 .

[13]  Fabio L. Traversa,et al.  Accelerating Deep Learning with Memcomputing , 2018, Neural Networks.

[14]  Raoul-Martin Memmesheimer,et al.  Growing Critical: Self-Organized Criticality in a Developing Neural System. , 2018, Physical review letters.

[15]  Zohar Manna,et al.  The calculus of computation - decision procedures with applications to verification , 2007 .

[16]  Fabio L. Traversa,et al.  Memcomputing: Leveraging memory and physics to compute efficiently , 2018, ArXiv.

[17]  D. Freedman,et al.  On the histogram as a density estimator:L2 theory , 1981 .

[18]  L. Schmetterer.  Zeitschrift fur Wahrscheinlichkeitstheorie und Verwandte Gebiete. , 1963 .

[19]  Fabio L. Traversa,et al.  MemComputing Integer Linear Programming , 2018, ArXiv.

[20]  P. Bak,et al.  Earthquakes as a self‐organized critical phenomenon , 1989 .

[21]  Sanjeev Arora,et al.  Computational Complexity: A Modern Approach , 2009 .

[22]  Massimiliano Di Ventra,et al.  The parallel approach , 2013 .