
Analysis of TreeAlgorithms with MultiPacket Reception
In this paper, we analyze binarytree algorithms in a setup in which the...
read it

Online Debiasing for Adaptively Collected Highdimensional Data
Adaptive collection of data is increasingly commonplace in many applicat...
read it

Contextual Stochastic Block Models
We provide the first information theoretic tight analysis for inference ...
read it

The threshold for SDPrefutation of random regular NAE3SAT
Unlike its cousin 3SAT, the NAE3SAT (notallequal3SAT) problem has th...
read it

Accurate Inference for Adaptive Linear Models
Estimators computed from adaptively collected data do not behave like th...
read it

Inference in Graphical Models via Semidefinite Programming Hierarchies
Maximum A posteriori Probability (MAP) inference in graphical models amo...
read it

Improved SumofSquares Lower Bounds for Hidden Clique and Hidden Submatrix Problems
Given a large data matrix A∈R^n× n, we consider the problem of determini...
read it

Sparse PCA via Covariance Thresholding
In sparse principal component analysis we are given noisy observations o...
read it

Linear Bandits in High Dimension and Recommendation Systems
A large number of online services provide automated recommendations to h...
read it
Yash Deshpande
verfied profile