3 papers
cs.LG2026
Probe-then-Commit Multi-Objective Bandits: Theoretical Benefits of Limited Multi-Arm Feedback
Ming Shi
We study an online resource-selection problem motivated by multi-radio access selection and mobile edge computing offloading. In each round, an agent chooses among candidate li…
cs.LG2026
Bi-Level Online Provisioning and Scheduling with Switching Costs and Cross-Level Constraints
Jialei Liu, C. Emre Koksal, Ming Shi
We study a bi-level online provisioning and scheduling problem motivated by network resource allocation, where provisioning decisions are made at a slow time scale while queue-/sta…
cs.LG2026
Communication-Corruption Coupling and Verification in Cooperative Multi-Objective Bandits
Ming Shi
We study cooperative stochastic multi-armed bandits with vector-valued rewards under adversarial corruption and limited verification. In each of rounds, each of agents sele…