.png){kind=icon}
返回
A unifying look at sequence submodularity
.png){kind=icon}
OA
AI
DOI：10.1016/j.artint.2021.103486.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Several real-world problems in engineering and applied science require the selection of sequences that maximize a given reward function. Optimizing over sequences as opposed to sets requires exploring an exponentially larger search space and can become prohibitive in most cases of practical interest. However, if the objective function is submodular (intuitively, it exhibits a diminishing return property), the optimization problem becomes more manageable. Recently, there has been increasing interest in sequence submodularity in connection with applications such as recommender systems and online ad allocation. However, mostly ad hoc models and solutions have emerged within these applicative contexts. In consequence, the field appears fragmented and lacks coherence. In this paper, we offer a unified view of sequence submodularity and provide a generalized greedy algorithm that enjoys strong theoretical guarantees. We show how our approach naturally captures several application domains, and our algorithm encompasses existing methods, improving over them. (C) 2021 The Authors. Published by Elsevier B.V.
Keyword:
Submodularity
Sequence submodularity
Greedy algorithms
Suboptimal algorithms
Detection problems
Search-and-tracking
Environmental monitoring
Scheduling
Recommender systems
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
13.9
论文数:
6.1K
被引数:
1.9W
机构
查看更多机构
引用论文
分享收藏Combining temporal planning with probabilistic reasoning for autonomous surveillance missions.png)
AUTONOMOUS ROBOTSOAAI
AUTONOMOUS ROBOTSIF4.3
OAAI分享收藏
分享收藏分享收藏 没有更多内容