Task agnostic robust learning on corrupt outputs by correlation-guided mixture density networks

6Citations
Citations of this article
144Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we focus on weakly supervised learning with noisy training data for both classification and regression problems. We assume that the training outputs are collected from a mixture of a target and correlated noise distributions. Our proposed method simultaneously estimates the target distribution and the quality of each data which is defined as the correlation between the target and data generating distributions. The cornerstone of the proposed method is a Cholesky Block that enables modeling dependencies among mixture distributions in a differentiable manner where we maintain the distribution over the network weights. We first provide illustrative examples in both regression and classification tasks to show the effectiveness of the proposed method. Then, the proposed method is extensively evaluated in a number of experiments where we show that it constantly shows comparable or superior performances compared to existing baseline methods in the handling of noisy data.

Cite

CITATION STYLE

APA

Choi, S., Hong, S., Lim, S., & Lee, K. (2020). Task agnostic robust learning on corrupt outputs by correlation-guided mixture density networks. In Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition (pp. 3871–3880). IEEE Computer Society. https://doi.org/10.1109/CVPR42600.2020.00393

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free