Local Rademacher complexity bounds based on covering numbers-Reference-Cited by-同舟云学术

Local Rademacher complexity bounds based on covering numbers

Published:2016-12 Issue: Volume:218 Page:320-330
ISSN:0925-2312
Container-title:Neurocomputing
language:en
Short-container-title:Neurocomputing

Author:

Lei Yunwen,Ding Lixin,Bi Yingzhou

Funder

Science Computing and Intelligent Information Processing of GuangXi higher education key laboratory

Publisher

Elsevier BV

Subject

Artificial Intelligence,Cognitive Neuroscience,Computer Science Applications

Reference42 articles.

1. Rademacher and gaussian complexities: risk bounds and structural results;Bartlett;J. Mach. Learn. Res.,2002

2. Local rademacher complexities;Bartlett;Ann. Stat.,2005

3. Constrained empirical risk minimization framework for distance metric learning;Bian;IEEE Trans. Neural Netw. Learn. Syst.,2012

4. O. Bousquet, Concentration Inequalities and Empirical Processes Theory Applied to the Analysis of Learning Algorithms (Ph.D thesis), Ecole Polytechnique, Paris, 2002.

5. New approaches to statistical learning theory;Bousquet;Ann. Inst. Stat. Math.,2003

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. AUC-Oriented Domain Adaptation: From Theory to Algorithm;IEEE Transactions on Pattern Analysis and Machine Intelligence;2023-12

2. From oracle generalization bound toward empirical inequality;Information Sciences;2023-09

3. Do we really need a new theory to understand over-parameterization?;Neurocomputing;2023-07

4. Optimizing Two-way Partial AUC with an End-to-end Framework;IEEE Transactions on Pattern Analysis and Machine Intelligence;2023

5. Local Rademacher Complexity Machine;Neurocomputing;2019-05