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. 1505.02910
  4. Cited By
Permutational Rademacher Complexity: a New Complexity Measure for
  Transductive Learning
v1v2 (latest)

Permutational Rademacher Complexity: a New Complexity Measure for Transductive Learning

12 May 2015
Ilya O. Tolstikhin
Nikita Zhivotovskiy
Gilles Blanchard
ArXiv (abs)PDFHTML

Papers citing "Permutational Rademacher Complexity: a New Complexity Measure for Transductive Learning"

3 / 3 papers shown
Title
Information-Theoretic Generalization Bounds for Transductive Learning and its Applications
Information-Theoretic Generalization Bounds for Transductive Learning and its Applications
Huayi Tang
Yong Liu
152
0
0
08 Nov 2023
Rademacher Complexity Bounds for a Penalized Multiclass Semi-Supervised
  Algorithm
Rademacher Complexity Bounds for a Penalized Multiclass Semi-Supervised Algorithm
Yury Maximov
Massih-Reza Amini
Zaïd Harchaoui
65
33
0
02 Jul 2016
Inductive supervised quantum learning
Inductive supervised quantum learning
A. Monras
G. Sentís
P. Wittek
SSL
58
4
0
24 May 2016
1