Streaming Adaptive Submodular Maximization

08/17/2022
by   Shaojie Tang, et al.
0

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 order, and there have been few studies for the stream-based setting where items arrive in an arbitrary order and one must immediately decide whether to select an item or not upon its arrival. In this paper, we introduce a new class of utility functions, semi-policywise submodular functions. We develop a series of effective algorithms to maximize a semi-policywise submodular function under the stream-based setting.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/07/2020

Adaptive Cascade Submodular Maximization

In this paper, we propose and study the cascade submodular maximization ...
research
04/10/2021

Beyond Pointwise Submodularity: Non-Monotone Adaptive Submodular Maximization subject to a Knapsack Constraint

In this paper, we study the non-monotone adaptive submodular maximizatio...
research
01/17/2023

Ranking with submodular functions on the fly

Maximizing submodular functions have been studied extensively for a wide...
research
02/09/2012

Predicting Contextual Sequences via Submodular Function Maximization

Sequence optimization, where the items in a list are ordered to maximize...
research
05/14/2019

Adaptive Robust Optimization with Nearly Submodular Structure

Constrained submodular maximization has been extensively studied in the ...
research
08/16/2023

Non-monotone Sequential Submodular Maximization

In this paper, we study a fundamental problem in submodular optimization...
research
11/01/2021

Partial-Adaptive Submodular Maximization

The goal of a typical adaptive sequential decision making problem is to ...

Please sign up or login with your details

Forgot password? Click here to reset