default search action
Sudeep Salgia
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j4]Sudeep Salgia
, Tamir Gabay
A Communication-Efficient Adaptive Algorithm for Federated Learning Under Cumulative Regret. IEEE Trans. Signal Process. 72: 735-743 (2024) - [j3]Sudeep Salgia
Adaptive Binning Coincidence Test for Uniformity Testing. IEEE Trans. Signal Process. 72: 2421-2435 (2024) - [c8]Sudeep Salgia, Sattar Vakili, Qing Zhao:
Random Exploration in Bayesian Optimization: Order-Optimal Regret and Computational Efficiency. ICML 2024 - [i12]Nikola Pavlovic, Sudeep Salgia, Qing Zhao:
Order-Optimal Regret in Distributed Kernel Bandits using Uniform Sampling with Shared Randomness. CoRR abs/2402.13182 (2024) - [i11]Sudeep Salgia, Yuejie Chi:
The Sample-Communication Complexity Trade-off in Federated Q-Learning. CoRR abs/2408.16981 (2024) - 2023
- [j2]Sudeep Salgia
Collaborative Learning in Kernel-Based Bandits for Distributed Users. IEEE Trans. Signal Process. 71: 3956-3967 (2023) - [c7]Sudeep Salgia:
Provably and Practically Efficient Neural Contextual Bandits. ICML 2023: 29800-29844 - [c6]Sudeep Salgia, Qing Zhao:
Distributed Linear Bandits under Communication Constraints. ICML 2023: 29845-29875 - [i10]Sudeep Salgia, Karthik Murthy, Qing Zhao, Tamir Gabay, Kobi Cohen:
A Communication-Efficient Adaptive Algorithm for Federated Learning under Cumulative Regret. CoRR abs/2301.08869 (2023) - [i9]Sudeep Salgia, Sattar Vakili, Qing Zhao:
Random Exploration in Bayesian Optimization: Order-Optimal Regret and Computational Efficiency. CoRR abs/2310.15351 (2023) - 2022
- [j1]Boshuang Huang
Disagreement-Based Active Learning in Online Settings. IEEE Trans. Signal Process. 70: 1947-1958 (2022) - [i8]Sudeep Salgia, Sattar Vakili, Qing Zhao:
Provably and Practically Efficient Neural Contextual Bandits. CoRR abs/2206.00099 (2022) - [i7]Sudeep Salgia, Sattar Vakili, Qing Zhao:
Kernel-based Federated Learning with Personalization. CoRR abs/2207.07948 (2022) - [i6]Sudeep Salgia, Qing Zhao:
Distributed Linear Bandits under Communication Constraints. CoRR abs/2211.02212 (2022) - 2021
- [c5]Sudeep Salgia, Qing Zhao:
An Order-Optimal Adaptive Test Plan for Noisy Group Testing Under Unknown Noise Models. ICASSP 2021: 4035-4039 - [c4]Sudeep Salgia, Sattar Vakili, Qing Zhao:
A Domain-Shrinking based Bayesian Optimization Algorithm with Order-Optimal Regret Performance. NeurIPS 2021: 28836-28847 - [i5]Sudeep Salgia, Qing Zhao, Lang Tong:
As Easy as ABC: Adaptive Binning Coincidence Test for Uniformity Testing. CoRR abs/2110.06325 (2021) - 2020
- [c3]Sudeep Salgia, Qing Zhao, Sattar Vakili:
Stochastic Coordinate Minimization with Progressive Precision for Stochastic Convex Optimization. ICML 2020: 8427-8437 - [i4]Sudeep Salgia, Qing Zhao, Sattar Vakili:
Stochastic Coordinate Minimization with Progressive Precision for Stochastic Convex Optimization. CoRR abs/2003.05482 (2020) - [i3]Sudeep Salgia, Sattar Vakili, Qing Zhao:
A Computationally Efficient Approach to Black-box Optimization using Gaussian Process Models. CoRR abs/2010.13997 (2020)
2010 – 2019
- 2019
- [c2]Sattar Vakili
Stochastic Gradient Descent on a Tree: an Adaptive and Robust Approach to Stochastic Convex Optimization. Allerton 2019: 432-438 - 2018
- [c1]Sudeep Salgia, Animesh Kumar:
Bandlimited Spatiotemporal Field Sampling with Location and Time Unaware Mobile Sensors. ICASSP 2018: 4574-4578 - 2017
- [i2]Sudeep Salgia, Animesh Kumar:
Spatial Field estimation from Samples taken at Unknown Locations generated by an Unknown Autoregressive Process. CoRR abs/1710.09451 (2017) - [i1]Sudeep Salgia, Animesh Kumar:
On Bandlimited Spatiotemporal Field Sampling with Location and Time Unaware Mobile Sensors. CoRR abs/1710.09454 (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 2024-09-30 01:01 CEST 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: