arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1310.2880stat.MLcs.CVcs.LGmath.STstat.TH
收藏

用于计算机视觉和大数据学习的退火特征选择

Feature Selection with Annealing for Computer Vision and Big Data Learning

Florida State University(佛罗里达州立大学)

Adrian Barbu, Yiyuan She, Liangjing Ding, Gary Gramajo

摘要:

许多计算机视觉和医学成像问题都面临着从大规模数据集中学习的问题,这些数据集包含数百万个观察和特征。在本文中,我们提出了一种新的有效的学习计划,收紧稀疏性约束逐步删除变量的基础上的标准和时间表。在整个迭代过程中,问题大小不断下降,这一有吸引力的事实使其特别适合大数据学习。我们的方法一般适用于任何可微损失函数的优化,并发现在回归,分类和排名的应用。由此产生的算法建立变量筛选到估计,是非常简单的实现。我们提供了理论保证的收敛性和选择的一致性。此外,一维分段线性响应函数被用来考虑非线性和二阶先验施加在这些功能,以避免过拟合。在真实数据和合成数据上的实验表明,该方法在回归、分类和排序等方面与其他方法相比具有很好的性能,同时计算效率高,可扩展性好。

英文摘要:

Many computer vision and medical imaging problems are faced with learning from large-scale datasets, with millions of observations and features. In this paper we propose a novel efficient learning scheme that tightens a sparsity constraint by gradually removing variables based on a criterion and a schedule. The attractive fact that the problem size keeps dropping throughout the iterations makes it particularly suitable for big data learning. Our approach applies generically to the optimization of any differentiable loss function, and finds applications in regression, classification and ranking. The resultant algorithms build variable screening into estimation and are extremely simple to implement. We provide theoretical guarantees of convergence and selection consistency. In addition, one dimensional piecewise linear response functions are used to account for nonlinearity and a second order prior is imposed on these functions to avoid overfitting. Experiments on real and synthetic data show that the proposed method compares very well with other state of the art methods in regression, classification and ranking while being computationally very efficient and scalable.

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

↑