default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAdarsh Barik
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j1]Adarsh Barik, Jean Honorio
:
Recovering Exact Support in Federated lasso without Optimization. Trans. Mach. Learn. Res. 2024 (2024)- [i17]Adarsh Barik, Anand Krishna, Vincent Y. F. Tan:
LEARN: An Invex Loss for Outlier Oblivious Robust Online Optimization. CoRR abs/2408.06297 (2024) - [i16]Adarsh Barik, Anand Krishna, Vincent Y. F. Tan:
A Sample Efficient Alternating Minimization-based Algorithm For Robust Phase Retrieval. CoRR abs/2409.04733 (2024) - [i15]Anand Krishna, Philips George John, Adarsh Barik, Vincent Y. F. Tan:
p-Mean Regret for Stochastic Bandits. CoRR abs/2412.10751 (2024) - 2023
- [c9]Adarsh Barik, Jean Honorio:
Provable Computational and Statistical Guarantees for Efficient Learning of Continuous-Action Graphical Games. ICASSP 2023: 1-5 - [i14]Adarsh Barik, Jean Honorio:
Outlier-robust Estimation of a Sparse Linear Model Using Invexity. CoRR abs/2306.12678 (2023) - [i13]Adarsh Barik, Suvrit Sra, Jean Honorio:
Invex Programs: First Order Algorithms and Their Convergence. CoRR abs/2307.04456 (2023) - 2022
- [c8]Adarsh Barik, Jean Honorio:
Provable Sample Complexity Guarantees For Learning Of Continuous-Action Graphical Games With Nonparametric Utilities. ICASSP 2022: 4443-4447 - [c7]Adarsh Barik, Jean Honorio:
Information Theoretic Limits For Standard and One-Bit Compressed Sensing with Graph-Structured Sparsity. ICASSP 2022: 5173-5177 - [c6]Adarsh Barik, Jean Honorio:
Sparse Mixed Linear Regression with Guarantees: Taming an Intractable Problem with Invex Relaxation. ICML 2022: 1627-1646 - [c5]Wenjie Li, Adarsh Barik, Jean Honorio:
A Simple Unified Framework for High Dimensional Bandit Problems. ICML 2022: 12619-12655 - [i12]Adarsh Barik, Jean Honorio:
Sparse Mixed Linear Regression with Guarantees: Taming an Intractable Problem with Invex Relaxation. CoRR abs/2206.01167 (2022) - [i11]Deepak Maurya, Adarsh Barik, Jean Honorio:
A Novel Plug-and-Play Approach for Adversarially Robust Generalization. CoRR abs/2208.09449 (2022) - 2021
- [c4]Donald Q. Adams, Adarsh Barik, Jean Honorio:
Information-Theoretic Bounds for Integral Estimation. ISIT 2021: 742-747 - [c3]Adarsh Barik, Jean Honorio:
Fair Sparse Regression with Clustering: An Invex Relaxation for a Combinatorial Problem. NeurIPS 2021: 23245-23257 - [i10]Wenjie Li, Adarsh Barik, Jean Honorio:
A Simple Unified Framework for High Dimensional Bandit Problems. CoRR abs/2102.09626 (2021) - [i9]Adarsh Barik, Jean Honorio:
Fair Sparse Regression with Clustering: An Invex Relaxation for a Combinatorial Problem. CoRR abs/2102.09704 (2021) - [i8]Donald Q. Adams, Adarsh Barik, Jean Honorio:
Information-Theoretic Bounds for Integral Estimation. CoRR abs/2102.10199 (2021) - 2020
- [i7]Adarsh Barik, Jean Honorio:
Provable Sample Complexity Guarantees for Learning of Continuous-Action Graphical Games with Nonparametric Utilities. CoRR abs/2004.01022 (2020) - [i6]Adarsh Barik, Jean Honorio:
Exact Support Recovery in Federated Regression with One-shot Communication. CoRR abs/2006.12583 (2020)
2010 – 2019
- 2019
- [c2]Adarsh Barik, Jean Honorio:
Learning Bayesian Networks with Low Rank Conditional Probability Tables. NeurIPS 2019: 8962-8971 - [i5]Adarsh Barik, Jean Honorio:
Learning Bayesian Networks with Low Rank Conditional Probability Tables. CoRR abs/1905.12552 (2019) - [i4]Adarsh Barik, Jean Honorio:
Provable Computational and Statistical Guarantees for Efficient Learning of Continuous-Action Graphical Games. CoRR abs/1911.04225 (2019) - 2018
- [i3]Adarsh Barik, Jean Honorio:
Learning Binary Bayesian Networks in Polynomial Time and Sample Complexity. CoRR abs/1803.04087 (2018) - [i2]Adarsh Barik, Jean Honorio:
Information Theoretic Limits for Standard and One-Bit Compressed Sensing with Graph-Structured Sparsity. CoRR abs/1811.06635 (2018) - 2017
- [c1]Adarsh Barik, Jean Honorio, Mohit Tawarmalani:
Information theoretic limits for linear prediction with graph-structured sparsity. ISIT 2017: 2348-2352 - [i1]Adarsh Barik, Jean Honorio, Mohit Tawarmalani:
Information Theoretic Limits for Linear Prediction with Graph-Structured Sparsity. CoRR abs/1701.07895 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-22 21:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
