Local algorithms for pattern recognition and dependencies estimation

  • Authors:
  • V. Vapnik;L. Bottou

  • Affiliations:
  • -;-

  • Venue:
  • Neural Computation
  • Year:
  • 1993

Quantified Score

Hi-index 0.06

Visualization

Abstract

In previous publications (Bottou and Vapnik 1992; Vapnik 1992)we described local learning algorithms, which result in performanceimprovements for real problems. We present here the theoreticalframework on which these algorithms are based. First, we present anew statement of certain learning problems, namely the local riskminimization. We review the basic results of the uniformconvergence theory of learning, and extend these results to localrisk minimization. We also extend the structural risk minimizationprinciple for both pattern recognition problems and regressionproblems. This extended induction principle is the basis for a newclass of algorithms.