ML Anthology

A General Greedy Approximation Algorithm with Applications

T. Zhang
NeurIPS 2001 pp. 1065-1072
/neurips/2001/zhang2001neurips-general/

Abstract

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

PDF NeurIPS Semantic Scholar

Cite

Text

Zhang. "A General Greedy Approximation Algorithm with Applications." Neural Information Processing Systems, 2001.

Markdown

[Zhang. "A General Greedy Approximation Algorithm with Applications." Neural Information Processing Systems, 2001.](https://mlanthology.org/neurips/2001/zhang2001neurips-general/)

BibTeX

@inproceedings{zhang2001neurips-general,
  title     = {{A General Greedy Approximation Algorithm with Applications}},
  author    = {Zhang, T.},
  booktitle = {Neural Information Processing Systems},
  year      = {2001},
  pages     = {1065-1072},
  url       = {https://mlanthology.org/neurips/2001/zhang2001neurips-general/}
}