Pith. sign in

REVIEW

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

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2102.09510 v2 pith:2PBFDBPZ submitted 2021-02-18 cond-mat.dis-nn cond-mat.stat-mechcs.DCcs.DSphysics.comp-ph

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

M. Bernaschi , M. Bisson , M. Fatica , E. Marinari , V. Martin-Mayor , G. Parisi , F. Ricci-Tersenghi This is my paper
classification cond-mat.dis-nn cond-mat.stat-mechcs.DCcs.DSphysics.comp-ph
keywords energyalgorithmchallengeefficientfirstgpusimplementationlandscape
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.