ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2004.11963
  4. Cited By
Online Learning with Cumulative Oversampling: Application to Budgeted
  Influence Maximization
v1v2v3 (latest)

Online Learning with Cumulative Oversampling: Application to Budgeted Influence Maximization

24 April 2020
Shatian Wang
Shuoguang Yang
Zhen Xu
Van-Anh Truong
ArXiv (abs)PDFHTML

Papers citing "Online Learning with Cumulative Oversampling: Application to Budgeted Influence Maximization"

1 / 1 papers shown
A Framework for Adapting Offline Algorithms to Solve Combinatorial
  Multi-Armed Bandit Problems with Bandit Feedback
A Framework for Adapting Offline Algorithms to Solve Combinatorial Multi-Armed Bandit Problems with Bandit FeedbackInternational Conference on Machine Learning (ICML), 2023
G. Nie
Yididiya Y. Nadew
Yanhui Zhu
Vaneet Aggarwal
Christopher J. Quinn
OffRL
323
17
0
30 Jan 2023
1
Page 1 of 1