Refined Rademacher Chaos Complexity Bounds with Applications to the Multikernel Learning Problem | Citedby Results | Neural Computation | MIT Press

Skip to Main Content

Skip Nav Destination

Refined Rademacher Chaos Complexity Bounds with Applications to the Multikernel Learning Problem

Neural Computation (2014) 26 (4): 739–760.

This article has been cited by the following articles in journals that are participating in Crossref Cited-by Linking.

Evolving Deep Multiple Kernel Learning Networks Through Genetic Algorithms

Wangbo Shen
Weiwei Lin
Yulei Wu
Fang Shi
Wentai Wu
Keqin Li

IEEE Transactions on Industrial Informatics (2023) 19 (2): 1569.

Self-Adaptive Deep Multiple Kernel Learning Based on Rademacher Complexity

Shengbing Ren
Wangbo Shen
Chaudry Naeem Siddique
You Li

Symmetry (2019) 11 (3): 325.

Generalization Bounds for Coregularized Multiple Kernel Learning

Xinxing Wu
Guosheng Hu

Computational Intelligence and Neuroscience (2018) 2018: 1.

Local Rademacher complexity bounds based on covering numbers

Yunwen Lei
Lixin Ding
Yingzhou Bi

Neurocomputing (2016) 218: 320.

Generalization analysis of multi-modal metric learning

Yunwen Lei
Yiming Ying

Analysis and Applications (2016) 14 (04): 503.

Refined Generalization Bounds of Gradient Learning over Reproducing Kernel Hilbert Spaces

Shao-Gao Lv

Neural Computation (2015) 27 (6): 1294.