Discriminative and Generative Views of Binary Experiments

author: Robert C. Williamson, Australian National University
published: March 26, 2010,   recorded: December 2009,   views: 100
Categories

Slides

Related content

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.
  Delicious Bibliography

Description

We consider Binary experiments (supervised learning problems where there are two different labels) and explore formal relationships between two views of them, which we call “generative” and “discriminative”. The discriminative perspective involves an expected loss. The generative perspective (in our sense) involves the distances between class-conditional distributions. We extend known results to the class of all proper losses (scoring rules) and all f-divergences as distances between distributions. We also sketch how one can derive the SVM and MMD algorithms from the generative perspective.

See Also:

Download slides icon Download slides: nipsworkshops09_williamson_dgvbe_01.pdf (343.2 KB)


Help icon Streaming Video Help

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: