default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBo Xue 0004
Person information
- affiliation: Nanjing University, National Key Laboratory for Novel Software Technology, Nanjing, China
Other persons with the same name
- Bo Xue — disambiguation page
- Bo Xue 0001
![[0000-0003-2211-0676]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0003-2211-0676")
— Jiangsu University of Technology, School of Electric Information Engineering, Changzhou, China (and 1 more) - Bo Xue 0002 — Dalian Minzu University, School of Computer Science and Engineering, Dalian, China
- Bo Xue 0003 — Zhengzhou University, School of Mathematics and Statistics, Zhengzhou, China
- Bo Xue 0005 — University of Science and Technology of China, Division of Life Sciences and Medicine, First Affiliated Hospital of USTC, Hefei, China (and 1 more)
- Bo Xue 0006 — Agency of Science, Technology and Research, Institute of Molecular and Cell Biology, Singapore
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c9]Ji Cheng, Bo Xue, Jiaxiang Yi, Qingfu Zhang:
Hierarchize Pareto Dominance in Multi-Objective Stochastic Linear Bandits. AAAI 2024: 11489-11497- [c8]Bo Xue, Ji Cheng, Fei Liu, Yimu Wang, Qingfu Zhang:
Multiobjective Lipschitz Bandits under Lexicographic Ordering. AAAI 2024: 16238-16246 - 2023
- [c7]Yimu Wang, Xiangru Jian, Bo Xue:
Balance Act: Mitigating Hubness in Cross-Modal Retrieval with Query and Gallery Banks. EMNLP 2023: 10542-10567 - [c6]Bo Xue, Yimu Wang, Yuanyu Wan, Jinfeng Yi, Lijun Zhang:
Efficient Algorithms for Generalized Linear Bandits with Heavy-tailed Rewards. NeurIPS 2023 - [c5]Xiaoyuan Zhang, Xi Lin, Bo Xue, Yifan Chen, Qingfu Zhang:
Hypervolume Maximization: A Geometric View of Pareto Set Learning. NeurIPS 2023 - [i3]Yimu Wang, Xiangru Jian, Bo Xue:
Balance Act: Mitigating Hubness in Cross-Modal Retrieval with Query and Gallery Banks. CoRR abs/2310.11612 (2023) - [i2]Bo Xue, Yimu Wang, Yuanyu Wan, Jinfeng Yi, Lijun Zhang:
Efficient Algorithms for Generalized Linear Bandits with Heavy-tailed Rewards. CoRR abs/2310.18701 (2023) - 2021
- [c4]Yuanyu Wan, Bo Xue, Lijun Zhang:
Projection-free Online Learning in Dynamic Environments. AAAI 2021: 10067-10075 - [c3]Yimu Wang, Bo Xue, Quan Cheng, Yuhui Chen, Lijun Zhang:
Deep Unified Cross-Modality Hashing by Pairwise Data Alignment. IJCAI 2021: 1129-1135 - 2020
- [c2]Bo Xue, Guanghui Wang, Yimu Wang, Lijun Zhang:
Nearly Optimal Regret for Stochastic Linear Bandits with Heavy-Tailed Payoffs. IJCAI 2020: 2936-2942 - [c1]Yimu Wang, Xiu-Shen Wei, Bo Xue, Lijun Zhang:
Piecewise Hashing: A Deep Hashing Method for Large-Scale Fine-Grained Search. PRCV (2) 2020: 432-444 - [i1]Bo Xue, Guanghui Wang, Yimu Wang, Lijun Zhang:
Nearly Optimal Regret for Stochastic Linear Bandits with Heavy-Tailed Payoffs. CoRR abs/2004.13465 (2020)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-16 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
