使用符号梯度下降合成用于排序的评分函数
Synthesizing Scoring Functions for Rankings Using Symbolic Gradient Descent
AI总结:
研究在排序函数未知时如何合成重现排序的线性评分函数,提出基于混合整数线性规划的系统RankHow,并引入符号梯度下降近似技术,实验证明其速度与精度均优于现有技术。
摘要:
给定一个关系及其元组的排序,但没有关于排序函数的信息,我们希望合成能够重现该排序的简单评分函数。我们的系统 RankHow 识别能够最小化基于位置的误差的线性评分函数,同时支持对其权重的灵活约束。它基于一种新的公式化方法,即混合整数线性规划(MILP)。虽然 MILP 在一般情况下是 NP 难的,但我们表明,通过将 MILP 问题简化为许多线性规划(LP),RankHow 比一个基于树的算法快几个数量级,该算法保证在输入元组数量上具有多项式时间复杂度(PTIME)。我们假设这是由两个属性引起的:首先,PTIME 算法等价于 MILP 程序的一种朴素评估策略。其次,MILP 求解器依赖高级启发式方法对整个程序进行整体推理,而 PTIME 算法孤立地解决许多子问题。为了进一步提高 RankHow 的可扩展性,我们提出了一种名为符号梯度下降(Sym-GD)的新颖近似技术。它利用问题结构更快地找到误差函数的局部最小值。实验表明,RankHow 能够解决现实问题,找到比现有技术更准确的线性评分函数。
英文摘要:
Given a relation and a ranking of its tuples, but no information about the ranking function, we are interested in synthesizing simple scoring functions that reproduce the ranking. Our system RankHow identifies linear scoring functions that minimize position-based error, while supporting flexible constraints on their weights. It is based on a new formulation as a mixed-integer linear program (MILP). While MILP is NP-hard in general, we show that RankHow is orders of magnitude faster than a tree-based algorithm that guarantees polynomial time complexity (PTIME) in the number of input tuples by reducing the MILP problem to many linear programs (LPs). We hypothesize that this is caused by 2 properties: First, the PTIME algorithm is equivalent to a naive evaluation strategy for the MILP program. Second, MILP solvers rely on advanced heuristics to reason holistically about the entire program, while the PTIME algorithm solves many sub-problems in isolation. To further improve RankHow's scalability, we propose a novel approximation technique called symbolic gradient descent (Sym-GD). It exploits problem structure to more quickly find local minima of the error function. Experiments demonstrate that RankHow can solve realistic problems, finding more accurate linear scoring functions than the state of the art.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。