交互式决策中不同支持向量的枚举
Enumeration of Distinct Support Vectors for Interactive Decision Making
摘要:
在常规预测任务中,机器学习算法输出全局优化其目标函数的单个最佳模型,该目标函数通常是准确性。因此,用户无法显式访问其他模型。与此相反,多模型枚举在非标准机器学习应用中吸引了越来越多的兴趣,其中其他标准,例如,可解释性或公平性比准确性更重要,且用户可能想要访问多于一个非最佳但合适模型。本文提出了一种支持向量机(SVM)的K-best模型枚举算法,给定数据集S和整数K>0,在对偶SVM问题中,按目标函数值降序枚举S上具有不同支持向量的K-best模型。基于对支持向量的格型结构的分析,我们的算法有效地找到了下一个最好的模型,具有较小的延迟。这在支持用户交互式检查他们对枚举模型的需求时很有用。通过在真实数据集上的实验,我们评估了我们的算法的效率和实用性。
英文摘要:
In conventional prediction tasks, a machine learning algorithm outputs a single best model that globally optimizes its objective function, which typically is accuracy. Therefore, users cannot access the other models explicitly. In contrast to this, multiple model enumeration attracts increasing interests in non-standard machine learning applications where other criteria, e.g., interpretability or fairness, than accuracy are main concern and a user may want to access more than one non-optimal, but suitable models. In this paper, we propose a K-best model enumeration algorithm for Support Vector Machines (SVM) that given a dataset S and an integer K>0, enumerates the K-best models on S with distinct support vectors in the descending order of the objective function values in the dual SVM problem. Based on analysis of the lattice structure of support vectors, our algorithm efficiently finds the next best model with small latency. This is useful in supporting users's interactive examination of their requirements on enumerated models. By experiments on real datasets, we evaluated the efficiency and usefulness of our algorithm.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。