Robustness and Generalizability for Markovian Samples
published: Oct. 20, 2009, recorded: September 2009, views: 2855
Report a problem or upload filesIf 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.
We consider robustness of learning algorithms and prove that under a very general setup, robustness of an algorithm implies that it generalizes, and consequently, a robust algorithm that asymptotically minimizes empirical risk is consistent. In particular, this relationship holds in the case where both training samples and testing samples are generated according to evolving of a Markovian chain satisfying the Doeblin condition. We further provide conditions that ensure robustness and hence generalizability and in some cases consistency, all under the Markovian setup. Two notable examples are support vector machines and Lasso.
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !