Evidence of an exponential speed-up in the solution of hard optimization problems

10/23/2017
by   Fabio L. Traversa, et al.
0

Optimization problems pervade essentially every scientific discipline and industry. Many such problems require finding a solution that maximizes the number of constraints satisfied. Often, these problems are particularly difficult to solve because they belong to the NP-hard class, namely algorithms that always find a solution in polynomial time are not known. Over the past decades, research has focused on developing heuristic approaches that attempt to find an approximation to the solution. However, despite numerous research efforts, in many cases even approximations to the optimal solution are hard to find, as the computational time for further refining a candidate solution grows exponentially with input size. Here, we show a non-combinatorial approach to hard optimization problems that achieves an exponential speed-up and finds better approximations than the current state-of-the-art. First, we map the optimization problem into a boolean circuit made of specially designed, self-organizing logic gates, which can be built with (non-quantum) electronic components; the equilibrium points of the circuit represent the approximation to the problem at hand. Then, we solve its associated non-linear ordinary differential equations numerically, towards the equilibrium points. We demonstrate this exponential gain by comparing a sequential MatLab implementation of our solver with the winners of the 2016 Max-SAT competition on a variety of hard optimization instances. We show empirical evidence that our solver scales linearly with the size of the problem, both in time and memory, and argue that this property derives from the collective behavior of the simulated physical circuit. Our approach can be applied to other types of optimization problems and the results presented here have far-reaching consequences in many fields.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/20/2018

Memcomputing: Leveraging memory and physics to compute efficiently

It is well known that physical phenomena may be of great help in computi...
research
11/12/2020

Efficient Solution of Boolean Satisfiability Problems with Digital MemComputing

Boolean satisfiability is a propositional logic problem of interest in m...
research
03/24/2020

Memcomputing for Accelerated Optimization

In this work, we introduce the concept of an entirely new circuit archit...
research
02/14/2023

Lightsolver challenges a leading deep learning solver for Max-2-SAT problems

Maximum 2-satisfiability (MAX-2-SAT) is a type of combinatorial decision...
research
01/20/2018

A high-performance analog Max-SAT solver and its application to Ramsey numbers

We introduce a continuous-time analog solver for MaxSAT, a quintessentia...
research
08/10/2020

Ising Model Optimization Problems on a FPGA Accelerated Restricted Boltzmann Machine

Optimization problems, particularly NP-Hard Combinatorial Optimization p...
research
08/29/2018

MemComputing Integer Linear Programming

Integer linear programming (ILP) encompasses a very important class of o...

Please sign up or login with your details

Forgot password? Click here to reset