Adarsh Barik

Publication Activity (10 Years)

Years Active: 2017-2024
Publications (10 Years): 24

Top Topics

Sample Complexity

Unified Framework

Bayesian Networks

Sparse Regression

Top Venues

Publications

Adarsh Barik, Jean Honorio
Recovering Exact Support in Federated lasso without Optimization. Trans. Mach. Learn. Res. 2024 (2024)
Adarsh Barik, Jean Honorio
Outlier-robust Estimation of a Sparse Linear Model Using Invexity. CoRR (2023)
Adarsh Barik, Jean Honorio
Provable Computational and Statistical Guarantees for Efficient Learning of Continuous-Action Graphical Games. ICASSP (2023)
Adarsh Barik, Suvrit Sra, Jean Honorio
Invex Programs: First Order Algorithms and Their Convergence. CoRR (2023)
Adarsh Barik, Jean Honorio
Provable Sample Complexity Guarantees For Learning Of Continuous-Action Graphical Games With Nonparametric Utilities. ICASSP (2022)
Wenjie Li, Adarsh Barik, Jean Honorio
A Simple Unified Framework for High Dimensional Bandit Problems. ICML (2022)
Adarsh Barik, Jean Honorio
Sparse Mixed Linear Regression with Guarantees: Taming an Intractable Problem with Invex Relaxation. CoRR (2022)
Deepak Maurya, Adarsh Barik, Jean Honorio
A Novel Plug-and-Play Approach for Adversarially Robust Generalization. CoRR (2022)
Adarsh Barik, Jean Honorio
Sparse Mixed Linear Regression with Guarantees: Taming an Intractable Problem with Invex Relaxation. ICML (2022)
Adarsh Barik, Jean Honorio
Information Theoretic Limits For Standard and One-Bit Compressed Sensing with Graph-Structured Sparsity. ICASSP (2022)
Donald Q. Adams, Adarsh Barik, Jean Honorio
Information-Theoretic Bounds for Integral Estimation. ISIT (2021)
Wenjie Li, Adarsh Barik, Jean Honorio
A Simple Unified Framework for High Dimensional Bandit Problems. CoRR (2021)
Donald Q. Adams, Adarsh Barik, Jean Honorio
Information-Theoretic Bounds for Integral Estimation. CoRR (2021)
Adarsh Barik, Jean Honorio
Fair Sparse Regression with Clustering: An Invex Relaxation for a Combinatorial Problem. NeurIPS (2021)
Adarsh Barik, Jean Honorio
Fair Sparse Regression with Clustering: An Invex Relaxation for a Combinatorial Problem. CoRR (2021)
Adarsh Barik, Jean Honorio
Exact Support Recovery in Federated Regression with One-shot Communication. CoRR (2020)
Adarsh Barik, Jean Honorio
Provable Sample Complexity Guarantees for Learning of Continuous-Action Graphical Games with Nonparametric Utilities. CoRR (2020)
Adarsh Barik, Jean Honorio
Learning Bayesian Networks with Low Rank Conditional Probability Tables. NeurIPS (2019)
Adarsh Barik, Jean Honorio
Learning Bayesian Networks with Low Rank Conditional Probability Tables. CoRR (2019)
Adarsh Barik, Jean Honorio
Provable Computational and Statistical Guarantees for Efficient Learning of Continuous-Action Graphical Games. CoRR (2019)
Adarsh Barik, Jean Honorio
Information Theoretic Limits for Standard and One-Bit Compressed Sensing with Graph-Structured Sparsity. CoRR (2018)
Adarsh Barik, Jean Honorio
Learning Binary Bayesian Networks in Polynomial Time and Sample Complexity. CoRR (2018)
Adarsh Barik, Jean Honorio, Mohit Tawarmalani
Information Theoretic Limits for Linear Prediction with Graph-Structured Sparsity. CoRR (2017)
Adarsh Barik, Jean Honorio, Mohit Tawarmalani
Information theoretic limits for linear prediction with graph-structured sparsity. ISIT (2017)