event thumbnail image
The 25th International Conference on Machine Learning (ICML 2008)

Boosting with Incomplete Information

author: Yang Wang, Simon Fraser University

Description

In real-world machine learning problems, it is very common that part of the input feature vector is incomplete: either not available, missing, or corrupted. In this paper, we present a boosting approach that integrates features with incomplete information and those with complete information to form a strong classifier. By introducing hidden variables to model missing information, we form loss functions that combine fully labeled data with partially labeled data to effectively learn normalized and unnormalized models. The primal problems of the proposed optimization problems with these loss functions are provided to show their close relationships and the motivations behind them. We use auxiliary functions to bound the change of the loss functions and derive explicit parameter update rules for the learning algorithms. We demonstrate encouraging results on two real-world problems - visual object recognition in computer vision and named entity recognition in natural language processing - to show the effectiveness of the proposed boosting approach.

You might be experiencing some problems with Your Video player.
Slides
0:00 Boosting with Incomplete Information
0:10 Introduction
1:44 Motivation - 1
2:08 Motivation - 2
2:51 Motivation - 3
3:23 Motivation - 4
3:56 Previous Work
4:52 Review of Boosting
7:19 Primal/Dual Problem
8:25 Problem Statement
9:02 Boosting with Hidden Variables
10:09 Primal/Dual Programs
10:54 Learning and Inference
11:47 Experiments: Visual Object Recognition - 1
12:09 Experiments: Visual Object Recognition - 2
12:46 Experiments: Visual Object Recognition - 3
12:55 Experiments: Visual Object Recognition - 4
13:19 Experiments: Visual Object Recognition - 5
14:13 Experiments: Visual Object Recognition - 6
14:50 Experiments: Visual Object Recognition - 7
15:08 Experiments: Named Entity Recognition - 1
16:19 Experiments: Named Entity Recognition - 2
16:40 Experiments: Named Entity Recognition - 3
16:58 - Questions

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: