期刊
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
卷 34, 期 1, 页码 187-193出版社
IEEE COMPUTER SOC
DOI: 10.1109/TPAMI.2011.177
关键词
Stability; sparsity; Lasso; regularization
资金
- NUS [R-265-000-384-133]
- US National Science Foundation (NSF) [EFRI-0735905, CNS-0721532, CNS-0831580]
- DTRA [HDTRA1-08-0029]
- Israel Science Foundation [890015]
- Directorate For Engineering [1056028] Funding Source: National Science Foundation
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 l(1)-regularized regression (Lasso) cannot be stable, while l(2)-regularized regression is known to have strong stability properties and is therefore not sparse.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据