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

Xingyue Guo

dblp:121/7952 · DBLP profile ↗
← Back
6ranked-venue papers
3as first author
5since 2021 · last 2026
—ORCID · conflict

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

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

Artificial intelligence
2 papers
Transfer learning and domain adaptation · 30% Learning paradigms · 20% Language models and text generation · 15%

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

TopicWeightPapersLastEvidence papers
Machine learning › Learning paradigms › continual learning › catastrophic forgetting
catastrophic forgetting mitigation
1.012026
Grow-on-Demand: Sparse and Adaptive Expert Expansion for Continual Instruction Tuning · AAAI 2026
Natural language and speech › Language models and text generation › instruction tuning
continual instruction tuning
1.012026
Grow-on-Demand: Sparse and Adaptive Expert Expansion for Continual Instruction Tuning · AAAI 2026
Machine learning › Transfer learning and domain adaptation › zero-shot learning
generalized zero-shot learning
1.012026
Hyperbolic Multimodal Generative Representation Learning for Generalized Zero-Shot Multimodal Information Extraction · WWW 2026
Knowledge, reasoning and agents › Knowledge representation and reasoning › knowledge acquisition › knowledge extraction
multimodal information extraction
1.012026
Hyperbolic Multimodal Generative Representation Learning for Generalized Zero-Shot Multimodal Information Extraction · WWW 2026
Machine learning › Efficient and distributed learning
parameter-efficient fine-tuning
1.012026
Grow-on-Demand: Sparse and Adaptive Expert Expansion for Continual Instruction Tuning · AAAI 2026
Machine learning › Transfer learning and domain adaptation
zero-shot learning
1.012026
Hyperbolic Multimodal Generative Representation Learning for Generalized Zero-Shot Multimodal Information Extraction · WWW 2026
Machine learning › Learning paradigms
continual learning
0.312026
Grow-on-Demand: Sparse and Adaptive Expert Expansion for Continual Instruction Tuning · AAAI 2026
Machine learning › Representation and self-supervised learning › representation learning › dimensionality reduction › manifold learning › geometric representation learning
hyperbolic representation learning
0.312026
Hyperbolic Multimodal Generative Representation Learning for Generalized Zero-Shot Multimodal Information Extraction · WWW 2026

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

variational information bottleneck · 1.0mixture of experts · 1.0hyperbolic space · 1.0expert demand detection · 1.0autoencoder · 1.0LoRA · 1.0
YearPublicationVenuePosition
2026 Grow-on-Demand: Sparse and Adaptive Expert Expansion for Continual Instruction Tuning
abstract
Continual instruction tuning aims to incrementally adapt large language models to new tasks without forgetting previously acquired knowledge. Existing approaches often struggle to balance plasticity and stability. Replay-based methods retrain on historical data, which raises privacy concerns. Architecture-based methods allocate task-specific components, resulting in significant parameter growth. To address this, we consider a structure-sharing strategy that enables parameter reuse across similar tasks and expands only when necessary, avoiding any data replay. Specifically, we introduce Grow-on-Demand (GoD-MoE), a parameter-efficient framework that is based on sparse and adaptive expert module expansion for continual instruction tuning. GoD-MoE inserts multiple LoRA-based experts into attention layers and dynamically activates a small subset of experts for each task. To avoid redundant parameter growth, we develop an Expert Demand Detector that determines whether new experts are added, facilitating adaptive structural sharing and minimizing parameter overhead. We conduct comprehensive experiments on the TRACE benchmark, demonstrating that GoD-MoE achieves state-of-the-art performance. Furthermore, it effectively mitigates catastrophic forgetting and even outperforms several advanced replay-based baselines.
Ying Zhang 0015, Xingyue Guo, Yu Zhao 0043, Xuhui Sui, Baohang Zhou, Xinying Qian, Xiaojie Yuan
AAAI2
2026 Hyperbolic Multimodal Generative Representation Learning for Generalized Zero-Shot Multimodal Information Extraction
abstract
Multimodal information extraction (MIE) constitutes a set of essential tasks aimed at extracting structural information from Web texts with integrating images, to facilitate the structural construction of Web-based semantic knowledge. To address the expanding category set including newly emerging entity types or relations on websites, prior research proposed the zero-shot MIE (ZS-MIE) task which aims to extract unseen structural knowledge with textual and visual modalities. However, the ZS-MIE models are limited to recognizing the samples that fall within the unseen category set, and they struggle to deal with real-world scenarios that encompass both seen and unseen categories. The shortcomings of existing methods can be ascribed to two main aspects. On one hand, these methods construct representations of samples and categories within Euclidean space, failing to capture the hierarchical semantic relationships between the two modalities within a sample and their corresponding category prototypes. On the other hand, there is a notable gap in the distribution of semantic similarity between seen and unseen category sets, which impacts the generative capability of the ZS-MIE models. To overcome the above disadvantages, we delve into the generalized zero-shot MIE (GZS-MIE) task and propose the hyperbolic multimodal generative representation learning framework (HMGRL). The variational information bottleneck and autoencoder networks are reconstructed with hyperbolic space for modeling the multi-level hierarchical semantic correlations among samples and prototypes. Furthermore, the proposed model is trained with the unseen samples generated by the decoder, and we introduce the semantic similarity distribution alignment loss to enhance the model's generalization performance. Experimental evaluations on two benchmark datasets underscore the superiority of HMGRL compared to existing baseline methods.
Baohang Zhou, Kehui Song, Rize Jin, Yu Zhao 0043, Xuhui Sui, Xinying Qian, Xingyue Guo, Ying Zhang 0015
WWW7
2025 Few-shot temporal knowledge graph completion based on query-adaptive Mamba-enhanced temporal relation learning
Xingyue Guo, Ying Zhang 0015, Yu Zhao 0043, Baohang Zhou, Xuhui Sui, Xinying Qian, Xiaojie Yuan
Knowl. Based Syst.1
2025 Learning to solve combinatorial optimization problems with heterophily
Xingyue Guo, Qingqiong Cai
Neural Networks1
2024 A self-supervised learning model for graph clustering optimization problems
Qingqiong Cai, Xingyue Guo, Shenwei Huang
Knowl. Based Syst.2
2012 Modeling of pulse responses from time-evolving ocean-like surfaces
abstract
A time domain integral equation (TDIE) method is developed to characterize the pulse responses from a time-evolving ocean-like surface. Pulses echoes are obtained from a series of “frozen” profiles that correspond to the evolving surface at discrete instances. The Doppler shift and bandwidth are examined by using the pulse echoes for different wind speeds and interrogating waveforms. Other than using continuous waves in traditional researches, using pulse waves would give a narrower predicted bandwidth.
Xingyue Guo, Ming-Yao Xia
IGARSS1