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. 2107.08444
  4. Cited By
A Theory of PAC Learnability of Partial Concept Classes

A Theory of PAC Learnability of Partial Concept Classes

18 July 2021
N. Alon
Steve Hanneke
R. Holzman
Shay Moran
ArXivPDFHTML

Papers citing "A Theory of PAC Learnability of Partial Concept Classes"

16 / 16 papers shown
Title
Sample Compression Scheme Reductions
Sample Compression Scheme Reductions
Idan Attias
Steve Hanneke
Arvind Ramaswami
MQ
42
1
0
16 Oct 2024
A Characterization of List Regression
A Characterization of List Regression
Chirag Pabbaraju
Sahasrajit Sarmasarkar
32
1
0
28 Sep 2024
List Sample Compression and Uniform Convergence
List Sample Compression and Uniform Convergence
Steve Hanneke
Shay Moran
Tom Waknine
38
6
0
16 Mar 2024
Optimal PAC Bounds Without Uniform Convergence
Optimal PAC Bounds Without Uniform Convergence
Ishaq Aden-Ali
Yeshwanth Cherapanamjeri
Abhishek Shetty
Nikita Zhivotovskiy
35
16
0
18 Apr 2023
Online Learning and Disambiguations of Partial Concept Classes
Online Learning and Disambiguations of Partial Concept Classes
T. Cheung
Hamed Hatami
Pooya Hatami
Kaave Hosseini
13
4
0
30 Mar 2023
The One-Inclusion Graph Algorithm is not Always Optimal
The One-Inclusion Graph Algorithm is not Always Optimal
Ishaq Aden-Ali
Yeshwanth Cherapanamjeri
Abhishek Shetty
Nikita Zhivotovskiy
29
7
0
19 Dec 2022
Comparative Learning: A Sample Complexity Theory for Two Hypothesis
  Classes
Comparative Learning: A Sample Complexity Theory for Two Hypothesis Classes
Lunjia Hu
Charlotte Peale
43
6
0
16 Nov 2022
A Characterization of List Learnability
A Characterization of List Learnability
Moses Charikar
Chirag Pabbaraju
29
13
0
07 Nov 2022
Multiclass Learnability Beyond the PAC Framework: Universal Rates and
  Partial Concept Classes
Multiclass Learnability Beyond the PAC Framework: Universal Rates and Partial Concept Classes
Alkis Kalavasis
Grigoris Velegkas
Amin Karbasi
21
11
0
05 Oct 2022
Adversarially Robust Learning: A Generic Minimax Optimal Learner and
  Characterization
Adversarially Robust Learning: A Generic Minimax Optimal Learner and Characterization
Omar Montasser
Steve Hanneke
Nathan Srebro
29
17
0
15 Sep 2022
A Characterization of Multiclass Learnability
A Characterization of Multiclass Learnability
Nataly Brukhim
Dan Carmon
Irit Dinur
Shay Moran
Amir Yehudayoff
13
50
0
03 Mar 2022
A Characterization of Semi-Supervised Adversarially-Robust PAC
  Learnability
A Characterization of Semi-Supervised Adversarially-Robust PAC Learnability
Idan Attias
Steve Hanneke
Yishay Mansour
32
15
0
11 Feb 2022
Fat-Shattering Dimension of $k$-fold Aggregations
Fat-Shattering Dimension of kkk-fold Aggregations
Idan Attias
A. Kontorovich
34
2
0
10 Oct 2021
Adversarial Laws of Large Numbers and Optimal Regret in Online
  Classification
Adversarial Laws of Large Numbers and Optimal Regret in Online Classification
N. Alon
Omri Ben-Eliezer
Y. Dagan
Shay Moran
M. Naor
E. Yogev
77
51
0
22 Jan 2021
When is Memorization of Irrelevant Training Data Necessary for
  High-Accuracy Learning?
When is Memorization of Irrelevant Training Data Necessary for High-Accuracy Learning?
Gavin Brown
Mark Bun
Vitaly Feldman
Adam D. Smith
Kunal Talwar
253
93
0
11 Dec 2020
Agnostic Sample Compression Schemes for Regression
Agnostic Sample Compression Schemes for Regression
Idan Attias
Steve Hanneke
A. Kontorovich
Menachem Sadigurschi
24
4
0
03 Oct 2018
1