Ziqing Yang — Page 3

arXiv2019

Improving Machine Reading Comprehension via Adversarial Training

Adversarial training (AT) as a regularization method has proved its effectiveness in various tasks, such as image classification and text classification. Though there are successful applications of AT in many tasks of natural language processing (NLP), the mechanism behind it is still unclear. In this paper, we aim to apply AT on machine reading comprehension (MRC) and study its effects from multiple perspectives. We experiment with three different kinds of RC tasks: span-based RC, span-based RC with unanswerable questions and multi-choice RC. The experimental results show that the proposed method can improve the performance significantly and universally on SQuAD1.1, SQuAD2.0 and RACE. With virtual adversarial training (VAT), we explore the possibility of improving the RC models with semi-supervised learning and prove that examples from a different task are also beneficial. We also find that AT helps little in defending against artificial adversarial examples, but AT helps the model to learn better on examples that contain more low-frequency words.

cs.CL↗

arXiv2015

Critical behaviors and universality classes of percolation phase transitions on two-dimensional square lattice

We have investigated both site and bond percolation on two dimensional lattice under the random rule and the product rule respectively. With the random rule, sites or bonds are added randomly into the lattice. From two candidates picked randomly, the site or bond with the smaller size product of two connected clusters is added when the product rule is taken. Not only the size of the largest cluster but also its size jump are studied to characterize the universality class of percolation. The finite-size scaling forms of giant cluster size and size jump are proposed and used to determine the critical exponents of percolation from Monte Carlo data. It is found that the critical exponents of both size and size jump in random site percolation are equal to that in random bond percolation. With the random rule, site and bond percolation belong to the same universality class. We obtain the critical exponents of the site percolation under the product rule, which are different from that of both random percolation and the bond percolation under the product rule. The universality class of site percolation differs different from that of bond percolation when the product rule is used.

cond-mat.stat-mech↗