Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
2003.00563
Cited By
An Equivalence Between Private Classification and Online Prediction
1 March 2020
Mark Bun
Roi Livni
Shay Moran
Re-assign community
ArXiv
PDF
HTML
Papers citing
"An Equivalence Between Private Classification and Online Prediction"
23 / 23 papers shown
Title
Rethink Repeatable Measures of Robot Performance with Statistical Query
Bowen Weng
L. Capito
Guillermo A. Castillo
Dylan Khor
26
0
0
13 May 2025
An \tilde{O}ptimal Differentially Private Learner for Concept Classes with VC Dimension 1
Chao Yan
26
0
0
10 May 2025
Improved Bounds for Pure Private Agnostic Learning: Item-Level and User-Level Privacy
Bo Li
Wei Wang
Peng Ye
FedML
39
0
0
30 Jul 2024
Credit Attribution and Stable Compression
Roi Livni
Shay Moran
Kobbi Nissim
Chirag Pabbaraju
49
0
0
22 Jun 2024
On the Computational Landscape of Replicable Learning
Alkis Kalavasis
Amin Karbasi
Grigoris Velegkas
Felix Y. Zhou
50
2
0
24 May 2024
A survey on the complexity of learning quantum states
Anurag Anshu
Srinivasan Arunachalam
34
66
0
31 May 2023
Statistical Indistinguishability of Learning Algorithms
Alkis Kalavasis
Amin Karbasi
Shay Moran
Grigoris Velegkas
25
16
0
23 May 2023
A Unified Characterization of Private Learnability via Graph Theory
N. Alon
Shay Moran
Hilla Schefler
Amir Yehudayoff
34
2
0
08 Apr 2023
Replicability and stability in learning
Zachary Chase
Shay Moran
Amir Yehudayoff
29
9
0
07 Apr 2023
List and Certificate Complexities in Replicable Learning
P. Dixon
A. Pavan
Jason Vander Woude
N. V. Vinodchandran
32
12
0
05 Apr 2023
Stability is Stable: Connections between Replicability, Privacy, and Adaptive Generalization
Mark Bun
Marco Gaboardi
Max Hopkins
R. Impagliazzo
Rex Lei
T. Pitassi
Satchit Sivakumar
Jessica Sorrell
28
29
0
22 Mar 2023
Differentially-Private Bayes Consistency
Olivier Bousquet
Haim Kaplan
A. Kontorovich
Yishay Mansour
Shay Moran
Menachem Sadigurschi
Uri Stemmer
18
0
0
08 Dec 2022
Comparative Learning: A Sample Complexity Theory for Two Hypothesis Classes
Lunjia Hu
Charlotte Peale
43
6
0
16 Nov 2022
On PAC Learning Halfspaces in Non-interactive Local Privacy Model with Public Unlabeled Data
Jinyan Su
Jinhui Xu
Di Wang
21
2
0
17 Sep 2022
Finite Littlestone Dimension Implies Finite Information Complexity
Aditya Pradeep
Ido Nachum
Michael C. Gastpar
17
7
0
27 Jun 2022
Differential Privacy Amplification in Quantum and Quantum-inspired Algorithms
Armando Angrisani
Mina Doosti
E. Kashefi
24
12
0
07 Mar 2022
Reproducibility in Learning
R. Impagliazzo
Rex Lei
T. Pitassi
Jessica Sorrell
26
43
0
20 Jan 2022
User-Level Private Learning via Correlated Sampling
Badih Ghazi
Ravi Kumar
Pasin Manurangsi
FedML
40
13
0
21 Oct 2021
A Theory of PAC Learnability of Partial Concept Classes
N. Alon
Steve Hanneke
R. Holzman
Shay Moran
22
50
0
18 Jul 2021
Smoothed Analysis of Online and Differentially Private Learning
Nika Haghtalab
Tim Roughgarden
Abhishek Shetty
31
47
0
17 Jun 2020
Online Agnostic Boosting via Regret Minimization
Nataly Brukhim
Xinyi Chen
Elad Hazan
Shay Moran
16
13
0
02 Mar 2020
Learning Privately with Labeled and Unlabeled Examples
A. Beimel
Kobbi Nissim
Uri Stemmer
40
23
0
10 Jul 2014
Sample Complexity Bounds on Differentially Private Learning via Communication Complexity
Vitaly Feldman
David Xiao
175
71
0
25 Feb 2014
1