BriefGPT.xyz
Feb, 2018
非子模目标强鲁棒性最大化
Robust Maximization of Non-Submodular Objectives
HTML
PDF
Ilija Bogunovic, Junyao Zhao, Volkan Cevher
TL;DR
研究了在最劣情况下,基于一个基数约束k最大化单调集合函数的删除问题,提出了一种新的算法Oblivious-Greedy,并对于更广泛的非凸优化问题证明了首个常数因子逼近保证,通过提出新的度量参数,如逆曲率,证明了这些结果适用于线性区域,并通过支撑选择和方差缩小等两个实际问题的案例研究得到了验证。
Abstract
We study the problem of maximizing a
monotone set function
subject to a
cardinality constraint
$k$ in the setting where some number of elements $\tau$ is deleted from the returned set. The focus of this work is o
→