Changjian Hu

dblp:86/1649 · DBLP profile ↗
← Back
25ranked-venue papers
0as first author
4since 2021 · last 2021
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 24 · 4 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 since 2021Systems, architecture and hardware · 1Databases, data management, data science and information retrieval · 1

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
4 papers
Language models and text generation · 76% Machine translation · 13% Question answering and dialogue systems · 11%

Topics — the 6 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Natural language and speech › Language models and text generation › text generation
paraphrase generation
0.922021
Syntactically-Informed Unsupervised Paraphrasing with Non-Parallel Data · EMNLP (1) 2021
Exploring Bilingual Parallel Corpora for Syntactically Controllable Paraphrase Generation · IJCAI 2020
Natural language and speech › Language models and text generation
controllable text generation
0.512021
Change or Not: A Simple Approach for Plug and Play Language Models on Sentiment Control · AAAI 2021
Natural language and speech › Language models and text generation › text generation › paraphrase generation
unsupervised paraphrase generation
0.512021
Syntactically-Informed Unsupervised Paraphrasing with Non-Parallel Data · EMNLP (1) 2021
Natural language and speech › Machine translation
parallel corpora
0.412020
Exploring Bilingual Parallel Corpora for Syntactically Controllable Paraphrase Generation · IJCAI 2020
Natural language and speech › Question answering and dialogue systems
task-oriented dialogue
0.412019
GECOR: An End-to-End Generative Ellipsis and Co-reference Resolution Model for Task-Oriented Dialogue · EMNLP/IJCNLP (1) 2019
Natural language and speech › Language models and text generation
text generation
0.112019
GECOR: An End-to-End Generative Ellipsis and Co-reference Resolution Model for Task-Oriented Dialogue · EMNLP/IJCNLP (1) 2019

Methods — techniques the papers use, named apart from their topics

