SOTAVerified

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

2023-02-14Code Available1· sign in to hype

Hod Wirzberger, Assaf Kalinski, Idan Meirzada, Harel Primack, Yaniv Romano, Chene Tradonsky, Ruti Ben Shlomi

arXivPDF

Code Available — Be the first to reproduce this paper.

Reproduce

Code

Abstract

Maximum 2-satisfiability (MAX-2-SAT) is a type of combinatorial decision problem that is known to be NP-hard. In this paper, we compare LightSolver's quantum-inspired algorithm to a leading deep-learning solver for the MAX-2-SAT problem. Experiments on benchmark data sets show that LightSolver achieves significantly smaller time-to-optimal-solution compared to a state-of-the-art deep-learning algorithm, where the gain in performance tends to increase with the problem size.

Tasks

Deep Learning

Reproductions