Learning from Rules Generalizing Labeled Exemplars

FOS: Computer and information sciences Computer Science - Machine Learning Computer Science - Computation and Language Statistics - Machine Learning Machine Learning (stat.ML) 01 natural sciences Computation and Language (cs.CL) 0105 earth and related environmental sciences Machine Learning (cs.LG)
DOI: 10.48550/arxiv.2004.06025 Publication Date: 2020-01-01
ABSTRACT
In many applications labeled data is not readily available, and needs to be collected via pain-staking human supervision. We propose a rule-exemplar method for collecting human supervision to combine the efficiency of rules with the quality of instance labels. The supervision is coupled such that it is both natural for humans and synergistic for learning. We propose a training algorithm that jointly denoises rules via latent coverage variables, and trains the model through a soft implication loss over the coverage and label variables. The denoised rules and trained model are used jointly for inference. Empirical evaluation on five different tasks shows that (1) our algorithm is more accurate than several existing methods of learning from a mix of clean and noisy supervision, and (2) the coupled rule-exemplar supervision is effective in denoising rules.<br/>ICLR 2020 (Spotlight)<br/>
SUPPLEMENTAL MATERIAL
Coming soon ....
REFERENCES ()
CITATIONS ()
EXTERNAL LINKS
PlumX Metrics
RECOMMENDATIONS
FAIR ASSESSMENT
Coming soon ....
JUPYTER LAB
Coming soon ....