The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Learning from Multiple Sources
Open accessAbstract
We consider the problem of learning accurate models from multiple sources of"nearby " data. Given distinct samples from multiple data sources and estimates of the dissimilarities between these sources, we provide a general theory of whichsamples should be used to learn models for each source. This theory is applicable in a broad decision-theoretic learning framework, and yields results for classifi-cation and regression generally, and for density estimation within the exponential family. A key component of our approach is the development of approximatetriangle inequalities for expected loss, which may be of independent interest.
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
Wu, Y. (1999) · Technometrics · doi:10.1080/00401706.1999.10485951 · Cited by 27,221
Probability Inequalities for sums of Bounded Random Variables
Hoeffding, W. (1994) · Springer Series in Statistics · doi:10.1007/978-1-4612-0865-5_26 · Cited by 6,666
Graphical Models, Exponential Families, and Variational Inference
Wainwright, M. J., & Jordan, M. I. (2007) · now publishers, Inc. eBooks · doi:10.1561/9781601981851 · Cited by 2,959
Rademacher and Gaussian Complexities: Risk Bounds and Structural Results
Bartlett, P. L., & Mendelson, S. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44581-1_15 · Cited by 1,949
On the method of bounded differences
McDiarmid, C. (1989) · Surveys in Combinatorics, 1989 · doi:10.1017/cbo9781107359949.008 · Cited by 1,425
Neural network learning theoretical foundations
Anthony, M., & Bartlett, P. L. (2009) · Cited by 1,310
Decision theoretic generalizations of the PAC model for neural net and other learning applications
Haussler, D. (1992) · Information and Computation · doi:10.1016/0890-5401(92)90010-d · Cited by 843
Parallel optimization: Theory, algorithms, and applications
(1998) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(98)90713-1 · Cited by 813
Exploiting Task Relatedness for Multiple Task Learning
Ben-David, S., & Schuller, R. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45167-9_41 · Cited by 425
Learning Bounds for Domain Adaptation
Blitzer, J. C., Crammer, K., Kulesza, A., Pereira, F. M. B., & Wortman, J. R. (2007) · Cited by 393
Self-citationRademacher penalties and structural risk minimization
Koltchinskii, V. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.930926 · Cited by 373
Efficient distribution-free learning of probabilistic concepts
Kearns, M. J., & Schapire, R. E. (1994) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(05)80062-5 · Cited by 373
Self-citationImproving SVM accuracy by training on auxiliary data sources
Wu, P., & Dietterich, T. G. (2004) · Twenty-first international conference on Machine learning - ICML '04 · doi:10.1145/1015330.1015436 · Cited by 301
Learning Internal Representations
Baxter, J. (1995) · Cited by 211
Rademacher Processes and Bounding the Risk of Function Learning
Koltchinskii, V., & Panchenko, D. (2000) · High Dimensional Probability II · doi:10.1007/978-1-4612-1358-1_29 · Cited by 209
Model Selection and Error EstimationPreprint
Bartlett, P. L., Boucheron, S., & Lugosi, G. (2000) · SSRN Electronic Journal · doi:10.2139/ssrn.248567 · Cited by 88
Algorithmic Stability and Meta-Learning
Maurer, A. (2005) · doi:10.5555/1046920.1088705 · Cited by 83
Learning from data of variable quality
Crammer, K., Kearns, M. J., & Wortman, J. (1995) · Cited by 31
Self-citation
Cited by
A theory of learning from different domains
Ben-David, S., Blitzer, J., Crammer, K., Kulesza, A., Pereira, F., & Vaughan, J. W. (2010) · Machine Learning · doi:10.1007/s10994-009-5152-4 · Cited by 3,515
Self-citationMoment Matching for Multi-Source Domain Adaptation
Peng, X., Bai, Q., Xia, X., Huang, Z., Saenko, K., & Wang, B. (2019) · 2019 IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2019.00149 · Cited by 1,621
(2008) · Cited by 436
Domain Adaptation From Multiple Sources: A Domain-Dependent Regularization Approach
Duan, L., Xu, D., & Tsang, I. W. (2012) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2011.2178556 · Cited by 332
Knowledge transfer via multiple model local structure mapping
Gao, J., Fan, W., Jiang, J., & Han, J. (2008) · Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1401890.1401928 · Cited by 330
Metadata
- Authors
- Crammer, K., Kearns, M., & Wortman, J.
- Venue
- Advances in Neural Information Processing Systems 19
- Publisher
- The MIT Press
- Published
- 2007-09-07
- Volume
- 19
- Pages
- 321-328
- OpenAlex
- W2142604614
- Cited by
- 266
- References
- 18
- FWCI
- 15.35
- Type
- book chapter
- Language
- en
- Open access
- green
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.