The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Multi-Task Feature Learning
Abstract
We present a method for learning a low-dimensional representation which is shared across a set of multiple related tasks. The method builds upon the well-known 1-norm regularization problem using a new regularizer which controls the number of learned features common for all the tasks. We show that this problem is equivalent to a convex optimization problem and develop an iterative algorithm for solving it. The algorithm has a simple interpretation: it alternately performs a supervised and an unsupervised step, where in the latter step we learn common-across-tasks representations and in the former step we learn task-specific functions using these representations. We report experiments on a simulated and a real data set which demonstrate that the proposed method dramatically improves the per-formance relative to learning each task independently. Our algorithm can also be used, as a special case, to simply select – not learn – a few common features across the tasks.
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 Elements of Statistical Learning
Hastie, T., Tibshirani, R., & Friedman, J. (2009) · Springer Series in Statistics · doi:10.1007/978-0-387-84858-7 · Cited by 25,970
The Elements of Statistical Learning: Data Mining, Inference, and Prediction
John Lu, Z. Q. (2010) · Journal of the Royal Statistical Society Series A: Statistics in Society · doi:10.1111/j.1467-985x.2010.00646_6.x · Cited by 12,390
A Framework for Learning Predictive Structures from Multiple Tasks and Unlabeled Data
Ando, R. K., & Zhang, T. (2005) · doi:10.5555/1046920.1194905 · Cited by 1,311
Maximum-Margin Matrix Factorization
Srebro, N., Rennie, J. D. M., & Jaakkola, T. (2004) · Cited by 962
A rank minimization heuristic with application to minimum order system approximation
Fazel, M., Hindi, H., & Boyd, S. P. (2001) · Proceedings of the 2001 American Control Conference. (Cat. No.01CH37148) · doi:10.1109/acc.2001.945730 · Cited by 956
Learning Multiple Tasks with Kernel Methods
Evgeniou, T., Micchelli, C. A., & Pontil, M. (2005) · doi:10.5555/1046920.1088693 · Cited by 799
Self-citationA Model of Inductive Bias Learning
Baxter, J. (2000) · Cited by 730
Donoho, D. L. (2006) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20131 · Cited by 634
A model of inductive bias learning
Baxter, J. (2000) · Journal of Artificial Intelligence Research · doi:10.1613/jair.731 · Cited by 582
Sharing features: efficient boosting procedures for multiclass object detection
Torralba, A., Murphy, K. P., & Freeman, W. T. (2004) · Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004. · doi:10.1109/cvpr.2004.1315241 · Cited by 577
Lenk, P. J., DeSarbo, W. S., Green, P. E., & Young, M. R. (1996) · Marketing Science · doi:10.1287/mksc.15.2.173 · Cited by 532
On Learning Vector-Valued Functions
Micchelli, C. A., & Pontil, M. (2005) · Neural Computation · doi:10.1162/0899766052530802 · Cited by 494
Self-citationExploiting 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 Gaussian processes from multiple tasks
Yu, K., Tresp, V., & Schwaighofer, A. (2005) · Proceedings of the 22nd international conference on Machine learning - ICML '05 · doi:10.1145/1102351.1102479 · Cited by 380
Serre, T., Kouh, M., Cadieu, C. F., Knoblich, U., Kreiman, G., & Poggio, T. (2005) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 277
Multi-task feature and kernel selection for SVMs
Jebara, T. (2004) · Twenty-first international conference on Machine learning - ICML '04 · doi:10.1145/1015330.1015426 · Cited by 218
A Convex Optimization Approach to Modeling Consumer Heterogeneity in Conjoint Estimation
Evgeniou, T., Pontil, M., & Toubia, O. (2007) · Marketing Science · doi:10.1287/mksc.1070.0291 · Cited by 141
Self-citationLearning Multiple Related Tasks using Latent Independent Component Analysis
Zhang, J. A., Ghahramani, Z., & Yang, Y. (2005) · Cited by 110
Low-rank matrix factorization with attributesPreprint
Abernethy, J., Bach, F., Evgeniou, T., & Vert, J. (2006) · arXiv.org · doi:10.48550/arxiv.cs/0611124 · Cited by 101
Self-citation
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
A Singular Value Thresholding Algorithm for Matrix Completion
Cai, J.-F., Candès, E. J., & Shen, Z. (2010) · SIAM Journal on Optimization · doi:10.1137/080738970 · Cited by 5,809
DeCAF: A Deep Convolutional Activation Feature for Generic Visual Recognition
Donahue, J., Jia, Y., Vinyals, O., Hoffman, J., Zhang, N., Tzeng, E., & Darrell, T. (2013) · arXiv · doi:10.48550/arxiv.1310.1531 · Cited by 4,019
An Overview of Multi-Task Learning in Deep Neural Networks
Ruder, S. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1706.05098 · Cited by 2,265
Kuybeda, O., Frank, G. A., Bartesaghi, A., Borgnia, M., Subramaniam, S., & Sapiro, G. (2013) · Journal of Structural Biology · doi:10.1016/j.jsb.2012.10.010 · Cited by 2,162
Metadata
- Authors
- Argyriou, A., Evgeniou, T., & Pontil, M.
- Venue
- Advances in Neural Information Processing Systems 19
- Publisher
- The MIT Press
- Published
- 2007-09-07
- Pages
- 41-48
- OpenAlex
- W2165644552
- Cited by
- 1,333
- References
- 19
- FWCI
- 50.61
- Type
- book chapter
- 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.