Author name cluster

Liang Jiang

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

6 papers

1 author row

AAAI Conference 2023 Conference Paper

Robust Domain Adaptation for Machine Reading Comprehension

Liang Jiang
Zhenyu Huang
Jia Liu
Zujie Wen
Xi Peng

Most domain adaptation methods for machine reading comprehension (MRC) use a pre-trained question-answer (QA) construction model to generate pseudo QA pairs for MRC transfer. Such a process will inevitably introduce mismatched pairs (i.e., Noisy Correspondence) due to i) the unavailable QA pairs in target documents, and ii) the domain shift during applying the QA construction model to the target domain. Undoubtedly, the noisy correspondence will degenerate the performance of MRC, which however is neglected by existing works. To solve such an untouched problem, we propose to construct QA pairs by additionally using the dialogue related to the documents, as well as a new domain adaptation method for MRC. Specifically, we propose Robust Domain Adaptation for Machine Reading Comprehension (RMRC) method which consists of an answer extractor (AE), a question selector (QS), and an MRC model. Specifically, RMRC filters out the irrelevant answers by estimating the correlation to the document via the AE, and extracts the questions by fusing the candidate questions in multiple rounds of dialogue chats via the QS. With the extracted QA pairs, MRC is fine-tuned and provides the feedback to optimize the QS through a novel reinforced self-training method. Thanks to the optimization of the QS, our method will greatly alleviate the noisy correspondence problem caused by the domain shift. To the best of our knowledge, this could be the first study to reveal the influence of noisy correspondence in domain adaptation MRC models and show a feasible solution to achieve the robustness against the mismatched pairs. Extensive experiments on three datasets demonstrate the effectiveness of our method.

PDF Details DOI

YNICL Journal 2021 Journal Article

An automatic machine learning approach for ischemic stroke onset time identification based on DWI and FLAIR imaging

Haichen Zhu
Liang Jiang
Hong Zhang
Limin Luo
Yang Chen
Yuchen Chen

Current thrombolysis for acute ischemic stroke (AIS) treatment strictly relies on the time since stroke (TSS) less than 4.5 h. However, some patients are excluded from thrombolytic treatment because of the unknown TSS. The diffusion-weighted imaging (DWI) and fluid-attenuated inversion recovery (FLAIR) mismatch can simply identify TSS since lesion intensities are not identical at different onset time. In this paper, we propose an automatic machine learning method to classify the TSS less than or more than 4.5 h. First, we develop a cross-modal convolutional neural network to accurately segment the stroke lesions from DWI and FLAIR images. Second, the features are extracted from DWI and FLAIR according to the segmentation regions of interest (ROI). Finally, the features are fed to machine learning models to identify TSS. In DWI and FLAIR ROI segmentation, the networks obtain high Dice coefficients with 0.803 and 0.647. The classification test results show that our model achieves an accuracy of 0.805, with a sensitivity of 0.769 and a specificity of 0.840. Our approach outperforms human reading DWI-FLAIR mismatch model, illustrating the potential for automatic and fast TSS identification.

Details DOI

AAAI Conference 2020 Conference Paper

Long Short-Term Sample Distillation

Liang Jiang
Zujie Wen
Zhongping Liang
Yafang Wang
Gerard de Melo
Zhe Li
Liangzhuang Ma
Jiaxing Zhang

In the past decade, there has been substantial progress at training increasingly deep neural networks. Recent advances within the teacher–student training paradigm have established that information about past training updates show promise as a source of guidance during subsequent training steps. Based on this notion, in this paper, we propose Long Short- Term Sample Distillation, a novel training policy that simultaneously leverages multiple phases of the previous training process to guide the later training updates to a neural network, while efﬁciently proceeding in just one single generation pass. With Long Short-Term Sample Distillation, the supervision signal for each sample is decomposed into two parts: a long-term signal and a short-term one. The long-term teacher draws on snapshots from several epochs ago in order to provide steadfast guidance and to guarantee teacher– student differences, while the short-term one yields more upto-date cues with the goal of enabling higher-quality updates. Moreover, the teachers for each sample are unique, such that, overall, the model learns from a very diverse set of teachers. Comprehensive experimental results across a range of vision and NLP tasks demonstrate the effectiveness of this new training method.

PDF Details

IJCAI Conference 2018 Conference Paper

Enhancing Semantic Representations of Bilingual Word Embeddings with Syntactic Dependencies

Linli Xu
Wenjun Ouyang
Xiaoying Ren
Yang Wang
Liang Jiang

Cross-lingual representation is a technique that can both represent different languages in the same latent vector space and enable the knowledge transfer across languages. To learn such representations, most of existing works require parallel sentences with word-level alignments and assume that aligned words have similar Bag-of-Words (BoW) contexts. However, due to differences in grammar structures among different languages, the contexts of aligned words in different languages may appear at different positions of the sentence. To address this issue of different syntactics across different languages, we propose a model of bilingual word embeddings integrating syntactic dependencies (DepBiWE) by producing dependency parse-trees which encode the accurate relative positions for the contexts of aligned words. In addition, a new method is proposed to learn bilingual word embeddings from dependency-based contexts and BoW contexts jointly. Extensive experimental results on a real world dataset clearly validate the superiority of the proposed model DepBiWE on various natural language processing (NLP) tasks.

PDF Details

AAAI Conference 2018 Conference Paper

How Images Inspire Poems: Generating Classical Chinese Poetry from Images with Memory Networks

Linli Xu
Liang Jiang
Chuan Qin
Zhe Wang
Dongfang Du

With the recent advances of neural models and natural language processing, automatic generation of classical Chinese poetry has drawn signiﬁcant attention due to its artistic and cultural value. Previous works mainly focus on generating poetry given keywords or other text information, while visual inspirations for poetry have been rarely explored. Generating poetry from images is much more challenging than generating poetry from text, since images contain very rich visual information which cannot be described completely using several keywords, and a good poem should convey the image accurately. In this paper, we propose a memory based neural model which exploits images to generate poems. Specifically, an Encoder-Decoder model with a topic memory network is proposed to generate classical Chinese poetry from images. To the best of our knowledge, this is the ﬁrst work attempting to generate classical Chinese poetry from images with neural networks. A comprehensive experimental investigation with both human evaluation and quantitative analysis demonstrates that the proposed model can generate poems which convey images accurately.

PDF Details

IJCAI Conference 2015 Conference Paper

Word Embedding Revisited: A New Representation Learning and Explicit Matrix Factorization Perspective

Yitan Li
Linli Xu
Fei Tian
Liang Jiang
Xiaowei Zhong
Enhong Chen

Recently significant advances have been witnessed in the area of distributed word representations based on neural networks, which are also known as word embeddings. Among the new word embedding models, skip-gram negative sampling (SGNS) in the word2vec toolbox has attracted much attention due to its simplicity and effectiveness. However, the principles of SGNS remain not well understood, except for a recent work that explains SGNS as an implicit matrix factorization of the pointwise mutual information (PMI) matrix. In this paper, we provide a new perspective for further understanding SGNS. We point out that SGNS is essentially a representation learning method, which learns to represent the co-occurrence vector for a word. Based on the representation learning view, SGNS is in fact an explicit matrix factorization (EMF) of the words’ co-occurrence matrix. Furthermore, extended supervised word embedding can be established based on our proposed representation learning view.

PDF Details