activity
20172025
most citedA Domain-Shrinking based Bayesian Optimization Algorithm with Order-Optimal Regret Performance

6 citations · 10 across the 17 of their papers we have counts for

collaborators

17 papers

stat.ML2025

Differential Privacy in Kernelized Contextual Bandits via Random Projections

Nikola Pavlovic, Sudeep Salgia, Qing Zhao

We consider the problem of contextual kernel bandits with stochastic contexts, where the underlying reward function belongs to a known Reproducing Kernel Hilbert Space. We study th…

stat.ML2025

Differentially Private Kernelized Contextual Bandits

Nikola Pavlovic, Sudeep Salgia, Qing Zhao

We consider the problem of contextual kernel bandits with stochastic contexts, where the underlying reward function belongs to a known Reproducing Kernel Hilbert Space (RKHS). We s…

cs.LG2025

Characterizing the Accuracy-Communication-Privacy Trade-off in Distributed Stochastic Convex Optimization

Sudeep Salgia, Nikola Pavlovic, Yuejie Chi +1

We consider the problem of differentially private stochastic convex optimization (DP-SCO) in a distributed setting with clients, where each of them has a local dataset of i…

cs.LG2024

The Sample-Communication Complexity Trade-off in Federated Q-Learning

Sudeep Salgia, Yuejie Chi

We consider the problem of federated Q-learning, where agents aim to collaboratively learn the optimal Q-function of an unknown infinite-horizon Markov decision process with fi…

cs.LG2024

Order-Optimal Regret in Distributed Kernel Bandits using Uniform Sampling with Shared Randomness

Nikola Pavlovic, Sudeep Salgia, Qing Zhao

We consider distributed kernel bandits where agents aim to collaboratively maximize an unknown reward function that lies in a reproducing kernel Hilbert space. Each agent seque…

cs.LG2023

Random Exploration in Bayesian Optimization: Order-Optimal Regret and Computational Efficiency

Sudeep Salgia, Sattar Vakili, Qing Zhao

We consider Bayesian optimization using Gaussian Process models, also referred to as kernel-based bandit optimization. We study the methodology of exploring the domain using random…