skip to main content
Explore Scholarly Publications and Datasets in the NSF-PAR

  • Home
  • Search Results
  • Page 1 of 19

Search for: All records

Creators/Authors contains: "Shen, C."

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; ( , Proceedings of the AAAI Conference on Artificial Intelligence)
    Federated multi-armed bandits (FMAB) is a new bandit paradigm that parallels the federated learning (FL) framework in supervised learning. It is inspired by practical applications in cognitive radio and recommender systems, and enjoys features that are analogous to FL. This paper proposes a general framework of FMAB and then studies two specific federated bandit models. We first study the approximate model where the heterogeneous local models are random realizations of the global model from an unknown distribution. This model introduces a new uncertainty of client sampling, as the global model may not be reliably learned even if the finite localmore »models are perfectly known. Furthermore, this uncertainty cannot be quantified a priori without knowledge of the suboptimality gap. We solve the approximate model by proposing Federated Double UCB (Fed2-UCB), which constructs a novel “double UCB” principle accounting for uncertainties from both arm and client sampling. We show that gradually admitting new clients is critical in achieving an O(log(T)) regret while explicitly considering the communication loss. The exact model, where the global bandit model is the exact average of heterogeneous local models, is then studied as a special case. We show that, somewhat surprisingly, the order-optimal regret can be achieved independent of the number of clients with a careful choice of the update periodicity. Experiments using both synthetic and real-world datasets corroborate the theoretical analysis and demonstrate the effectiveness and efficiency of the proposed algorithms.« less
    Accepted Manuscript Full Text Available
  2. ; ; ( , IEEE International Conference on Communications)
    Accepted Manuscript Full Text Available
  3. ; ; ( , Physical Review C)
    Full Text Available 
  4. ; ; ( , The 24rd International Conference on Artificial Intelligence and Statistics (AISTATS))
    Accepted Manuscript Full Text Available
  5. ; ; ; ; ; ; ; ; ; ; et al ( , Physical Review Letters)
    Full Text Available 
  6. ; ; ; ( , Astronomy and Computing)
    Full Text Available 
  7. ; ; ; ; ; ; ; ; ; ; et al ( , Physical Review C)
    Full Text Available 
  8. ; ; ; ; ; ; ; ; ; ; et al ( , Physical Review Letters)
    Full Text Available 
  9. ; ; ; ; ; ; ; ; ; ; et al ( , Physical Review C)
    Full Text Available 
  10. ; ; ; ; ; ; ; ; ; ; et al ( , Physical Review D)
    Free, publicly-accessible full text available May 1, 2023