Demo Data from VLDB 2026 / reviewers in the wild / expert
Chenyi Xiong
dblp:426/7923
· DBLP profile ↗
3ranked-venue papers
1as first author
3since 2021 · last 2026
0009-0006-6806-2218ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 2 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 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
1 paper |
Vision and language · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computer vision › Vision and language › visual question answering
continual visual question answering |
1.0 | 1 | 2026 | MacVQA: Adaptive Memory Allocation and Global Noise Filtering for Continual Visual Question Answering · AAAI 2026 |
Computer vision › Vision and language
multimodal reasoning |
1.0 | 1 | 2026 | MacVQA: Adaptive Memory Allocation and Global Noise Filtering for Continual Visual Question Answering · AAAI 2026 |
Computer vision › Vision and language
visual question answering |
1.0 | 1 | 2026 | MacVQA: Adaptive Memory Allocation and Global Noise Filtering for Continual Visual Question Answering · AAAI 2026 |
Methods — techniques the papers use, named apart from their topics
prototype-based memory · 1.0noise filtering · 1.0adaptive memory allocation · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | MacVQA: Adaptive Memory Allocation and Global Noise Filtering for Continual Visual Question AnsweringabstractVisual Question Answering (VQA) requires models to reason over multimodal information, combining visual and textual data. With the development of continual learning, significant progress has been made in retaining knowledge and adapting to new information in the VQA domain. However, current methods often struggle with balancing knowledge retention, adaptation, and robust feature representation. To address these challenges, we propose a novel framework with adaptive memory allocation and global noise filtering called MacVQA for visual question answering. MacVQA fuses visual and question information while filtering noise to ensure robust representations, and employs prototype-based memory allocation to optimize feature quality and memory usage. These designs enable MacVQA to balance knowledge acquisition, retention, and compositional generalization in continual VQA learning. Experiments on ten continual VQA tasks show that MacVQA outperforms existing baselines, achieving 43.38% average accuracy and 2.32% average forgetting on standard tasks, and 42.53% average accuracy and 3.60% average forgetting on novel composition tasks. Zhifei Li 0009, Chenyi Xiong, Yujing Xia, Xiaoju Hou, Miao Zhang 0036, Kui Xiao |
AAAI | 3 |
| 2026 | RealKGC: Relation-constrained large language models for inductive knowledge graph completion
Yan Zhang 0077, Chenyi Xiong, Ziyue Qin, Zhifei Li 0009 |
Knowl. Based Syst. | 3 |
| 2026 | HiMod: Hierarchical Modeling with Graph Perturbation for Enhanced Inductive Knowledge Graph ReasoningabstractInductive reasoning aims to infer missing knowledge for unseen entities and relations. Existing methods exhibit limited generalization capabilities due to their dependence on localized structural patterns and inadequate handling of graph imbalance. To address these challenges, we propose a novel Hi erarchical Mod eling with Graph Perturbation-Enhanced Network (HiMod), which effectively integrates hierarchical relation modeling with a dynamic perturbation mechanism to enhance the generalization ability of inductive reasoning models. HiMod leverages a hierarchical relation modeling mechanism that maps specific relations to higher-level general concepts within a global semantic framework. This allows for capturing semantic commonalities across relations, enabling robust reasoning for unseen queries. Simultaneously, a dynamic perturbation mechanism is introduced to adjust perturbation strength based on node importance and graph sparsity, facilitating deeper exploration of the latent semantic space and mitigating the effects of graph imbalance. Extensive experiments on three benchmark inductive knowledge graph reasoning datasets demonstrate that HiMod achieves the most significant MRR improvements among the four split versions, with 11.17% on WN18RR, 4.61% on FB15K-237, and 5.47% on NELL-995. Our code is available at https://github.com/HubuKG/HiMod . Chenyi Xiong, Miao Zhang 0036, Kui Xiao, Zhifang Huang, Dunhui Yu, Yan Zhang 0077, Zhifei Li 0009 |
ACM Trans. Knowl. Discov. Data | 1 |