paper-with-me

Papers

Decision-Oriented Learning with Differentiable Submodular Maximization for Vehicle Routing Problem

2023-03-02 · Guangyao Shi, Pratap Tokekar

We study the problem of learning a function that maps context observations (input) to parameters of a submodular function (output). Our motivating case study is a specific type of vehicle routing problem, in which a team of Unmanned Ground Vehicles (UGVs) can serve as mobile charging stations to recharge a team of Unmanned Ground Vehicles (UAVs) that execute persistent monitoring tasks. {We want to learn the mapping from observations of UAV task routes and wind field to the parameters of a submodular objective function, which describes the distribution of landing positions of the UAVs .} Traditionally, such a learning problem is solved independently as a prediction phase without considering the downstream task optimization phase. However, the loss function used in prediction may be misaligned with our final goal, i.e., a good routing decision. Good performance in the isolated prediction phase does not necessarily lead to good decisions in the downstream routing task. In this paper, we propose a framework that incorporates task optimization as a differentiable layer in the prediction phase. Our framework allows end-to-end training of the prediction model without using engineered intermediate loss that is targeted only at the prediction performance. In the proposed framework, task optimization (submodular maximization) is made differentiable by introducing stochastic perturbations into deterministic algorithms (i.e., stochastic smoothing). We demonstrate the efficacy of the proposed framework using synthetic data. Experimental results of the mobile charging station routing problem show that the proposed framework can result in better routing decisions, e.g. the average number of UAVs recharged increases, compared to the prediction-optimization separate approach.

📄 PDF Abstract BibTeX arXiv:2303.01543

Code (0)

등록된 구현이 없습니다.

Tasks

Prediction

Similar Papers 제목 키워드 기반

Differentiable Greedy Submodular Maximization: Guarantees, Gradient Estimators, and Applications

2020-05-06 · Shinsaku Sakaue

Motivated by, e.g., sensitivity analysis and end-to-end learning, the demand for differentiable optimization algorithms has been significantly increasing. In this paper, we establish a theoretically guaranteed versatile …

Sensitivity

Differentiable Submodular Maximization

2018-03-05 · Sebastian Tschiatschek, Aytunc Sahin, Andreas Krause

We consider learning of submodular functions from data. These functions are important in machine learning and have a wide range of applications, e.g. data summarization, feature selection and active learning. Despite the…

Active LearningData Summarizationfeature selectionProduct Recommendation

Streaming Adaptive Submodular Maximization

2022-08-17 · Shaojie Tang, Jing Yuan

Many sequential decision making problems can be formulated as an adaptive submodular maximization problem. However, most of existing studies in this field focus on pool-based setting, where one can pick items in any orde…

Decision MakingSequential Decision Making

Robust Adaptive Submodular Maximization

2021-07-23 · Shaojie Tang

The goal of a sequential decision making problem is to design an interactive policy that adaptively selects a group of items, each selection is based on the feedback from the past, in order to maximize the expected utili…

Active LearningDecision MakingMarketingSequential Decision Making

Partial-Adaptive Submodular Maximization

2021-11-01 · Shaojie Tang, Jing Yuan

The goal of a typical adaptive sequential decision making problem is to design an interactive policy that selects a group of items sequentially, based on some partial observations, to maximize the expected utility. It ha…

Active LearningDecision MakingSequential Decision Making