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. 1902.10582
  4. Cited By
Polynomial-time Algorithms for Multiple-arm Identification with
  Full-bandit Feedback

Polynomial-time Algorithms for Multiple-arm Identification with Full-bandit Feedback

27 February 2019
Yuko Kuroki
Liyuan Xu
Atsushi Miyauchi
Junya Honda
Masashi Sugiyama
ArXivPDFHTML

Papers citing "Polynomial-time Algorithms for Multiple-arm Identification with Full-bandit Feedback"

16 / 16 papers shown
Title
Explicit Best Arm Identification in Linear Bandits Using No-Regret
  Learners
Explicit Best Arm Identification in Linear Bandits Using No-Regret Learners
Mohammadi Zaki
Avinash Mohan
Aditya Gopalan
106
9
0
13 Jun 2020
PAC Identification of Many Good Arms in Stochastic Multi-Armed Bandits
PAC Identification of Many Good Arms in Stochastic Multi-Armed Bandits
A. Chaudhuri
Shivaram Kalyanakrishnan
41
26
0
24 Jan 2019
Combinatorial Pure Exploration with Continuous and Separable Reward
  Functions and Its Applications (Extended Version)
Combinatorial Pure Exploration with Continuous and Separable Reward Functions and Its Applications (Extended Version)
Weiran Huang
Jungseul Ok
Liang-Sheng Li
Wei Chen
94
61
0
04 May 2018
Disagreement-Based Combinatorial Pure Exploration: Sample Complexity
  Bounds and an Efficient Algorithm
Disagreement-Based Combinatorial Pure Exploration: Sample Complexity Bounds and an Efficient Algorithm
Tongyi Cao
A. Krishnamurthy
38
8
0
21 Nov 2017
Fully adaptive algorithm for pure exploration in linear bandits
Fully adaptive algorithm for pure exploration in linear bandits
Liyuan Xu
Junya Honda
Masashi Sugiyama
43
84
0
16 Oct 2017
Nearly Optimal Sampling Algorithms for Combinatorial Pure Exploration
Nearly Optimal Sampling Algorithms for Combinatorial Pure Exploration
Lijie Chen
Anupam Gupta
Jiacheng Li
Mingda Qiao
Ruosong Wang
80
47
0
04 Jun 2017
Scalable Generalized Linear Bandits: Online Computation and Hashing
Scalable Generalized Linear Bandits: Online Computation and Hashing
Kwang-Sung Jun
Aniruddha Bhargava
Robert D. Nowak
Rebecca Willett
61
124
0
01 Jun 2017
The End of Optimism? An Asymptotic Analysis of Finite-Armed Linear
  Bandits
The End of Optimism? An Asymptotic Analysis of Finite-Armed Linear Bandits
Tor Lattimore
Csaba Szepesvári
91
103
0
14 Oct 2016
Multiple-Play Bandits in the Position-Based Model
Multiple-Play Bandits in the Position-Based Model
Paul Lagrée
Claire Vernade
Olivier Cappé
32
83
0
08 Jun 2016
Pure Exploration of Multi-armed Bandit Under Matroid Constraints
Pure Exploration of Multi-armed Bandit Under Matroid Constraints
Lijie Chen
Anupam Gupta
Jian Li
59
49
0
23 May 2016
On the Optimal Sample Complexity for Best Arm Identification
On the Optimal Sample Complexity for Best Arm Identification
Lijie Chen
Jian Li
58
59
0
12 Nov 2015
Optimal Regret Analysis of Thompson Sampling in Stochastic Multi-armed
  Bandit Problem with Multiple Plays
Optimal Regret Analysis of Thompson Sampling in Stochastic Multi-armed Bandit Problem with Multiple Plays
Junpei Komiyama
Junya Honda
Hiroshi Nakagawa
52
134
0
02 Jun 2015
Best-Arm Identification in Linear Bandits
Best-Arm Identification in Linear Bandits
Marta Soare
A. Lazaric
Rémi Munos
55
178
0
22 Sep 2014
On the Complexity of Best Arm Identification in Multi-Armed Bandit
  Models
On the Complexity of Best Arm Identification in Multi-Armed Bandit Models
E. Kaufmann
Olivier Cappé
Aurélien Garivier
142
1,021
0
16 Jul 2014
lil' UCB : An Optimal Exploration Algorithm for Multi-Armed Bandits
lil' UCB : An Optimal Exploration Algorithm for Multi-Armed Bandits
Kevin Jamieson
Matthew Malloy
Robert D. Nowak
Sébastien Bubeck
82
411
0
27 Dec 2013
Multiple Identifications in Multi-Armed Bandits
Multiple Identifications in Multi-Armed Bandits
Sébastien Bubeck
Tengyao Wang
N. Viswanathan
95
173
0
14 May 2012
1