ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1909.09836
  4. Cited By
Optimal query complexity for private sequential learning against
  eavesdropping

Optimal query complexity for private sequential learning against eavesdropping

21 September 2019
Jiaming Xu
Kuang Xu
Dana Yang
    FedML
ArXivPDFHTML

Papers citing "Optimal query complexity for private sequential learning against eavesdropping"

1 / 1 papers shown
Title
Query Complexity of Bayesian Private Learning
Query Complexity of Bayesian Private Learning
Kuang Xu
11
17
0
15 Nov 2019
1