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. 2002.05392
  4. Cited By
Tight Lower Bounds for Combinatorial Multi-Armed Bandits
v1v2v3 (latest)

Tight Lower Bounds for Combinatorial Multi-Armed Bandits

Annual Conference Computational Learning Theory (COLT), 2020
13 February 2020
Nadav Merlis
Shie Mannor
ArXiv (abs)PDFHTML

Papers citing "Tight Lower Bounds for Combinatorial Multi-Armed Bandits"

14 / 14 papers shown
Multi-Play Combinatorial Semi-Bandit Problem
Multi-Play Combinatorial Semi-Bandit Problem
Shintaro Nakamura
Yuko Kuroki
Wei Chen
148
0
0
12 Sep 2025
Graph-Dependent Regret Bounds in Multi-Armed Bandits with Interference
Graph-Dependent Regret Bounds in Multi-Armed Bandits with Interference
Fateme Jamshidi
Mohammad Shahverdikondori
Negar Kiyavash
378
4
0
10 Mar 2025
Cost-Effective Online Multi-LLM Selection with Versatile Reward Models
Cost-Effective Online Multi-LLM Selection with Versatile Reward Models
Xiangxiang Dai
Jin Li
Xutong Liu
Anqi Yu
J. C. Lui
335
34
0
26 May 2024
No-Regret M${}^{\natural}$-Concave Function Maximization: Stochastic Bandit Algorithms and Hardness of Adversarial Full-Information Setting
No-Regret M♮{}^{\natural}♮-Concave Function Maximization: Stochastic Bandit Algorithms and Hardness of Adversarial Full-Information Setting
Taihei Oki
Shinsaku Sakaue
387
0
0
21 May 2024
Allocating Divisible Resources on Arms with Unknown and Random Rewards
Allocating Divisible Resources on Arms with Unknown and Random RewardsAnnual Conference Computational Learning Theory (COLT), 2023
Yi Xiong
Siyuan Li
256
0
0
28 Jun 2023
Batch-Size Independent Regret Bounds for Combinatorial Semi-Bandits with
  Probabilistically Triggered Arms or Independent Arms
Batch-Size Independent Regret Bounds for Combinatorial Semi-Bandits with Probabilistically Triggered Arms or Independent ArmsNeural Information Processing Systems (NeurIPS), 2022
Xutong Liu
Jinhang Zuo
Siwei Wang
Carlee Joe-Wong
John C. S. Lui
Wei Chen
415
28
0
31 Aug 2022
Cost-Efficient Distributed Learning via Combinatorial Multi-Armed
  Bandits
Cost-Efficient Distributed Learning via Combinatorial Multi-Armed Bandits
Maximilian Egger
Rawad Bitar
Antonia Wachter-Zeh
Deniz Gunduz
FedML
442
2
0
16 Feb 2022
Risk-Aware Algorithms for Combinatorial Semi-Bandits
Risk-Aware Algorithms for Combinatorial Semi-Bandits
Ranga Shaarad Ayyagari
Ambedkar Dukkipati
274
2
0
02 Dec 2021
Heterogeneous Multi-player Multi-armed Bandits: Closing the Gap and
  Generalization
Heterogeneous Multi-player Multi-armed Bandits: Closing the Gap and Generalization
Chengshuai Shi
Wei Xiong
Cong Shen
Jing Yang
346
30
0
27 Oct 2021
Confidence-Budget Matching for Sequential Budgeted Learning
Confidence-Budget Matching for Sequential Budgeted LearningInternational Conference on Machine Learning (ICML), 2021
Yonathan Efroni
Nadav Merlis
Aadirupa Saha
Shie Mannor
305
14
0
05 Feb 2021
Adversarial Combinatorial Bandits with General Non-linear Reward
  Functions
Adversarial Combinatorial Bandits with General Non-linear Reward FunctionsInternational Conference on Machine Learning (ICML), 2021
Xi Chen
Yanjun Han
Yining Wang
223
19
0
05 Jan 2021
Screening for an Infectious Disease as a Problem in Stochastic Control
Screening for an Infectious Disease as a Problem in Stochastic Control
Jakub Mareˇcek
246
3
0
01 Nov 2020
Online Competitive Influence Maximization
Online Competitive Influence MaximizationInternational Conference on Artificial Intelligence and Statistics (AISTATS), 2020
Jinhang Zuo
Xutong Liu
Carlee Joe-Wong
John C. S. Lui
Wei Chen
567
15
0
24 Jun 2020
Contextual Blocking Bandits
Contextual Blocking BanditsInternational Conference on Artificial Intelligence and Statistics (AISTATS), 2020
Soumya Basu
Orestis Papadigenopoulos
Constantine Caramanis
Sanjay Shakkottai
305
23
0
06 Mar 2020
1
Page 1 of 1