1. Transfer Learning for Image Classification

2. Transfer Learning Approaches Leverage data from related tasks to improve performance:  Improve generalization.  Reduce the run-time of evaluating a set of classifiers. Two Main Approaches:  Learning Shared Hidden Representations.  Sharing Features.

3. Sharing Features: efficient boosting procedures for multiclass object detection Antonio Torralba Kevin Murphy William Freeman

4. Snapshot of the idea Goal:  Reduce the computational cost of multiclass object recognition  Improve generalization performance Approach:  Make boosted classifiers share weak learners  Some Notation:

5. Training a single boosted classifier  Consider training a single boosted classifier: Candidate weak learners Weighted stumps Fit an additive model

6. Training a single boosted classifier Greedy Approach Minimize the exponential loss Gentle Boosting

7. Standard Multiclass Case: No Sharing Additive model for each class Minimize the sum of exponential losses Each class has its own set of weak learners:

8. Multiclass Case: Sharing Features subset of classes corresponding additive classifier classifier for the k class At iteration t add one weak learner to one of the additive models: Minimize the sum of exponential losses Naive approach : Greedy Heuristic:

9. Sharing features for multiclass object detection Torralba, Murphy, Freeman. CVPR 2004

10. Learning efficiency

11. Sharing features shows sub-linear scaling of features with objects (for area under ROC = 0.9). Red: shared features Blue: independent features

12. How the features are shared across objects Basic features: Filter responses computed at different locations of the image

13. Uncovering Shared Structures in Multiclass Classification Yonatan Amit Michael Fink Nathan Srebro Shimon Ullman

14. Structure Learning Framework Class Parameters Structural Parameters  Find optimal parameters: Linear Classifiers Linear Transformations

15. Multiclass Loss Function  Maximal Hinge Loss:  Hinge Loss:

16. Snapshot of the idea  Main Idea: Enforce Sharing by finding low rank parameter matrix W Transformation on x Transformation on w  Consider the m by d parameter matrix:  Can be factored:  Rows of theta form a basis

17. Low Rank Regularization Penalty  Rank of a d by m matrixis the smallest z, such that:  A regularization penalty designed to minimize the rank of W’ would tend to produce solutions where a few basis are shared by all classes.  Minimizing the rank would lead to a hard combinatorial problem  Instead use a trace norm penalty: eigen value of W’

18. Putting it all together No longer in the objective  For optimization they use a gradient based method that minimizes a smooth approximation of the objective

19. Mammals Dataset

20. Results

21. Transfer Learning for Image Classification via Sparse Joint Regularization Ariadna Quattoni Michael Collins Trevor Darrell

22. Training visual classifiers when a few examples are available  Problem:  Image classification from a few examples can be hard.  A good representation of images is crucial.  Solution:  We learn a good image representation using: unlabeled data + labeled data from related problems

23. Snapshot of the idea:  Use unlabeled dataset + kernel function to compute a new representation:  Complex features, high dimensional space  Some of them will be very discriminative (hopefully)  Most will be irrelevant  If we knew the relevant features we could learn from fewer examples.  Related problems may share relevant features.  We can use data from related problems to discover them !!

24. Semi-supervised learning Large dataset of unlabeled data Small training set of labeled images h-dimensional training set Visual Representation Unsupervised learning ComputeTrain Classifier Step 1: Learn representation Step 2: Train Classifier

25. Semi-supervised learning:  Raina et al. [ICML 2007] proposed an approach that learns a sparse set of high level features (i.e. linear combinations of the original features) from unlabeled data using a sparse coding technique.  Balcan et al. [ML 2004] proposed a representation based on computing kernel distances to unlabeled data points.

26. Learning visual representations using unlabeled data only  Unsupervised learning in data space  Good thing:  Lower dimensional representation preserves relevant statistics of the data sample.  Bad things:  The representation might still contain irrelevant features, i.e. features that are useless for classification.

27. Learning visual representations from unlabeled data + labeled data from related categories Step 1: Learn a representation Large Dataset of unlabeled images Kernel Function Create New Representation Select Discriminative Features of the New Representation Discriminative representation Labeled images from related categories

28. Our contribution  Main differences with previous approaches:  Our choice of joint regularization norm allows us to express the joint loss minimization as a linear program (i.e. no need for greedy approximations.)  While previous approaches build joint sparse classifiers on the feature space our method discovers discriminative features in a space derived using the unlabeled data and uses these discriminative features to solve future problems.

