Skip to content
Open access

GASTM: A Graph-Adapted Semantic Topic Model With Instance-Aware Dual-View Fusion

2026 · IEEE Access · Vol 14, pp. 104642-104661 · 0 citations · 35 references
Computer Science

TL;DR

A Graph-Adapted Semantic Topic Model with Instance-Aware Dual-View Fusion with fusion-type ablation yields counterintuitive findings that support the effectiveness of the adaptive gate strategy over static alternatives.

Abstract

In neural topic modeling, the reliability of a document representation varies from one document to the next: a syntactic view drawn from a dependency graph is informative when the parse is well formed, whereas a semantic view drawn from a pretrained transformer is more dependable when the parse is sparse or fragmented. Existing hybrid models combine the two views with a fixed rule, set once for the whole corpus through concatenation, averaging, or a constant weight, so the locally less reliable view is over-weighted on individual documents. To close these gaps, a Graph-Adapted Semantic Topic Model with Instance-Aware Dual-View Fusion (GASTM) is proposed. Within a variational autoencoder, a GGNN-based dependency encoder and a pretrained transformer semantic encoder are kept jointly trainable, while corpus-wide lexical statistics are carried through a learnable node embedding on the graph branch. A continuous per-document fusion weight is then produced by an instance-aware adaptive gate, allowing the two views to be combined in a controlled manner before reaching the latent inference space. On five benchmarks, GASTM is shown to consistently outperform the baselines on both topic quality and downstream classification. A fusion-type ablation further yields counterintuitive findings that support the effectiveness of the adaptive gate strategy over static alternatives.

Read PDF

Similar papers

Preprint Aug 2026

Domain-Agnostic Neural Topic Modeling with Contextual Token-Level Semantic Graph Representation

DARTopic is a domain-agnostic framework that constructs token-level semantic graphs from frozen PLM embeddings and jointly trains a GNN encoder with topic inference, demonstrating robustness to PLM choice and favorable runtime efficiency over fine-tuning based alternatives.

Seung-Won Seo, W. Cho, Yongmin Yoo · 0 citations
Open access 2026

A Dual-Level Structural Context Collaborative Framework for Knowledge Graph Completion

These results demonstrate that collaborative modeling of instance-level and batch-level structural context can effectively enhance structure-aware entity representation and improve fine-grained entity prediction.

Jing Wang, Tian Xia, Hao Li · 0 citations
Open access Aug 2026

SeGMA4Rec: Learning stable sequential representations through semantic graph propagation and hierarchical contrastive alignment.

Semantic Global Graph with Multi-layer Alignment for Recommendation (SeGMA4Rec), which combines item-level semantic enrichment with sequence-level hierarchical regularization, is proposed and achieves strong and generally superior performance over competitive baselines.

Wan-Na Cui, Hak-Keung Lam · 0 citations
Conference Aug 2026

Joint multi-task learning with knowledge graph embedding and semantic-enhanced encoding for teaching evaluation text analysis

This study proposes a teaching evaluation text analysis framework integrating knowledge graph embedding, semantic-enhanced encoding, and joint multi-task learning to address the difficulty of accurately analyzing large-scale unstructured teaching evaluation texts.

Wenbo Li, Heng Wang, Di Yang et al. · 0 citations
Open access 2026

FMFT: A Memory-Augmented Multi-Feature Fusion Transformer Enhanced With Retrieval Augmented Graph-Based Few-Shot Learning

This work proposes a Few-Shot Memory Fusion Transformer (FMFT), a memory-augmented, multi-feature-fusion transformer enhanced with the Retrieval-Augmented Graph (RAG) and Few-Shot learning that significantly outperforms competitive baselines in both full-resource and few-shot scenarios.

S. Chauhan, Shefali Saxena, Shweta V. Jain et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.