John C. S. Lui
Choh-Ming Li Professor of Computer Science and Engineering
Works on online learning such as multi-armed bandits and reinforcement learning, network science and quantum networks.
John C. S. Lui's lab at CUHK works on reinforcement learning and learning theory & optimization. 155 papers since 2023, 51 at top venues, mostly NeurIPS and ICML. Applications close .
At a glance
- papers, 2023–2026
- 40/ year
- at T1 venues
- 33%
- PhD students
- —
- MS students
- —
- alumni listed
- —
Papers by yearfrom the lab homepage, 2023–2026
- 37 papers2026 · T1 9 · collecting
- 36 papers2025 · T1 20
- 36 papers2024 · T1 6
- 46 papers2023 · T1 16
T1 venuesOtherVenues: NeurIPS, ICML, INFOCOM, ICLR, KDD
Research focuspaper titles that use each topic's words
- Learning theory & optimization43 papers
- Reinforcement learning34 papers
- bandits30 papers
- online learning9 papers
- network science0 papers
Paper list
From the lab homepage.
202637 papers
- The Fortieth AAAI : AI Alignment Track, JanuaryA Multi-Agent Conversational Bandit Approach to Online Evaluation and Selection of User-Aligned LLM Responses (opens in a new tab)
- IEEE Journal on Selected Areas in Communications (JSAC),44: 4611-4625An Optimal Latency Qubit Transmission Strategy for Quantum Information Networks (opens in a new tab)
- Future Generation Computing Systems, 182: 108451Applying quantum error-correcting codes for fault-tolerant blind quantum cloud computation (opens in a new tab)
- The Web Conference (WWW) , AprilBANCO: Drift-Aware Batched Bandits for Adaptive Proximity Graph Pruning (opens in a new tab)
- IEEE Transactions on Big Data (TBD)Behavior Habits Enhanced Intention Learning for Session Based Recommendation.Da
- ACM Transactions on Information Systems (ToIS), 44(1): 26:1-26:32Beyond Texts: Incorporating Co-occurrences into the Review-based Conversation Recommendation Systems (opens in a new tab)
- IEEE/ACM Transactions on Networking (ToN), 34: 3932-3946Combinatorial Logistic Online Learning and Its Applications in Nonlinear Networked Systems (opens in a new tab)
- INFOCOM (T1)Constraint-Aware Combinatorial Bandits: Theoretical Foundations and Network Applications (opens in a new tab)
- IEEE/ACM Transactions on Networking (ToN), 34: 3609-3624Cooperative Bandit Algorithms with Optimal Regret and Communication Costs (opens in a new tab)
- IEEE/ACM Transactions on Networking (ToN), 34: 5114-5126Corruption-Resilient Combinatorial Bandit Learning for Heterogeneous Network Systems
- IEEE Trans. on Mobile Computing (TMC)COTRA: A Data Trading Framework for Multi-Source Data Cooperation (opens in a new tab)
- IEEE Transactions on Emerging Topics in Computational Intelligence (TETCI)Differentially Private Online Convex Optimization with Long-term Constraints via Gaussian Mechanism and Virtual Queue (opens in a new tab)
202536 papers
- IEEE/ACM Transactions on Networking (ToN), 33(1), FebA Fast Heuristic Entanglement Distribution Algorithm for Quantum Repeater Chains (opens in a new tab)
- KDD (T1)A Unified Online-Offline Framework for Co-Branding Campaign Recommendations (opens in a new tab)
- ACM Proc. Measurements and Analysis of Computing Systems, 9(1), 3:1-3:39Asynchronous Multi-Agent Bandits: Fully Distributed vs. Leader-Coordinated Algorithms (opens in a new tab)
- ICLR (T1)Bandit Learning in Matching Markets with Indifference (opens in a new tab)
- SCBubble: Towards Scalable Evolving Graph Processing via Mini-Batch Sorting (opens in a new tab)
- ACM SIGMETRICSCombinatorial Logistic Bandits (opens in a new tab)
- ICLR (T1)Demystifying Online Clustering of Bandits: Enhanced Exploration Under Stochastic and Smoothed Adversarial Contexts (opens in a new tab)
- SOSP (T1)DiffKV: Differentiated Memory Management for Large Language Models with Parallel KV Compaction (opens in a new tab)
- INFOCOM (T1)Exploring the Structural Property of the Optimal Entanglement Policy for Quantum Switch (opens in a new tab)
- ICML (T1)Federated In-Context Learning: Iterative Refinement for Improved Answer Quality (opens in a new tab)
- ICML (T1)Fusing Reward and Dueling Feedback in Stochastic Bandits (opens in a new tab)
- IEEE Trans. on Mobile Computing (TMC), 24(7), JulyIncremental Least-Recently-Used Algorithm: Good, Robust, and Predictable Performance (opens in a new tab)
202436 papers
- IEEE Transactions on Network and Service Management, 21(2), 1534-1549Achieving Multi-Time-Step Segment Routing via Traffic Prediction and Compressive Sensing Techniques (opens in a new tab)
- IEEE Transactions on Mobile Computing (TMC), 23(4), 3410-3423Analyzing Queueing Problems via Bandits with Linear Reward and Nonlinear Workload Fairness (opens in a new tab)
- ICML (T1)Combinatorial Multivariant Multi-Armed Bandits with Applications to Episodic Reinforcement Learning and Beyond (opens in a new tab)
- ACM Sigmetrics/PerformanceContinuous Query-based Data Trading (opens in a new tab)
- IEEE Transactions on Knowledge and Data Engineerin (TKDE), 36(12): 7825-7838Conversational Recommendation with OnlineLearning and Clustering on Misspecifed Users (opens in a new tab)
- The IEEE GLOBECOM SymposiaCooperative Multi-source Data Trading (opens in a new tab)
- NeurIPS (T1)D-LLM: A Token Adaptive Computing Resource Allocation Strategy for Large Language Models (opens in a new tab)
- MASSDaMPS: A Deadline-aware Multipath Packet Scheduler for Mobile Applications (opens in a new tab)
- IEEE/ACM Transactions on Networking (ToN), 32(6):5459-5474eMPTCP: A Framework to Fully Extend Multipath TCP (opens in a new tab)
- IEEE Transactions on Mobile Computing (TMC), 23(6): 7196-7209Eris: An Online Auction for Scheduling Unbiased Distributed Learning over Edge Wireless Networks (opens in a new tab)
- IEEE Int. Conference on Computer Communications (INFOCOM), May 20-23Fed-CVLC: Compressing Federated Learning Communications with Variable-Length Codes (opens in a new tab)
- IJCAI (T1)FedConPE: Efficient Federated Conversational Bandits with Heterogeneous Clients (opens in a new tab)
202346 papers
- IJCAI (T1)A Survey of Federated Evaluation in Federated Learning (opens in a new tab)
- IEEE Transactions on Mobile Computing (TMC), 34 (5), 1650-1666Accelerating Distributed DNN Training via Transport Layer Scheduling (opens in a new tab)
- ICLR (T1)Achieving Near-Optimal Individual Regret \& Low Communications in Multi-Agent Bandits (opens in a new tab)
- IEEE Transactions on Mobile ComputingAn Incentive Auction for Heterogeneous Client Selection in Federated Learning (opens in a new tab)
- IJCAI (T1)B. Soltani, Y.P. Zhou, V. Haghighi, John C.S. Lui. A Survey of Federated Evaluation in Federated Learning
- NeurIPS (T1)Block Broyden's Methods for Solving Nonlinear Equations (opens in a new tab)
- RANDOMClassical simulation of one-query quantum distinguishers (opens in a new tab)
- Transactions on Knowledge and Data Engineering (IEEE TKDE), 30(5), MayCommon Neighbors Matter: Fast Random Walk Sampling with Common Neighbor Awareness (opens in a new tab)
- KDD (T1)Communication Efficient Distributed Newton Method with Fast Convergence Rates (opens in a new tab)
- ICML (T1)Contextual Combinatorial Bandits with Probabilistically Triggered Arms (opens in a new tab)
- IEEE/ACM Transactions on Networking (ToN), 31(6), DecemberCooperation Preference Aware Shapley Value: Modeling, Algorithms and Applications (opens in a new tab)
- The IEEE International Conference on Distributed Computing Systems (ICDCS ).Data-Driven Rate Control for RDMA Networks: A Lightweight Online Learning Approach (opens in a new tab)
Where alumni went
Alumni are not listed on the lab homepage.
Apply to CUHKFall 2027
Computer Science and Engineering MPhil/PhD
- Round
- HKPFS / main round
- Opens
- —
- GRE
- See program page
- English
- Interview in English
- Fee
- See program page
Not yet confirmed for this intake.
Similar labsnearest by research summary
- CAToronto
Jimmy Ba
- Reinforcement learning
- USUT Austin
Sanjay Shakkottai
- Learning theory & optimization
- CNPeking
Ying Tan
- Trustworthy & safe ML
- SGNTU
Sean Du
- Trustworthy & safe ML
- USMIT
Luca Daniel
- Trustworthy & safe ML
- CNSJTU
Xiangzhong Fang
- Learning theory & optimization
Your notes
Save this lab to keep notes.
Data
Some numbers could not be verified:
- The member list could not be found on the lab site.
- The alumni list could not be found on the lab site.
- Collected
- Verified
- Papers
- The lab homepage
- Members
- Not collected
- Alumni
- Not collected
Tiers are venue classifications, not lab rankings.
CUHKcloses