1 citations · 2 across the 4 of their papers we have counts for
5 papers
Cooperative Multi-agent Bandits: Distributed Algorithms with Optimal Individual Regret and Constant Communication Costs
Lin Yang, Xuchuang Wang, Mohammad Hajiesmaili +3
Recently, there has been extensive study of cooperative multi-agent multi-armed bandits where a set of distributed agents cooperatively play the same multi-armed bandit game. The g…
A GNN-Guided Predict-and-Search Framework for Mixed-Integer Linear Programming
Qingyu Han, Linxin Yang, Qian Chen +5
Mixed-integer linear programming (MILP) is widely employed for modeling combinatorial optimization problems. In practice, similar MILP instances with only coefficient variations ar…
On-Demand Communication for Asynchronous Multi-Agent Bandits
Yu-Zhen Janice Chen, Lin Yang, Xuchuang Wang +4
This paper studies a cooperative multi-agent multi-armed stochastic bandit problem where agents operate asynchronously -- agent pull times and rates are unknown, irregular, and het…
The Online Knapsack Problem with Departures
Bo Sun, Lin Yang, Mohammad Hajiesmaili +4
The online knapsack problem is a classic online resource allocation problem in networking and operations research. Its basic version studies how to pack online arriving items of di…
Efficient primal heuristics for mixed-integer linear programs
Akang Wang, Linxin Yang, Sha Lai +7
This paper is a short report about our work for the primal task in the Machine Learning for Combinatorial Optimization NeurIPS 2021 Competition. For each dataset of our interest in…