Skip to content
conftrace_

Chung-Wei Lee

17 papers · 2018–2025 · 5 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 ↓
+7 more ↓ πŸ—ΊοΈ Taxonomy Completionist (24) πŸƒ Academic Marathon Β· Sprint 🌍 Conference Polyglot Β· Silver πŸŒ‰ Interdisciplinary Bridge Β· Bronze 🐣 Hot Topic Early Bird
πŸ† Keyword Champion (2) 🀝 Dynamic Duo (15) πŸ‘‘ Triple Crown ⚑ Prolific Year Β· Productive πŸ”₯ Unstoppable Β· Bronze πŸ’Ž Century Club Β· Bronze πŸ—ƒοΈ Keyword Collector (69)

Venues

NeurIPS (8) COLT (4) ICLR (2) ICML (2) CVPR (1)

Top co-authors

Haipeng Luo (15) Christian Kroer (7) Chen-Yu Wei (7) Gabriele Farina (6) Mengxiao Zhang (5) Julien Grand-ClΓ©ment (3) Yifang Chen (2) Ioannis Anagnostides (2) Tuomas Sandholm (2) Weiqiang Zheng (2)

Research topics

Machine Learning (17) Optimization & Theory (15) Artificial Intelligence (9) Mathematics & Optimization (9) Optimization (9) Core AI (8) Learning Types (6) Reinforcement Learning (3) Methods (3) Core Methods (1) Learning Paradigms (1)

Keywords

regret bound (8) online learning (6) last-iterate convergence (5) game theory (4) nash equilibrium (3) zero-sum game (3) contextual bandit (3) optimistic gradient descent (2) dynamic regret (2) regret matching (2) self-concordant barrier (2) extensive-form game (2) multi-armed bandit (2) multiplicative weights update (2) optimistic learning (2) counterfactual regret minimization (1) linear function approximation (1) pac learning (1) multi-agent learning (1) sample complexity (1)

Papers

Last-Iterate Convergence Properties of Regret-Matching Algorithms in Games ICLR 2025 Fast Last-Iterate Convergence of Learning in Games Requires Forgetful Algorithms NeurIPS 2024 Context-lumpable stochastic bandits NeurIPS 2023 Regret Matching+: (In)Stability and Fast Convergence in Games NeurIPS 2023 Kernelized Multiplicative Weights for 0/1-Polyhedral Games: Bridging the Gap Between Learning in Extensive-Form and Normal-Form Games ICML 2022 Near-Optimal No-Regret Learning Dynamics for General Convex Games NeurIPS 2022 Uncoupled Learning Dynamics with $O(\log T)$ Swap Regret in Multiplayer Games NeurIPS 2022 Achieving Near Instance-Optimality and Minimax-Optimality in Stochastic and Adversarial Linear Bandits Simultaneously ICML 2021 Last-iterate Convergence in Extensive-Form Games NeurIPS 2021 Last-iterate Convergence of Decentralized Optimistic Gradient Descent/Ascent in Infinite-horizon Competitive Markov Games COLT 2021 Linear Last-iterate Convergence in Constrained Saddle-point Optimization ICLR 2021 Policy Optimization in Adversarial MDPs: Improved Exploration via Dilated Bonuses NeurIPS 2021 A Closer Look at Small-loss Bounds for Bandits with Graph Feedback COLT 2020 Bias no more: high-probability data-dependent regret bounds for adversarial bandits and MDPs NeurIPS 2020 Achieving Optimal Dynamic Regret for Non-stationary Bandits without Prior Information COLT 2019 A New Algorithm for Non-stationary Contextual Bandits: Efficient, Optimal and Parameter-free COLT 2019 Multi-Label Zero-Shot Learning With Structured Knowledge Graphs CVPR 2018