arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1907.01121cs.LGstat.ML
收藏

稀疏范数问题的迭代重加权方法

An Iteratively Re-weighted Method for Problems with Sparsity-Inducing Norms

Northwestern Polytechnical University(西北工业大学);University of Pittsburgh(匹兹堡大学)

Feiping Nie, Zhanxuan Hu, Xiaoqian Wang, Rong Wang, Xuelong Li, Heng Huang

摘要:

针对多任务学习、子空间聚类、特征选择、鲁棒主成分分析等机器学习任务中经常遇到的稀疏范数难以处理的问题,提出了一种具有可靠收敛保证的迭代重加权方法(IRW).我们研究其收敛速度,通过大量的实验上的真实数据。此外,为了验证IRW的实用性,我们使用它来解决一个具体的鲁棒特征选择模型,具有复杂的目标函数。实验结果表明,该模型与所提出的优化方法相结合,显着优于替代方法。

英文摘要:

This work aims at solving the problems with intractable sparsity-inducing norms that are often encountered in various machine learning tasks, such as multi-task learning, subspace clustering, feature selection, robust principal component analysis, and so on. Specifically, an Iteratively Re-Weighted method (IRW) with solid convergence guarantee is provided. We investigate its convergence speed via numerous experiments on real data. Furthermore, in order to validate the practicality of IRW, we use it to solve a concrete robust feature selection model with complicated objective function. The experimental results show that the model coupled with proposed optimization method outperforms alternative methods significantly.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