VLDB 2026 Research / reviewers in the wild / expert
Shiquan Liu
dblp:401/6124
· DBLP profile ↗
3ranked-venue papers
0as first author
3since 2021 · last 2026
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 2 since 2021Systems, architecture and hardware · 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 |
Graph learning · 69% Deep learning architectures and training · 17% Representation and self-supervised learning · 14% |
Topics — the 6 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Graph learning › hypergraph learning
hypergraph neural network |
1.9 | 2 | 2026 | Hypergraph Foundation Model · IEEE Trans. Pattern Anal. Mach. Intell. 2026 Self-Supervised Hypergraph Training Framework via Structure-Aware Learning · IEEE Trans. Pattern Anal. Mach. Intell. 2025 |
Machine learning › Deep learning architectures and training
foundation model |
1.0 | 1 | 2026 | Hypergraph Foundation Model · IEEE Trans. Pattern Anal. Mach. Intell. 2026 |
Machine learning › Graph learning
graph foundation model |
1.0 | 1 | 2026 | Hypergraph Foundation Model · IEEE Trans. Pattern Anal. Mach. Intell. 2026 |
Machine learning › Graph learning
graph neural network |
1.0 | 1 | 2026 | Hypergraph Foundation Model · IEEE Trans. Pattern Anal. Mach. Intell. 2026 |
Machine learning › Representation and self-supervised learning › representation learning › unsupervised representation learning › self-supervised representation learning › masked modeling
masked feature reconstruction |
0.9 | 1 | 2025 | Self-Supervised Hypergraph Training Framework via Structure-Aware Learning · IEEE Trans. Pattern Anal. Mach. Intell. 2025 |
Machine learning › Graph learning › graph representation learning
text-attributed graph learning |
0.3 | 1 | 2026 | Hypergraph Foundation Model · IEEE Trans. Pattern Anal. Mach. Intell. 2026 |
Methods — techniques the papers use, named apart from their topics
scaling laws · 1.0multi-hypergraph structural knowledge extraction · 1.0hierarchical neighbor-guided embedding · 1.0structure-aware learning · 0.9masking and re-masking · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Hypergraph Foundation ModelabstractHypergraph neural networks (HGNNs) effectively model complex high-order relationships in domains like protein interactions and social networks by connecting multiple vertices through hyperedges, enhancing modeling capabilities, and reducing information loss. Developing foundation models for hypergraphs is challenging due to their distinct data, which includes both vertex features and intricate structural information. We present Hyper-FM, a Hypergraph Foundation Model for multi-domain knowledge extraction, featuring Hierarchical High-Order Neighbor Guided Vertex Knowledge Embedding for vertex feature representation and Hierarchical Multi-Hypergraph Guided Structural Knowledge Extraction for structural information. Additionally, we curate 11 text-attributed hypergraph datasets to advance research between HGNNs and LLMs. Experiments on these datasets show that Hyper-FM outperforms baseline methods by approximately 13.4%, validating our approach. Furthermore, we propose the first scaling law for hypergraph foundation models, demonstrating that increasing domain diversity significantly enhances performance, unlike merely augmenting vertex and hyperedge counts. This underscores the critical role of domain diversity in scaling hypergraph models. Yue Gao 0002, Yifan Feng 0001, Shiquan Liu, Xiangmin Han, Shaoyi Du, Zongze Wu 0001, Han Hu 0003 |
IEEE Trans. Pattern Anal. Mach. Intell. | 3 |
| 2026 | Approximate Computing-Based Framework for Low-Cost Runtime Hardware Trojan DefenseabstractWith the growing reliance on third-party intellectual property (3PIP) in integrated circuit design, the threat of functional failures induced by hardware Trojans embedded within these components has become increasingly critical. The high stealthiness and sophistication of hardware Trojans often render existing detection techniques insufficient for comprehensive coverage. As a result, runtime detection and recovery techniques have emerged and been proposed as a crucial last line of defense. However, these solutions typically introduce substantial hardware overhead, limiting their practicality in resource-constrained applications such as edge computing. To address this critical challenge, this work leverages approximate computing to develop low-cost runtime recovery strategies against hardware Trojans. Specifically, it begins by analyzing the challenges and potential opportunities introduced into existing security schemes when approximate computing is applied. Based on this analysis, targeted solutions and optimization techniques are proposed. These are then integrated into a unified framework that explores the trade-off between hardware resource usage and computational accuracy while maintaining circuit-level security. Experimental results across several commonly used applications demonstrate that the proposed framework can achieve over 20% of hardware resource savings with only a 5% reduction in accuracy. To the best of our knowledge, this work is the first to systematically integrate approximate computing with runtime hardware Trojan recovery, providing a new cost-effective direction for circuit-level security in resource-constrained systems. Yuqin Dou, Yang Wang 0142, Shiquan Liu, Haroon Waris, Yijun Cui, Weiqiang Liu 0001 |
IEEE Trans. Circuits Syst. I Regul. Pap. | 3 |
| 2025 | Self-Supervised Hypergraph Training Framework via Structure-Aware LearningabstractHypergraphs, with their ability to model complex, beyond pair-wise correlations, presents a significant advancement over traditional graphs for capturing intricate relational data across diverse domains. However, the integration of hypergraphs into self-supervised learning (SSL) frameworks has been hindered by the intricate nature of high-order structural variations. This paper introduces the Self-Supervised Hypergraph Training Framework via Structure-Aware Learning (SS-HT), designed to enhance the perception and measurement of these variations within hypergraphs. The SS-HT framework employs a "Masking and Re-Masking" strategy to bolster feature reconstruction in Hypergraph Neural Networks (HGNNs), addressing the limitations of traditional SSL methods. It also introduces a metric strategy for local high-order correlation changes, streamlining the computational efficiency of structural distance calculations. Extensive experiments on 11 datasets demonstrate SS-HT's superior performance over existing SSL methods for both low-order and high-order data. Notably, the framework significantly reduces data labeling dependency, achieving a 32% improvement over HGNN in the downstream task fine-tuning phase under the 1% labeled data setting in the Cora-CC dataset. Ablation studies further validate SS-HT's scalability and its capacity to augment the performance of various HGNN methods, underscoring its robustness and applicability in real-world scenarios. Yifan Feng 0001, Shiquan Liu, Shihui Ying, Shaoyi Du, Zongze Wu 0001, Yue Gao 0002 |
IEEE Trans. Pattern Anal. Mach. Intell. | 2 |