Variable Selection and Task Grouping for Multi-Task Learning
arXiv:1802.04676 · doi:10.1145/3219819.3219992
Abstract
We consider multi-task learning, which simultaneously learns related prediction tasks, to improve generalization performance. We factorize a coefficient matrix as the product of two matrices based on a low-rank assumption. These matrices have sparsities to simultaneously perform variable selection and learn and overlapping group structure among the tasks. The resulting bi-convex objective function is minimized by alternating optimization where sub-problems are solved using alternating direction method of multipliers and accelerated proximal gradient descent. Moreover, we provide the performance bound of the proposed method. The effectiveness of the proposed method is validated for both synthetic and real-world datasets.
arXiv comment9 pages, 2 figures
References in corpus (10)
- Proceedings of the 29th International Conference on Machine Learning (ICML-12)
- A Survey on Multi-Task Learning
- Clustered Multi-Task Learning: A Convex Formulation
- Learning Task Grouping and Overlap in Multi-task Learning
- A General Analysis of the Convergence of ADMM
- Estimation of Simultaneously Sparse and Low Rank Matrices
- The Benefit of Multitask Representation Learning
- New Perspectives on k-Support and Cluster Norms
- New Perspectives on -Support and Cluster Norms
- Sparse Prediction with the -Support Norm