Fast and Sample-Efficient Relevance-Based Multi-Task Representation Learning

This letter explores an approach for task-relevant multi-task representation learning when the amount of data is limited for both source tasks and target tasks. Specifically, we consider a low-dimensional setting where the goal is to sample source task data based on their relevance so as to utilize...

Full description

Saved in:
Bibliographic Details
Published in:IEEE control systems letters Vol. 8; pp. 1397 - 1402
Main Authors: Lin, Jiabin, Moothedath, Shana
Format: Journal Article
Language:English
Published: IEEE 2024
Subjects:
alternating gradient descent
meta learning
Minimization
multi-task learning
Multitasking
Prediction algorithms
Representation learning
Task analysis
Training
Vectors
ISSN:2475-1456, 2475-1456
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This letter explores an approach for task-relevant multi-task representation learning when the amount of data is limited for both source tasks and target tasks. Specifically, we consider a low-dimensional setting where the goal is to sample source task data based on their relevance so as to utilize task-relevant information effectively. We present a novel learning algorithm based on an alternating projected gradient descent (GD) and minimization estimator. We present the convergence guarantee of our algorithm, excess risk, and the sample complexity of our approach. We evaluated the effectiveness of our algorithm via numerical experiments and compared it empirically against three benchmark approaches.
ISSN:2475-1456
2475-1456
DOI:10.1109/LCSYS.2024.3412880