BriefGPT.xyz
Mar, 2016
有限预算下点子模函数的自适应最大化
Maximize Pointwise Cost-sensitively Submodular Functions With Budget Constraint
HTML
PDF
Nguyen Viet Cuong, Huan Xu
TL;DR
研究了具有预算约束的最坏情况自适应优化问题,证明了具有点位置次模性和点位置成本敏感次模性的效用函数的两个简单贪心算法不是近似最优的,但其中最优的贪心算法是近似最优的,可以用于解决有限预算下的主动学习问题。
Abstract
We study the worst-case
adaptive optimization
problem with
budget constraint
. Unlike previous works, we consider the general setting where the cost is a set function on sets of decisions. For this setting, we inv
→