Library Header Image
LSE Research Online LSE Library Services

Maximal width learning of binary functions

Anthony, Martin and Ratsaby, Joel (2010) Maximal width learning of binary functions. Theoretical Computer Science, 411 (1). pp. 138-147. ISSN 0304-3975

Full text not available from this repository.

Identification Number: 10.1016/j.tcs.2009.09.020


This paper concerns learning binary-valued functions defined on, and investigates how a particular type of ‘regularity’ of hypotheses can be used to obtain better generalization error bounds. We derive error bounds that depend on the sample width (a notion analogous to that of sample margin for real-valued functions). This motivates learning algorithms that seek to maximize sample width.

Item Type: Article
Official URL:
Additional Information: © 2009 Elsevier
Divisions: Mathematics
Subjects: Q Science > QA Mathematics
Date Deposited: 11 Aug 2010 11:15
Last Modified: 20 Jul 2021 00:50

Actions (login required)

View Item View Item