activity
20122026
most citedThe Landscape of the Planted Clique Problem: Dense subgraphs and the Overlap Gap Property

23 citations · 149 across the 33 of their papers we have counts for

collaborators
Showing 2019Show all

6 papers · 1 filter

math.ST2019

All-or-Nothing Phenomena: From Single-Letter to High Dimensions

Galen Reeves, Jiaming Xu, Ilias Zadik

We consider the linear regression problem of estimating a -dimensional vector from observations , where for a real-val…

stat.ML2019★ 8 cited

Stationary Points of Shallow Neural Networks with Quadratic Activation Function

David Gamarnik, Eren C. Kızıldağ, Ilias Zadik

We consider the teacher-student setting of learning shallow neural networks with quadratic activations and planted weight matrix , where is the wi…

math.ST2019★ 5 cited

Inference in High-Dimensional Linear Regression via Lattice Basis Reduction and Integer Relation Detection

David Gamarnik, Eren C. Kızıldağ, Ilias Zadik

We focus on the high-dimensional linear regression problem, where the algorithmic goal is to efficiently infer an unknown feature vector from its linear measur…

math.ST2019★ 23 cited

The Landscape of the Planted Clique Problem: Dense subgraphs and the Overlap Gap Property

David Gamarnik, Ilias Zadik

In this paper we study the computational-statistical gap of the planted clique problem, where a clique of size is planted in an Erdos Renyi graph resulting i…

math.ST2019

The All-or-Nothing Phenomenon in Sparse Linear Regression

Galen Reeves, Jiaming Xu, Ilias Zadik

We study the problem of recovering a hidden binary -sparse -dimensional vector from noisy linear observations where are i.i.d. an…

cs.IT2019

A simple bound on the BER of the MAP decoder for massive MIMO systems

Christos Thrampoulidis, Ilias Zadik, Yury Polyanskiy

The deployment of massive MIMO systems has revived much of the interest in the study of the large-system performance of multiuser detection systems. In this paper, we prove a non-t…