Transductive Rademacher Complexity and its Applications

DOI10.1613/jair.2587zbMath1192.68515arXiv1401.3441OpenAlexW3023646171WikidataQ129519607 ScholiaQ129519607MaRDI QIDQ3651463

Dmitry Pechyony, Ran El-Yaniv

Publication date: 10 December 2009

Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1401.3441

zbMATH Keywords

PAC-Bayesian bound for mixtures of transductive algorithms

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (7)

L1-norm locally linear representation regularization multi-source adaptation learning ⋮ Robust latent regression with discriminative regularization by leveraging auxiliary knowledge ⋮ A Bayesian perspective of statistical machine learning for big data ⋮ Concentration Inequalities for Samples without Replacement ⋮ Robust multi-source adaptation visual classification using supervised low-rank representation ⋮ Permutational Rademacher Complexity ⋮ Concentration inequalities on the multislice and for sampling without replacement

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