# Low-Rank Multitask Learning based on Tensorized SVMs and LSSVMs

arXiv: https://arxiv.org/abs/2308.16056 · HTML: https://mlsanity.com/paper/2308.16056/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- Builds on 7 of its 51 references that are in the map.
- First posted on arXiv 30 Aug 2023.

## Builds on (most cited first, 7 of 7)

- [Deep Multi-task Representation Learning: A Tensor Factorisation Approach](https://mlsanity.com/paper/1605.06391/) (2016)
- [Parallelized Tensor Train Learning of Polynomial Classifiers](https://mlsanity.com/paper/1612.06505/) (2016)
- [Scaling SVM and Least Absolute Deviations via Exact Data Reduction](https://mlsanity.com/paper/1310.7048/) (2013)
- [Deep Multi-Task Learning via Generalized Tensor Trace Norm](https://mlsanity.com/paper/2002.04799/) (2020)
- [Tensor-based Multi-view Spectral Clustering via Shared Latent Space](https://mlsanity.com/paper/2207.11559/) (2022)
- [Tensor Regression](https://mlsanity.com/paper/2308.11419/) (2023)
- [Tensorized LSSVMs for Multitask Regression](https://mlsanity.com/paper/2303.02451/) (2023)

## Built on by (most cited first, 1 of 1)

- [Hierarchical Subspaces of Policies for Continual Offline Reinforcement Learning](https://mlsanity.com/paper/2412.14865/) (2024)

## Abstract (arXiv)

Multitask learning (MTL) leverages task-relatedness to enhance performance. With the emergence of multimodal data, tasks can now be referenced by multiple indices. In this paper, we employ high-order tensors, with each mode corresponding to a task index, to naturally represent tasks referenced by multiple indices and preserve their structural relations. Based on this representation, we propose a general framework of low-rank MTL methods with tensorized support vector machines (SVMs) and least square support vector machines (LSSVMs), where the CP factorization is deployed over the coefficient tensor. Our approach allows to model the task relation through a linear combination of shared factors weighted by task-specific factors and is generalized to both classification and regression problems. Through the alternating optimization scheme and the Lagrangian function, each subproblem is transformed into a convex problem, formulated as a quadratic programming or linear system in the dual form. In contrast to previous MTL frameworks, our decision function in the dual induces a weighted kernel function with a task-coupling term characterized by the similarities of the task-specific factors, better revealing the explicit relations across tasks in MTL. Experimental results validate the effectiveness and superiority of our proposed methods compared to existing state-of-the-art approaches in MTL. The code of implementation will be available at https://github.com/liujiani0216/TSVM-MTL.