295 citations · 710 across the 81 of their papers we have counts for
6 papers · 1 filter
Optimal Multi-Objective Best Arm Identification with Fixed Confidence
Zhirui Chen, P. N. Karthik, Yeow Meng Chee +1
We consider a multi-armed bandit setting with finitely many arms, in which each arm yields an -dimensional vector reward upon selection. We assume that the reward of each dimens…
Fixed-Budget Differentially Private Best Arm Identification
Zhirui Chen, P. N. Karthik, Yeow Meng Chee +1
We study best arm identification (BAI) in linear bandits in the fixed-budget regime under differential privacy constraints, when the arm rewards are supported on the unit interval.…
Learning to Search Feasible and Infeasible Regions of Routing Problems with Flexible Neural k-Opt
Yining Ma, Zhiguang Cao, Yeow Meng Chee
In this paper, we present Neural k-Opt (NeuOpt), a novel learning-to-search (L2S) solver for routing problems. It learns to perform flexible k-opt exchanges based on a tailored act…
Federated Best Arm Identification with Heterogeneous Clients
Zhirui Chen, P. N. Karthik, Vincent Y. F. Tan +1
We study best arm identification in a federated multi-armed bandit setting with a central server and multiple clients, when each client has access to a {\em subset} of arms and eac…
Learning Generalizable Models for Vehicle Routing Problems via Knowledge Distillation
Jieyi Bi, Yining Ma, Jiahai Wang +4
Recent neural methods for vehicle routing problems always train and test the deep models on the same instance distribution (i.e., uniform). To tackle the consequent cross-distribut…
Efficient Neural Neighborhood Search for Pickup and Delivery Problems
Yining Ma, Jingwen Li, Zhiguang Cao +4
We present an efficient Neural Neighborhood Search (N2S) approach for pickup and delivery problems (PDPs). In specific, we design a powerful Synthesis Attention that allows the van…