Streaming adaptive submodular maximization*

被引:2
作者
Tang, Shaojie [1 ]
Yuan, Jing [2 ]
机构
[1] Univ Texas Dallas, Naveen Jindal Sch Management, Richardson, TX 75080 USA
[2] Univ North Texas, Dept Comp Sci & Engn, Denton, TX USA
关键词
Approximation algorithm; Adaptive submodularity; Streaming setting;
D O I
10.1016/j.tcs.2022.11.030
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Adaptive submodular maximization has been extensively studied in the literature. However, most of existing studies in this field focus on pool-based setting, where one is allowed to 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.(c) 2022 Elsevier B.V. All rights reserved.
引用
收藏
页数:11
相关论文
共 22 条
[1]  
Adibi A, 2020, ADV NEURAL INF PROCE, V33
[2]  
[Anonymous], 2013, Advances in Neural Information Processing Systems
[3]   Streaming Submodular Maximization: Massive Data Summarization on the Fly [J].
Badanidiyuru, Ashwinkumar ;
Mirzasoleiman, Baharan ;
Karbasi, Amin ;
Krause, Andreas .
PROCEEDINGS OF THE 20TH ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING (KDD'14), 2014, :671-680
[4]  
Chekuri C., 2021, PREPRINT, DOI 10.48550/arXiv.2107.03662
[5]  
Fujii K, 2016, ADV NEUR IN, V29
[6]  
Golovin D, 2011, J ARTIF INTELL RES, V42, P427
[7]  
Golovin Daniel., 2010, NIPS
[8]  
Gonen A, 2013, J MACH LEARN RES, V14, P2583
[9]  
Gotovos A, 2015, PROCEEDINGS OF THE TWENTY-FOURTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI), P1996
[10]  
Kazemi E, 2019, PR MACH LEARN RES, V97