arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2102.05744math.OCcs.LG
收藏

稠密约束矩阵的最大可行子系统快速解

Faster Maximum Feasible Subsystem Solutions for Dense Constraint Matrices

Carleton University(卡尔顿大学)

Fereshteh Fakhar Firouzeh, John W. Chinneck, Sreeraman Rajan

摘要:

寻找不可行的线性约束集合的最大基数可行子集是最大可行子系统问题(MAX FS)。解决这个问题在机器学习和压缩传感等广泛的应用中至关重要。虽然MAX FS是NP难的,但存在有用的启发式算法,但这些算法对于大型问题可能很慢。我们扩展了密集约束矩阵情况下的现有启发式算法,以大大提高其速度,同时保持或提高解决方案质量。我们测试扩展算法的两个应用程序,具有密集的约束矩阵:二进制分类,压缩感知和稀疏恢复。在这两种情况下,速度大大提高,而不损失准确性。

英文摘要:

Finding the largest cardinality feasible subset of an infeasible set of linear constraints is the Maximum Feasible Subsystem problem (MAX FS). Solving this problem is crucial in a wide range of applications such as machine learning and compressive sensing. Although MAX FS is NP-hard, useful heuristic algorithms exist, but these can be slow for large problems. We extend the existing heuristics for the case of dense constraint matrices to greatly increase their speed while preserving or improving solution quality. We test the extended algorithms on two applications that have dense constraint matrices: binary classification, and sparse recovery in compressive sensing. In both cases, speed is greatly increased with no loss of accuracy.

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

↑