Bo Xue
20 papers · 2020–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 ↓+5 more ↓ Show less ↑
π Interdisciplinary Bridge Β· Silver πΊοΈ Taxonomy Completionist (36) π£ Hot Topic Early Bird π Conference Polyglot Β· Silver π Academic Marathon Β· Sprint
π€
Dynamic Duo
(10)
π
Renaissance Researcher
(7)
β‘
Prolific Year Β· Productive
π
Century Club Β· Bronze
ποΈ
Keyword Collector
(93)
Top co-authors
Research topics
Machine Learning
(18)
Optimization & Theory
(15)
Mathematics & Optimization
(9)
Optimization
(9)
Learning Types Β· Machine Learning
(8)
Core Methods
(5)
Artificial Intelligence
(4)
Core AI
(4)
Application Areas
(3)
Data Science & Analytics
(2)
Deep Learning
(2)
Reinforcement Learning
(2)
Architectures
(2)
Learning Types Β· Deep Learning
(2)
Methods
(2)
Keywords
regret bound
(9)
multi-objective optimization
(6)
multi-armed bandit
(5)
online learning
(5)
upper confidence bound
(2)
exploration-exploitation tradeoff
(2)
lexicographic ordering
(2)
strongly convex
(2)
multi-objective stochastic linear bandit
(2)
cross-modal retrieval
(2)
representation learning
(2)
neural network
(2)
exploration exploitation
(1)
sequential decision making
(1)
gaussian process
(1)
regret minimization
(1)
convex optimization
(1)
learning theory
(1)
best arm identification
(1)
dynamic regret
(1)
Papers
Beyond the Lower Bound: Bridging Regret Minimization and Best Arm Identification in Lexicographic Bandits
AAAI 2026
Offline Multi-Objective Bandits: From Logged Data to Pareto-Optimal Policies
AAAI 2026
Parametric Pareto Set Learning for Expensive Multi-Objective Optimization
AAAI 2026
DREAM: Improving Video-Text Retrieval Through Relevance-Based Augmentation Using Large Foundation Models
NAACL 2025
Lexicographic Lipschitz Bandits: New Algorithms and a Lower Bound
JMLR 2025
Multi-objective Linear Reinforcement Learning with Lexicographic Rewards
ICML 2025
Multi-Objective Neural Bandits with Random Scalarization
IJCAI 2025
Multiple Trade-offs: An Improved Approach for Lexicographic Linear Bandits
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
Safe Online Convex Optimization with Heavy-Tailed Observation Noises
AAAI 2025
Hierarchize Pareto Dominance in Multi-Objective Stochastic Linear Bandits
AAAI 2024
Multiobjective Lipschitz Bandits under Lexicographic Ordering
AAAI 2024
Balance Act: Mitigating Hubness in Cross-Modal Retrieval with Query and Gallery Banks
EMNLP 2023
Efficient Algorithms for Generalized Linear Bandits with Heavy-tailed Rewards
NeurIPS 2023
Exploring and Verbalizing Academic Ideas by Concept Co-occurrence
ACL 2023
Hypervolume Maximization: A Geometric View of Pareto Set Learning
NeurIPS 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