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. 1905.03125
  4. Cited By
Batch-Size Independent Regret Bounds for the Combinatorial Multi-Armed
  Bandit Problem

Batch-Size Independent Regret Bounds for the Combinatorial Multi-Armed Bandit Problem

8 May 2019
Nadav Merlis
Shie Mannor
ArXivPDFHTML

Papers citing "Batch-Size Independent Regret Bounds for the Combinatorial Multi-Armed Bandit Problem"

5 / 5 papers shown
Title
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
Non-stationary Bandits and Meta-Learning with a Small Set of Optimal
  Arms
Non-stationary Bandits and Meta-Learning with a Small Set of Optimal Arms
Javad Azizi
T. Duong
Yasin Abbasi-Yadkori
András Gyorgy
Claire Vernade
Mohammad Ghavamzadeh
34
8
0
25 Feb 2022
Risk-Aware Algorithms for Combinatorial Semi-Bandits
Risk-Aware Algorithms for Combinatorial Semi-Bandits
Ranga Shaarad Ayyagari
Ambedkar Dukkipati
13
1
0
02 Dec 2021
Confidence-Budget Matching for Sequential Budgeted Learning
Confidence-Budget Matching for Sequential Budgeted Learning
Yonathan Efroni
Nadav Merlis
Aadirupa Saha
Shie Mannor
19
10
0
05 Feb 2021
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