The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
Regularized multi--task learning
Abstract
Past empirical work has shown that learning multiple related tasks from data simultaneously can be advantageous in terms of predictive performance relative to learning these tasks independently. In this paper we present an approach to multi--task learning based on the minimization of regularization functionals similar to existing ones, such as the one for Support Vector Machines (SVMs), that have been successfully used in the past for single--task learning. Our approach allows to model the relation between tasks in terms of a novel kernel function that uses a task--coupling parameter. We implement an instance of the proposed approach similar to SVMs and test it empirically using simulated as well as real data. The experimental results show that the proposed method performs better than existing multi--task learning methods and largely outperforms single--task learning using SVMs.
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
The Nature of Statistical Learning Theory
Vapnik, V. N. (1995) · doi:10.1007/978-1-4757-2440-0 · Cited by 39,138
Wu, Y. (1999) · Technometrics · doi:10.1080/00401706.1999.10485951 · Cited by 27,221
Caruana, R. (1997) · Machine Learning · doi:10.1023/a:1007379606734 · Cited by 6,636
Spline Models for Observational Data
Wahba, G. (1990) · doi:10.1137/1.9781611970128 · Cited by 4,184
Mangasarian, O. L. (1994) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971255 · Cited by 3,220
Hierarchical Mixtures of Experts and the EM Algorithm
Jordan, M. I., & Jacobs, R. A. (1994) · Neural Computation · doi:10.1162/neco.1994.6.2.181 · Cited by 2,673
(1998) · Springer eBooks · doi:10.1007/978-1-4615-5529-2 · Cited by 1,235
Regularization Networks and Support Vector Machines
Evgeniou, T., Pontil, M., & Poggio, T. (2000) · Advances in Computational Mathematics · doi:10.1023/a:1018946025316 · Cited by 1,197
Self-citationMarketing models of consumer heterogeneity
Allenby, G. M., & Rossi, P. E. (1998) · Journal of Econometrics · doi:10.1016/s0304-4076(98)00055-4 · Cited by 785
A Model of Inductive Bias Learning
Baxter, J. (2000) · Cited by 730
A model of inductive bias learning
Baxter, J. (2000) · Journal of Artificial Intelligence Research · doi:10.1613/jair.731 · Cited by 582
Predicting Multivariate Responses in Multiple Linear Regression
Breiman, L., & Friedman, J. H. (1997) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/1467-9868.00054 · Cited by 536
On Learning Vector-Valued Functions
Micchelli, C. A., & Pontil, M. (2005) · Neural Computation · doi:10.1162/0899766052530802 · Cited by 494
Self-citationA Bayesian/Information Theoretic Model of Learning to Learn via Multiple Task Sampling
Baxter, J. (1997) · Machine Learning · doi:10.1023/a:1007327622663 · Cited by 462
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
Modeling Consumer Demand for Variety
Kim, J., Allenby, G. M., & Rossi, P. E. (2002) · Marketing Science · doi:10.1287/mksc.21.3.229.143 · Cited by 414
A Hierarchical Bayes Model of Primary and Secondary Demand
Arora, N., Allenby, G. M., & Ginter, J. L. (1998) · Marketing Science · doi:10.1287/mksc.17.1.29 · Cited by 206
(2000) · CrossRef Listing of Deleted DOIs · doi:10.1162/153244304322765658 · Cited by 192
Improving Parameter Estimates and Model Prediction by Aggregate Customization in Choice Experiments
Arora, N., & Huber, J. C. (2001) · Journal of Consumer Research · doi:10.1086/322902 · Cited by 130
Categorization by Learning and Combining Object Parts
Heisele, B., Serre, T., Pontil, M., Vetter, T. R., & Poggio, T. (2001) · Cited by 118
Self-citationAdaptive Multivariate Ridge Regression
Brown, P. J., & Zidek, J. V. (1980) · The Annals of Statistics · doi:10.1214/aos/1176344891 · Cited by 108
Empirical Bayes for Learning to Learn
Heskes, T. (2000) · Radboud Repository (Radboud University) · doi:10.5555/645529.658133 · Cited by 98
SILVER, D. L. (1996) · Connection Science · doi:10.1080/095400996116929 · Cited by 72
Clustering Learning Tasks and the Selective Cross-Task Transfer of Knowledge
Thrun, S., & O’Sullivan, J. A. (1998) · Springer eBooks · doi:10.1007/978-1-4615-5529-2_10 · Cited by 71
Silver, D. L., & Mercer, R. E. (1996) · Springer eBooks · doi:10.1007/978-1-4615-5529-2_9 · Cited by 70
A theoretical framework for learning from a pool of disparate data sources
Ben-David, S., Gehrke, J. E., & Schuller, R. (2002) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/775047.775111 · Cited by 69
A model of inductive bias learning
BaxterJonathan (2000) · doi:10.5555/1622248.1622254 · Cited by 24
(1998)
Cited by
Pan, S. J., & Yang, Q. (2010) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2009.191 · Cited by 23,387
“Evgeniou and Pontil [48] borrowed the idea of HB to SVMs for multitask learning.”
BackgroundWeiss, K., Khoshgoftaar, T. M., & Wang, D. (2016) · Journal of Big Data · doi:10.1186/s40537-016-0043-6 · Cited by 6,260
A Survey on Multi-Task Learning
Zhang, Y., & Yang, Q. (2017) · arXiv · doi:10.48550/arxiv.1707.08114 · Cited by 2,910
A Survey on Multi-Task Learning
Zhang, Y., & Yang, Q. (2022) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2021.3070203 · Cited by 2,878
BDD100K: A Diverse Driving Dataset for Heterogeneous Multitask Learning
Yu, F., Chen, H., Wang, X., Xian, W., Chen, Y., Liu, F., Madhavan, V., & Darrell, T. (2020) · 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr42600.2020.00271 · Cited by 2,641
Metadata
- Authors
- Evgeniou, T., & Pontil, M.
- Venue
- Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
- Publisher
- ACM
- Published
- 2004-08-22
- Pages
- 109-117
- OpenAlex
- W2143104527
- Cited by
- 1,433
- References
- 28
- FWCI
- 6.72
- Type
- conference paper
- Language
- en
- Open access
- closed
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.