paper-with-me

홈 › Papers

Structured Prediction with Partial Labelling through the Infimum Loss

2020-03-02 · ICML 2020 1 · 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.

📄 PDF Abstract BibTeX arXiv:2003.00920

Code (2)

VivienCabannes/infimum_loss 공식 구현
VivienCabannes/partial_labelling 공식 구현

Tasks

Structured Prediction

Similar Papers 제목 키워드 기반

Risk Minimization in Structured Prediction using Orbit Loss

2015-12-07 · Danny Karmon, Joseph Keshet

We introduce a new surrogate loss function called orbit loss in the structured prediction framework, which has good theoretical and practical advantages. While the orbit loss is not convex, it has a simple analytical gra…

DecoderPredictionStructured Prediction

Deep Functional Maps: Structured Prediction for Dense Shape Correspondence

2017-04-27 · ICCV 2017 10 · Or Litany, Tal Remez, Emanuele Rodolà, Alex M. Bronstein 외

We introduce a new framework for learning dense correspondence between deformable 3D shapes. Existing learning based approaches model shape correspondence as a labelling problem, where each point of a query shape receive…

Structured Prediction

Learning Structured Outputs from Partial Labels using Forest Ensemble

2014-07-24 · Truyen Tran, Dinh Phung, Svetha Venkatesh

Learning structured outputs with general structures is computationally challenging, except for tree-structured models. Thus we propose an efficient boosting-based algorithm AdaBoost.MRF for this task. The idea is based o…

EgoMap: Projective mapping and structured egocentric memory for Deep RL

2020-01-24 · Edward Beeching, Christian Wolf, Jilles Dibangoye, Olivier Simonin

Tasks involving localization, memorization and planning in partially observable 3D environments are an ongoing challenge in Deep Reinforcement Learning. We present EgoMap, a spatially structured neural memory architectur…

Deep Reinforcement LearningMemorizationreinforcement-learningReinforcement Learning+1

Partially Hidden Markov Chain Linear Autoregressive model: inference and forecasting

2021-02-24 · Fatoumata Dama, Christine Sinoquet

Time series subject to change in regime have attracted much interest in domains such as econometry, finance or meteorology. For discrete-valued regimes, some models such as the popular Hidden Markov Chain (HMC) describe …

Model SelectionTime SeriesTime Series Analysis