Learning with sample dependent hypothesis spaces

✍ Scribed by Qiang Wu; Ding-Xuan Zhou

• Book ID: 104008358
• Publisher: Elsevier Science
• Year: 2008
• Tongue: English
• Weight: 695 KB
• Volume: 56
• Category: Article
• ISSN: 0898-1221
• DOI: 10.1016/j.camwa.2008.09.014

✦ Synopsis

Many learning algorithms use hypothesis spaces which are trained from samples, but little theoretical work has been devoted to the study of these algorithms. In this paper we show that mathematical analysis for these algorithms is essentially different from that for algorithms with hypothesis spaces independent of the sample or depending only on the sample size. The difficulty lies in the lack of a proper characterization of approximation error. To overcome this difficulty, we propose an idea of using a larger function class (not necessarily linear space) containing the union of all possible hypothesis spaces (varying with the sample) to measure the approximation ability of the algorithm. We show how this idea provides error analysis for two particular classes of learning algorithms in kernel methods: learning the kernel via regularization and coefficient based regularization. We demonstrate the power of this approach by its wide applicability.