Spatial Field estimation from Samples taken at Unknown Locations generated by an Unknown Autoregressive Process. - Sudeep Salgia; Animesh Kumar (CoRR, 2017)

Bandlimited Spatiotemporal Field Sampling with Location and Time Unaware Mobile Sensors. - Sudeep Salgia; Animesh Kumar (ICASSP, 2018)

Stochastic Gradient Descent on a Tree: an Adaptive and Robust Approach to Stochastic Convex Optimization. - Sattar Vakili; Sudeep Salgia; Qing Zhao 001 (Allerton, 2019)

Stochastic Coordinate Minimization with Progressive Precision for Stochastic Convex Optimization. - Sudeep Salgia; Qing Zhao 001; Sattar Vakili (ICML, 2020)

A Computationally Efficient Approach to Black-box Optimization using Gaussian Process Models. - Sudeep Salgia; Sattar Vakili; Qing Zhao 001 (CoRR, 2020)

An Order-Optimal Adaptive Test Plan for Noisy Group Testing Under Unknown Noise Models. - Sudeep Salgia; Qing Zhao 001 (ICASSP, 2021)

A Domain-Shrinking based Bayesian Optimization Algorithm with Order-Optimal Regret Performance. - Sudeep Salgia; Sattar Vakili; Qing Zhao 001 (NeurIPS, 2021)

As Easy as ABC: Adaptive Binning Coincidence Test for Uniformity Testing. - Sudeep Salgia; Qing Zhao 001; Lang Tong 001 (CoRR, 2021)

Provably and Practically Efficient Neural Contextual Bandits. - Sudeep Salgia; Sattar Vakili; Qing Zhao 001 (CoRR, 2022)

Kernel-based Federated Learning with Personalization. - Sudeep Salgia; Sattar Vakili; Qing Zhao 001 (CoRR, 2022)

Disagreement-Based Active Learning in Online Settings. - Boshuang Huang; Sudeep Salgia; Qing Zhao 001 (IEEE Trans. Signal Process., 2022)

Distributed Linear Bandits under Communication Constraints. - Sudeep Salgia; Qing Zhao 001 (ICML, 2023)

Provably and Practically Efficient Neural Contextual Bandits. - Sudeep Salgia (ICML, 2023)

A Communication-Efficient Adaptive Algorithm for Federated Learning under Cumulative Regret. - Sudeep Salgia; Karthik Murthy; Qing Zhao 001; Tamir Gabay; Kobi Cohen (CoRR, 2023)

Collaborative Learning in Kernel-Based Bandits for Distributed Users. - Sudeep Salgia; Sattar Vakili; Qing Zhao 001 (IEEE Trans. Signal Process., 2023)

Random Exploration in Bayesian Optimization: Order-Optimal Regret and Computational Efficiency. - Sudeep Salgia; Sattar Vakili; Qing Zhao 001 (ICML, 2024)

The Sample-Communication Complexity Trade-off in Federated Q-Learning. - Sudeep Salgia; Yuejie Chi (NeurIPS, 2024)

A Communication-Efficient Adaptive Algorithm for Federated Learning Under Cumulative Regret. - Sudeep Salgia; Tamir Gabay; Qing Zhao 001; Kobi Cohen (IEEE Trans. Signal Process., 2024)

Adaptive Binning Coincidence Test for Uniformity Testing. - Sudeep Salgia; Xinyi Wang 006; Qing Zhao 001; Lang Tong 001 (IEEE Trans. Signal Process., 2024)

Differentially Private Kernelized Contextual Bandits. - Nikola Pavlovic; Sudeep Salgia; Qing Zhao 001 (AISTATS, 2025)

Order-Optimal Regret in Distributed Kernel Bandits using Uniform Sampling with Shared Randomness. - Nikola Pavlovic; Sudeep Salgia; Qing Zhao 001 (AISTATS, 2025)

Characterizing the Accuracy-Communication-Privacy Trade-off in Distributed Stochastic Convex Optimization. - Sudeep Salgia; Nikola Pavlovic; Yuejie Chi; Qing Zhao 001 (AISTATS, 2025)

Differential Privacy in Kernelized Contextual Bandits via Random Projections. - Nikola Pavlovic; Sudeep Salgia; Qing Zhao 001 (CoRR, 2025)