
Strong recovery of geometric planted matchings
We study the problem of efficiently recovering the matching between an u...
read it

AverageCase Integrality Gap for NonNegative Principal Component Analysis
Montanari and Richard (2015) asked whether a natural semidefinite progra...
read it

Hypothesis testing with lowdegree polynomials in the Morris class of exponential families
Analysis of lowdegree polynomial algorithms is a powerful, newlypopula...
read it

Positivitypreserving extensions of sumofsquares pseudomoments over the hypercube
We introduce a new method for building higherdegree sumofsquares lowe...
read it

Spectral Planting and the Hardness of Refuting Cuts, Colorability, and Communities in Random Graphs
We study the problem of efficiently refuting the kcolorability of a gra...
read it

Linear Programming and Community Detection
The problem of community detection with two equalsized communities is c...
read it

The AverageCase Time Complexity of Certifying the Restricted Isometry Property
In compressed sensing, the restricted isometry property (RIP) on M × N s...
read it

A Tight Degree 4 SumofSquares Lower Bound for the SherringtonKirkpatrick Hamiltonian
We show that, if W∈R^N × N_sym is drawn from the gaussian orthogonal ens...
read it

Notes on Computational Hardness of Hypothesis Testing: Predictions using the LowDegree Likelihood Ratio
These notes survey and explore an emerging method, which we call the low...
read it

SubexponentialTime Algorithms for Sparse PCA
We study the computational cost of recovering a unitnorm sparse princip...
read it

Computational Hardness of Certifying Bounds on Constrained PCA Problems
Given a random n × n symmetric matrix W drawn from the Gaussian orthogo...
read it
Dmitriy Kunisky
is this you? claim profile