Picture for Sudeep Salgia

Sudeep Salgia

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

Add code
Aug 30, 2024
Figure 1 for The Sample-Communication Complexity Trade-off in Federated Q-Learning
Figure 2 for The Sample-Communication Complexity Trade-off in Federated Q-Learning
Figure 3 for The Sample-Communication Complexity Trade-off in Federated Q-Learning
Figure 4 for The Sample-Communication Complexity Trade-off in Federated Q-Learning
Viaarxiv icon

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

Add code
Feb 20, 2024
Viaarxiv icon

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

Add code
Oct 23, 2023
Viaarxiv icon

A Communication-Efficient Adaptive Algorithm for Federated Learning under Cumulative Regret

Add code
Jan 21, 2023
Viaarxiv icon

Distributed Linear Bandits under Communication Constraints

Add code
Nov 04, 2022
Viaarxiv icon

Kernel-based Federated Learning with Personalization

Add code
Jul 16, 2022
Figure 1 for Kernel-based Federated Learning with Personalization
Figure 2 for Kernel-based Federated Learning with Personalization
Figure 3 for Kernel-based Federated Learning with Personalization
Viaarxiv icon

Provably and Practically Efficient Neural Contextual Bandits

Add code
May 31, 2022
Figure 1 for Provably and Practically Efficient Neural Contextual Bandits
Figure 2 for Provably and Practically Efficient Neural Contextual Bandits
Figure 3 for Provably and Practically Efficient Neural Contextual Bandits
Figure 4 for Provably and Practically Efficient Neural Contextual Bandits
Viaarxiv icon

As Easy as ABC: Adaptive Binning Coincidence Test for Uniformity Testing

Add code
Oct 12, 2021
Figure 1 for As Easy as ABC: Adaptive Binning Coincidence Test for Uniformity Testing
Viaarxiv icon

A Computationally Efficient Approach to Black-box Optimization using Gaussian Process Models

Add code
Oct 27, 2020
Figure 1 for A Computationally Efficient Approach to Black-box Optimization using Gaussian Process Models
Figure 2 for A Computationally Efficient Approach to Black-box Optimization using Gaussian Process Models
Figure 3 for A Computationally Efficient Approach to Black-box Optimization using Gaussian Process Models
Figure 4 for A Computationally Efficient Approach to Black-box Optimization using Gaussian Process Models
Viaarxiv icon

Stochastic Coordinate Minimization with Progressive Precision for Stochastic Convex Optimization

Add code
Mar 11, 2020
Figure 1 for Stochastic Coordinate Minimization with Progressive Precision for Stochastic Convex Optimization
Figure 2 for Stochastic Coordinate Minimization with Progressive Precision for Stochastic Convex Optimization
Viaarxiv icon