Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Xiyao Li

dblp:264/8349 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
5since 2021 · last 2025
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 4 · 1 first-author · 4 since 2021Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%
Artificial intelligence
1 paper
Transfer learning and domain adaptation · 50% Information extraction and text analysis · 50%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information retrieval
cross-domain retrieval
0.812024
ProS: Prompting-to-Simulate Generalized Knowledge for Universal Cross-Domain Retrieval · CVPR 2024
Information retrieval › cross-domain retrieval
universal cross-domain retrieval
0.812024
ProS: Prompting-to-Simulate Generalized Knowledge for Universal Cross-Domain Retrieval · CVPR 2024
Machine learning › Transfer learning and domain adaptation
domain shift
0.212024
ProS: Prompting-to-Simulate Generalized Knowledge for Universal Cross-Domain Retrieval · CVPR 2024
Natural language and speech › Information extraction and text analysis › lexical semantics
semantic change detection
0.212024
ProS: Prompting-to-Simulate Generalized Knowledge for Universal Cross-Domain Retrieval · CVPR 2024

Methods — techniques the papers use, named apart from their topics

prompt tuning · 1.5mask-and-align · 1.5content-aware dynamic prompts · 1.5
YearPublicationVenuePosition
2025 A Polytope-Centric Technique for Efficient Domain Partitioning in Function Sorting
Xiyao Li, Ying Cai 0001, Soamar Homsi
IEEE Big Data1
2024 ProS: Prompting-to-Simulate Generalized Knowledge for Universal Cross-Domain Retrieval
abstract
The goal of Universal Cross-Domain Retrieval (UCDR) is to achieve robust performance in generalized test scenarios, wherein data may belong to strictly unknown do-mains and categories during training. Recently, pre-trained models with prompt tuning have shown strong generalization capabilities and attained noteworthy achievements in various downstream tasks, such as few-shot learning and video-text retrieval. However, applying them directly to UCDR may not be sufficient to handle both domain shift (i.e., adapting to unfamiliar domains) and semantic shift (i.e., transferring to unknown categories). To this end, we propose Prompting-to-Simulate (ProS), the first method to apply prompt tuning for UCDR. ProS employs a two-step process to simulate Content-aware Dynamic Prompts (CaDP) which can impact models to produce generalized features for UCDR. Concretely, in Prompt Units Learning stage, we introduce two Prompt Units to individually capture domain and semantic knowledge in a mask-and-align way. Then, in Context-aware Simulator Learning stage, we train a Content-aware Prompt Simulator under a simulated test scenario to produce the corresponding CaDP. Extensive experiments conducted on three benchmark datasets show that our method achieves new state-of-the-art performance without bringing excessive parameters. Code is available at https://github.com/fangkaipeng/ProS.
Kaipeng Fang, Jingkuan Song, Lianli Gao, Pengpeng Zeng, Zhi-Qi Cheng, Xiyao Li, Heng Tao Shen
CVPR6
2024 MoCoSA: Momentum Contrast for Knowledge Graph Completion with Structure-Augmented Pre-trained Language Models
abstract
Knowledge Graph Completion (KGC) aims to conduct reasoning on the facts within knowledge graphs and automatically infer missing links. Existing methods can mainly be categorized into structure-based or description-based. Structure-based methods effectively represent relational facts in knowledge graphs using entity embeddings and description-based methods leverage pre-trained language models (PLMs) to understand textual information. In this paper, we propose Momentum Contrast for knowledge graph completion with Structure-Augmented pre-trained language models (MoCoSA), which allows the PLM to perceive the structural information by the adaptable structure encoder. We proposed momentum hard negative and intra-relation negative sampling to improve learning efficiency. Experimental results demonstrate that our approach achieves state-of-the-art performance in terms of mean reciprocal rank (MRR), with improvements of 2.5% on WN18RR and 21% on OpenBG500.
Jiabang He, Lei Wang 0185, Xiyao Li, Xing Xu 0001
ICME4
2024 Conductivity Imaging from Internal Measurements with Mixed Least-Squares Deep Neural Networks
abstract
Abstract. In this work, we develop a novel approach using deep neural networks (DNNs) to reconstruct the conductivity distribution in elliptic problems from one measurement of the solution over the whole domain. The approach is based on a mixed reformulation of the governing equation and utilizes the standard least-squares objective, with DNNs as ansatz functions to approximate the conductivity and flux simultaneously. We provide a thorough analysis of the DNN approximations of the conductivity for both continuous and empirical losses, including rigorous error estimates that are explicit in terms of the noise level, various penalty parameters, and neural network architectural parameters (depth, width, and parameter bounds). We also provide multiple numerical experiments in two dimensions and multidimensions to illustrate distinct features of the approach, e.g., excellent stability with respect to data noise and capability of solving high-dimensional problems.
Bangti Jin, Xiyao Li, Qimeng Quan, Zhi Zhou 0002
SIAM J. Imaging Sci.2
2024 MCFPN: Multi-Path Cross Fusion Pyramid-Like Network for Image Super-Resolution Reconstruction
abstract
In the multipath reconstruction process, the currently existing super-resolution reconstruction methods ignore the structural similarity between features, which makes high-frequency features, such as texture detail features, difficult to be extracted. To solve this problem, a multi-path cross fusion pyramid-like network (MCFPN) is proposed for image super-resolution reconstruction in this paper. First, a shuffle separable attention (SSA) block is designed to select cross-channel feature information which improves the network's ability. Second, a multi-path cross fusion pyramid-like structure is constructed to mine the hierarchical features under different dimensions. Finally, a forward and reverse cross fusion strategy is designed to efficiently utilize structural information in different dimensions. Experimental results show that MCPFN is well adapted to the reconstruction tasks.
Xiyao Li
IEEE Signal Process. Lett.1