Comparing the Value of Labeled and Unlabeled Data in Method-of-Moments Latent Variable Estimation
Not on the map. Why?
Abstract (arXiv)
Labeling data for modern machine learning is expensive and time-consuming. Latent variable models can be used to infer labels from weaker, easier-to-acquire sources operating on unlabeled data. Such models can also be trained using labeled data, presenting a key question: should a user invest in few labeled or many unlabeled points? We answer this via a framework centered on model misspecification in method-of-moments latent variable estimation. Our core result is a bias-variance decomposition of the generalization error, which shows that the unlabeled-only approach incurs additional bias under misspecification. We then introduce a correction that provably removes this bias in certain cases. We apply our decomposition framework to three scenarios -- well-specified, misspecified, and corrected models -- to 1) choose between labeled and unlabeled data and 2) learn from their combination. We observe theoretically and with synthetic experiments that for well-specified models, labeled points are worth a constant factor more than unlabeled points. With misspecification, however, their relative value is higher due to the additional bias but can be reduced with correction. We also apply our approach to study real-world weak supervision techniques for dataset construction.
Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 12 of its 38 references that are in the map. First posted on arXiv 3 Mar 2021.
Builds on
12 of 38 references.
References · 12
- 2019Data Shapley: Equitable Valuation of Data for Machine Learningcited by 617
- 2019Towards Efficient Data Valuation Based on the Shapley Valuecited by 279
- 2016Data Programming: Creating Large Training Sets, Quicklycited by 246
- 2020Rethinking Bias-Variance Trade-off for Generalization of Neural Networkscited by 107
- 2018Training Complex Models with Multi-Task Weak Supervisioncited by 106
- 2020Fast and Three-rious: Speeding Up Weak Supervision with Triplet Methodscited by 98
- 2014Inconsistency of Bayesian Inference for Misspecified Linear Models, and a Proposal for Repairing Itcited by 92
- 2017Learning the Structure of Generative Models without Labeled Datacited by 50
- 2019Learning Dependency Structures for Weak Supervision Modelscited by 32
- 2014Learning Latent Variable Gaussian Graphical Modelscited by 8
- 2014Evaluating the Crowd with Confidencecited by 4
- 2015On model misspecification and KL separation for Gaussian graphical modelscited by 4
Built on by
Citing papers per year: 2021: 2; 2022: 4; 2023: 0; 2024: 1.
7 papers.
- 2021End-to-End Weak Supervisioncited by 33
- 2021Universalizing Weak Supervisioncited by 27
- 2022Shoring Up the Foundations: Fusing Model Embeddings and Weak Supervisioncited by 18
- 2022Losses over Labels: Weakly Supervised Learning via Direct Loss Constructioncited by 11
- 2022Data Consistency for Weakly Supervised Learningcited by 2
- 2022Generative Modeling Helps Weak Supervision (and Vice Versa)cited by 0
- 2024Empirical Analysis for Unsupervised Universal Dependency Parse Tree Aggregationcited by 0
- 2024Empirical Analysis for Unsupervised Universal Dependency Parse Tree Aggregation28 Mar 2024
- 2022Losses over Labels: Weakly Supervised Learning via Direct Loss Construction13 Dec 2022
- 2022Shoring Up the Foundations: Fusing Model Embeddings and Weak Supervision24 Mar 2022
- 2022Generative Modeling Helps Weak Supervision (and Vice Versa)22 Mar 2022
- 2022Data Consistency for Weakly Supervised Learning8 Feb 2022
- 2021Universalizing Weak Supervision7 Dec 2021
- 2021End-to-End Weak Supervision5 Jul 2021