event thumbnail image
NATO Advanced Study Institute on Mining Massive Data Sets for Security

Large-Scale Semi-Supervised Learning

author: Jason Weston, NEC Laboratories America, Inc.

Description

Labeling data is expensive, whilst unlabeled data is often abundant and cheap to collect. Semi-supervised learning algorithms that can use both types of data can perform significantly better than supervised algorithms that use labeled data alone. However, for such gains to be observed, the amount of unlabeled data trained on should be relatively large. Therefore, making semi-supervised algorithms scalable is paramount. In this work we discuss several recent techniques for improving the scaling ability of these algorithms.

You might be experiencing some problems with Your Video player.
Slides
0:00 Large Scale Semi-Supervised Learning
0:28 1 Introduction
3:43 2 What is Supervised Learning?
5:32 3 What is Semi-Supervised Learning?
8:32 4 Why Semi-Supervised?
10:43 5 When Can it Work?
12:08 i) Cluster Assumption
13:45 ii) Manifold Assumption
14:31 iii) Zipf’s law effect. . . ?
14:47 i) Cluster Assumption
15:42 iii) Zipf’s law effect. . . ?
17:02 iv) Non-iid data
18:08 6 Why Large-Scale Semi-Sup. Learning?
21:14 7 Why Large-Scale Semi-Sup. Learning?
22:06 6 Why Large-Scale Semi-Sup. Learning?
22:11 7 Why Large-Scale Semi-Sup. Learning?
23:55 8 History of Semi-Supervised Learning
26:55 9 General Approach for Discriminative Semi-Sup. Learning
28:36 10 Some Current Algorithmic Approaches
29:24 Method 1: Label-propagation (1)
30:29 Method 1: Label-propagation (2)
31:10 Method 1: Label-propagation (3)
31:20 Method 1: Label-propagation (4)
31:35 Method 1: Label-propagation (1)
31:56 Method 1: Label-propagation (5)
32:11 Method 1: Label-propagation (6)
35:06 Method 2: Change of representation
35:53 Method 2: Change of Representation : using SVMs
36:15 Method 2: Change of Representation : cluster kernels
38:33 Method 3: Direct Regularization
39:21 Method 3: Direct Regularization - TSVM
40:24 Method 3: Direct Regularization
40:32 Method 3: Direct Regularization - TSVM
41:16 Method 3: Direct Regularization
41:23 Method 3: Direct Regularization - TSVM
42:14 Comparing the methods : small scale
43:54 11 Speeding up these algorithms
46:45 Speeding up Method 2: Fast Cluster kernels (1)
48:18 Speeding up Method 2: Fast Cluster kernels (2)
48:22 Speeding up Method 2: Fast Cluster kernels (1)
48:50 Speeding up Method 2: Fast Cluster kernels (2)
50:45 12 Speeding up TSVMs: The Concave-Convex Procedure (CCCP)
52:19 13 The Algorithm [Collobert et al., 2006]
52:32 14 Small Scale Results
53:26 15 Speed Comparison with SVMLight
54:18 16 Converges in 5-10 ”SVM” iterations
54:46 17 Large Dataset: Reuters
55:38 18 Large Dataset: MNIST
56:01 19 Training Time on Reuters & MNIST
56:29 20 Future scaling: online learning
57:36 21 Summary

Lecture rating

People found this lecture:
Worth seeing
because it is:
 Valuable and informative
Well presented
Easily understandable
Acceptably recorded
You need to login to cast your vote.

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: