conftrace_

John C.S. Lui

38 papers · 2018–2026 · 8 conferences · across top CS/AI conferences

Achievements

Jump to papers ↓
+13 more ↓ 🌍 Conference Polyglot (7) 🏃 Academic Marathon (7) 🧭 Keyword Pioneer 🌉 Interdisciplinary Bridge 🐣 Hot Topic Early Bird
🌉 Interdisciplinary Bridge 🧭 Keyword Pioneer 🐣 Hot Topic Early Bird 🤝 Dynamic Duo (11) 👑 Triple Crown 🏆 Grand Slam 🧬 Topic Evolution 💎 Century Club (35) 🚀 Conference Pioneer Prolific Year (8) 🗃️ Keyword Collector (103) The Questioner 🔥 Unstoppable (8)

Conferences

NIPS (12) ICML (9) AAAI (6) ICLR (5) IJCAI (2) UAI (2) ACL (1) AISTATS (1)

Papers

Online Multi-LLM Selection via Contextual Bandits Under Unstructured Context Evolution AAAI 2026 Large Language Model-Enhanced Multi-Armed Bandits ACL 2026 A Multi-Agent Conversational Bandit Approach to Online Evaluation and Selection of User-Aligned LLM Responses AAAI 2026 Stochastic Bandits Robust to Adversarial Attacks ICLR 2025 An Enhanced Levenberg--Marquardt Method via Gram Reduction AAAI 2025 Quantum Best Arm Identification with Quantum Oracles AAAI 2025 Variance-Dependent Regret Bounds for Nonstationary Linear Bandits AISTATS 2025 Model-based RL as a Minimalist Approach to Horizon-Free and Second-Order Bounds ICLR 2025 Demystifying Online Clustering of Bandits: Enhanced Exploration Under Stochastic and Smoothed Adversarial Contexts ICLR 2025 Bandit Learning in Matching Markets with Indifference ICLR 2025 Offline Learning for Combinatorial Multi-armed Bandits ICML 2025 Quantum Algorithms for Finite-horizon Markov Decision Processes ICML 2025 Online Clustering of Dueling Bandits ICML 2025 Federated In-Context Learning: Iterative Refinement for Improved Answer Quality ICML 2025 Provable Zero-Shot Generalization in Offline Reinforcement Learning ICML 2025 Fusing Reward and Dueling Feedback in Stochastic Bandits ICML 2025 Combinatorial Multivariant Multi-Armed Bandits with Applications to Episodic Reinforcement Learning and Beyond ICML 2024 Quantum Algorithm for Online Exp-concave Optimization ICML 2024 Quantum Algorithms for Non-smooth Non-convex Optimization NIPS 2024 D-LLM: A Token Adaptive Computing Resource Allocation Strategy for Large Language Models NIPS 2024 Exploration for Free: How Does Reward Heterogeneity Improve Regret in Cooperative Multi-agent Bandits? UAI 2023 Achieving Near-Optimal Individual Regret & Low Communications in Multi-Agent Bandits ICLR 2023 Contextual Combinatorial Bandits with Probabilistically Triggered Arms ICML 2023 Online Clustering of Bandits with Misspecified User Models NIPS 2023 Multi-Fidelity Multi-Armed Bandits Revisited NIPS 2023 Online Corrupted User Detection and Regret Minimization NIPS 2023 Block Broyden's Methods for Solving Nonlinear Equations NIPS 2023 Uncertainty-Aware Instance Reweighting for Off-Policy Learning NIPS 2023 Batch-Size Independent Regret Bounds for Combinatorial Semi-Bandits with Probabilistically Triggered Arms or Independent Arms NIPS 2022 Federated online clustering of bandits UAI 2022 Cooperative Stochastic Bandits with Asynchronous Agents and Constrained Feedback NIPS 2021 Restless-UCB, an Efficient and Low-complexity Algorithm for Online Restless Bandits NIPS 2020 Adversarial Bandits with Corruptions: Regret Lower Bound and No-regret Algorithm NIPS 2020 Understanding Persuasion Cascades in Online Product Rating Systems AAAI 2019 Submodular Optimization over Streams with Inhomogeneous Decays AAAI 2019 Modeling the Assimilation-Contrast Effects in Online Product Rating Systems: Debiasing and Recommendations IJCAI 2018 Beyond the Click-Through Rate: Web Link Selection with Multi-level Feedback IJCAI 2018 Community Exploration: From Offline Optimization to Online Learning NIPS 2018