Multiple Trade-offs: An Improved Approach for Lexicographic Linear Bandits.
Proceedings of the AAAI-25, Sponsored by the Association for the Advancement of Artificial Intelligence, February 25, 2025
Multiobjective Lipschitz Bandits under Lexicographic Ordering.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024
Hierarchize Pareto Dominance in Multi-Objective Stochastic Linear Bandits.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024
Hypervolume Maximization: A Geometric View of Pareto Set Learning.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023
Efficient Algorithms for Generalized Linear Bandits with Heavy-tailed Rewards.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023
Balance Act: Mitigating Hubness in Cross-Modal Retrieval with Query and Gallery Banks.
Proceedings of the 2023 Conference on Empirical Methods in Natural Language Processing, 2023
Deep Unified Cross-Modality Hashing by Pairwise Data Alignment.
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021
Projection-free Online Learning in Dynamic Environments.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021
Piecewise Hashing: A Deep Hashing Method for Large-Scale Fine-Grained Search.
Proceedings of the Pattern Recognition and Computer Vision - Third Chinese Conference, 2020
Nearly Optimal Regret for Stochastic Linear Bandits with Heavy-Tailed Payoffs.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020