Picture for Yuko Kuroki

Yuko Kuroki

Query-Efficient Correlation Clustering with Noisy Oracle

Add code
Feb 02, 2024
Viaarxiv icon

Best-of-Both-Worlds Algorithms for Linear Contextual Bandits

Add code
Dec 24, 2023
Viaarxiv icon

Dynamic Structure Estimation from Bandit Feedback

Add code
Jun 02, 2022
Figure 1 for Dynamic Structure Estimation from Bandit Feedback
Figure 2 for Dynamic Structure Estimation from Bandit Feedback
Figure 3 for Dynamic Structure Estimation from Bandit Feedback
Figure 4 for Dynamic Structure Estimation from Bandit Feedback
Viaarxiv icon

Combinatorial Pure Exploration with Bottleneck Reward Function and its Extension to General Reward Functions

Add code
Feb 24, 2021
Figure 1 for Combinatorial Pure Exploration with Bottleneck Reward Function and its Extension to General Reward Functions
Figure 2 for Combinatorial Pure Exploration with Bottleneck Reward Function and its Extension to General Reward Functions
Figure 3 for Combinatorial Pure Exploration with Bottleneck Reward Function and its Extension to General Reward Functions
Figure 4 for Combinatorial Pure Exploration with Bottleneck Reward Function and its Extension to General Reward Functions
Viaarxiv icon

Combinatorial Pure Exploration with Full-bandit Feedback and Beyond: Solving Combinatorial Optimization under Uncertainty with Limited Observation

Add code
Dec 31, 2020
Figure 1 for Combinatorial Pure Exploration with Full-bandit Feedback and Beyond: Solving Combinatorial Optimization under Uncertainty with Limited Observation
Viaarxiv icon

Online Dense Subgraph Discovery via Blurred-Graph Feedback

Add code
Jun 24, 2020
Figure 1 for Online Dense Subgraph Discovery via Blurred-Graph Feedback
Figure 2 for Online Dense Subgraph Discovery via Blurred-Graph Feedback
Figure 3 for Online Dense Subgraph Discovery via Blurred-Graph Feedback
Figure 4 for Online Dense Subgraph Discovery via Blurred-Graph Feedback
Viaarxiv icon

Combinatorial Pure Exploration with Partial or Full-Bandit Linear Feedback

Add code
Jun 14, 2020
Figure 1 for Combinatorial Pure Exploration with Partial or Full-Bandit Linear Feedback
Viaarxiv icon

Graph Mining Meets Crowdsourcing: Extracting Experts for Answer Aggregation

Add code
May 17, 2019
Figure 1 for Graph Mining Meets Crowdsourcing: Extracting Experts for Answer Aggregation
Figure 2 for Graph Mining Meets Crowdsourcing: Extracting Experts for Answer Aggregation
Figure 3 for Graph Mining Meets Crowdsourcing: Extracting Experts for Answer Aggregation
Figure 4 for Graph Mining Meets Crowdsourcing: Extracting Experts for Answer Aggregation
Viaarxiv icon

Polynomial-time Algorithms for Combinatorial Pure Exploration with Full-bandit Feedback

Add code
Feb 27, 2019
Figure 1 for Polynomial-time Algorithms for Combinatorial Pure Exploration with Full-bandit Feedback
Figure 2 for Polynomial-time Algorithms for Combinatorial Pure Exploration with Full-bandit Feedback
Figure 3 for Polynomial-time Algorithms for Combinatorial Pure Exploration with Full-bandit Feedback
Figure 4 for Polynomial-time Algorithms for Combinatorial Pure Exploration with Full-bandit Feedback
Viaarxiv icon