ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1802.06052
  4. Cited By
Online Continuous Submodular Maximization

Online Continuous Submodular Maximization

16 February 2018
Lin Chen
Hamed Hassani
Amin Karbasi
ArXiv (abs)PDFHTML

Papers citing "Online Continuous Submodular Maximization"

24 / 24 papers shown
Title
Decentralized Projection-free Online Upper-Linearizable Optimization with Applications to DR-Submodular Optimization
Decentralized Projection-free Online Upper-Linearizable Optimization with Applications to DR-Submodular Optimization
Yiyang Lu
M. Pedramfar
Vaneet Aggarwal
121
1
0
30 Jan 2025
Fast Submodular Function Maximization
Fast Submodular Function Maximization
Lianke Qin
Zhao Song
Yitan Wang
81
10
0
15 May 2023
Stochastic Submodular Maximization via Polynomial Estimators
Stochastic Submodular Maximization via Polynomial Estimators
Gözde Özcan
Stratis Ioannidis
30
1
0
17 Mar 2023
Online Submodular Coordination with Bounded Tracking Regret: Theory,
  Algorithm, and Applications to Multi-Robot Coordination
Online Submodular Coordination with Bounded Tracking Regret: Theory, Algorithm, and Applications to Multi-Robot Coordination
Zirui Xu
Hongyu Zhou
Vasileios Tzoumas
80
9
0
26 Sep 2022
Online Learning for Non-monotone Submodular Maximization: From Full
  Information to Bandit Feedback
Online Learning for Non-monotone Submodular Maximization: From Full Information to Bandit Feedback
Qixin Zhang
Zengde Deng
Zaiyi Chen
Kuangqi Zhou
Haoyuan Hu
Yu Yang
56
6
0
16 Aug 2022
Online Decentralized Frank-Wolfe: From theoretical bound to applications
  in smart-building
Online Decentralized Frank-Wolfe: From theoretical bound to applications in smart-building
Angan Mitra
K. Nguyen
T. Nguyen
Denis Trystram
P. Youssef
69
2
0
31 Jul 2022
Online Nonsubmodular Minimization with Delayed Costs: From Full
  Information to Bandit Feedback
Online Nonsubmodular Minimization with Delayed Costs: From Full Information to Bandit Feedback
Tianyi Lin
Aldo Pacchiano
Yaodong Yu
Michael I. Jordan
64
0
0
15 May 2022
Improved Regret Bounds for Online Submodular Maximization
Improved Regret Bounds for Online Submodular Maximization
Omid Sadeghi
P. Raut
Maryam Fazel
46
4
0
15 Jun 2021
Submodular + Concave
Submodular + Concave
Siddharth Mitra
Moran Feldman
Amin Karbasi
35
19
0
09 Jun 2021
Scalable Projection-Free Optimization
Scalable Projection-Free Optimization
Mingrui Zhang
83
0
0
07 May 2021
An optimization problem for continuous submodular functions
An optimization problem for continuous submodular functions
L. Csirmaz
60
2
0
26 Sep 2020
Continuous Submodular Maximization: Beyond DR-Submodularity
Continuous Submodular Maximization: Beyond DR-Submodularity
Moran Feldman
Amin Karbasi
57
5
0
21 Jun 2020
From Sets to Multisets: Provable Variational Inference for Probabilistic
  Integer Submodular Models
From Sets to Multisets: Provable Variational Inference for Probabilistic Integer Submodular Models
Aytunc Sahin
Yatao Bian
J. M. Buhmann
Andreas Krause
38
6
0
01 Jun 2020
Provable Non-Convex Optimization and Algorithm Validation via
  Submodularity
Provable Non-Convex Optimization and Algorithm Validation via Submodularity
Yatao Bian
41
3
0
18 Dec 2019
One Sample Stochastic Frank-Wolfe
One Sample Stochastic Frank-Wolfe
Mingrui Zhang
Zebang Shen
Aryan Mokhtari
Hamed Hassani
Amin Karbasi
115
59
0
10 Oct 2019
Multi-Point Bandit Algorithms for Nonstationary Online Nonconvex
  Optimization
Multi-Point Bandit Algorithms for Nonstationary Online Nonconvex Optimization
Abhishek Roy
Krishnakumar Balasubramanian
Saeed Ghadimi
P. Mohapatra
OffRL
64
15
0
31 Jul 2019
Online Continuous DR-Submodular Maximization with Long-Term Budget
  Constraints
Online Continuous DR-Submodular Maximization with Long-Term Budget Constraints
Omid Sadeghi
Maryam Fazel
51
25
0
30 Jun 2019
Dual Averaging Method for Online Graph-structured Sparsity
Dual Averaging Method for Online Graph-structured Sparsity
Baojian Zhou
F. Chen
Yiming Ying
42
8
0
26 May 2019
Non-monotone DR-submodular Maximization: Approximation and Regret
  Guarantees
Non-monotone DR-submodular Maximization: Approximation and Regret Guarantees
C. Dürr
Nguyen Kim Thang
Abhinav Srivastav
Léo Tible
37
7
0
23 May 2019
MaxHedge: Maximising a Maximum Online
MaxHedge: Maximising a Maximum Online
Stephen Pasteris
Fabio Vitale
Kevin S. Chan
Shiqiang Wang
Mark Herbster
20
0
0
28 Oct 2018
Fast greedy algorithms for dictionary selection with generalized
  sparsity constraints
Fast greedy algorithms for dictionary selection with generalized sparsity constraints
K. Fujii
Tasuku Soma
20
6
0
07 Sep 2018
Differentially Private Online Submodular Optimization
Differentially Private Online Submodular Optimization
Adrian Rivera Cardoso
Rachel Cummings
33
6
0
06 Jul 2018
Optimal Algorithms for Continuous Non-monotone Submodular and
  DR-Submodular Maximization
Optimal Algorithms for Continuous Non-monotone Submodular and DR-Submodular Maximization
Rad Niazadeh
Tim Roughgarden
Joshua R. Wang
63
53
0
24 May 2018
Projection-Free Online Optimization with Stochastic Gradient: From
  Convexity to Submodularity
Projection-Free Online Optimization with Stochastic Gradient: From Convexity to Submodularity
Lin Chen
Christopher Harshaw
Hamed Hassani
Amin Karbasi
84
77
0
22 Feb 2018
1