Machine Learning Reductions

author:John Langford, Yahoo! Research
published: Feb. 25, 2007,   recorded: July 2006,   views: 193
Categories
You might be experiencing some problems with Your Video player.

Related content

Visitors who watched this lecture also watched...
04:59:19
Machine Learning, Probability and Graphical Models

18450 views - Sam Roweis, 2006
02:15:42
Reinforcement Learning Theory

910 views - John Langford, 2006
02:38:48
Tutorial on Machine Learning Reductions

1281 views - John Langford, 2005
05:02:23
Statistical Learning Theory

8000 views - John Shawe-Taylor, 2004
01:01:24
Semisupervised Learning Approaches

6016 views - Tom Mitchell, 2006
32:18
Neighbourhood Components Analysis

1843 views - Sam Roweis, 2006
03:54:31
Support Vector Machines

12763 views - Chih-Jen Lin, 2006
04:16:53
Learning with Kernels

3768 views - Bernhard Schölkopf, 2003
01:00:47
Gaussian Process Basics

12625 views - David MacKay, 2006
04:31:39
Kernel Methods

2004 views - Alexander J. Smola, 2006

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.
Lecture popularity: You need to login to cast your vote.

 Watch videos:   (click on thumbnail to launch)

Watch Part 1
Part 1 1:13:53 Flash video Slide Synchronization Windows Media video
!NOW PLAYING
Watch Part 2
Part 2 1:15:15 Flash video Slide Synchronization Windows Media video

Description

There are several different classification problems commonly encountered in real world applications such as 'importance weighted classification', 'cost sensitive classification', 'reinforcement learning', 'regression' and others. Many of these problems can be related to each other by simple machines (reductions) that transform problems of one type into problems of another type. Finding a reduction from your problem to a more common problem allows the reuse of simple learning algorithms to solve relatively complex problems. It also induces an organization on learning problems — problems that can be easily reduced to each other are 'nearby' and problems which can not be so reduced are not close.

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: