Pith. Sign in

RECORD

Graph Adaptive Semantic Transfer for Cross-domain Sentiment Classification

Computation and Language · Submitted 18 May 2022

abstract compiled · 2026-09-23 · no language-model review

The authors' main claim Extensive experiments on four public datasets indicate that GAST achieves comparable effectiveness to a range of state-of-the-art models.

how it is stated · hedged possibility 0.61 read the record →

Comment (0) Read on arXiv ↗
Cite ▾
arXiv ID2205.08772 (version 1)
Pith IDHJXOUWR5, Pith's permanent record of this paper and its review
CitationEnhong Chen, Kai Zhang, Kun Zhang, Mengdi Zhang, Mingyue Cheng, Qi Liu, Wei Wu, Zhenya Huang. "Graph Adaptive Semantic Transfer for Cross-domain Sentiment Classification." arXiv:2205.08772 (2022). https://pith.science/paper/HJXOUWR5
Claim paper

The compiled record

The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Open the compiled record

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-09-23: 1 request, 6,934 input tokens.

What the abstract itself states, as probabilities: claims first 0.07 · states limitation 0.18 · human participants 0.03 · controlled comparison 0.43 · randomized assignment 0.01 · states quantitative result 0.18 · compares with prior results 0.91 · mentions code or data availability 0.02.

The abstract, sentence by sentence

arXiv listing abstract v1. Results and the main claim are underlined; .

Cross-domain sentiment classification (CDSC) aims to use the transferable semantics learned from the source domain to predict the sentiment of reviews in the unlabeled target domain. Existing studies in this task attach more attention to the sequence modeling of sentences while largely ignoring the rich domain-invariant semantics embedded in graph structures (i.e., the part-of-speech tags and dependency relations). As an important aspect of exploring characteristics of language comprehension, adaptive graph representations have played an essential role in recent years. To this end, in the paper, we aim to explore the possibility of learning invariant semantic features from graph-like structures in CDSC. Specifically, we present Graph Adaptive Semantic Transfer (GAST) model, an adaptive syntactic graph embedding method that is able to learn domain-invariant semantics from both word sequences and syntactic graphs. More specifically, we first raise a POS-Transformer module to extract sequential semantic features from the word sequences as well as the part-of-speech tags. Then, we design a Hybrid Graph Attention (HGAT) module to generate syntax-based semantic features by considering the transferable dependency relations. Finally, we devise an Integrated aDaptive Strategy (IDS) to guide the joint learning process of both modules. Extensive experiments on four public datasets indicate that GAST achieves comparable effectiveness to a range of state-of-the-art models.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 Cross-domain sentiment classification (CDSC) aims to use the transferable semantics learned from the source domain to predict the sentiment of reviews in the unlabeled target domain. background 1.00 0.04 0.03 asserted 0.99
s1 Existing studies in this task attach more attention to the sequence modeling of sentences while largely ignoring the rich domain-invariant semantics embedded in graph structures (i.e., the part-of-speech tags and dependency relations). gap 0.99 0.07 0.03 asserted 1.00
s2 As an important aspect of exploring characteristics of language comprehension, adaptive graph representations have played an essential role in recent years. background 1.00 0.04 0.02 asserted 1.00
s3 To this end, in the paper, we aim to explore the possibility of learning invariant semantic features from graph-like structures in CDSC. contribution 0.91 0.30 0.05 hedged possibility 0.90
s4 Specifically, we present Graph Adaptive Semantic Transfer (GAST) model, an adaptive syntactic graph embedding method that is able to learn domain-invariant semantics from both word sequences and syntactic graphs. contribution 0.71 0.93 0.12 asserted 0.99
s5 More specifically, we first raise a POS-Transformer module to extract sequential semantic features from the word sequences as well as the part-of-speech tags. method 0.98 0.93 0.03 asserted 0.99
s6 Then, we design a Hybrid Graph Attention (HGAT) module to generate syntax-based semantic features by considering the transferable dependency relations. method 0.98 0.93 0.03 asserted 0.99
s7 Finally, we devise an Integrated aDaptive Strategy (IDS) to guide the joint learning process of both modules. method 0.96 0.94 0.03 asserted 0.98
s8 Extensive experiments on four public datasets indicate that GAST achieves comparable effectiveness to a range of state-of-the-art models. result 1.00 0.96 0.80 hedged possibility 0.61

What kind of paper the classifier reports this is: method or tool 1.00 · evidence from observation or experiment 0.97.

What was examined, and what was not

sources read
  • arXiv listing abstract v1
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

The paper
Original abstract

Cross-domain sentiment classification (CDSC) aims to use the transferable semantics learned from the source domain to predict the sentiment of reviews in the unlabeled target domain. Existing studies in this task attach more attention to the sequence modeling of sentences while largely ignoring the rich domain-invariant semantics embedded in graph structures (i.e., the part-of-speech tags and dependency relations). As an important aspect of exploring characteristics of language comprehension, adaptive graph representations have played an essential role in recent years. To this end, in the paper, we aim to explore the possibility of learning invariant semantic features from graph-like structures in CDSC. Specifically, we present Graph Adaptive Semantic Transfer (GAST) model, an adaptive syntactic graph embedding method that is able to learn domain-invariant semantics from both word sequences and syntactic graphs. More specifically, we first raise a POS-Transformer module to extract sequential semantic features from the word sequences as well as the part-of-speech tags. Then, we design a Hybrid Graph Attention (HGAT) module to generate syntax-based semantic features by considering the transferable dependency relations. Finally, we devise an Integrated aDaptive Strategy (IDS) to guide the joint learning process of both modules. Extensive experiments on four public datasets indicate that GAST achieves comparable effectiveness to a range of state-of-the-art models.

Human review
How the literature uses it

What this paper does with the arXiv papers it cites

Each citing sentence is taken from the citing paper's LaTeX source and typed by Pith's classifier. A label appears at probability 0.8 or more (0.95 for support), a contest at 0.7 or more; the quoted words are the citing authors'. How each label was checked · JSON

What it cites · 1 sentence without a confident label

Uses the method or tool of 2 papers
  • Inspired by [ref] , we minimize the entropy penalty to disambiguate the positive and negative samples over the unlabeled data from both domains.

    Cross-Domain Sentiment Classification with In-Domain Contrastive Learning · Integrated Adaptive Strategy · 0.90

  • To evaluate the impact of different syntactic features, inspired by [ref] , we conduct a comparative experiment using two well-known dependency parsers, i.e., Stanford Parser [ref] and Biaffine Parser[https://github.com/allenai/allennlp.] [ref] , to construct our syntactic graph.

    Deep Biaffine Attention for Neural Dependency Parsing · Influence of Adaptive Syntactic Graph · 0.84

Cites as background 3 papers

Discussion

Know something about this paper? Leave a comment, or highlight any passage above to comment on it.