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. 2402.11119
  4. Cited By
Private PAC Learning May be Harder than Online Learning

Private PAC Learning May be Harder than Online Learning

16 February 2024
Mark Bun
Aloni Cohen
Rathin Desai
ArXivPDFHTML

Papers citing "Private PAC Learning May be Harder than Online Learning"

3 / 3 papers shown
Title
On the Computational Landscape of Replicable Learning
On the Computational Landscape of Replicable Learning
Alkis Kalavasis
Amin Karbasi
Grigoris Velegkas
Felix Y. Zhou
50
2
0
24 May 2024
Exploration is Harder than Prediction: Cryptographically Separating
  Reinforcement Learning from Supervised Learning
Exploration is Harder than Prediction: Cryptographically Separating Reinforcement Learning from Supervised Learning
Noah Golowich
Ankur Moitra
Dhruv Rohatgi
OffRL
35
4
0
04 Apr 2024
Sample Complexity Bounds on Differentially Private Learning via
  Communication Complexity
Sample Complexity Bounds on Differentially Private Learning via Communication Complexity
Vitaly Feldman
David Xiao
175
72
0
25 Feb 2014
1