Author:
Blanchard G.,Schäfer C.,Rozenholc Y.,Müller K.-R.
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Software
Reference22 articles.
1. Adelson-Velskii, G. M., & Landis, E. M. (1962). An algorithm for the organization of information. Soviet Math. Doclady, 3, 1259–1263.
2. Barron, A., Birgé, L., & Massart, P. (1999). Risk bounds for model selection via penalization. Probability Theory and Related Fields, 113, 301–413.
3. Barron, A., & Sheu, C. (1991). Approximation of density functions by sequences of exponential families. Annals of Statistics, 19, 1347–1369.
4. Bartlett, P., Bousquet, O., & Mendelson, S. (2005). Local Rademacher complexities. Annals of Statistics, 33(4), 1497–1537.
5. Blanchard, G. (2004). Different paradigms for choosing sequential reweighting algorithms. Neural Computation, 16, 811–836.
Cited by
22 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献