2 citations · 5 across the 7 of their papers we have counts for
7 papers
Envy-Free Allocation of Indivisible Goods via Noisy Queries
Zihan Li, Yan Hao Ling, Jonathan Scarlett +1
We introduce a problem of fairly allocating indivisible goods (items) in which the agents' valuations cannot be observed directly, but instead can only be accessed via noisy querie…
Complexity of Round-Robin Allocation with Potentially Noisy Queries
Zihan Li, Pasin Manurangsi, Jonathan Scarlett +1
We study the complexity of a fundamental algorithm for fairly allocating indivisible items, the round-robin algorithm. For agents and items, we show that the algorithm can…
Multi-view MERA Subspace Clustering
Zhen Long, Ce Zhu, Jie Chen +3
Tensor-based multi-view subspace clustering (MSC) can capture high-order correlation in the self-representation tensor. Current tensor decompositions for MSC suffer from highly unb…
Regret Bounds for Noise-Free Cascaded Kernelized Bandits
Zihan Li, Jonathan Scarlett
We consider optimizing a function network in the noise-free grey-box setting with RKHS function classes, where the exact intermediate results are observable. We assume that the str…
A Robust Phased Elimination Algorithm for Corruption-Tolerant Gaussian Process Bandits
Ilija Bogunovic, Zihan Li, Andreas Krause +1
We consider the sequential optimization of an unknown, continuous, and expensive to evaluate reward function, from noisy and adversarially corrupted observed rewards. When the corr…
Gaussian Process Bandit Optimization with Few Batches
Zihan Li, Jonathan Scarlett
In this paper, we consider the problem of black-box optimization using Gaussian Process (GP) bandit optimization with a small number of batches. Assuming the unknown function has a…
Learning Erdős-Rényi Random Graphs via Edge Detecting Queries
Zihan Li, Matthias Fresacher, Jonathan Scarlett
In this paper, we consider the problem of learning an unknown graph via queries on groups of nodes, with the result indicating whether or not at least one edge is present among tho…