Adarsh Barik


Lawson 2149 #28
Department of Computer Science
Purdue University
Email: abarik(at)purdue(dot)edu

About Me

I am a PhD student in Department of Computer Science at Purdue University. I am advised by Prof. Jean Honorio. Before coming to Purdue, I completed my B.Tech and M.Tech (Dual Degree) from Indian Institute of Technology, Madras.

Research Interests

I am interested in theoretical and computational aspect of Optimization, Machine Learning, Information Theory and High Dimensional Data Analytics.

Recently, I have been working in developing provable efficient techniques to recover graph structures from data. I work with both directed and undirected graphical models in high dimensional settings (in terms of number of nodes). My focus is to provide sufficient and necessary theoretical bounds on sample complexity and computational complexity for structure learning in graphs.


  1. Information Theoretic Limits for Standard and One-Bit Compressed Sensing with Graph-Structured Sparsity
    Adarsh Barik, Jean Honorio
    Under submission
  2. Learning Discrete Bayesian Networks in Polynomial Time and Sample Complexity
    Adarsh Barik, Jean Honorio
    Under submission
  3. Learning Bayesian Networks with Low Rank Conditional Probability Tables
    Adarsh Barik, Jean Honorio
    Accepted, NeurIPS 2019
  4. Information Theoretic Limits for Linear Prediction with Graph-Structured Sparsity
    Adarsh Barik, Jean Honorio, Mohit Tawarmalani
    Accepted, ISIT 2017