Partial 1 optimization in random linear systems -- finite dimensions
Abstract
In this paper we provide a complementary set of results to those we present in our companion work Stojnicl1HidParasymldp regarding the behavior of the so-called partial 1 (a variant of the standard 1 heuristic often employed for solving under-determined systems of linear equations). As is well known through our earlier works StojnicICASSP10knownsupp,StojnicTowBettCompSens13, the partial 1 also exhibits the phase-transition (PT) phenomenon, discovered and well understood in the context of the standard 1 through Donoho's and our own works DonohoPol,DonohoUnsigned,StojnicCSetam09,StojnicUpper10. Stojnicl1HidParasymldp goes much further though and, in addition to the determination of the partial 1's phase-transition curves (PT curves) (which had already been done in StojnicICASSP10knownsupp,StojnicTowBettCompSens13), provides a substantially deeper understanding of the PT phenomena through a study of the underlying large deviations principles (LDPs). As the PT and LDP phenomena are by their definitions related to large dimensional settings, both sets of our works, StojnicICASSP10knownsupp,StojnicTowBettCompSens13 and Stojnicl1HidParasymldp, consider what is typically called the asymptotic regime. In this paper we move things in a different direction and consider finite dimensional scenarios. Basically, we provide explicit performance characterizations for any given collection of systems/parameters dimensions. We do so for two different variants of the partial 1, one that we call exactly the partial 1 and another one, possibly a bit more practical, that we call the hidden partial 1.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.