Robust Multi-objective Learning with Mentor Feedback

author: Robert Schapire, Department of Computer Science, Princeton University
published: July 15, 2014,   recorded: June 2014,   views: 2375

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.


We study decision making when each action is described by a set of objectives, all of which are to be maximized. During the training phase, we have access to the actions of an outside agent (“mentor”). In the test phase, our goal is to maximally improve upon the mentor’s (unobserved) actions across all objectives. We present an algorithm with a vanishing regret compared with the optimal possible improvement, and show that our regret bound is the best possible. The bound is independent of the number of actions, and scales only as the logarithm of the number of objectives.

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Reviews and comments:

Comment1 abbiehurst22, March 6, 2023 at 3:47 p.m.:

The finest instructional I've ever seen, in my opinion. So that we may receive more information like this, please spread the word about this topic

Write your own review or comment:

make sure you have javascript enabled or clear this field: