Bo Xue
20 papers · 2020–2026 · 8 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+7 more ↓ Show less ↑
π Academic Marathon (5) π§ Keyword Pioneer π Interdisciplinary Bridge π Conference Polyglot (8) π Cross-Pollinator (14)
π
Renaissance Researcher
(9)
πΊοΈ
Taxonomy Completionist
(36)
π
Conference Polyglot
(8)
π€
Dynamic Duo
(10)
π
Century Club
(17)
ποΈ
Keyword Collector
(89)
β‘
Prolific Year
(8)
Conferences
AAAI (8)
IJCAI (4)
JMLR (2)
NIPS (2)
ACL (1)
EMNLP (1)
ICML (1)
NAACL (1)
Top co-authors
Keywords
regret bound
(8)
multi-objective optimization
(6)
multi-armed bandit
(5)
online learning
(5)
strongly convex
(2)
multi-objective stochastic linear bandit
(2)
upper confidence bound
(2)
representation learning
(2)
neural network
(2)
cross-modal retrieval
(2)
exploration-exploitation trade-off
(2)
lexicographic ordering
(2)
online convex optimization
(1)
exploration exploitation
(1)
convex optimization
(1)
gaussian process
(1)
regret minimization
(1)
sequential decision-making
(1)
learning theory
(1)
thompson sampling
(1)
Papers
Parametric Pareto Set Learning for Expensive Multi-Objective Optimization
AAAI 2026
Offline Multi-Objective Bandits: From Logged Data to Pareto-Optimal Policies
AAAI 2026
Beyond the Lower Bound: Bridging Regret Minimization and Best Arm Identification in Lexicographic Bandits
AAAI 2026
DREAM: Improving Video-Text Retrieval Through Relevance-Based Augmentation Using Large Foundation Models
NAACL 2025
Multiple Trade-offs: An Improved Approach for Lexicographic Linear Bandits
AAAI 2025
Safe Online Convex Optimization with Heavy-Tailed Observation Noises
AAAI 2025
Multi-objective Linear Reinforcement Learning with Lexicographic Rewards
ICML 2025
Multi-Objective Neural Bandits with Random Scalarization
IJCAI 2025
Optimal and Efficient Algorithms for Decentralized Online Convex Optimization
JMLR 2025
Lexicographic Lipschitz Bandits: New Algorithms and a Lower Bound
JMLR 2025
Problem-dependent Regret for Lexicographic Multi-Armed Bandits with Adversarial Corruptions
IJCAI 2025
Multiobjective Lipschitz Bandits under Lexicographic Ordering
AAAI 2024
Hierarchize Pareto Dominance in Multi-Objective Stochastic Linear Bandits
AAAI 2024
Hypervolume Maximization: A Geometric View of Pareto Set Learning
NIPS 2023
Efficient Algorithms for Generalized Linear Bandits with Heavy-tailed Rewards
NIPS 2023
Exploring and Verbalizing Academic Ideas by Concept Co-occurrence
ACL 2023
Balance Act: Mitigating Hubness in Cross-Modal Retrieval with Query and Gallery Banks
EMNLP 2023
Deep Unified Cross-Modality Hashing by Pairwise Data Alignment
IJCAI 2021
Projection-free Online Learning in Dynamic Environments
AAAI 2021
Nearly Optimal Regret for Stochastic Linear Bandits with Heavy-Tailed Payoffs
IJCAI 2020