Skip to content
conftrace_

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.

Jump to papers ↓
+12 more ↓ πŸ—ΊοΈ 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)

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