research
∙
06/02/2022
Dynamic Structure Estimation from Bandit Feedback
This work present novel method for structure estimation of an underlying...
share
research
∙
02/24/2021
Combinatorial Pure Exploration with Bottleneck Reward Function and its Extension to General Reward Functions
In this paper, we study the Combinatorial Pure Exploration problem with ...
research
∙
12/31/2020
Combinatorial Pure Exploration with Full-bandit Feedback and Beyond: Solving Combinatorial Optimization under Uncertainty with Limited Observation
Combinatorial optimization is one of the fundamental research fields tha...
research
∙
06/24/2020
Online Dense Subgraph Discovery via Blurred-Graph Feedback
Dense subgraph discovery aims to find a dense component in edge-weighted...
research
∙
06/14/2020
Combinatorial Pure Exploration with Partial or Full-Bandit Linear Feedback
In this paper, we propose the novel model of combinatorial pure explorat...
research
∙
06/14/2019
Non-zero-sum Stackelberg Budget Allocation Game for Computational Advertising
Computational advertising has been studied to design efficient marketing...
research
∙
05/17/2019
Graph Mining Meets Crowdsourcing: Extracting Experts for Answer Aggregation
Aggregating responses from crowd workers is a fundamental task in the pr...
research
∙
02/27/2019
Polynomial-time Algorithms for Combinatorial Pure Exploration with Full-bandit Feedback
We study the problem of stochastic combinatorial pure exploration (CPE),...
research
∙
03/16/2018