The learning complexity of smooth functions of a single variable

  • Authors:
  • Don Kimber;Philip M. Long

  • Affiliations:
  • Xerox Palo Alto Research Center, 3333 Coyote Hill Road, Palo Alto, CA;Computer Science Department, UC Santa Cruz, Santa Cruz, CA

  • Venue:
  • COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
  • Year:
  • 1992

Quantified Score

Hi-index 0.00

Visualization

Abstract

We study the on-line learning of classes of functions of a single real variable formed through bounds on various norms of functions' derivatives. We determine the best bounds obtainable on the worst-case sum of squared errors (also “absolute” errors) for several such classes.