Who is Afraid of Non-Convex Loss Functions?

author: Yann LeCun, New York University (NYU)
published: Dec. 29, 2007,   recorded: December 2007,   views: 46368


Related Open Educational Resources

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.


The NIPS community has suffered of an acute convexivitis epidemic:
- ML applications seem to have trouble moving beyond logistic regression, SVMs, and exponential-family graphical models;
- For a new ML model, convexity is viewed as a virtue;
- Convexity is sometimes a virtue;
- But it is often a limitation.
ML theory has essentially never moved beyond convex models - the same way control theory has not really moved beyond linear systems.

See Also:

Download slides icon Download slides: eml07_lecun_wia_01.pdf (8.2┬áMB)

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: