Information theoretic limits for linear prediction with graph-structured sparsity. - Adarsh Barik; Jean Honorio; Mohit Tawarmalani (ISIT, 2017)

Learning Binary Bayesian Networks in Polynomial Time and Sample Complexity. - Adarsh Barik; Jean Honorio (CoRR, 2018)

Learning Bayesian Networks with Low Rank Conditional Probability Tables. - Adarsh Barik; Jean Honorio (NeurIPS, 2019)

Exact Support Recovery in Federated Regression with One-shot Communication. - Adarsh Barik; Jean Honorio (CoRR, 2020)

Information-Theoretic Bounds for Integral Estimation. - Donald Q. Adams; Adarsh Barik; Jean Honorio (ISIT, 2021)

Fair Sparse Regression with Clustering: An Invex Relaxation for a Combinatorial Problem. - Adarsh Barik; Jean Honorio (NeurIPS, 2021)

Provable Sample Complexity Guarantees For Learning Of Continuous-Action Graphical Games With Nonparametric Utilities. - Adarsh Barik; Jean Honorio (ICASSP, 2022)

Information Theoretic Limits For Standard and One-Bit Compressed Sensing with Graph-Structured Sparsity. - Adarsh Barik; Jean Honorio (ICASSP, 2022)

Sparse Mixed Linear Regression with Guarantees: Taming an Intractable Problem with Invex Relaxation. - Adarsh Barik; Jean Honorio (ICML, 2022)

A Simple Unified Framework for High Dimensional Bandit Problems. - Wenjie Li; Adarsh Barik; Jean Honorio (ICML, 2022)

A Novel Plug-and-Play Approach for Adversarially Robust Generalization. - Deepak Maurya; Adarsh Barik; Jean Honorio (CoRR, 2022)

Provable Computational and Statistical Guarantees for Efficient Learning of Continuous-Action Graphical Games. - Adarsh Barik; Jean Honorio (ICASSP, 2023)

Outlier-robust Estimation of a Sparse Linear Model Using Invexity. - Adarsh Barik; Jean Honorio (CoRR, 2023)

Invex Programs: First Order Algorithms and Their Convergence. - Adarsh Barik; Suvrit Sra; Jean Honorio (CoRR, 2023)

LEARN: An Invex Loss for Outlier Oblivious Robust Online Optimization. - Adarsh Barik; Anand Krishna; Vincent Y. F. Tan (CoRR, 2024)

A Sample Efficient Alternating Minimization-based Algorithm For Robust Phase Retrieval. - Adarsh Barik; Anand Krishna; Vincent Y. F. Tan (CoRR, 2024)

Recovering Exact Support in Federated lasso without Optimization. - Adarsh Barik; Jean Honorio (Trans. Mach. Learn. Res., 2024)

p-Mean Regret for Stochastic Bandits. - Anand Krishna; Philips George John; Adarsh Barik; Vincent Y. F. Tan (AAAI, 2025)

Exact Solutions of the Inner Optimization Problem of Adversarial Robustness. - Deepak Maurya; Adarsh Barik; Jean Honorio (ICASSP, 2025)