John C.S. Lui
38 papers · 2018–2026 · 8 venues · across top CS/AI venues
Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.
Achievements
Jump to papers ↓+12 more ↓ Show less ↑
πΊοΈ Taxonomy Completionist (59) π Conference Polyglot Β· Silver π Academic Marathon Β· Sprint π Interdisciplinary Bridge Β· Silver π£ Hot Topic Early Bird
π
Grand Slam
π¬
Deep Specialist
(12)
π
Keyword Champion
(2)
π
Triple Crown
π€
Dynamic Duo
(12)
β‘
Prolific Year Β· Prolific
π₯
Unstoppable Β· Bronze
β
The Questioner
π
Century Club Β· Bronze
π
Conference Pioneer
π
Renaissance Researcher
(7)
ποΈ
Keyword Collector
(162)
Top co-authors
Research topics
Machine Learning
(32)
Optimization & Theory
(23)
Mathematics & Optimization
(18)
Optimization
(18)
Artificial Intelligence
(17)
Core AI
(16)
Learning Types
(15)
Reinforcement Learning
(5)
Methods
(5)
Application Areas
(4)
Data Science & Analytics
(3)
Deep Learning
(3)
Interdisciplinary
(3)
Applications
(3)
Core Methods
(3)
Keywords
regret bound
(15)
multi-armed bandit
(12)
online learning
(9)
contextual bandit
(5)
quantum algorithm
(4)
regret minimization
(4)
large language model
(3)
in-context learning
(2)
quasi-newton method
(2)
superlinear convergence
(2)
stochastic optimization
(2)
online clustering
(2)
gradient estimation
(2)
online algorithm
(2)
markov chain
(2)
best arm identification
(2)
sample complexity
(2)
query complexity
(2)
federated learning
(2)
greedy algorithm
(2)
Papers
A Multi-Agent Conversational Bandit Approach to Online Evaluation and Selection of User-Aligned LLM Responses
AAAI 2026
Large Language Model-Enhanced Multi-Armed Bandits
ACL 2026
Online Multi-LLM Selection via Contextual Bandits Under Unstructured Context Evolution
AAAI 2026
An Enhanced Levenberg--Marquardt Method via Gram Reduction
AAAI 2025
Bandit Learning in Matching Markets with Indifference
ICLR 2025
Demystifying Online Clustering of Bandits: Enhanced Exploration Under Stochastic and Smoothed Adversarial Contexts
ICLR 2025
Federated In-Context Learning: Iterative Refinement for Improved Answer Quality
ICML 2025
Fusing Reward and Dueling Feedback in Stochastic Bandits
ICML 2025
Model-based RL as a Minimalist Approach to Horizon-Free and Second-Order Bounds
ICLR 2025
Offline Learning for Combinatorial Multi-armed Bandits
ICML 2025
Online Clustering of Dueling Bandits
ICML 2025
Provable Zero-Shot Generalization in Offline Reinforcement Learning
ICML 2025
Quantum Algorithms for Finite-horizon Markov Decision Processes
ICML 2025
Quantum Best Arm Identification with Quantum Oracles
AAAI 2025
Stochastic Bandits Robust to Adversarial Attacks
ICLR 2025
Variance-Dependent Regret Bounds for Nonstationary Linear Bandits
AISTATS 2025
Combinatorial Multivariant Multi-Armed Bandits with Applications to Episodic Reinforcement Learning and Beyond
ICML 2024
D-LLM: A Token Adaptive Computing Resource Allocation Strategy for Large Language Models
NeurIPS 2024
Quantum Algorithm for Online Exp-concave Optimization
ICML 2024
Quantum Algorithms for Non-smooth Non-convex Optimization
NeurIPS 2024
Achieving Near-Optimal Individual Regret & Low Communications in Multi-Agent Bandits
ICLR 2023
Block Broyden's Methods for Solving Nonlinear Equations
NeurIPS 2023
Contextual Combinatorial Bandits with Probabilistically Triggered Arms
ICML 2023
Exploration for Free: How Does Reward Heterogeneity Improve Regret in Cooperative Multi-agent Bandits?
UAI 2023
Multi-Fidelity Multi-Armed Bandits Revisited
NeurIPS 2023
Online Clustering of Bandits with Misspecified User Models
NeurIPS 2023
Online Corrupted User Detection and Regret Minimization
NeurIPS 2023
Uncertainty-Aware Instance Reweighting for Off-Policy Learning
NeurIPS 2023
Batch-Size Independent Regret Bounds for Combinatorial Semi-Bandits with Probabilistically Triggered Arms or Independent Arms
NeurIPS 2022
Federated online clustering of bandits
UAI 2022
Cooperative Stochastic Bandits with Asynchronous Agents and Constrained Feedback
NeurIPS 2021
Adversarial Bandits with Corruptions: Regret Lower Bound and No-regret Algorithm
NeurIPS 2020
Restless-UCB, an Efficient and Low-complexity Algorithm for Online Restless Bandits
NeurIPS 2020
Submodular Optimization over Streams with Inhomogeneous Decays
AAAI 2019
Understanding Persuasion Cascades in Online Product Rating Systems
AAAI 2019
Beyond the Click-Through Rate: Web Link Selection with Multi-level Feedback
IJCAI 2018
Community Exploration: From Offline Optimization to Online Learning
NeurIPS 2018
Modeling the Assimilation-Contrast Effects in Online Product Rating Systems: Debiasing and Recommendations
IJCAI 2018