Adarsh Barik

According to our database, Adarsh Barik authored at least 17 papers between 2017 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

Recovering Exact Support in Federated lasso without Optimization.

Adarsh Barik, Jean Honorio

Trans. Mach. Learn. Res., 2024

A Sample Efficient Alternating Minimization-based Algorithm For Robust Phase Retrieval.

Adarsh Barik, Anand Krishna, Vincent Y. F. Tan

CoRR, 2024

LEARN: An Invex Loss for Outlier Oblivious Robust Online Optimization.

Adarsh Barik, Anand Krishna, Vincent Y. F. Tan

CoRR, 2024

2023

Invex Programs: First Order Algorithms and Their Convergence.

Adarsh Barik, Suvrit Sra, Jean Honorio

CoRR, 2023

Outlier-robust Estimation of a Sparse Linear Model Using Invexity.

Adarsh Barik, Jean Honorio

CoRR, 2023

Provable Computational and Statistical Guarantees for Efficient Learning of Continuous-Action Graphical Games.

Adarsh Barik, Jean Honorio

Proceedings of the IEEE International Conference on Acoustics, 2023

2022

A Novel Plug-and-Play Approach for Adversarially Robust Generalization.

Deepak Maurya, Adarsh Barik, Jean Honorio

CoRR, 2022

A Simple Unified Framework for High Dimensional Bandit Problems.

Wenjie Li, Adarsh Barik, Jean Honorio

Proceedings of the International Conference on Machine Learning, 2022

Sparse Mixed Linear Regression with Guarantees: Taming an Intractable Problem with Invex Relaxation.

Adarsh Barik, Jean Honorio

Proceedings of the International Conference on Machine Learning, 2022

Information Theoretic Limits For Standard and One-Bit Compressed Sensing with Graph-Structured Sparsity.

Adarsh Barik, Jean Honorio

Proceedings of the IEEE International Conference on Acoustics, 2022

Provable Sample Complexity Guarantees For Learning Of Continuous-Action Graphical Games With Nonparametric Utilities.

Adarsh Barik, Jean Honorio

Proceedings of the IEEE International Conference on Acoustics, 2022

2021

Fair Sparse Regression with Clustering: An Invex Relaxation for a Combinatorial Problem.

Adarsh Barik, Jean Honorio

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Information-Theoretic Bounds for Integral Estimation.

Donald Q. Adams, Adarsh Barik, Jean Honorio

Proceedings of the IEEE International Symposium on Information Theory, 2021

2020

Exact Support Recovery in Federated Regression with One-shot Communication.

Adarsh Barik, Jean Honorio

CoRR, 2020

2019

Learning Bayesian Networks with Low Rank Conditional Probability Tables.

Adarsh Barik, Jean Honorio

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

2018

Learning Binary Bayesian Networks in Polynomial Time and Sample Complexity.

Adarsh Barik, Jean Honorio

CoRR, 2018

2017

Information theoretic limits for linear prediction with graph-structured sparsity.

Adarsh Barik, Jean Honorio, Mohit Tawarmalani

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017