About me

My name is Xutong Liu. I am now a postdoctoral fellow working with Prof. John C.S. Lui (IEEE/ACM Fellow) at the ANSR Lab, the Chinese University of Hong Kong (CUHK). I received my Ph.D. degree from the Computer Science and Engineering Department at CUHK in 2022, proudly supervised by Prof. John C.S. Lui. Prior to that, I received my bachelor’s degree with an honored rank (top 5%) from University of Science and Technology of China (USTC) in 2017. For my research, I am fortunate to collaborate with many outstanding researchers, including Dr. Wei Chen (IEEE Fellow, Chair of MSR Asia Theory Center), Dr. Siwei Wang from Microsoft Research, Prof. Shuai Li from Shanghai Jiao Tong University, Dr. Jinhang Zuo, Prof. Mohammad Hajiesmaili, Prof. Don Towsley (IEEE/ACM Fellow) from University of Massachusetts Amherst, Prof. Carlee Joe-Wong from Carnegie Mellon University, and Prof. Adam Wierman from California Institute of Technology.

Research

My research focuses on data-driven combinatorial optimization and combinatorial optimization under uncertainty, which are intersections of combinatorial optimization, stochastic modeling, online learning, and reinforcement learning. Through the lens of algorithm design and mathematical tools, I am interested in solving decision-making problems for recommender systems, network systems, and data-center optimization. For these applications, my goal is to develop efficient solutions with provable learning efficiency, scalability, and generalizability guarantee.

My recent works mainly study online learning and reinforcement learning problems, e.g., combinatorial multi-armed bandits, distributed/federated multi-armed bandits, and reinforcement learning with large action space.

Selected Publications

News

  • May. 2024: Our works on combinatorial bandits view to solve episodic RL and quantum algorithm for online exp-concave optimization are accepted to ICML 2024.
  • Dec. 2023: Our work on federated contextual cascading bandits is accepted to AAAI 2024.
  • Dec. 2023: Our work on learning context-aware probabilistic maximum coverage bandits is accepted to INFOCOM 2024.
  • Oct. 2023: I am visiting University of Massachusetts Amherst as a visiting scholar advised by Prof. Mohammad Hajiesmaili.
  • Sept. 2023: Our work on online clustering of bandits with misspecified user model is accepted to NeurIPS 2023.
  • April. 2023: Our work on contextual combinatorial bandits with probabilistically triggered arms is accepted to ICML 2023.
  • April. 2023: I was awarded RGC Postdoctoral Fellowship (one of 50 awardees globally)!
  • Dec. 2022: Our work on variance-adaptive algorithm for probabilistic maximum coverage problem is accepted to INFOCOM 2023.
  • Nov. 2022: Our work on explorative key-term selection strategies for conversational contextual bandits is accepted to AAAI 2023.
  • Sept. 2022: Our work on batch-size independent regret bounds for combinatorial bandits is accepted to NeurIPS 2022.
  • July. 2022: I successfully pass my Ph.D. thesis defence! I will join CUHK as a postdoc this fall.