BriefGPT.xyz
Nov, 2023
求和最大子模函数博弈
Sum-max Submodular Bandits
HTML
PDF
Stephen Pasteris, Alberto Rumi, Fabio Vitale, Nicolò Cesa-Bianchi
TL;DR
在线决策问题、子模函数、求和-最大函数、强化学习以及后悔上界是该研究论文的主要关键词和内容。
Abstract
Many
online decision-making problems
correspond to maximizing a sequence of
submodular functions
. In this work, we introduce
sum-max functions
→