activity
20032026
most citedA framework to characterize performance of LASSO algorithms

99 citations · 428 across the 78 of their papers we have counts for

collaborators
Showing cs.ITShow all

25 papers · 1 filter

cs.IT2023

Exact Error in Matrix Completion: Approximately Low-Rank Structures and Missing Blocks

Agostino Capponi, Mihailo Stojnic

We study the completion of approximately low rank matrices with entries missing not at random (MNAR). In the context of typical large-dimensional statistical settings, we establish…

cs.IT2020

Sparse linear regression -- CLuP achieves the ideal \emph{exact} ML

Mihailo Stojnic

In this paper we revisit one of the classical statistical problems, the so-called sparse maximum-likelihood (ML) linear regression. As a way of attacking this type of regression, w…

cs.IT2020

Rephased CLuP

Mihailo Stojnic

In \cite{Stojnicclupint19,Stojnicclupcmpl19,Stojnicclupplt19} we introduced CLuP, a \bl{\textbf{Random Duality Theory (RDT)}} based algorithmic mechanism that can be used for solvi…

cs.IT2020★ 2 cited

Algorithmic random duality theory -- large scale CLuP

Mihailo Stojnic

Based on our \bl{\textbf{Random Duality Theory (RDT)}}, in a sequence of our recent papers \cite{Stojnicclupint19,Stojnicclupcmpl19,Stojnicclupplt19}, we introduced a powerful algo…

cs.IT2019★ 4 cited

Complexity analysis of the Controlled Loosening-up (CLuP) algorithm

Mihailo Stojnic

In our companion paper \cite{Stojnicclupint19} we introduced a powerful mechanism that we referred to as the Controlled Loosening-up (CLuP) for handling MIMO ML-detection problems.…

cs.IT2019

Starting CLuP with polytope relaxation

Mihailo Stojnic

The Controlled Loosening-up (CLuP) mechanism that we recently introduced in \cite{Stojnicclupint19} is a generic concept that can be utilized to solve a large class of problems in…