Maximal width learning of binary functions

Anthony, Martin ORCID: 0000-0002-7796-6044 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.

Author

Identification Number: 10.1016/j.tcs.2009.09.020

Abstract

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:	http://www.elsevier.com/locate/tcs
Additional Information:	© 2009 Elsevier
Divisions:	Mathematics
Subjects:	Q Science > QA Mathematics
Date Deposited:	11 Aug 2010 11:15
Last Modified:	11 Dec 2024 23:40
URI:	http://eprints.lse.ac.uk/id/eprint/28573

Actions (login required)

View Item