29. Overview of the method  Step I: Use the unlabeled data to compute a new representation space [Kernel SVD].  Step II: Use the labeled data from related problems to discover discriminative features in the new space [Joint Sparse Regularization].  Step III: Compute the new discriminative representation for the samples of the target problem.  Step IV: Train the target classifier using the representation of step III.

30. Step I: Compute a representation using the unlabeled data  A) Compute kernel matrix of unlabeled images:  B) Compute a projection matrix A by taking all the eigen vectors of K. K U  Perform Kernel SVD on the Unlabeled Data.

31. Step I: Compute a representation using the unlabeled data  C) Project labeled data from related problems to the new space: D  Notational shorthand:

32. Sidetrack  Another possible method for learning a representation from the unlabeled data would be to create a projection matrix Q by taking the h eigen vectors of A corresponding to the h largest eigenvalues.  We will call this approach the Low Rank Baseline  Our method differs significantly from the low rank approach in that we use training data from related problems to select discriminative features in the new space.

33. Step II: Discover relevant features by joint sparse approximation  A classifier is a function: where:is the input space, i.e. the representation learnt from unlabeled data. is a binary label, in our application is going to be 1 if an imageand  A loss function: belongs to a particular topic and -1 otherwise.

34. Step II: Discover relevant features by joint sparse approximation  Consider learning a single sparse linear classifier (on the space learnt from the unlabeled data) of the form:  A sparse model will have only a few features with non-zero coefficients.  A natural choice for parameter estimation would be: Classification error L1 penalizes non-sparse solutions  Donoho [2004] has proven (in a regression setting) that the solution with smallest L1 norm is also the sparsest solution.

35. Step II: Discover relevant features by joint sparse approximation  Goal: Find a subset of features R such that each problem in:  Solution : Regularized Joint loss minimization: Classification error on training set k penalizes solutions that utilize too many features can be well approximated by a sparse classifier whose non-zero coefficients correspond to features in R.

36. Step II: Discover relevant features by joint sparse approximation  How do we penalize solutions that use too many features? Coefficients for for feature 2 Coefficients for classifier 2  Problem : not a proper norm, would lead to a hard combinatorial problem.

37. Step II: Discover relevant features by joint sparse approximation  Instead of using the #non-zero-rows pseudo-norm we will use a convex relaxation [Tropp 2006]  The combination of the two norms results in a solution where only a few features are used but the features used will contribute in solving many classification problems.  This norm combines: An L1 norm on the maximum absolute values of the coefficients promotes sparsity on max values. Use few features The L∞ norm on each row promotes non-sparsity on the rows Share features

38. Step II: Discover relevant features by joint sparse approximation  Using the L1- L∞ norm we can rewrite our objective function as:  For any convex loss this is a convex function, in particular when considering the hinge loss: the optimization problem can be expressed as a linear program.

39. Step II: Discover relevant features by joint sparse approximation  Linear program formulation ( hinge loss):  Max value constraints: and  Slack variables constraints: and

40. Step III: Compute the discriminative features representation  Define the set of relevant features to be:  Create a new representation by taking all the features in x’ corresponding to the indexes in R

41. Experiments: Dataset 10382 images, 108 topics. Predict 10 most frequent topics; (binary prediction) Reuters Dataset Data Partitions 3000 unlabeled images. labeled training sets of sizes: 1, 5, 10,15…50. 2382 images as testing data. 5000 images as source of supervised training data Training set with n positive examples and 2*n

42. Dataset SuperBowl [341] Danish Cartoons [178 ] Sharon [321] Australian open [209] Trapped coal miners [196] Golden globes [167] Grammys [170] Figure skating [146] Academy Awards [135] Iraq [ 125]

43. Baseline Representation  Sampling:  ‘Bag of words’ representation that combines: color, texture and raw local image information  Sample image patches on a fixed grid  For each image patch compute: Color features based on HSV color histograms Texture features based on mean responses of Gabor filters at different scales and orientations Raw features, normalized pixel values  Create visual dictionary: for each feature type we do vector quantization and create a dictionary V of 2000 visual words.

44. Baseline representation  For every feature type map each patch to its closest visual word in the corresponding dictionary.  Compute baseline representation:  Sample image patches over a fix grid  The final representation is given by: whereis the number of times that an image patch was mapped to the i-th color word

45. Setting  Step 1: Learn a representation using the unlabeled datataset and labeled datatasets from 9 topics.  Step 2: Train a classifier for the 10 th held out topic using the learnt representation.  As evaluation we use the equal error rate averaged over the 10 topics.

