A Universal Kernel for Learning Regular Languages
author: Leonid Kontorovich,
Weizmann Institute of Science
published: Sept. 5, 2007, recorded: August 2007, views: 4307
published: Sept. 5, 2007, recorded: August 2007, views: 4307
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.
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
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: