Overlap gap properties and parametric RDT appear to be two sides of the same coin for characterizing computational hardness—the paper provides strong numerical evidence that they converge to the same algorithmic threshold, offering a unified geometric-algorithmic perspective on statistical-comp...
This paper connects two mathematical frameworks for understanding hard computational problems in machine learning: overlap gap properties (OGPs) and recursive decomposition trees (RDT).