activity
20182021
most citedFork or Fail: Cycle-Consistent Training with Many-to-One Mappings

10 citations · 19 across the 3 of their papers we have counts for

collaborators

10 papers

cs.LG202110 cited

Fork or Fail: Cycle-Consistent Training with Many-to-One Mappings

Qipeng Guo, Zhijing Jin, Ziyu Wang +5

Cycle-consistent training is widely used for jointly learning a forward and inverse mapping between two domains of interest without the cumbersome requirement of collecting matched…

cs.CL20202 cited

Tasty Burgers, Soggy Fries: Probing Aspect Robustness in Aspect-Based Sentiment Analysis

Xiaoyu Xing, Zhijing Jin, Di Jin +3

Aspect-based sentiment analysis (ABSA) aims to predict the sentiment towards a specific aspect in the text. However, existing ABSA test sets cannot be used to probe whether a model…

cs.CL2020

CycleGT: Unsupervised Graph-to-Text and Text-to-Graph Generation via Cycle Training

Qipeng Guo, Zhijing Jin, Xipeng Qiu +3

Two important tasks at the intersection of knowledge graphs and natural language processing are graph-to-text (G2T) and text-to-graph (T2G) conversion. Due to the difficulty and hi…

cs.CL2020

Relation of the Relations: A New Paradigm of the Relation Extraction Problem

Zhijing Jin, Yongyi Yang, Xipeng Qiu +1

In natural language, often multiple entities appear in the same text. However, most previous works in Relation Extraction (RE) limit the scope to identifying the relation between t…

cs.CL20207 cited

Hooks in the Headline: Learning to Generate Headlines with Controlled Styles

Di Jin, Zhijing Jin, Joey Tianyi Zhou +2

Current summarization systems only produce plain, factual headlines, but do not meet the practical needs of creating memorable titles to increase exposure. We propose a new task, S…

cs.CL2020

A Simple Baseline to Semi-Supervised Domain Adaptation for Machine Translation

Di Jin, Zhijing Jin, Joey Tianyi Zhou +1

State-of-the-art neural machine translation (NMT) systems are data-hungry and perform poorly on new domains with no supervised data. As data collection is expensive and infeasible…