Skip to main content
Article thumbnail
Location of Repository

Maximal width learning of binary functions

By Martin Anthony and Joel Ratsaby

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

Topics: QA Mathematics
Publisher: Elsevier
Year: 2010
DOI identifier: 10.1016/j.tcs.2009.09.020
OAI identifier: oai:eprints.lse.ac.uk:28573
Provided by: LSE Research Online
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://www.elsevier.com/locate... (external link)
  • http://eprints.lse.ac.uk/28573... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.