Skip to main content
Search

# Fully Lifted Random Duality Theory

1 related articles

Subscribe to updates
  1. Stojnic uses parametric fl-RDT on the symmetric binary perceptron to obtain a satisfiability threshold of 1.8159 and an algorithmic threshold near 1.6021, pointing to a computational gap of about 0.21

    Stojnic studies the statistical-computational gap (SCG) of the symmetric binary perceptron (SBP) via a parametric use of fully lifted random duality theory (fl-RDT): at κ=1 the second lifting level gives αc≈1.8159 matching the theoretical satisfiability threshold, the seventh level gives αa≈1.6021 with predicted convergence to about 1.59–1.60, close to the local-entropy replica prediction αLE≈1.58 for clustering defragmentation; in the α→0 regime the third lifting level gives κ≈1.2385√(α/−log α), qualitatively matching OGP predictions and identically matching local-entropy predictions; the author also designs a CLuP-SBP algorithm whose practical performance approaches the theoretical predictions.

You’re all caught up