arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1810.05992stat.MLcs.LG
收藏

近似最优Lasso解的凸壳逼近

Convex Hull Approximation of Nearly Optimal Lasso Solutions

Osaka University(大阪大学);RIKEN AIP(理化学研究所人工智能研究中心)

Satoshi Hara, Takanori Maehara

摘要:

在一个普通的特征选择过程中,一组重要的功能是通过解决一个优化问题,如拉索回归问题,我们希望得到的功能很好地解释数据。在这项研究中,而不是单一的最佳解决方案,我们考虑找到一组不同的,但接近最佳的解决方案。为此,我们制定的问题,找到一个小数目的解决方案,使这些解决方案的凸包近似的一组接近最优的解决方案。该算法包括两个步骤:首先,我们随机抽样的极值点的近最优解集。然后,我们使用贪婪算法选择少量的点。实验结果表明,该算法能够很好地逼近解集.结果还表明,我们可以获得具有较大多样性的Lasso解。

英文摘要:

In an ordinary feature selection procedure, a set of important features is obtained by solving an optimization problem such as the Lasso regression problem, and we expect that the obtained features explain the data well. In this study, instead of the single optimal solution, we consider finding a set of diverse yet nearly optimal solutions. To this end, we formulate the problem as finding a small number of solutions such that the convex hull of these solutions approximates the set of nearly optimal solutions. The proposed algorithm consists of two steps: First, we randomly sample the extreme points of the set of nearly optimal solutions. Then, we select a small number of points using a greedy algorithm. The experimental results indicate that the proposed algorithm can approximate the solution set well. The results also indicate that we can obtain Lasso solutions with a large diversity.

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

↑