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. 1703.01610
  4. Cited By
Improving Regret Bounds for Combinatorial Semi-Bandits with
  Probabilistically Triggered Arms and Its Applications

Improving Regret Bounds for Combinatorial Semi-Bandits with Probabilistically Triggered Arms and Its Applications

5 March 2017
Qinshi Wang
Wei Chen
ArXivPDFHTML

Papers citing "Improving Regret Bounds for Combinatorial Semi-Bandits with Probabilistically Triggered Arms and Its Applications"

9 / 9 papers shown
Title
Bandits with Anytime Knapsacks
Bandits with Anytime Knapsacks
Eray Can Elumar
Cem Tekin
Osman Yagan
107
0
0
30 Jan 2025
Combinatorial Multivariant Multi-Armed Bandits with Applications to Episodic Reinforcement Learning and Beyond
Combinatorial Multivariant Multi-Armed Bandits with Applications to Episodic Reinforcement Learning and Beyond
Xutong Liu
Siwei Wang
Jinhang Zuo
Han Zhong
Xuchuang Wang
Zhiyong Wang
Shuai Li
Mohammad Hajiesmaili
J. C. Lui
Wei Chen
85
1
0
03 Jun 2024
Online Influence Maximization under Decreasing Cascade Model
Online Influence Maximization under Decreasing Cascade Model
Fang-yuan Kong
Jize Xie
Baoxiang Wang
Tao Yao
Shuai Li
13
5
0
19 May 2023
Provably Efficient Reinforcement Learning for Online Adaptive Influence
  Maximization
Provably Efficient Reinforcement Learning for Online Adaptive Influence Maximization
Kaixuan Huang
Yuehua Wu
Xuezhou Zhang
Shenyinying Tu
Qingyun Wu
Mengdi Wang
Huazheng Wang
28
1
0
29 Jun 2022
Online Learning of Independent Cascade Models with Node-level Feedback
Online Learning of Independent Cascade Models with Node-level Feedback
Shuoguang Yang
Van-Anh Truong
21
2
0
06 Sep 2021
Best Arm Identification for Cascading Bandits in the Fixed Confidence
  Setting
Best Arm Identification for Cascading Bandits in the Fixed Confidence Setting
Zixin Zhong
Wang Chi Cheung
Vincent Y. F. Tan
26
8
0
23 Jan 2020
Nearly Optimal Algorithms for Piecewise-Stationary Cascading Bandits
Nearly Optimal Algorithms for Piecewise-Stationary Cascading Bandits
Lingda Wang
Huozhi Zhou
Bingcong Li
L. Varshney
Zhizhen Zhao
12
6
0
12 Sep 2019
Thompson Sampling for Combinatorial Semi-Bandits
Thompson Sampling for Combinatorial Semi-Bandits
Siwei Wang
Wei Chen
13
125
0
13 Mar 2018
Matroid Bandits: Fast Combinatorial Optimization with Learning
Matroid Bandits: Fast Combinatorial Optimization with Learning
B. Kveton
Zheng Wen
Azin Ashkan
Hoda Eydgahi
Brian Eriksson
46
119
0
20 Mar 2014
1