Yuanyu Wan
34 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 ↓+8 more ↓ Show less ↑
πΊοΈ Taxonomy Completionist (43) π Academic Marathon Β· Sprint π Conference Polyglot Β· Silver π Interdisciplinary Bridge Β· Bronze π£ Hot Topic Early Bird
π¬
Deep Specialist
(23)
π€
Dynamic Duo
(22)
π§¬
Topic Evolution
π
Keyword Champion
(4)
β‘
Prolific Year Β· Prolific
π₯
Unstoppable Β· Bronze
π
Century Club Β· Bronze
ποΈ
Keyword Collector
(133)
Top co-authors
Research topics
Machine Learning
(28)
Mathematics & Optimization
(27)
Optimization
(27)
Optimization & Theory Β· Machine Learning
(23)
Learning Types
(10)
Deep Learning
(5)
Artificial Intelligence
(3)
Mathematics
(3)
Optimization & Theory Β· Deep Learning
(3)
Application Areas
(2)
Core AI
(2)
Models
(2)
Computer Science
(1)
Reinforcement Learning
(1)
Core Methods
(1)
Keywords
regret bound
(21)
online learning
(10)
online convex optimization
(10)
dynamic regret
(6)
strongly convex
(6)
spectral gap
(4)
projection-free algorithm
(4)
distributed learning
(4)
frank-wolfe algorithm
(3)
delayed feedback
(3)
frequent direction
(3)
convex optimization
(3)
gossip algorithm
(3)
line search
(2)
adaptive subgradient method
(2)
switching cost
(2)
matrix sketching
(2)
online optimization
(2)
communication complexity
(2)
gradient descent
(2)
Papers
Beyond the Lower Bound: Bridging Regret Minimization and Best Arm Identification in Lexicographic Bandits
AAAI 2026
Sampling-Aware Quantization for Diffusion Models
CVPR 2026
SpatiaLQA: A Benchmark for Evaluating Spatial Logical Reasoning in Vision-Language Models
CVPR 2026
Black-Box Reductions for Decentralized Online Convex Optimization in Changing Environments
COLT 2025
Dataset Ownership Verification for Pre-trained Masked Models
ICCV 2025
Dimension-Free Adaptive Subgradient Methods with Frequent Directions
ICML 2025
Mixture of Online and Offline Experts for Non-Stationary Time Series
AAAI 2025
Multi-objective Linear Reinforcement Learning with Lexicographic Rewards
ICML 2025
Online Nonsubmodular Optimization with Delayed Feedback in the Bandit Setting
AAAI 2025
Optimal and Efficient Algorithms for Decentralized Online Convex Optimization
JMLR 2025
Problem-dependent Regret for Lexicographic Multi-Armed Bandits with Adversarial Corruptions
IJCAI 2025
Revisiting Differentially Private Algorithms for Decentralized Online Learning
ICML 2025
Revisiting Projection-Free Online Learning with Time-Varying Constraints
AAAI 2025
Safe Online Convex Optimization with Heavy-Tailed Observation Noises
AAAI 2025
Smoothed Online Convex Optimization with Delayed Feedback
IJCAI 2025
Continuous Contrastive Learning for Long-Tailed Semi-Supervised Recognition
NeurIPS 2024
Improved Regret for Bandit Convex Optimization with Delayed Feedback
NeurIPS 2024
Learning Label Shift Correction for Test-Agnostic Long-Tailed Recognition
ICML 2024
Nearly Optimal Regret for Decentralized Online Convex Optimization
COLT 2024
Non-stationary Online Convex Optimization with Arbitrary Delays
ICML 2024
Non-stationary Projection-Free Online Learning with Dynamic and Adaptive Regret Guarantees
AAAI 2024
Online Composite Optimization Between Stochastic and Adversarial Environments
NeurIPS 2024
Projection-Free Variance Reduction Methods for Stochastic Constrained Multi-Level Compositional Optimization
ICML 2024
Distributed Projection-Free Online Learning for Smooth and Convex Losses
AAAI 2023
Efficient Algorithms for Generalized Linear Bandits with Heavy-tailed Rewards
NeurIPS 2023
Improved Dynamic Regret for Online Frank-Wolfe
COLT 2023
Online Frank-Wolfe with Arbitrary Delays
NeurIPS 2022
Projection-free Distributed Online Learning with Sublinear Communication Complexity
JMLR 2022
Approximate Multiplication of Sparse Matrices with Limited Space
AAAI 2021
Online Convex Optimization with Continuous Switching Constraint
NeurIPS 2021
Projection-free Online Learning in Dynamic Environments
AAAI 2021
Projection-free Online Learning over Strongly Convex Sets
AAAI 2021
Projection-free Distributed Online Convex Optimization with O(βT) Communication Complexity
ICML 2020
Efficient Adaptive Online Learning via Frequent Directions
IJCAI 2018