SLiMFast: Guaranteed Results for Data Fusion and Source Reliability
Open accessThe DOI matches its Crossref record.
Abstract
We focus on data fusion, i.e., the problem of unifying conflicting data from data sources into a single representation by estimating the source accuracies. We propose SLiMFast, a framework that expresses data fusion as a statistical learning problem over discriminative probabilistic models, which in many cases correspond to logistic regression. In contrast to previous approaches that use complex generative models, discriminative models make fewer distributional assumptions over data sources and allow us to obtain rigorous theoretical guarantees. Furthermore, we show how SLiMFast enables incorporating domain knowledge into data fusion, yielding accuracy improvements of up to 50% over state-of-the-art baselines. Building upon our theoretical results, we design an optimizer that obviates the need for users to manually select an algorithm for learning SLiMFast's parameters. We validate our optimizer on multiple real-world datasets and show that it can accurately predict the learning algorithm that yields the best data fusion results.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
No references could be resolved yet.
Research works printed but not linked: 39
- 10.14778/2856318.2856328 · DOI
- 10.1561/2200000015 · DOI · Paper page
- S. H. Bach , M. Broecheler , B. Huang , and L. Getoor . Hinge-loss markov random fields and probabilistic soft logic. CoRR, abs/1505.04406 , 2015 . S. H. Bach, M. Broecheler, B. Huang, and L. Getoor. Hinge-loss markov random fields and probabilistic soft logic. CoRR, abs/1505.04406, 2015. · arXiv
- 10.1145/1456650.1456651 · DOI · Paper page
- 10.1109/TIT.2010.2044061 · DOI · Paper page
- 10.1145/2488388.2488414 · DOI · Paper page
- 10.14778/1687627.1687690 · DOI · Paper page
- 10.14778/2732951.2732962 · DOI · Paper page
- 10.14778/2777598.2777603 · DOI · Paper page
- 10.14778/2535568.2448938 · DOI
- 10.1007/978-3-031-01853-4 · DOI · Paper page
- 10.1145/1718487.1718504 · DOI · Paper page
- 10.1145/2487575.2487595 · DOI
- 10.1109/ICDE.2015.7113284 · DOI
- 10.1162/neco.1994.6.2.181 · DOI · Paper page
- D. Karger , S. Oh , and D. Shah . Iterative learning for reliable crowd sourcing systems . In NIPS , pages 1953 -- 1961 . 2011 . D. Karger, S. Oh, and D. Shah. Iterative learning for reliable crowd sourcing systems. In NIPS, pages 1953--1961. 2011.
- K. Leetaru and P. Schrodt . GDELT: Global Database of Events, Language, and Tone . In ISA Annual Convention , 2013 . K. Leetaru and P. Schrodt. GDELT: Global Database of Events, Language, and Tone. In ISA Annual Convention, 2013.
- 10.14778/2735496.2735505 · DOI · Paper page
- 10.1145/2588555.2610509 · DOI · Paper page
- 10.14778/2535568.2448943 · DOI · Paper page
- 10.1145/2897350.2897352 · DOI · Paper page
- 10.5555/541177 · doi:10.5555/541177
- A. Y. Ng and M. I. Jordan . On discriminative vs. generative classifiers: A comparison of logistic regression and naive bayes . In NIPS , pages 841 -- 848 . MIT Press , 2002 . A. Y. Ng and M. I. Jordan. On discriminative vs. generative classifiers: A comparison of logistic regression and naive bayes. In NIPS, pages 841--848. MIT Press, 2002.
- J. Pasternack and D. Roth . Knowing what to believe (when you already know something) . In COLING , pages 877 -- 885 , 2010 . J. Pasternack and D. Roth. Knowing what to believe (when you already know something). In COLING, pages 877--885, 2010.
- 10.1145/2488388.2488476 · DOI · Paper page
- A. B. Patel , T. Nguyen , and R. G. Baraniuk . A probabilistic theory of deep learning. arXiv preprint arXiv:1504.00641 , 2015 . A. B. Patel, T. Nguyen, and R. G. Baraniuk. A probabilistic theory of deep learning. arXiv preprint arXiv:1504.00641, 2015. · arXiv
- 10.1109/MIS.2015.74 · doi:10.1109/mis.2015.74
- 10.1145/2588555.2610504 · DOI
- 10.1137/1.9781611974010.43 · DOI
- C. D. Sa , C. Ré , and K. Olukotun . Global convergence of stochastic gradient descent for some non-convex matrix problems . In ICML , pages 2332 -- 2341 , 2015 . C. D. Sa, C. Ré, and K. Olukotun. Global convergence of stochastic gradient descent for some non-convex matrix problems. In ICML, pages 2332--2341, 2015.
- 10.14778/2809974.2809991 · DOI · Paper page
- R. Tibshirani . Regression shrinkage and selection via the lasso. Journal of the Royal Statistical Society , Series B , pages 267 -- 288 , 1994 . R. Tibshirani. Regression shrinkage and selection via the lasso. Journal of the Royal Statistical Society, Series B, pages 267--288, 1994.
- C. J. Wu . On the convergence properties of the EM algorithm. The Annals of statistics , pages 95 -- 103 , 1983 . C. J. Wu. On the convergence properties of the EM algorithm. The Annals of statistics, pages 95--103, 1983.
- 10.1145/1281192.1281309 · DOI · Paper page
- 10.1145/1963405.1963439 · DOI · Paper page
- 10.14778/2732977.2733001 · DOI
- Y. Zhang , X. Chen , D. Zhou , and M. I. Jordan . Spectral methods meet EM: A provably optimal algorithm for crowdsourcing . In NIPS , pages 1260 -- 1268 . 2014 . Y. Zhang, X. Chen, D. Zhou, and M. I. Jordan. Spectral methods meet EM: A provably optimal algorithm for crowdsourcing. In NIPS, pages 1260--1268. 2014.
- 10.14778/2168651.2168656 · DOI · Paper page
- 10.1145/2661829.2661892 · DOI · Paper page
Cited by
On the Opportunities and Risks of Foundation Models
Bommasani, R., Hudson, D. A., Adeli, E., Altman, R., Arora, S., von Arx, S., Bernstein, M. S., Bohg, J., Bosselut, A., Brunskill, E., et al. (2021) · arXiv · doi:10.48550/arxiv.2108.07258 · Cited by 2,676
Self-citationSnorkel: rapid training data creation with weak supervision
Ratner, A., Bach, S. H., Ehrenberg, H., Fries, J., Wu, S., & Ré, C. (2017) · Proceedings of the VLDB Endowment · doi:10.14778/3157794.3157797 · Cited by 777
Self-citationHoloClean: holistic data repairs with probabilistic inference
Rekatsinas, T., Chu, X., Ilyas, I. F., & Ré, C. (2017) · Proceedings of the VLDB Endowment · doi:10.14778/3137628.3137631 · Cited by 480
Self-citationSnorkel DryBell: A Case Study in Deploying Weak Supervision at Industrial Scale
Bach, S. H., Rodriguez, D., Liu, Y., Luo, C., Shao, H., Xia, C., Sen, S., Ratner, A., Hancock, B., Alborzi, H., et al. (2019) · Proceedings of the 2019 International Conference on Management of Data · doi:10.1145/3299869.3314036 · Cited by 118
Self-citationSnorkel MeTaL: Weak Supervision for Multi-Task Learning
Ratner, A., Hancock, B., Dunnmon, J., Goldman, R., & Ré, C. (2018) · Proceedings of the Second Workshop on Data Management for End-To-End Machine Learning · doi:10.1145/3209889.3209898 · Cited by 43
Self-citation
Metadata
- Authors
- Rekatsinas, T., Joglekar, M., Garcia-Molina, H., Parameswaran, A., & Ré, C.
- Venue
- Proceedings of the 2017 ACM International Conference on Management of Data
- Publisher
- ACM
- Published
- 2017-05-09
- Pages
- 1399-1414
- OpenAlex
- W2404544029
- Cited by
- 60
- References
- 0
- FWCI
- 4.57
- Type
- conference paper
- Language
- en
- Open access
- gold
- Funders
- Defense Advanced Research Projects Agency (N66001-15- C-4043)
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.