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
相关论文
共 50 条
  • [41] Quick Streaming Algorithms for Maximization of Monotone Submodular Functions in Linear Time
    Kuhnle, Alan
    24TH INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND STATISTICS (AISTATS), 2021, 130
  • [42] Multi-Pass Streaming Algorithms for Monotone Submodular Function Maximization
    Huang, Chien-Chung
    Kakimura, Naonori
    THEORY OF COMPUTING SYSTEMS, 2022, 66 (01) : 354 - 394
  • [43] Multi-Pass Streaming Algorithms for Monotone Submodular Function Maximization
    Chien-Chung Huang
    Naonori Kakimura
    Theory of Computing Systems, 2022, 66 : 354 - 394
  • [44] Streaming Algorithm for Monotone k-Submodular Maximization with Cardinality Constraints
    Ene, Alina
    Nguyen, Huy L.
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 162, 2022,
  • [45] Adaptive Maximization of Pointwise Submodular Functions With Budget Constraint
    Nguyen Viet Cuong
    Xu, Huan
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 29 (NIPS 2016), 2016, 29
  • [46] A Polynomial Lower Bound on Adaptive Complexity of Submodular Maximization
    Li, Wenzheng
    Liu, Paul
    Vondrak, Jan
    PROCEEDINGS OF THE 52ND ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (STOC '20), 2020, : 140 - 152
  • [47] Adaptive Sampling for Fast Constrained Maximization of Submodular Functions
    Quinzan, Francesco
    Doskoc, Vanja
    Goebel, Andreas
    Friedrich, Tobias
    24TH INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND STATISTICS (AISTATS), 2021, 130
  • [48] The One-Way Communication Complexity of Submodular Maximization with Applications to Streaming and Robustness
    Feldman, Moran
    Norouzi-Fard, Ashkan
    Svensson, Ola
    Zenklusen, Rico
    JOURNAL OF THE ACM, 2023, 70 (04)
  • [49] An optimal streaming algorithm for non-submodular functions maximization on the integer lattice
    Bin Liu
    Zihan Chen
    Huijuan Wang
    Weili Wu
    Journal of Combinatorial Optimization, 2023, 45
  • [50] Fast Streaming Algorithms for k-Submodular Maximization under a Knapsack Constraint
    Pham, Canh V.
    Ha, Dung K. T.
    Hoang, Huan X.
    Tran, Tan D.
    2022 IEEE 9TH INTERNATIONAL CONFERENCE ON DATA SCIENCE AND ADVANCED ANALYTICS (DSAA), 2022, : 260 - 269