One approach to matching texts from asymmetrical domains is projecting the input sequences into a common semantic space as feature vectors upon which the matching function can be readily defined and learned.In realworld matching practices, it is often observed that with the training goes on, the feature vectors projected from different domains tend to be indistinguishable.The phenomenon, however, is often overlooked in existing matching models.As a result, the feature vectors are constructed without any regularization, which inevitably increases the difficulty of learning the downstream matching functions.In this paper, we propose a novel match method tailored for text matching in asymmetrical domains, called WD-Match.In WD-Match, a Wasserstein distance-based regularizer is defined to regularize the features vectors projected from different domains.As a result, the method enforces the feature projection function to generate vectors such that those correspond to different domains cannot be easily discriminated.The training process of WD-Match amounts to a game that minimizes the matching loss regularized by the Wasserstein distance.WD-Match can be used to improve different text matching methods, by using the method as its underlying matching model.Four popular text matching methods have been exploited in the paper.Experimental results based on four publicly available benchmarks showed that WD-Match consistently outperformed the underlying methods and the baselines.

Community Question Answering (CQA) has become a primary means for people to acquire knowledge, where people are free to ask questions or submit answers. To enhance the efficiency of the service, similar question identification becomes a core task in CQA which aims to find a similar question from the archived repository whenever a new question is asked. However, it has long been a challenge to properly measure the similarity between two questions due to the inherent variation of natural language, i.e., there could be different ways to ask a same question or different questions sharing similar expressions. To alleviate this problem, it is natural to involve the existing answers for the enrichment of the archived questions. Traditional methods typically take aone-side usage, which leverages the answer as some expanded representation of the corresponding question. Unfortunately, this may introduce unexpected noises into the similarity computation since answers are often long and diverse, leading to inferior performance. In this work, we propose atwo-side usage, which leverages the answer as a bridge of the two questions. The key idea is based on our observation that similar questions could be addressed by similar parts of the answer while different questions may not. In other words, we can compare the matching patterns of the two questions over the same answer to measure their similarity. In this way, we propose a novel matching over matching model, namely Match2, which compares the matching patterns between two question-answer pairs for similar question identification. Empirical experiments on two benchmark datasets demonstrate that our model can significantly outperform previous state-of-the-art methods on the similar question identification task.

Distributed storage systems provide reliable access to data through redundancy spread in network system. A key goal is to minimize bandwidth overhead to maintain the redundancy. This paper studies the flexible recovery from multiple node failures in distributed storage systems. Via a cut-based analysis of information flow graph, we obtain a lower bound of maintenance bandwidth for multi-loss flexible recovery (MFR). We also design a coding scheme based on MFR with maintenance bandwidth matching the lower bound. So the lower bound of maintenance bandwidth for multi-loss recovery is tight and the proposed recovery scheme is optimal.

This paper studies the recovery from multiple node failures in distributed storage systems. We design a mutually cooperative recovery (MCR) mechanism for multiple node failures. Via a cut-based analysis of the information flow graph, we obtain a lower bound of maintenance bandwidth based on MCR. For MCR, we also propose a transmission scheme and design a linear network coding scheme based on (η, κ) strong-MDS code, which is a generalization of (η, κ) MDS code. We prove that the maintenance bandwidth based on our transmission and coding schemes matches the lower bound, so the lower bound is tight and the transmission scheme and coding scheme for MCR are optimal. We also give numerical comparisons of MCR with other redundancy recovery mechanisms in storage cost and maintenance bandwidth to show the advantage of MCR.