A General Greedy Approximation Algorithm With Applications

Download Now Free registration required

Executive Summary

Greedy approximation algorithms have been frequently used to obtain sparse solutions to learning problems. This paper presents a general greedy algorithm for solving a class of convex optimization problems. This paper derives a bound on the rate of approximation for this algorithm, and show that the algorithm includes a number of earlier studies as special cases.

  • Format: PDF
  • Size: 84.1 KB