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. 2302.01324
  4. Cited By
Randomized Greedy Learning for Non-monotone Stochastic Submodular
  Maximization Under Full-bandit Feedback

Randomized Greedy Learning for Non-monotone Stochastic Submodular Maximization Under Full-bandit Feedback

2 February 2023
Fares Fourati
Vaneet Aggarwal
Christopher J. Quinn
Mohamed-Slim Alouini
ArXivPDFHTML

Papers citing "Randomized Greedy Learning for Non-monotone Stochastic Submodular Maximization Under Full-bandit Feedback"

2 / 2 papers shown
Title
Online Influence Maximization under Linear Threshold Model
Online Influence Maximization under Linear Threshold Model
Shuai Li
Fang-yuan Kong
Kejie Tang
Qizhi Li
Wei Chen
40
39
0
12 Nov 2020
Thompson Sampling for Complex Bandit Problems
Thompson Sampling for Complex Bandit Problems
Aditya Gopalan
Shie Mannor
Yishay Mansour
144
202
0
03 Nov 2013
1