Shiyin Lu
16 papers · 2018–2025 · 8 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+8 more ↓ Show less ↑
π Cross-Pollinator (9) π§ Keyword Pioneer π Conference Polyglot (8) π Academic Marathon (7) π Renaissance Researcher (5)
πΊοΈ
Taxonomy Completionist
(18)
π§
Keyword Pioneer
π
Conference Polyglot
(8)
π€
Dynamic Duo
(12)
π
Grand Slam
π
Conference Pioneer
π
Century Club
(16)
ποΈ
Keyword Collector
(55)
Conferences
AAAI (5)
NIPS (3)
ICLR (2)
ICML (2)
AISTATS (1)
ICCV (1)
IJCAI (1)
UAI (1)
Top co-authors
Keywords
dynamic regret
(5)
online learning
(3)
regret bound
(3)
online convex optimization
(3)
attention mechanism
(2)
adaptive regret
(2)
online algorithm
(2)
upper confidence bound
(2)
non-stationary environment
(2)
graph feedback
(2)
stochastic reward
(1)
gradient descent
(1)
visual question answering
(1)
strongly convex
(1)
catastrophic forgetting
(1)
reproducing kernel hilbert space
(1)
determinantal point process
(1)
markov decision process
(1)
domain adaptation
(1)
pareto optimality
(1)
Papers
MDP3: A Training-free Approach for List-wise Frame Selection in Video-LLMs
ICCV 2025
Towards Unbiased Information Extraction and Adaptation in Cross-Domain Recommendation
AAAI 2025
Parrot: Multilingual Visual Instruction Tuning
ICML 2025
ZooProbe: A Data Engine for Evaluating, Exploring, and Evolving Large-scale Training Data for Multimodal LLMs
ICLR 2025
Non-stationary Projection-Free Online Learning with Dynamic and Adaptive Regret Guarantees
AAAI 2024
Wings: Learning Multimodal LLMs without Text-only Forgetting
NIPS 2024
Revisiting Smoothed Online Learning
NIPS 2021
Stochastic Bandits with Graph Feedback in Non-Stationary Environments
AAAI 2021
Stochastic Graphical Bandits with Adversarial Corruptions
AAAI 2021
Minimizing Dynamic Regret and Adaptive Regret Simultaneously
AISTATS 2020
SAdam: A Variant of Adam for Strongly Convex Functions
ICLR 2020
Adapting to Smoothness: A More Universal Algorithm for Online Convex Optimization
AAAI 2020
Adaptivity and Optimality: A Universal Algorithm for Online Convex Optimization
UAI 2019
Optimal Algorithms for Lipschitz Bandits with Heavy-tailed Rewards
ICML 2019
Multi-Objective Generalized Linear Bandits
IJCAI 2019
Adaptive Online Learning in Dynamic Environments
NIPS 2018