Pith. sign in

REVIEW 2 cited by

Controlled Loosening-up (CLuP) -- achieving exact MIMO ML in polynomial time

Not yet reviewed by Pith; the record is open.

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 1909.01175 v1 pith:HS5KQUBU submitted 2019-09-03 cs.IT math.ITmath.STstat.TH

classification cs.ITmath.ITmath.STstat.TH
keywords mimoresultstheoryachievingclupcollectionconceptcontrolled
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In this paper we attack one of the most fundamental signal processing/informaton theory problems, widely known as the MIMO ML-detection. We introduce a powerful Random Duality Theory (RDT) mechanism that we refer to as the Controlled Loosening-up (CLuP) as a way of achieving the exact ML-performance in MIMO systems in polynomial time. We first outline the general strategy and then discuss the rationale behind the entire concept. A solid collection of results obtained through numerical experiments is presented as well and found to be in an excellent agreement with what the theory predicts. As this is the introductory paper of a massively general concept that we have developed, we mainly focus on keeping things as simple as possible and put the emphasis on the most fundamental ideas. In our several companion papers we present various other complementary results that relate to both, theoretical and practical aspects and their connections to a large collection of other problems and results that we have achieved over the years in Random Duality.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. CLuP practically achieves $\sim 1.77$ positive and $\sim 0.33$ negative Hopfield model ground state free energy

    cond-mat.dis-nn 2025-07 conditional novelty 6.0 of 10

    CLuP±Hop approximates Hopfield ground state free energies to within about 0.3% using simple gradient descent, backed by the author's fully lifted random duality theory.

  2. A CLuP algorithm to practically achieve $\sim 0.76$ SK--model ground state free energy

    cond-mat.dis-nn 2025-07 conditional novelty 5.0 of 10

    The authors propose a CLuP-SK barrier-descent algorithm and report it achieves approximately 0.76 of the SK ground state free energy for n around 2000 to 8000, approaching the theoretical Parisi limit of about 0.763.

Pith tools