arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2003.00920cs.LGcs.AIstat.ML
收藏

Structured Prediction with Partial Labelling through the Infimum Loss

INRIA(法国国家信息与自动化研究所);Département d’Informatique de l’École Normale Supérieure(巴黎高等师范学院计算机系);PSL Research University(巴黎文理研究大学)

Vivien Cabannes, Alessandro Rudi, Francis Bach

英文摘要:

Annotating datasets is one of the main costs in nowadays supervised learning. The goal of weak supervision is to enable models to learn using only forms of labelling which are cheaper to collect, as partial labelling. This is a type of incomplete annotation where, for each datapoint, supervision is cast as a set of labels containing the real one. The problem of supervised learning with partial labelling has been studied for specific instances such as classification, multi-label, ranking or segmentation, but a general framework is still missing. This paper provides a unified framework based on structured prediction and on the concept of infimum loss to deal with partial labelling over a wide family of learning problems and loss functions. The framework leads naturally to explicit algorithms that can be easily implemented and for which proved statistical consistency and learning rates. Experiments confirm the superiority of the proposed approach over commonly used baselines.

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

↑