Predicting Contextual Sequences via Submodular Function Maximization

Details Predicting Contextual Sequences via Submodular Function Maximization Predicting Contextual Sequences via Submodular Function Maximization

2012-02-09

arxiv.org/abs/1202.2112v1

Computer Science

Artificial Intelligence

8 pages

Scientific paper

Sequence optimization, where the items in a list are ordered to maximize some reward has many applications such as web advertisement placement, search, and control libraries in robotics. Previous work in sequence optimization produces a static ordering that does not take any features of the item or context of the problem into account. In this work, we propose a general approach to order the items within the sequence based on the context (e.g., perceptual information, environment description, and goals). We take a simple, efficient, reduction-based approach where the choice and order of the items is established by repeatedly learning simple classifiers or regressors for each "slot" in the sequence. Our approach leverages recent work on submodular function maximization to provide a formal regret reduction from submodular sequence optimization to simple cost-sensitive prediction. We apply our contextual sequence prediction algorithm to optimize control libraries and demonstrate results on two robotics problems: manipulator trajectory prediction and mobile robot path planning.

Affiliated with

Also associated with

No associations

Rating

Predicting Contextual Sequences via Submodular Function Maximization does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Predicting Contextual Sequences via Submodular Function Maximization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Predicting Contextual Sequences via Submodular Function Maximization will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-273633