46.  Uses as a representation: where Q is consists of the h highest eigenvectors of the matrix A computed in the first step of the algorithm Experiments  Baseline model (RFB):  Uses raw representation.  For both LRB and SPT we used and RBF kernel when computing the Representation from unlabeled data.  Low Rank baseline (LRB):  Sparse Transfer Model (SPT)  Three models, all linear SVMs  Uses Representation computed by our algorithm

47. Results:

48. Mean Equal Error rate per topic for classifiers trained with five positive examples; for the RFB model and the SPT model. SuperBowl; GG: Golden Globes; DC: Danish Cartoons; Gr: Grammys; AO: Australian Open; Sh:Sharon; FS: Figure Skating; AA: Academy Awards; Ir: Iraq.

49. Results

50. Conclusion  Summary:  We described a method for learning discriminative sparse image representations from unlabeled images + images from related tasks.  The method is based on learning a representation from the unlabeled data and performing joint sparse approximation on the data from related tasks to find a subset of discriminative features.  The induced representation improves performance when learning with very few examples.

51. Future work  Develop an efficient algorithm for solving the joint optimization that will scale to very large datasets.  Combine different representations

52. Joint Sparse Approximation  Discovers image representations which improve learning with few examples  The LP formulation is feasible for small problems but becomes intractable for larger data-sets.

53. Outline A Joint Sparse Approximation Model for Multi-task Learning An Efficient Algorithm Experiments

54. Joint Sparse Approximation as a Constrained Convex Optimization Problem  We will use a Projected SubGradient method. Main advantages: simple, scalable, guaranteed convergence rates. A convex function Convex constraints  Projected SubGradient methods have been recently proposed:  L 2 regularization, i.e. SVM [Shalev-Shwartz et al. 2007]  L 1 regularization [Duchi et al. 2008]

55. Euclidean Projection into the L 1-∞ ball  Projection: Inspecting the Lagrangian shows that it can be reduced to:  We reduced the projection to finding new maximums for each feature across tasks and using them to truncate A.  The total mass removed from a feature across tasks should be the same for all features whose coefficients don’t vanish. 12

56. t1t1 t2t2 t3t3 t4t4 t5t5 t6t6 t1t1 t2t2 t3t3 t4t4 t5t5 t6t6 t1t1 t2t2 t3t3 t4t4 t5t5 t6t6 Feature IFeature IIFeature III Euclidean Projection into the L 1-∞ ball 3 Features, 6 problems, Q=14 Regret

57. Euclidean Projection into the L 1-∞ ball

58. An Efficient Algorithm For Finding μ  Recall that we need to find a vector of maximums µ that sums to Q and a constant θ such that the mass loss for every feature is the same.  Consider the mass loss function and its inverse:  We can construct this function and pick the θ for which This is a piece wise linear function So is its inverse  Consider a function that takes a mass loss and computes the corresponding sum of µ ( the norm of the new matrix) This is also piece wise linear

59. Complexity  The total cost of the algorithm is dominated by the initial sort  The total cost is in the order of:  The merge of these rows to build the piece wise linear function: of each row of A:  Notice that we only need to consider non-zero rows of A, so d is really the number of non-zero rows rather than the actual number of features

60. Outline A Joint Sparse Approximation Model for Multi-task Learning An Efficient Algorithm Experiments

61. Synthetic Experiments  We use the same projected subgradient method, and compared three different types of projection steps:  L 1−∞ projection  L 2 projection  L 1 projection  All tasks consisted of predicting functions of the form:  To generate jointly sparse vectors we randomly selected 10% of the features to be the relevant feature set V. Then for each task we randomly selected a subset v and zeroed all parameters outside v.

62. Synthetic Experiments Test Error Performance on predicting relevant features

63. Dataset: News story prediction SuperBowl Danish Cartoons Sharon Australian open Trapped coal miners Golden globes Grammys Figure skating Academy Awards Iraq  40 tasks  Raw image representation: Bag of visual words  Linear Kernel  3000 dimensions

64. Image Classification Experiments

65. Conclusion and Future Work  Presented a simple and effective algorithm for training joint models with L 1−∞ constraints.  The algorithm scales linearly with the number of examples and O(dm log(dm) ) with the number of problems and dimensions.  The experiments on a real image dataset show that this algorithm can find solutions that are jointly sparse, resulting in lower test error.  We believe our approach can be extended to work on an online multi-task learning setting.

66. Future Work: Online Multitask Classification [Cavallanti et al. 2008]  There are m binary classification tasks indexed by 1,…., M  At each time step t=1,2,…,T the learner receives a task index k and the corresponding instance vector.  Based on this information the learner outputs a binary prediction an then observes the correct label y k  We are interested in comparing the learner’s mistake count to that of the optimal predictors:

67. Thanks!

68. Lagrangian