About This Document
- sl:arxiv_author :
- sl:arxiv_firstAuthor : Alexander Ratner
- sl:arxiv_num : 1605.07723
- sl:arxiv_published : 2016-05-25T04:14:59Z
- sl:arxiv_summary : Large labeled training sets are the critical building blocks of supervised
learning methods and are key enablers of deep learning techniques. For some
applications, creating labeled training sets is the most time-consuming and
expensive part of applying machine learning. We therefore propose a paradigm
for the programmatic creation of training sets called data programming in which
users express weak supervision strategies or domain heuristics as labeling
functions, which are programs that label subsets of the data, but that are
noisy and may conflict. We show that by explicitly representing this training
set labeling process as a generative model, we can \"denoise\" the generated
training set, and establish theoretically that we can recover the parameters of
these generative models in a handful of settings. We then show how to modify a
discriminative loss function to make it noise-aware, and demonstrate our method
over a range of discriminative models including logistic regression and LSTMs.
Experimentally, on the 2014 TAC-KBP Slot Filling challenge, we show that data
programming would have led to a new winning score, and also show that applying
data programming to an LSTM model leads to a TAC-KBP score almost 6 F1 points
over a state-of-the-art LSTM baseline (and into second place in the
competition). Additionally, in initial user studies we observed that data
programming may be an easier way for non-experts to create machine learning
models when training data is limited or unavailable.@en
- sl:arxiv_title : Data Programming: Creating Large Training Sets, Quickly@en
- sl:arxiv_updated : 2017-01-08T19:48:53Z
- sl:bookmarkOf : https://arxiv.org/abs/1605.07723
- sl:creationDate : 2022-12-04
- sl:creationTime : 2022-12-04T22:44:18Z
Documents with similar tags (experimental)
Preferences...