BriefGPT.xyz
Aug, 2016
可扩展的学习非可分解目标
Large-scale Learning With Global Non-Decomposable Objectives
HTML
PDF
Elad ET. Eban, Mariano Schain, Ariel Gordon, Rif A. Saurous, Gal Elidan
TL;DR
本研究提出了一种统一的框架,使用简单的构建块限制,允许对各种基于排名的目标进行高度可扩展的优化,并在多个实际检索问题上展示了我们方法的优势,同时在性能和精度方面显著改进了基线。
Abstract
Modern
retrieval systems
are often driven by an underlying
machine learning
model. The goal of such systems is to identify and possibly rank the few most relevant items for a given query or context. Thus, the obj
→