Top Banner
Convex Optimization for Multitask Feature Learning Priya Venkateshan
38

Convex Optimization for Multitask Feature Learning

Nov 05, 2021

Download

Documents

dariahiddleston
Welcome message from author
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
Page 1: Convex Optimization for Multitask Feature Learning

Convex Optimization for Multitask Feature Learning

Priya Venkateshan

Page 2: Convex Optimization for Multitask Feature Learning
Page 3: Convex Optimization for Multitask Feature Learning
Page 4: Convex Optimization for Multitask Feature Learning

MULTITASK FEATURE LEARNING

Page 5: Convex Optimization for Multitask Feature Learning
Page 6: Convex Optimization for Multitask Feature Learning
Page 7: Convex Optimization for Multitask Feature Learning
Page 8: Convex Optimization for Multitask Feature Learning
Page 9: Convex Optimization for Multitask Feature Learning
Page 10: Convex Optimization for Multitask Feature Learning
Page 11: Convex Optimization for Multitask Feature Learning
Page 12: Convex Optimization for Multitask Feature Learning
Page 13: Convex Optimization for Multitask Feature Learning
Page 14: Convex Optimization for Multitask Feature Learning
Page 15: Convex Optimization for Multitask Feature Learning
Page 16: Convex Optimization for Multitask Feature Learning
Page 17: Convex Optimization for Multitask Feature Learning
Page 18: Convex Optimization for Multitask Feature Learning
Page 19: Convex Optimization for Multitask Feature Learning
Page 20: Convex Optimization for Multitask Feature Learning
Page 21: Convex Optimization for Multitask Feature Learning
Page 22: Convex Optimization for Multitask Feature Learning
Page 23: Convex Optimization for Multitask Feature Learning

MULTITASK FEATURE LEARNING VIA EFFICIENT L2,1 NORM MINIMIZATION

Page 24: Convex Optimization for Multitask Feature Learning

A probabilistic framework for MTFL

• k tasks, data of type

• Data matrix and

• Linear model:

• Weight matrix estimated from data

Page 25: Convex Optimization for Multitask Feature Learning

A probabilistic framework for MTFL

• Assume y has a gaussian distribution with mean and variance

• Likelihood:

• Define a prior on W to capture task interrelatedness

Page 26: Convex Optimization for Multitask Feature Learning

A probabilistic framework for MTFL

• Posterior :

• Plug in value from equations, take negative log of posterior.

• Optimal value of W can be computed by minimizing

• Equivalent:

• Generalize:

Page 27: Convex Optimization for Multitask Feature Learning

Two Smooth Reformulations

• Above optimization is nonsmooth.

• Reformulate it as an equivalent smooth convex problem

Page 28: Convex Optimization for Multitask Feature Learning

First Smooth Reformulation

• Introduce additional variable which upperbounds

Page 29: Convex Optimization for Multitask Feature Learning

Second Smooth Reformulation

Page 30: Convex Optimization for Multitask Feature Learning

Nesterov’s Method

• Converges faster than most traditional methods: O(1/d2), while gradient descent = O(1/d)

• Based on two sequences: {xi} sequence of approximate solutions, {si} sequence of search points.

Page 31: Convex Optimization for Multitask Feature Learning

Nesterov’s Method

• Each sequence point is affine combination of previous solution points

• Approximate solution is calculated as gradient step of sequence point where is Euclidean projection of v onto convex set G.

Page 32: Convex Optimization for Multitask Feature Learning
Page 33: Convex Optimization for Multitask Feature Learning

Algorithm

Page 34: Convex Optimization for Multitask Feature Learning

Complexity

• For both smooth formulations, the time complexity of the algorithm turns out to be where m = number of samples, n = number of features, k = number of tasks.

Page 35: Convex Optimization for Multitask Feature Learning

Experiments

• Datasets:

– School dataset

• Scores of 15,342 students from 139 schools from1985, 1986 and 1987. 28 attributes in each sample

• 139 tasks of predicting performance of students in each school

– Letter dataset

• 8 tasks of 2-class classification problems for letters by 180 writers.

• 45,679 samples

Page 36: Convex Optimization for Multitask Feature Learning

Results

Page 37: Convex Optimization for Multitask Feature Learning

Results

Page 38: Convex Optimization for Multitask Feature Learning

References

• Multitask Feature Learning - Andreas Argyriou, Theodoros Evgeniou, Massimiliano Pontil, NIPS-06

• Multitask Feature Learning via efficient L2,1 Norm Minimization - Jun Liu, Shuiwang Ji, Jieping Ye, UAI-09.

• Slides of first approach from authors’ website