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. 1909.11426
  4. Cited By
Online Non-Monotone DR-submodular Maximization
v1v2 (latest)

Online Non-Monotone DR-submodular Maximization

25 September 2019
Nguyen Kim Thang
Abhinav Srivastav
ArXiv (abs)PDFHTML

Papers citing "Online Non-Monotone DR-submodular Maximization"

3 / 3 papers shown
Title
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
58
6
0
16 Aug 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
71
0
0
15 May 2022
Online Learning via Offline Greedy Algorithms: Applications in Market
  Design and Optimization
Online Learning via Offline Greedy Algorithms: Applications in Market Design and Optimization
Rad Niazadeh
Negin Golrezaei
Joshua R. Wang
Fransisca Susan
Ashwinkumar Badanidiyuru
61
43
0
18 Feb 2021
1