arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1803.03319cs.LGstat.ML
收藏

图上基于损失的高效极端分类解码

Efficient Loss-Based Decoding on Graphs For Extreme Classification

The Technion(以色列理工学院)

Itay Evron, Edward Moroshko, Koby Crammer

摘要:

在极端分类问题中,需要学习算法将实例从极大的标签集中映射到标签。我们建立在最近的极端分类框架与对数时间和空间,并在一个一般的方法纠错输出编码(ECOC)与基于损失的解码,并介绍了一个灵活和有效的方法,伴随着理论界。我们的框架采用了由图诱导的输出代码,我们展示了如何执行有效的基于丢失的解码以潜在地提高准确性。此外,我们的框架提供了准确性,模型大小和预测时间之间的权衡。我们展示了如何只使用训练数据来找到这种权衡的最佳点。我们的实验研究证明了我们的假设和索赔的有效性,并表明,我们的方法是具有竞争力的国家的最先进的算法。

英文摘要:

In extreme classification problems, learning algorithms are required to map instances to labels from an extremely large label set. We build on a recent extreme classification framework with logarithmic time and space, and on a general approach for error correcting output coding (ECOC) with loss-based decoding, and introduce a flexible and efficient approach accompanied by theoretical bounds. Our framework employs output codes induced by graphs, for which we show how to perform efficient loss-based decoding to potentially improve accuracy. In addition, our framework offers a tradeoff between accuracy, model size and prediction time. We show how to find the sweet spot of this tradeoff using only the training data. Our experimental study demonstrates the validity of our assumptions and claims, and shows that our method is competitive with state-of-the-art algorithms.

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

↑