A Universal Kernel for Learning Regular Languages
author:
Leonid Kontorovich,
Weizmann Institute
Description
We give a universal kernel that renders all the regular languages linearly separable. We are not able to compute
this kernel efficiently and conjecture that it is intractable, but we do have an efficient ǫ-approximation
You might be experiencing some problems with Your Video player.
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.
Related content
Visitors who watched this lecture also watched...
32 comments
Link this page
Would you like to put a link to this lecture on your homepage?Go ahead! Copy the HTML snippet !
