How we are leading a 3-XORSAT challenge: from the energy landscape to the algorithm and its efficient implementation on GPUs

02/18/2021
by   M. Bernaschi, et al.
0

A recent 3-XORSAT challenge required to minimize a very complex and rough energy function, typical of glassy models with a random first order transition and a golf course like energy landscape. We present the ideas beyond the quasi-greedy algorithm and its very efficient implementation on GPUs that are allowing us to rank first in such a competition. We suggest a better protocol to compare algorithmic performances and we also provide analytical predictions about the exponential growth of the times to find the solution in terms of free-energy barriers.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/30/2020

A simple geometric method for navigating the energy landscape of centroidal Voronoi tessellations

Finding optimal centroidal Voronoi tessellations (CVTs) of a 2D domain p...
research
03/15/2018

Sonifying stochastic walks on biomolecular energy landscapes

Translating the complex, multi-dimensional data from simulations of biom...
research
04/03/2022

Stability of the Minimum Energy Path

The minimum energy path (MEP) is the most probable transition path that ...
research
06/21/2017

The energy landscape of a simple neural network

We explore the energy landscape of a simple neural network. In particula...
research
10/11/2018

The algorithmic hardness threshold for continuous random energy models

We prove an algorithmic hardness result for finding low-energy states in...
research
06/30/2022

GOSPF: An energy efficient implementation of the OSPF routing protocol

Energy saving is currently one of the most challenging issues for the In...
research
03/17/2020

The exponential decay of eigenfunctions for tight binding Hamiltonians via landscape and dual landscape functions

We consider the discrete Schrödinger operator H=-Δ+V on a cube M⊂Z^d, wi...

Please sign up or login with your details

Forgot password? Click here to reset