The DOI matches its Crossref record; 47 of the 47 references it cites were found in a registry or an index.
Robust multi-task feature learning
Open accessAbstract
Multi-task learning (MTL) aims to improve the performance of multiple related tasks by exploiting the intrinsic relationships among them. Recently, multi-task feature learning algorithms have received increasing attention and they have been successfully applied to many applications involving high-dimensional data. However, they assume that all tasks share a common set of features, which is too restrictive and may not hold in real-world applications, since outlier tasks often exist. In this paper, we propose a Robust MultiTask Feature Learning algorithm (rMTFL) which simultaneously captures a common set of features among relevant tasks and identifies outlier tasks. Specifically, we decompose the weight (model) matrix for all tasks into two components. We impose the well-known group Lasso penalty on row groups of the first component for capturing the shared features among relevant tasks. To simultaneously identify the outlier tasks, we impose the same group Lasso penalty but on column groups of the second component. We propose to employ the accelerated gradient descent to efficiently solve the optimization problem in rMTFL, and show that the proposed algorithm is scalable to large-size problems. In addition, we provide a detailed theoretical analysis on the proposed rMTFL formulation. Specifically, we present a theoretical bound to measure how well our proposed rMTFL approximates the true evaluation, and provide bounds to measure the error between the estimated weights of rMTFL and the underlying true weights. Moreover, by assuming that the underlying true weights are above the noise level, we present a sound theoretical result to show how to obtain the underlying true shared features and outlier tasks (sparsity patterns). Empirical studies on both synthetic and real-world data demonstrate that our proposed rMTFL is capable of simultaneously capturing shared features among tasks and identifying outlier 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
Horn, R. A., & Johnson, C. R. (1985) · Cited by 22,203
A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
Beck, A., & Teboulle, M. (2009) · SIAM Journal on Imaging Sciences · doi:10.1137/080716542 · Cited by 11,952
Caruana, R. (1997) · Machine Learning · doi:10.1023/a:1007379606734 · Cited by 6,636
Introductory Lectures on Convex Optimization: A Basic Course
Nesterov, Y. E. (2014) · Medical Entomology and Zoology · Cited by 3,557
Introductory Lectures on Convex Optimization
Nesterov, Y. (2004) · Applied Optimization · doi:10.1007/978-1-4419-8853-9 · Cited by 2,698
Simultaneous analysis of Lasso and Dantzig selector
Bickel, P. J., Ritov, Y., & Tsybakov, A. B. (2009) · The Annals of Statistics · doi:10.1214/08-aos620 · Cited by 2,396
Convex multi-task feature learning
Argyriou, A., Evgeniou, T., & Pontil, M. (2008) · Machine Learning · doi:10.1007/s10994-007-5040-8 · Cited by 1,528
Regularized multi--task learning
Evgeniou, T., & Pontil, M. (2004) · Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1014052.1014067 · Cited by 1,433
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
Caruana, R. (1998) · Cited by 1,110
Gradient methods for minimizing composite objective function
Nesterov, Y. E. (2007) · Cited by 867
A Model of Inductive Bias Learning
Baxter, J. (2000) · Cited by 730
Optimization with Sparsity-Inducing Penalties
Bach, F. (2011) · now publishers, Inc. eBooks · doi:10.1561/9781601985118 · Cited by 608
SLEP: Sparse Learning with Efficient Projections
Liu, J., Ji, S., & Ye, J. (2011) · Cited by 585
Self-citationA model of inductive bias learning
Baxter, J. (2000) · Journal of Artificial Intelligence Research · doi:10.1613/jair.731 · Cited by 582
Multi-Task Feature Learning Via Efficient l2,1-Norm Minimization
Liu, J., Ji, S., & Ye, J. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1205.2631 · Cited by 555
Self-citationEstimation of (near) low-rank matrices with noise and high-dimensional scaling
Negahban, S., & Wainwright, M. J. (2011) · The Annals of Statistics · doi:10.1214/10-aos850 · Cited by 537
Multi-task learning for classification with dirichlet process priors
Xue, Y., Liao, X., Carin, L., Krishnapuram, B., & Bartlett, P. (2007) · Cited by 485
Clustered Multi-Task Learning: A Convex Formulation
Jacob, L., Bach, F., & Vert, J. (2008) · arXiv (Cornell University) · doi:10.48550/arxiv.0809.2085 · Cited by 400
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
Tree-Guided Group Lasso for Multi-Task Regression with Structured Sparsity
Kim, S., & Xing, E. P. (2018) · Figshare · doi:10.1184/r1/6476414 · Cited by 374
A Dirty Model for Multi-task Learning
Jalali, A., Sanghavi, S., Ruan, C., & Ravikumar, P. (2010) · Cited by 368
Learning to learn with the informative vector machine
Lawrence, N. D., & Platt, J. C. (2004) · Twenty-first international conference on Machine learning - ICML '04 · doi:10.1145/1015330.1015382 · Cited by 338
Learning with Whom to Share in Multi-task Feature Learning
Kang, Z., Grauman, K. L., & Sha, F. (2011) · Cited by 320
Integrating low-rank and group-sparse structures for robust multi-task learning
Chen, J., Zhou, J., & Ye, J. (2011) · Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2020408.2020423 · Cited by 311
Self-citationLarge Margin Multi-Task Metric Learning
Parameswaran, S., & Weinberger, K. Q. (2010) · Cited by 271
Clustered Multi-Task Learning Via Alternating Structure Optimization.
Zhou, J., Chen, J., & Ye, J. (2011) · PubMed · Cited by 260
Self-citationA multi-task learning formulation for predicting disease progression
Zhou, J., Yuan, L., Liu, J., & Ye, J. (2011) · Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2020408.2020549 · Cited by 254
Self-citationDiscovering Structure in Multiple Learning Tasks: The TC Algorithm.
Thrun, S., & O’Sullivan, J. A. (1996) · Cited by 208
Trace Norm Regularization: Reformulations, Algorithms, and Multi-Task Learning
Pong, T. K., Tseng, P., Ji, S., & Ye, J. (2010) · SIAM Journal on Optimization · doi:10.1137/090763184 · Cited by 208
Self-citation(2000) · CrossRef Listing of Deleted DOIs · doi:10.1162/153244304322765658 · Cited by 192
Taking Advantage of Sparsity in Multi-Task Learning
Lounici, K., Pontil, M., Tsybakov, A. B., & van de Geer, S. (2009) · Cited by 179
Learning Gaussian Process Kernels via Hierarchical Bayes
Schwaighofer, A., Tresp, V., & Yu, K. (2004) · Cited by 172
Learning incoherent sparse and low-rank patterns from multiple tasks
Chen, J.-H., Liu, J., & Ye, J. (2010) · Knowledge Discovery and Data Mining · doi:10.1145/1835804.1835952 · Cited by 166
Self-citationAn efficient algorithm for a class of fused lasso problems
Liu, J., Yuan, L., & Ye, J. (2010) · Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1835804.1835847 · Cited by 163
Self-citationEfficient Methods for Overlapping Group Lasso
Yuan, L., Liu, J., & Ye, J. (2011) · Cited by 128
Self-citationLearning Multiple Related Tasks using Latent Independent Component Analysis
Zhang, J. A., Ghahramani, Z., & Yang, Y. (2005) · Cited by 110
Efficient Methods for Overlapping Group Lasso
Yuan, L., Liu, J., & Ye, J. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2013.17 · Cited by 105
Self-citationTransfer metric learning by learning task relationships
Zhang, Y., & Yeung, D. (2010) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1835804.1835954 · Cited by 100
Probabilistic Multi-Task Feature Selection
Zhang, Y., Yeung, D., & Xu, Q. (2010) · Cited by 83
Heterogeneous multitask learning with joint sparsity constraints
Yang, X., Kim, S. Y., & Xing, E. P. (2009) · Cited by 76
Learning Incoherent Sparse and Low-Rank Patterns from Multiple Tasks
Chen, J.-H., Liu, J., & Ye, J. (2012) · TKDD · doi:10.1145/2086737.2086742 · Cited by 75
Self-citationMulti-task Learning Using Generalized t Process
Zhang, Y., & Yeung, D. (2010) · Rare & Special e-Zone (The Hong Kong University of Science and Technology) · Cited by 57
Multitask Learning without Label Correspondences
Quadrianto, N., Petterson, J., Caetano, T. S., Smola, A., & Vishwanathan, S. V. N. (2010) · Figshare · Cited by 43
Gong, P., Gai, K., & Zhang, C. (2011) · Neurocomputing · doi:10.1016/j.neucom.2011.02.019 · Cited by 24
Self-citationA model of inductive bias learning
BaxterJonathan (2000) · doi:10.5555/1622248.1622254 · Cited by 24
Optimization with Sparsity-Inducing Penalties (Foundations and Trends(R) in Machine Learning)
Bach, F., Jenatton, R., & Mairal, J. (2011) · now publishers, Inc. eBooks · Cited by 20
Cited by
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
An overview of multi-task learning
Zhang, Y., & Yang, Q. (2018) · National Science Review · doi:10.1093/nsr/nwx105 · Cited by 1,117
Chen, Z., & Liu, B. (2018) · Synthesis Lectures on Artificial Intelligence and Machine Learning · doi:10.1007/978-3-031-01581-6 · Cited by 466
Gong, P., Zhang, C., Lu, Z., Huang, J. Z., & Ye, J. (2013) · PubMed · doi:10.48550/arxiv.1303.4434 · Cited by 272
Self-citation
Metadata
- Authors
- Gong, P., Ye, J., & Zhang, C.
- Venue
- Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
- Publisher
- ACM
- Published
- 2012-08-12
- Volume
- 2012
- Pages
- 895-903
- OpenAlex
- W2032612424
- Cited by
- 301
- References
- 47
- FWCI
- 61.67
- Type
- conference paper
- 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.