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)

4 May 2018

Jungseul Ok

Papers citing "Combinatorial Pure Exploration with Continuous and Separable Reward Functions and Its Applications (Extended Version)"

9 / 9 papers shown

Title
Query-Efficient Correlation Clustering with Noisy Oracle Yuko Kuroki Atsushi Miyauchi Francesco Bonchi Wei Chen 15 2 0 02 Feb 2024
Combinatorial Pure Exploration with Bottleneck Reward Function Yihan Du Yuko Kuroki Wei Chen 14 6 0 24 Feb 2021
Combinatorial Pure Exploration with Full-bandit Feedback and Beyond: Solving Combinatorial Optimization under Uncertainty with Limited Observation Yuko Kuroki Junya Honda Masashi Sugiyama OffRL 18 1 0 31 Dec 2020
Online Dense Subgraph Discovery via Blurred-Graph Feedback Yuko Kuroki Atsushi Miyauchi Junya Honda Masashi Sugiyama 11 15 0 24 Jun 2020
Locally Differentially Private (Contextual) Bandits Learning Kai Zheng Tianle Cai Weiran Huang Zhenguo Li Liwei Wang 12 61 0 01 Jun 2020
Exploration by Optimisation in Partial Monitoring Tor Lattimore Csaba Szepesvári 23 38 0 12 Jul 2019
MaxGap Bandit: Adaptive Algorithms for Approximate Ranking S. Katariya Ardhendu Shekhar Tripathy Robert D. Nowak 11 6 0 03 Jun 2019
Polynomial-time Algorithms for Multiple-arm Identification with Full-bandit Feedback Yuko Kuroki Liyuan Xu Atsushi Miyauchi Junya Honda Masashi Sugiyama 17 17 0 27 Feb 2019
Matroid Bandits: Fast Combinatorial Optimization with Learning B. Kveton Zheng Wen Azin Ashkan Hoda Eydgahi Brian Eriksson 46 119 0 20 Mar 2014