Transductive Rademacher Complexity and Its Applications

DOI10.1007/978-3-540-72927-3_13MaRDI QIDQ5432432zbMATH OpenOpenAlexFDO

Authors Dmitry Pechyony, Ran El-Yaniv

Publication date 3 January 2008

Published in Learning Theory (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.104.4174

Mathematics Subject Classification ID

Inequalities; stochastic orderings (60E15) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Transductive Rademacher complexity and its applications
• Permutational Rademacher Complexity
• The Rademacher Complexity of Linear Transformation Classes
• 10.1162/153244303321897690
• scientific article; zbMATH DE number 1804106
• Researches on Rademacher complexities in statistical learning theory: a survey
• Rademacher Margin Complexity
• scientific article; zbMATH DE number 1966627
• Rademacher complexity in Neyman-Pearson classification

Cited in

(13)

• Local Rademacher complexity: sharper risk bounds with and without unlabeled samples
• The false discovery rate for statistical pattern recognition
• Large margin vs. large volume in transductive learning
• Reshaped tensor nuclear norms for higher order tensor completion
• Permutational Rademacher Complexity
• An error bound based on a worst likely assignment
• Transductive Rademacher complexity and its applications
• Rademacher complexity bounds for a penalized multi-class semi-supervised algorithm
• Scaled Coupled Norms and Coupled Higher-Order Tensor Completion
• Convex coupled matrix and tensor completion
• Stable Transductive Learning
• scientific article; zbMATH DE number 2243369 (Why is no real title available?)
• Effective stabilized self-training on few-labeled graph data

This page was built for publication: Transductive Rademacher Complexity and Its Applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5432432)