4 papers
Multi-Play Combinatorial Semi-Bandit Problem
Shintaro Nakamura, Yuko Kuroki, Wei Chen
In the combinatorial semi-bandit (CSB) problem, a player selects an action from a combinatorial action set and observes feedback from the base arms included in the action. While CS…
Effective and Efficient Conductance-based Community Search at Billion Scale
Longlong Lin, Yue He, Wei Chen +3
Community search is a widely studied semi-supervised graph clustering problem, retrieving a high-quality connected subgraph containing the user-specified query vertex. However, exi…
Structural-Entropy-Based Sample Selection for Efficient and Effective Learning
Tianchi Xie, Jiangning Zhu, Guozu Ma +4
Sample selection improves the efficiency and effectiveness of machine learning models by providing informative and representative samples. Typically, samples can be modeled as a sa…
Query-Efficient Correlation Clustering with Noisy Oracle
Yuko Kuroki, Atsushi Miyauchi, Francesco Bonchi +1
We study a general clustering setting in which we have elements to be clustered, and we aim to perform as few queries as possible to an oracle that returns a noisy sample of th…