valence-arousal-dominance lexicon · 0.5sentiment classifier · 0.5gumbel-softmax · 0.5dynamic threshold · 0.5cycle reconstruction · 0.5conditional variational autoencoder · 0.5cycle learning · 0.4cross-lingual word embeddings · 0.4adversarial discriminator · 0.4end-to-end model · 0.4
YearPublicationVenuePosition
2021 Change or Not: A Simple Approach for Plug and Play Language Models on Sentiment Control
abstract
Text generation with sentiment control is difficult without fine-tuning or modifying the model architecture. Plug and Play Language Model (PPLM) utilizes an external sentiment classifier to update the hidden states of GPT-2 at each time step. It does not change the parameters but achieves competitive performance. However, fluency is impaired due to the instability of the hidden states. Moreover, the classifier is not strong because of the way it is trained with partial texts, hence it is difficult to guide the generation in the process. To solve the above problems, in this paper, we first propose a fixed threshold method based on the Valence-Arousal-Dominance (VAD) lexicon to decide whether to change a word, which keeps the fluency of the original LM to the greatest extent. Furthermore, for the improvement of sentiment alignment, we propose a dynamic threshold method that utilizes VAD-based loss to make the threshold dynamic. Experiments demonstrate that our methods outperform the baseline with a great margin significantly both on fluency and sentiment accuracy.
Rang Li, Changjian Hu, Chuangbai Xiao
AAAI4
2021 Syntactically-Informed Unsupervised Paraphrasing with Non-Parallel Data
abstract
Previous works on syntactically controlled paraphrase generation heavily rely on largescale parallel paraphrase data that are not easily available for many languages and domains.In this paper, we take this research direction to the extreme and investigate whether it is possible to learn syntactically controlled paraphrase generation with non-parallel data.We propose a syntactically-informed unsupervised paraphrasing model based on conditional variational auto-encoder (VAE) which can generate texts in a specified syntactic structure.Particularly, we design a two-stage learning method to effectively train the model using non-parallel data.The conditional VAE is trained to reconstruct the input sentence according to the given input and its syntactic structure.Furthermore, to improve the syntactic controllability and semantic consistency of the pre-trained conditional VAE, we finetune it using syntax controlling and cycle reconstruction learning objectives, and employ Gumbel-Softmax to combine these new learning objectives.Experiment results demonstrate that the proposed model trained only on non-parallel data is capable of generating diverse paraphrases with specified structures.Additionally, we further validate the effectiveness of our method for generating syntactically adversarial examples on a sentiment analysis task.
Erguang Yang, Mingtong Liu, Deyi Xiong, Changjian Hu, Jin An Xu, Yufeng Chen 0005
EMNLP (1)6
2021 Explore Coarse-Grained Structures for Syntactically Controllable Paraphrase Generation
Erguang Yang, Mingtong Liu, Deyi Xiong, Changjian Hu, Jin An Xu, Yufeng Chen 0005
NLPCC (1)6
2021 Generative adversarial network for Table-to-Text generation
Zhiqiang Zhan, Rang Li, Changjian Hu, Yang Zhang 0002
Neurocomputing5
2020 Balanced Joint Adversarial Training for Robust Intent Detection and Slot Filling
abstract
Joint intent detection and slot filling has recently achieved tremendous success in advancing the performance of utterance understanding.However, many joint models still suffer from the robustness problem, especially on noisy inputs or rare/unseen events.To address this issue, we propose a Joint Adversarial Training (JAT) model to improve the robustness of joint intent detection and slot filling, which consists of two parts: (1) automatically generating joint adversarial examples to attack the joint model, and (2) training the model to defend against the joint adversarial examples so as to robustify the model on small perturbations.As the generated joint adversarial examples have different impacts on the intent detection and slot filling loss, we further propose a Balanced Joint Adversarial Training (BJAT) model that applies a balance factor as a regularization term to the final loss function, which yields a stable training procedure.Extensive experiments and analyses on the lightweight models show that our proposed methods achieve significantly higher scores and substantially improve the robustness of both intent detection and slot filling.In addition, the combination of our BJAT with BERT-large achieves state-of-the-art results on two datasets.
Deyi Xiong, Chongyang Shi 0001, Changjian Hu
COLING6
2020 Cycle-Consistent Adversarial Autoencoders for Unsupervised Text Style Transfer
abstract
Unsupervised text style transfer is full of challenges due to the lack of parallel data and difficulties in content preservation.In this paper, we propose a novel neural approach to unsupervised text style transfer which we refer to as Cycle-consistent Adversarial autoEncoders (CAE) trained from non-parallel data.CAE consists of three essential components: (1) LSTM autoencoders that encode a text in one style into its latent representation and decode an encoded representation into its original text or a transferred representation into a style-transferred text, (2) adversarial style transfer networks that use an adversarially trained generator to transform a latent representation in one style into a representation in another style, and (3) a cycle-consistent constraint that enhances the capacity of the adversarial style transfer networks in content preservation.The entire CAE with these three components can be trained end-to-end.Extensive experiments and in-depth analyses on two widely-used public datasets consistently validate the effectiveness of proposed CAE in both style transfer and content preservation against several strong baselines in terms of four automatic evaluation metrics and human evaluation.
Yufang Huang, Wentao Zhu 0001, Deyi Xiong, Yiye Zhang, Changjian Hu
COLING5
2020 A Learning-Exploring Method to Generate Diverse Paraphrases with Multi-Objective Deep Reinforcement Learning
abstract
Paraphrase generation (PG) is of great importance to many downstream tasks in natural language processing.Diversity is an essential nature to PG for enhancing generalization capability and robustness of downstream applications.Recently, neural sequence-to-sequence (Seq2Seq) models have shown promising results in PG.However, traditional model training for PG focuses on optimizing model prediction against single reference and employs cross-entropy loss, which objective is unable to encourage model to generate diverse paraphrases.In this work, we present a novel approach with multi-objective learning to PG.We propose a learning-exploring method to generate sentences as learning objectives from the learned data distribution, and employ reinforcement learning to combine these new learning objectives for model training.We first design a sample-based algorithm to explore diverse sentences.Then we introduce several reward functions to evaluate the sampled sentences as learning signals in terms of expressive diversity and semantic fidelity, aiming to generate diverse and high-quality paraphrases.To effectively optimize model performance satisfying different evaluating aspects, we use a GradNorm-based algorithm that automatically balances these training objectives.Experiments and analyses on Quora and Twitter datasets demonstrate that our proposed method not only gains a significant increase in diversity but also improves generation quality over several state-of-the-art baselines.
Mingtong Liu, Erguang Yang, Deyi Xiong, Changjian Hu, Jin An Xu, Yufeng Chen 0005
COLING6
2020 Exploring Bilingual Parallel Corpora for Syntactically Controllable Paraphrase Generation
abstract
Paraphrase generation is of great importance to many downstream tasks in natural language processing. Recent efforts have focused on generating paraphrases in specific syntactic forms, which, generally, heavily relies on manually annotated paraphrase data that is not easily available for many languages and domains. In this paper, we propose a novel end-to-end framework to leverage existing large-scale bilingual parallel corpora to generate paraphrases under the control of syntactic exemplars. In order to train one model over the two languages of parallel corpora, we embed sentences of them into the same content and style spaces with shared content and style encoders using cross-lingual word embeddings. We propose an adversarial discriminator to disentangle the content and style space, and employ a latent variable to model the syntactic style of a given exemplar in order to guide the two decoders for generation. Additionally, we introduce cycle and masking learning schemes to efficiently train the model. Experiments and analyses demonstrate that the proposed model trained only on bilingual parallel data is capable of generating diverse paraphrases with desirable syntactic styles. Fine-tuning the trained model on a small paraphrase corpus makes it substantially outperform state-of-the-art paraphrase generation models trained on a larger paraphrase dataset.
Mingtong Liu, Erguang Yang, Deyi Xiong, Chen Sheng, Changjian Hu, Jin An Xu, Yufeng Chen 0005
IJCAI6
2020 Path-Based Visual Explanation
Mohsen Pourvali, Yucheng Jin 0001, Chen Sheng, Masha Gorkovenko, Changjian Hu
NLPCC (2)7
2020 Introspection unit in memory network: Learning to generalize inference in OOV scenarios
Qichuan Yang, Zhiqiang He 0002, Zhiqiang Zhan, Yang Zhang 0002, Rang Li, Changjian Hu
Neurocomputing6
2020 Knowledge attention sandwich neural network for text classification
Zhiqiang Zhan, Zifeng Hou, Qichuan Yang, Yang Zhang 0002, Changjian Hu
Neurocomputing6
2019 GECOR: An End-to-End Generative Ellipsis and Co-reference Resolution Model for Task-Oriented Dialogue
abstract
Jun Quan, Deyi Xiong, Bonnie Webber, Changjian Hu. Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP). 2019.
Jun Quan, Deyi Xiong, Bonnie L. Webber, Changjian Hu
EMNLP/IJCNLP (1)4
2019 MIDS: End-to-End Personalized Response Generation in Untrimmed Multi-Role Dialogue*
abstract
Multi-role dialogue is a challenging issue in nature language process (NLP), which needs not only to understand the sentences, but also to simulate the interaction among roles. However, existing methods treat all roles’ speeches as one sequence and assume that only two speakers take turn to talk, which blurs the characteristics of roles and rarely happen in daily life. To address these issues, we propose a Multi-role Interposition Dialogue System (MIDS) which generates reasonable responses based on dialogue context and next speaker prediction. MIDS employs multiple role-defined encoders to understand each speaker, and an independent sequence model to predict the next speaker. The independent sequence model also works as a scheduler to integrate encoders with weights. Then, an attention-enhanced decoder generates responses based on dialogue context, speaker prediction and integrated encoders. Moreover, with the help of the unique speaker prediction, MIDS is able to generate diverse responses and join conversation actively when appropriate. Experimental results demonstrate that MIDS significantly improves the accuracy of speaker prediction and reduces the perplexity of generation over baselines. Furthermore, MIDS is able to interact with users without cue during real-life online conversations. This work marks a first step towards simulating multi-role dialogue generation.
Qichuan Yang, Zhiqiang He 0002, Zhiqiang Zhan, Yang Zhang 0002, Changjian Hu
IJCNN6
2019 SSA: A More Humanized Automatic Evaluation Method for Open Dialogue Generation
abstract
Dialogue generation has been gaining ever-increasing attention, and various models have been proposed and adopted in many fields in recent years. How to evaluate their performance is critical. However, current evaluation metrics tend to be insufficient because of their simplicity and crudeness, resulting in weak correlation with human judgements. To solve this issue, we propose an automatic and comprehensive evaluation metric, which consists of three assessment criteria: Semantic Coherence, Syntactic Validity and Ability of Expression (SSA). The first two criteria are used to evaluate the generations from semantic and syntactic aspects respectively at the sentence level and the last one is to evaluate the overall performance at the model level. With two generative models, we conduct experiments on three datasets, including Twitter, Subtitle and Lenovo. Comparing with the previous metrics such as BLEU, METEOR and ROUGE, the correlation coefficient between SSA and human judgements is increased by 0.23-0.35, i.e. 324%-864% relative improvements. The experimental results demonstrate that SSA correlates more strongly with human judgements on the evaluation for open dialogue generation. Additionally, SSA is able to evaluate the semantic coherence and syntactic validity of generations exactly. More importantly, the evaluation models can be trained without human annotations. Thus, SSA is flexible and extensible to different datasets.
Zhiqiang Zhan, Zifeng Hou, Qichuan Yang, Yang Zhang 0002, Changjian Hu
IJCNN6
2019 Modeling Human Intelligence in Customer-Agent Conversation Using Fine-Grained Dialogue Acts
Qicheng Ding, Guoguang Zhao, Penghui Xu, Yucheng Jin 0001, Yu Zhang 0124, Changjian Hu, Qianying Wang 0002
NLPCC (2)6
2018 Using Reviewer Information to Improve Performance of Low-Quality Review Detection
Qingliang Miao, Changjian Hu
CICLing (2)2
2018 Adaptive Learning of Local Semantic and Global Structure Representations for Text Classification
abstract
Representation learning is a key issue for most Natural Language Processing (NLP) tasks. Most existing representation models either learn little structure information or just rely on pre-defined structures, leading to degradation of performance and generalization capability. This paper focuses on learning both local semantic and global structure representations for text classification. In detail, we propose a novel Sandwich Neural Network (SNN) to learn semantic and structure representations automatically without relying on parsers. More importantly, semantic and structure information contribute unequally to the text representation at corpus and instance level. To solve the fusion problem, we propose two strategies: Adaptive Learning Sandwich Neural Network (AL-SNN) and Self-Attention Sandwich Neural Network (SA-SNN). The former learns the weights at corpus level, and the latter further combines attention mechanism to assign the weights at instance level. Experimental results demonstrate that our approach achieves competitive performance on several text classification tasks, including sentiment analysis, question type classification and subjectivity classification. Specifically, the accuracies are MR (82.1%), SST-5 (50.4%), TREC (96%) and SUBJ (93.9%).
Zhiqiang Zhan, Qichuan Yang, Yang Zhang 0002, Changjian Hu, Zhensheng Li, Liuxin Zhang, Zhiqiang He 0002
COLING5
2018 Question Answering for Technical Customer Support
Qingliang Miao, Ji Geng 0002, Christoph Alt, Robert Schwarzenberg, Leonhard Hennig, Changjian Hu, Feiyu Xu 0001
NLPCC (1)7
2014 Monitoring massive appliances by a minimal number of smart meters
abstract
This article presents a framework for deploying a minimal number of smart meters to accurately track the ON/OFF states of a massive number of electrical appliances which exploits the sparseness feature of simultaneous ON/OFF switching events of the massive appliances. A theoretical bound on the least number of required smart meters is studied by an entropy-based approach, which qualifies the impact of meter deployment strategies to the state tracking accuracy. It motivates a meter deployment optimization algorithm (MDOP) to minimize the number of meters while satisfying given requirements to state tracking accuracy. To accurately decode the real-time ON/OFF states of appliances by the readings of meters, a fast state decoding (FSD) algorithm based on the hidden Markov model (HMM) is presented to track the state sequence of each appliance for better accuracy. Although traditional HMM needs O ( t 2 2 N ) time complexity to conduct online sequence decoding, FSD improves the complexity to O ( tn U+1 ), where n < N and U is an upper bound of the simultaneous switching events. Both MDOP and FSD are verified extensively using simulations and real PowerNet data. The results show that the meter deployment cost can be saved by more than 80% while still getting over 90% state tracking accuracy.
Yongcai Wang, Xiaohong Hao, Chenye Wu, Changjian Hu
ACM Trans. Embed. Comput. Syst.6
2010 Expanding Chinese Sentiment Dictionaries from Large Scale Unlabeled Corpus
Hongzhi Xu, Kai Zhao 0001, Likun Qiu, Changjian Hu
PACLIC4
2009 SELC: a self-supervised model for sentiment classification
abstract
This paper presents the SELC Model (SElf-Supervised, (Lexicon-based and (Corpus-based Model) for sentiment classification. The SELC Model includes two phases. The first phase is a lexicon-based iterative process. In this phase, some reviews are initially classified based on a sentiment dictionary. Then more reviews are classified through an iterative process with a negative/positive ratio control. In the second phase, a supervised classifier is learned by taking some reviews classified in the first phase as training data. Then the supervised classifier applies on other reviews to revise the results produced in the first phase. Experiments show the effectiveness of the proposed model. SELC totally achieves 6.63% F1-score improvement over the best result in previous studies on the same data (from 82.72% to 89.35%). The first phase of the SELC Model independently achieves 5.90% improvement (from 82.72% to 88.62%). Moreover, the standard deviation of F1-scores is reduced, which shows that the SELC Model could be more suitable for domain-independent sentiment classification.
Likun Qiu, Weishi Zhang, Changjian Hu, Kai Zhao 0001
CIKM3
2009 A Hybrid Model for Sense Guessing of Chinese Unknown Words
Likun Qiu, Kai Zhao 0001, Changjian Hu
PACLIC3
2009 Discovery of Dependency Tree Patterns for Relation Extraction
Hongzhi Xu, Changjian Hu, Guoyang Shen
PACLIC2
2009 SESS: A Self-Supervised and Syntax-Based Method for Sentiment Classification
Weishi Zhang, Kai Zhao 0001, Likun Qiu, Changjian Hu
PACLIC4
2008 A Method for Automatic POS Guessing of Chinese Unknown Words
Likun Qiu, Changjian Hu, Kai Zhao 0001
COLING2