Shiyin Lu
16 papers · 2018–2025 · 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 ↓+6 more ↓ Show less ↑
πΊοΈ Taxonomy Completionist (23) π Conference Polyglot Β· Silver π Academic Marathon Β· Sprint π Interdisciplinary Bridge Β· Bronze π£ Hot Topic Early Bird
π
Grand Slam
π€
Dynamic Duo
(12)
π
Conference Pioneer
π
Century Club Β· Bronze
π
Renaissance Researcher
(5)
ποΈ
Keyword Collector
(71)
Top co-authors
Research topics
Machine Learning
(14)
Optimization & Theory
(12)
Mathematics & Optimization
(9)
Optimization
(8)
Learning Types
(5)
Artificial Intelligence
(4)
Core AI
(4)
Application Areas
(3)
Mathematics
(2)
Computer Vision
(1)
Data Science & Analytics
(1)
Deep Learning
(1)
Natural Language Processing
(1)
Applications
(1)
Learning Paradigms
(1)
Keywords
regret bound
(5)
dynamic regret
(5)
online convex optimization
(4)
online learning
(3)
multimodal large language model
(3)
attention mechanism
(2)
online algorithm
(2)
non-stationary environment
(2)
adaptive regret
(2)
strongly convex function
(2)
upper confidence bound
(2)
graph feedback
(2)
gradient descent
(1)
visual question answering
(1)
reproducing kernel hilbert space
(1)
markov decision process
(1)
convex optimization
(1)
catastrophic forgetting
(1)
adaptive learning
(1)
domain adaptation
(1)
Papers
MDP3: A Training-free Approach for List-wise Frame Selection in Video-LLMs
ICCV 2025
Parrot: Multilingual Visual Instruction Tuning
ICML 2025
Towards Unbiased Information Extraction and Adaptation in Cross-Domain Recommendation
AAAI 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
NeurIPS 2024
Revisiting Smoothed Online Learning
NeurIPS 2021
Stochastic Bandits with Graph Feedback in Non-Stationary Environments
AAAI 2021
Stochastic Graphical Bandits with Adversarial Corruptions
AAAI 2021
Adapting to Smoothness: A More Universal Algorithm for Online Convex Optimization
AAAI 2020
Minimizing Dynamic Regret and Adaptive Regret Simultaneously
AISTATS 2020
SAdam: A Variant of Adam for Strongly Convex Functions
ICLR 2020
Adaptivity and Optimality: A Universal Algorithm for Online Convex Optimization
UAI 2019
Multi-Objective Generalized Linear Bandits
IJCAI 2019
Optimal Algorithms for Lipschitz Bandits with Heavy-tailed Rewards
ICML 2019
Adaptive Online Learning in Dynamic Environments
NeurIPS 2018