Adarsh Barik - RankMe

31 papers A* 5B 2Misc 4Journal 20

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	A Sample Efficient Alternating Minimization-Based Algorithm for Robust Phase Retrieval. IEEE Trans. Inf. Theory Adarsh Barik, Anand Krishna, Vincent Y. F. Tan
2025	Misc	`conf`	Exact Solutions of the Inner Optimization Problem of Adversarial Robustness. ICASSP Deepak Maurya, Adarsh Barik, Jean Honorio
2025	J	`jnl`	Parameter-free Algorithms for the Stochastically Extended Adversarial Model. CoRR Shuche Wang, Adarsh Barik, Peng Zhao, Vincent Y. F. Tan
2025	A*	`conf`	p-Mean Regret for Stochastic Bandits. AAAI Anand Krishna, Philips George John, Adarsh Barik, Vincent Y. F. Tan
2024	J	`jnl`	A Sample Efficient Alternating Minimization-based Algorithm For Robust Phase Retrieval. CoRR Adarsh Barik, Anand Krishna, Vincent Y. F. Tan
2024	J	`jnl`	LEARN: An Invex Loss for Outlier Oblivious Robust Online Optimization. CoRR Adarsh Barik, Anand Krishna, Vincent Y. F. Tan
2024	J	`jnl`	Recovering Exact Support in Federated lasso without Optimization. Trans. Mach. Learn. Res. Adarsh Barik, Jean Honorio
2024	J	`jnl`	p-Mean Regret for Stochastic Bandits. CoRR Anand Krishna, Philips George John, Adarsh Barik, Vincent Y. F. Tan
2023	J	`jnl`	Invex Programs: First Order Algorithms and Their Convergence. CoRR Adarsh Barik, Suvrit Sra, Jean Honorio
2023	J	`jnl`	Outlier-robust Estimation of a Sparse Linear Model Using Invexity. CoRR Adarsh Barik, Jean Honorio
2023	Misc	`conf`	Provable Computational and Statistical Guarantees for Efficient Learning of Continuous-Action Graphical Games. ICASSP Adarsh Barik, Jean Honorio
2022	J	`jnl`	A Novel Plug-and-Play Approach for Adversarially Robust Generalization. CoRR Deepak Maurya, Adarsh Barik, Jean Honorio
2022	A*	`conf`	A Simple Unified Framework for High Dimensional Bandit Problems. ICML Wenjie Li, Adarsh Barik, Jean Honorio
2022	Misc	`conf`	Information Theoretic Limits For Standard and One-Bit Compressed Sensing with Graph-Structured Sparsity. ICASSP Adarsh Barik, Jean Honorio
2022	Misc	`conf`	Provable Sample Complexity Guarantees For Learning Of Continuous-Action Graphical Games With Nonparametric Utilities. ICASSP Adarsh Barik, Jean Honorio
2022	A*	`conf`	Sparse Mixed Linear Regression with Guarantees: Taming an Intractable Problem with Invex Relaxation. ICML Adarsh Barik, Jean Honorio
2022	J	`jnl`	Sparse Mixed Linear Regression with Guarantees: Taming an Intractable Problem with Invex Relaxation. CoRR Adarsh Barik, Jean Honorio
2021	J	`jnl`	A Simple Unified Framework for High Dimensional Bandit Problems. CoRR Wenjie Li, Adarsh Barik, Jean Honorio
2021	A*	`conf`	Fair Sparse Regression with Clustering: An Invex Relaxation for a Combinatorial Problem. NeurIPS Adarsh Barik, Jean Honorio
2021	J	`jnl`	Fair Sparse Regression with Clustering: An Invex Relaxation for a Combinatorial Problem. CoRR Adarsh Barik, Jean Honorio
2021	B	`conf`	Information-Theoretic Bounds for Integral Estimation. ISIT Donald Q. Adams, Adarsh Barik, Jean Honorio
2021	J	`jnl`	Information-Theoretic Bounds for Integral Estimation. CoRR Donald Q. Adams, Adarsh Barik, Jean Honorio
2020	J	`jnl`	Exact Support Recovery in Federated Regression with One-shot Communication. CoRR Adarsh Barik, Jean Honorio
2020	J	`jnl`	Provable Sample Complexity Guarantees for Learning of Continuous-Action Graphical Games with Nonparametric Utilities. CoRR Adarsh Barik, Jean Honorio
2019	A*	`conf`	Learning Bayesian Networks with Low Rank Conditional Probability Tables. NeurIPS Adarsh Barik, Jean Honorio
2019	J	`jnl`	Learning Bayesian Networks with Low Rank Conditional Probability Tables. CoRR Adarsh Barik, Jean Honorio
2019	J	`jnl`	Provable Computational and Statistical Guarantees for Efficient Learning of Continuous-Action Graphical Games. CoRR Adarsh Barik, Jean Honorio
2018	J	`jnl`	Information Theoretic Limits for Standard and One-Bit Compressed Sensing with Graph-Structured Sparsity. CoRR Adarsh Barik, Jean Honorio
2018	J	`jnl`	Learning Binary Bayesian Networks in Polynomial Time and Sample Complexity. CoRR Adarsh Barik, Jean Honorio
2017	J	`jnl`	Information Theoretic Limits for Linear Prediction with Graph-Structured Sparsity. CoRR Adarsh Barik, Jean Honorio, Mohit Tawarmalani
2017	B	`conf`	Information theoretic limits for linear prediction with graph-structured sparsity. ISIT Adarsh Barik, Jean Honorio, Mohit Tawarmalani