CiteULike is a free online bibliography manager. Register and you can start organising your references online.
Tags

Sparse Algorithms Are Not Stable: A No-Free-Lunch Theorem

by: Huan Xu, C. Caramanis, S. Mannor
Pattern Analysis and Machine Intelligence, IEEE Transactions on, Vol. 34, No. 1. (January 2012), pp. 187-193, doi:10.1109/tpami.2011.177  Key: citeulike:12049787

Formatted Citation


Show HTML

Likes (beta)

This copy of the article hasn't been liked by anyone yet.

View FullText article


Abstract

We consider two desired properties of learning algorithms: sparsity and algorithmic stability. Both properties are believed to lead to good generalization ability. We show that these two properties are fundamentally at odds with each other: A sparse algorithm cannot be stable and vice versa. Thus, one has to trade off sparsity and stability in designing a learning algorithm. In particular, our general result implies that ℓ


eaduenez's tags for this article

Citations (CiTO)

No CiTO relationships defined

X There are no reviews yet

X Find related articles with these CiteULike tags

X Posting History


X Export records

Privacy Statement | Terms & Conditions
CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.