Publications

Phase Transitions for Detecting Latent Geometry in Random Graphs
Average-Case Lower Bounds for Learning Sparse Mixtures, Robust Estimation and Semirandom Adversaries
The Average-Case Complexity of Counting Cliques in Erdős-Rényi Hypergraphs
Optimal Average-Case Reductions to Sparse PCA: From Weak Assumptions to Strong Hardness
Universality of Computational Lower Bounds for Submatrix Detection
Stein's Method for Stationary Distributions of Markov Chains and Application to Ising Models
Learning Restricted Boltzmann Machines via Influence Maximization
Learning Tree-structured Ising Models in Order to Make Predictions
Sample Efficient Active Learning of Causal Trees
Information Storage in the Stochastic Ising Model at Zero Temperature
Optimal Single Sample Tests for Structured versus Unstructured Network Data
Reducibility and Computational Lower Bounds for Problems with Planted Sparse Structure
Sparse PCA from Sparse Linear Regression
Information-Theoretically Optimal Sequential Recommendations
Regret Bounds and Regimes of Optimality for Item-item and User-user Collaborative Filtering
Learning graphical models from the Glauber dynamics
Collaborative Filtering with Low Regret
Efficiently learning Ising models on arbitrary graphs
Structure learning of antiferromagnetic Ising models
Hardness of parameter estimation in graphical models
A Latent Source Model for Online Collaborative Filtering
Feasibility of Interference Alignment for the MIMO Interference Channel
Optimal assembly for high throughput shotgun sequencing
Reconstruction of Markov Random Fields from Samples: Some Observations and Algorithms
Information Theory of DNA Shotgun Sequencing
The approximate capacity of the many-to-one and one-to-many Gaussian interference channels
3-user interference channel: Degrees of freedom as a function of channel diversity
Mixing time of exponential random graphs
The two-user Gaussian interference channel: a deterministic view
Note on mutual information and orthogonal space-time codes