Yuanyu Wan
32 papers · 2018–2026 · 7 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+10 more ↓ Show less ↑
🏃 Academic Marathon (7) 🌉 Interdisciplinary Bridge 🧭 Keyword Pioneer 🌍 Conference Polyglot (7) 🐝 Cross-Pollinator (14)
🌍
Conference Polyglot
(7)
🏃
Academic Marathon
(7)
🌈
Renaissance Researcher
(5)
🤝
Dynamic Duo
(22)
🔬
Deep Specialist
(21)
🧬
Topic Evolution
⚡
Prolific Year
(12)
💎
Century Club
(31)
🔥
Unstoppable
(6)
🗃️
Keyword Collector
(94)
Conferences
AAAI (10)
ICML (7)
NIPS (6)
COLT (3)
IJCAI (3)
JMLR (2)
ICCV (1)
Top co-authors
Keywords
regret bound
(17)
online learning
(10)
online convex optimization
(10)
strongly convex
(5)
projection-free algorithm
(4)
dynamic regret
(4)
distributed learning
(4)
frank-wolfe algorithm
(3)
delayed feedback
(3)
spectral gap
(2)
communication complexity
(2)
line search
(2)
matrix sketching
(2)
frequent direction
(2)
multi-armed bandit
(2)
online optimization
(2)
gradient descent
(2)
convex optimization
(2)
switching cost
(2)
gossip algorithm
(2)
Papers
Beyond the Lower Bound: Bridging Regret Minimization and Best Arm Identification in Lexicographic Bandits
AAAI 2026
Mixture of Online and Offline Experts for Non-Stationary Time Series
AAAI 2025
Revisiting Differentially Private Algorithms for Decentralized Online Learning
ICML 2025
Dataset Ownership Verification for Pre-trained Masked Models
ICCV 2025
Black-Box Reductions for Decentralized Online Convex Optimization in Changing Environments
COLT 2025
Smoothed Online Convex Optimization with Delayed Feedback
IJCAI 2025
Problem-dependent Regret for Lexicographic Multi-Armed Bandits with Adversarial Corruptions
IJCAI 2025
Dimension-Free Adaptive Subgradient Methods with Frequent Directions
ICML 2025
Multi-objective Linear Reinforcement Learning with Lexicographic Rewards
ICML 2025
Optimal and Efficient Algorithms for Decentralized Online Convex Optimization
JMLR 2025
Revisiting Projection-Free Online Learning with Time-Varying Constraints
AAAI 2025
Safe Online Convex Optimization with Heavy-Tailed Observation Noises
AAAI 2025
Online Nonsubmodular Optimization with Delayed Feedback in the Bandit Setting
AAAI 2025
Nearly Optimal Regret for Decentralized Online Convex Optimization
COLT 2024
Improved Regret for Bandit Convex Optimization with Delayed Feedback
NIPS 2024
Continuous Contrastive Learning for Long-Tailed Semi-Supervised Recognition
NIPS 2024
Online Composite Optimization Between Stochastic and Adversarial Environments
NIPS 2024
Non-stationary Projection-Free Online Learning with Dynamic and Adaptive Regret Guarantees
AAAI 2024
Projection-Free Variance Reduction Methods for Stochastic Constrained Multi-Level Compositional Optimization
ICML 2024
Non-stationary Online Convex Optimization with Arbitrary Delays
ICML 2024
Learning Label Shift Correction for Test-Agnostic Long-Tailed Recognition
ICML 2024
Distributed Projection-Free Online Learning for Smooth and Convex Losses
AAAI 2023
Efficient Algorithms for Generalized Linear Bandits with Heavy-tailed Rewards
NIPS 2023
Improved Dynamic Regret for Online Frank-Wolfe
COLT 2023
Projection-free Distributed Online Learning with Sublinear Communication Complexity
JMLR 2022
Online Frank-Wolfe with Arbitrary Delays
NIPS 2022
Projection-free Online Learning in Dynamic Environments
AAAI 2021
Approximate Multiplication of Sparse Matrices with Limited Space
AAAI 2021
Online Convex Optimization with Continuous Switching Constraint
NIPS 2021
Projection-free Online Learning over Strongly Convex Sets
AAAI 2021
Projection-free Distributed Online Convex Optimization with $O(\sqrtT)$ Communication Complexity
ICML 2020
Efficient Adaptive Online Learning via Frequent Directions
IJCAI 2018