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. 2007.11045
  4. Cited By
On the Rademacher Complexity of Linear Hypothesis Sets

On the Rademacher Complexity of Linear Hypothesis Sets

21 July 2020
Pranjal Awasthi
Natalie Frank
M. Mohri
ArXiv (abs)PDFHTML

Papers citing "On the Rademacher Complexity of Linear Hypothesis Sets"

3 / 3 papers shown
Title
Uniform Generalization Bounds on Data-Dependent Hypothesis Sets via PAC-Bayesian Theory on Random Sets
Uniform Generalization Bounds on Data-Dependent Hypothesis Sets via PAC-Bayesian Theory on Random Sets
Benjamin Dupuis
Paul Viallard
George Deligiannidis
Umut Simsekli
120
5
0
26 Apr 2024
Relative Deviation Margin Bounds
Relative Deviation Margin Bounds
Corinna Cortes
M. Mohri
A. Suresh
72
14
0
26 Jun 2020
Adversarial Learning Guarantees for Linear Hypotheses and Neural
  Networks
Adversarial Learning Guarantees for Linear Hypotheses and Neural Networks
Pranjal Awasthi
Natalie Frank
M. Mohri
AAML
71
58
0
28 Apr 2020
1