Directed percolation and numerical stability of simulations of digital memcomputing machines

• URL: http://arxiv.org/abs/2102.03547v2
• Date: Wed, 31 Mar 2021 16:41:46 GMT
• Title: Directed percolation and numerical stability of simulations of digital memcomputing machines
• Authors: Yuan-Hang Zhang, Massimiliano Di Ventra
• Abstract summary: Digital memcomputing machines (DMMs) are a novel, non-solving class of machines designed to solve optimization problems. These machines can be physically realized with continuous-time, non-quantum dynamical systems with memory. Solutions of many hard problems have been reported by numerically integrating the ODEs of DMMs.
• Score: 8.761355402590105
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Digital memcomputing machines (DMMs) are a novel, non-Turing class of machines designed to solve combinatorial optimization problems. They can be physically realized with continuous-time, non-quantum dynamical systems with memory (time non-locality), whose ordinary differential equations (ODEs) can be numerically integrated on modern computers. Solutions of many hard problems have been reported by numerically integrating the ODEs of DMMs, showing substantial advantages over state-of-the-art solvers. To investigate the reasons behind the robustness and effectiveness of this method, we employ three explicit integration schemes (forward Euler, trapezoid and Runge-Kutta 4th order) with a constant time step, to solve 3-SAT instances with planted solutions. We show that, (i) even if most of the trajectories in the phase space are destroyed by numerical noise, the solution can still be achieved; (ii) the forward Euler method, although having the largest numerical error, solves the instances in the least amount of function evaluations; and (iii) when increasing the integration time step, the system undergoes a "solvable-unsolvable transition" at a critical threshold, which needs to decay at most as a power law with the problem size, to control the numerical errors. To explain these results, we model the dynamical behavior of DMMs as directed percolation of the state trajectory in the phase space in the presence of noise. This viewpoint clarifies the reasons behind their numerical robustness and provides an analytical understanding of the unsolvable-solvable transition. These results land further support to the usefulness of DMMs in the solution of hard combinatorial optimization problems.

Related papers

• On Robust Numerical Solver for ODE via Self-Attention Mechanism [82.95493796476767]
  We explore training efficient and robust AI-enhanced numerical solvers with a small data size by mitigating intrinsic noise disturbances. We first analyze the ability of the self-attention mechanism to regulate noise in supervised learning and then propose a simple-yet-effective numerical solver, Attr, which introduces an additive self-attention mechanism to the numerical solution of differential equations.
  arXiv  Detail & Related papers  (2023-02-05T01:39:21Z)
• Self-averaging of digital memcomputing machines [4.429709236737154]
  Digital memcomputing machines (DMMs) are a new class of computing machines that employ non-quantum dynamical systems with memory to solve optimization problems. We show that the time to solution (TTS) of DMMs follows an inverse Gaussian distribution, with the TTS self-averaging with increasing problem size. We provide both an analytical understanding of this phenomenon and numerical evidence by solving instances of the 3-SAT (satisfiability) problem.
  arXiv  Detail & Related papers  (2023-01-20T20:09:05Z)
• Algorithms for perturbative analysis and simulation of quantum dynamics [0.0]
  We develop general purpose algorithms for computing and utilizing both the Dyson series and Magnus expansion. We demonstrate how to use these tools to approximate fidelity in a region of model parameter space. We show how the pre-computation step can be phrased as a multivariable expansion problem with fewer terms than in the original method.
  arXiv  Detail & Related papers  (2022-10-20T21:07:47Z)
• Tunable Complexity Benchmarks for Evaluating Physics-Informed Neural Networks on Coupled Ordinary Differential Equations [64.78260098263489]
  In this work, we assess the ability of physics-informed neural networks (PINNs) to solve increasingly-complex coupled ordinary differential equations (ODEs) We show that PINNs eventually fail to produce correct solutions to these benchmarks as their complexity increases. We identify several reasons why this may be the case, including insufficient network capacity, poor conditioning of the ODEs, and high local curvature, as measured by the Laplacian of the PINN loss.
  arXiv  Detail & Related papers  (2022-10-14T15:01:32Z)
• PI-VAE: Physics-Informed Variational Auto-Encoder for stochastic differential equations [2.741266294612776]
  We propose a new class of physics-informed neural networks, called physics-informed Variational Autoencoder (PI-VAE) PI-VAE consists of a variational autoencoder (VAE), which generates samples of system variables and parameters. The satisfactory accuracy and efficiency of the proposed method are numerically demonstrated in comparison with physics-informed generative adversarial network (PI-WGAN)
  arXiv  Detail & Related papers  (2022-03-21T21:51:19Z)
• Adiabatic Quantum Computing for Multi Object Tracking [170.8716555363907]
  Multi-Object Tracking (MOT) is most often approached in the tracking-by-detection paradigm, where object detections are associated through time. As these optimization problems are often NP-hard, they can only be solved exactly for small instances on current hardware. We show that our approach is competitive compared with state-of-the-art optimization-based approaches, even when using of-the-shelf integer programming solvers.
  arXiv  Detail & Related papers  (2022-02-17T18:59:20Z)
• Message Passing Neural PDE Solvers [60.77761603258397]
  We build a neural message passing solver, replacing allally designed components in the graph with backprop-optimized neural function approximators. We show that neural message passing solvers representationally contain some classical methods, such as finite differences, finite volumes, and WENO schemes. We validate our method on various fluid-like flow problems, demonstrating fast, stable, and accurate performance across different domain topologies, equation parameters, discretizations, etc., in 1D and 2D.
  arXiv  Detail & Related papers  (2022-02-07T17:47:46Z)
• Stable Implementation of Probabilistic ODE Solvers [27.70274403550477]
  Probabilistic solvers for ordinary differential equations (ODEs) provide efficient quantification of numerical uncertainty. They suffer from numerical instability when run at high order or with small step-sizes. The present work proposes and examines a solution to this problem. It involves three components: accurate initialisation, a coordinate change preconditioner that makes numerical stability concerns step-size-independent, and square-root implementation.
  arXiv  Detail & Related papers  (2020-12-18T08:35:36Z)
• Fast and differentiable simulation of driven quantum systems [58.720142291102135]
  We introduce a semi-analytic method based on the Dyson expansion that allows us to time-evolve driven quantum systems much faster than standard numerical methods. We show results of the optimization of a two-qubit gate using transmon qubits in the circuit QED architecture.
  arXiv  Detail & Related papers  (2020-12-16T21:43:38Z)
• Efficient Solution of Boolean Satisfiability Problems with Digital MemComputing [0.0]
  We show that a memory-assisted physical system can efficiently solve the SAT problem in continuous time. The efficiency of the simulations is related to the collective dynamical properties of the original physical system. We anticipate our results to broaden research directions in physics-inspired computing paradigms.
  arXiv  Detail & Related papers  (2020-11-12T18:13:46Z)
• Large-scale Neural Solvers for Partial Differential Equations [48.7576911714538]
  Solving partial differential equations (PDE) is an indispensable part of many branches of science as many processes can be modelled in terms of PDEs. Recent numerical solvers require manual discretization of the underlying equation as well as sophisticated, tailored code for distributed computing. We examine the applicability of continuous, mesh-free neural solvers for partial differential equations, physics-informed neural networks (PINNs) We discuss the accuracy of GatedPINN with respect to analytical solutions -- as well as state-of-the-art numerical solvers, such as spectral solvers.
  arXiv  Detail & Related papers  (2020-09-08T13:26:51Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.