Searcharxiv⌕ Search

arXiv subjects

Xiang Zhou

Publications and source records attributed to Xiang Zhou.

At least 145 records · Page 8Linked to original sources

Towards Robustifying NLI Models Against Lexical Dataset Biases

While deep learning models are making fast progress on the task of Natural Language Inference, recent studies have also shown that these models achieve high accuracy by exploiting several dataset biases, and without deep understanding of the language semantics. Using contradiction-word bias and word-overlapping bias as our two bias examples, this paper explores both data-level and model-level debiasing methods to robustify models against lexical dataset biases. First, we debias the dataset through data augmentation and enhancement, but show that the model bias cannot be fully removed via this method. Next, we also compare two ways of directly debiasing the model without knowing what the dataset biases are in advance. The first approach aims to remove the label bias at the embedding level. The second approach employs a bag-of-words sub-model to capture the features that are likely to exploit the bias and prevents the original model from learning these biased features by forcing orthogonality between these two sub-models. We performed evaluations on new balanced datasets extracted from the original MNLI dataset as well as the NLI stress tests, and show that the orthogonality approach is better at debiasing the model while maintaining competitive overall accuracy. Our code and data are available at: https://github.com/owenzx/LexicalDebias-ACL2020

cs.CL↗

Enumerating Chemical Graphs with Two Disjoint Cycles Satisfying Given Path Frequency Specifications

Enumerating chemical graphs satisfying given constraints is a fundamental problem in mathematical and computational chemistry, and plays an essential part in a recently proposed framework for the inverse QSAR/QSPR. In this paper, constraints are given by feature vectors each of which consists of the frequencies of paths in a given set of paths. We consider the problem of enumerating chemical graphs that satisfy the path frequency constraints, which are given by a pair of feature vectors specifying upper and lower bounds of the frequency of each path. We design a branch-and-bound algorithm for enumerating chemical graphs of bi-block 2-augmented structure, that is, graphs that contain two edge-disjoint cycles. We present some computational experiments with an implementation of our proposed algorithm.

cs.DS↗

Stochastic Modified Equations for Continuous Limit of Stochastic ADMM

Stochastic version of alternating direction method of multiplier (ADMM) and its variants (linearized ADMM, gradient-based ADMM) plays a key role for modern large scale machine learning problems. One example is the regularized empirical risk minimization problem. In this work, we put different variants of stochastic ADMM into a unified form, which includes standard, linearized and gradient-based ADMM with relaxation, and study their dynamics via a continuous-time model approach. We adapt the mathematical framework of stochastic modified equation (SME), and show that the dynamics of stochastic ADMM is approximated by a class of stochastic differential equations with small noise parameters in the sense of weak approximation. The continuous-time analysis would uncover important analytical insights into the behaviors of the discrete-time algorithm, which are non-trivial to gain otherwise. For example, we could characterize the fluctuation of the solution paths precisely, and decide optimal stopping time to minimize the variance of solution paths.

math.OC↗

Semantics-aware BERT for Language Understanding

The latest work on language representations carefully integrates contextualized features into language model training, which enables a series of success especially in various machine reading comprehension and natural language inference tasks. However, the existing language representation models including ELMo, GPT and BERT only exploit plain context-sensitive features such as character or word embeddings. They rarely consider incorporating structured semantic information which can provide rich semantics for language representation. To promote natural language understanding, we propose to incorporate explicit contextual semantics from pre-trained semantic role labeling, and introduce an improved language representation model, Semantics-aware BERT (SemBERT), which is capable of explicitly absorbing contextual semantics over a BERT backbone. SemBERT keeps the convenient usability of its BERT precursor in a light fine-tuning way without substantial task-specific modifications. Compared with BERT, semantics-aware BERT is as simple in concept but more powerful. It obtains new state-of-the-art or substantially improves results on ten reading comprehension and language inference tasks.

cs.CL↗

DCMN+: Dual Co-Matching Network for Multi-choice Reading Comprehension

Multi-choice reading comprehension is a challenging task to select an answer from a set of candidate options when given passage and question. Previous approaches usually only calculate question-aware passage representation and ignore passage-aware question representation when modeling the relationship between passage and question, which obviously cannot take the best of information between passage and question. In this work, we propose dual co-matching network (DCMN) which models the relationship among passage, question and answer options bidirectionally. Besides, inspired by how human solve multi-choice questions, we integrate two reading strategies into our model: (i) passage sentence selection that finds the most salient supporting sentences to answer the question, (ii) answer option interaction that encodes the comparison information between answer options. DCMN integrated with the two strategies (DCMN+) obtains state-of-the-art results on five multi-choice reading comprehension datasets which are from different domains: RACE, SemEval-2018 Task 11, ROCStories, COIN, MCTest.

cs.CL↗

Torsional refrigeration by twisted, coiled, and supercoiled fibers

Higher efficiency, lower cost refrigeration is needed for both large and small scale cooling. Refrigerators using entropy changes during cycles of stretching or hydrostatically compression of a solid are possible alternatives to the vapor-compression fridges found in homes. We show that high cooling results from twist changes for twisted, coiled, or supercoiled fibers, including those of natural rubber, NiTi, and polyethylene fishing line. By using opposite chiralities of twist and coiling, supercoiled natural rubber fibers and coiled fishing line fibers result that cool when stretched. A demonstrated twist-based device for cooling flowing water provides a high cooling energy and device efficiency. Theory describes the axial and spring index dependencies of twist-enhanced cooling and its origin in a phase transformation for polyethylene fibers.

physics.app-ph↗

On the Global Convergence of Continuous-Time Stochastic Heavy-Ball Method for Nonconvex Optimization

We study the convergence behavior of the stochastic heavy-ball method with a small stepsize. Under a change of time scale, we approximate the discrete method by a stochastic differential equation that models small random perturbations of a coupled system of nonlinear oscillators. We rigorously show that the perturbed system converges to a local minimum in a logarithmic time. This indicates that for the diffusion process that approximates the stochastic heavy-ball method, it takes (up to a logarithmic factor) only a linear time of the square root of the inverse stepsize to escape from all saddle points. This results may suggest a fast convergence of its discrete-time counterpart. Our theoretical results are validated by numerical experiments.

math.PR↗

Dual Co-Matching Network for Multi-choice Reading Comprehension

Multi-choice reading comprehension is a challenging task that requires complex reasoning procedure. Given passage and question, a correct answer need to be selected from a set of candidate answers. In this paper, we propose \textbf{D}ual \textbf{C}o-\textbf{M}atching \textbf{N}etwork (\textbf{DCMN}) which model the relationship among passage, question and answer bidirectionally. Different from existing approaches which only calculate question-aware or option-aware passage representation, we calculate passage-aware question representation and passage-aware answer representation at the same time. To demonstrate the effectiveness of our model, we evaluate our model on a large-scale multiple choice machine reading comprehension dataset (i.e. RACE). Experimental result show that our proposed model achieves new state-of-the-art results.

cs.CL↗

No Disturbance Without Uncertainty as a Physical Principle

Finding physical principles lying behind quantum mechanics is essential to understand various quantum features, e.g., the quantum correlations, in a theory-independent manner. Here we propose such a principle, namely, no disturbance without uncertainty, stating that the disturbance caused by a measurement to a subsequent incompatible measurement is no larger than the uncertainty of the first measurement, equipped with suitable theory-independent measures for disturbance and uncertainty. When applied to local systems in a multipartite scenario, our principle imposes such a strong constraint on non-signaling correlations that quantum correlations can be recovered in many cases: i. it accounts for the Tsirelsons bound; ii. it provides the so far tightest boundary for a family of the noisy super-nonlocal box with 3 parameters, and iii. it rules out an almost quantum correlation from quantum correlations by which all the previous principles fail, as well as the celebrated quantum criterion due to Navascues, Pironio, and Acin. Our results pave the way to understand nonlocality exhibited in quantum correlations from local principles.

quant-ph↗

Thermal diffusivity and specific heat capacity of linear alkylbenzene

We report the measurements of the thermal diffusivity and the isobaric specific heat capacity of linear alkylbenzene at about 23$\,^{\circ}\mathrm{C}$ with the standard atmosphere, which are measured for the first time. The conductivity, heat capacity ratio, and speed of sound were derived from our measurements based on thermodynamic relations. The temperature dependence of heat capacity ratio and isobaric specific heat capacity were calculated and relevant results were discussed.

physics.ins-det↗

Initial state radiation correction and its effect to data-taking scheme for $σ^{\mathrm{B}}(e^+e^-\to ZH)$ measurement

The measurement of Born cross section of $e^+e^-\to ZH$ process is one of the major goals of the future Circular Electron Positron Collider, which may reach a precision of 0.5%. Such unprecedented precision must be guaranteed by both theoretical and experimental sides, such as the calculations of high order corrections, the knowledge of the $σ^{\mathrm{B}}(e^+e^-\to ZH)$ line shape. The uncertainty of radiative correction factor due to lack of knowledge of the $σ^{\mathrm{B}}(e^+e^-\to ZH)$ line shape is evaluated in this work. Therefore, the dedicated data-taking schemes are proposed in order to precisely calculate the ISR correction factor.

hep-ex↗

Residual Balancing: A Method of Constructing Weights for Marginal Structural Models

When making causal inferences, post-treatment confounders complicate analyses of time-varying treatment effects. Conditioning on these variables naively to estimate marginal effects may inappropriately block causal pathways and may induce spurious associations between treatment and the outcome, leading to bias. To avoid such bias, researchers often use marginal structural models (MSMs) with inverse probability weighting (IPW). However, IPW requires models for the conditional distributions of treatment and is highly sensitive to their misspecification. Moreover, IPW is relatively inefficient, susceptible to finite-sample bias, and difficult to use with continuous treatments. We introduce an alternative method of constructing weights for MSMs, which we call "residual balancing." In contrast to IPW, it requires modeling the conditional means of the post-treatment confounders rather than the conditional distributions of treatment, and it is therefore easier to use with continuous exposures. Numeric simulations suggest that residual balancing is both more efficient and more robust to model misspecification than IPW and its variants. We illustrate the method by estimating (a) the cumulative effect of negative advertising on election outcomes and (b) the controlled direct effect of shared democracy on public support for war. Open source software is available for implementing the proposed method.

stat.AP↗

A new method of energy reconstruction for large spherical liquid scintillator detectors

Liquid scintillators are commonly used to detect low energy neutrinos from the reactors, sun, and earth. It is a challenge to reconstruct deposited energies for a large liquid scintillator detector. For detectors with multiple optical mediums such as JUNO and SNO+, the prediction of the propagation of detected photons is extremely difficult due to mixed optical processes such as Rayleigh scattering, refraction and total reflection at their boundaries. Calibration based reconstruction methods consume impractical time since a large number of calibration points are required in a giant detector. In this paper, we propose a new model-independent method to reconstruct deposited energies with minimum requirements on the calibration system. This method is validated with JUNO's offline software. Monte Carlo studies show that the energy non-uniformity can be controlled below 1%, which is crucial for JUNO to achieve 3% energy resolution.

physics.ins-det↗

Dependency or Span, End-to-End Uniform Semantic Role Labeling

Semantic role labeling (SRL) aims to discover the predicateargument structure of a sentence. End-to-end SRL without syntactic input has received great attention. However, most of them focus on either span-based or dependency-based semantic representation form and only show specific model optimization respectively. Meanwhile, handling these two SRL tasks uniformly was less successful. This paper presents an end-to-end model for both dependency and span SRL with a unified argument representation to deal with two different types of argument annotations in a uniform fashion. Furthermore, we jointly predict all predicates and arguments, especially including long-term ignored predicate identification subtask. Our single model achieves new state-of-the-art results on both span (CoNLL 2005, 2012) and dependency (CoNLL 2008, 2009) SRL benchmarks.

cs.CL↗

Regression-with-residuals Estimation of Marginal Effects: A Method of Adjusting for Treatment-induced Confounders that may also be Moderators

Treatment-induced confounders complicate analyses of time-varying treatment effects and causal mediation. Conditioning on these variables naively to estimate marginal effects may inappropriately block causal pathways and may induce spurious associations between treatment and the outcome, leading to bias. Although several methods for estimating marginal effects avoid these complications, including inverse-probability-of-treatment-weighted (IPTW) estimation of marginal structural models (MSMs) as well as g- and regression-with-residuals (RWR) estimation of highly constrained structural nested mean models (SNMMs), each suffers from a set of nontrivial limitations. Specifically, IPTW estimation is inefficient, is difficult to use with continuous treatments or mediators, and may suffer from finite-sample bias, while g- and RWR estimation of highly constrained SNMMs for marginal effects are premised on the unrealistic assumption that there is no effect moderation. In this study, we adapt the method of RWR to estimate marginal effects with a set of moderately constrained SNMMs that accommodate several types of treatment-by-confounder and/or mediator-by-confounder interaction, thereby relaxing the assumption of no effect moderation. Through a series of simulation experiments and empirical examples, we show that this approach outperforms IPTW estimation of MSMs as well as both g- and RWR estimation of highly constrained SNMMs in which effect moderation is assumed away.

stat.AP↗

Simplified Gentlest Ascent Dynamics for Saddle Points in Non-gradient Systems

The gentlest ascent dynamics (GAD) (Nonlinearity, vol. 24, no. 6, p1831, 2011) is a continuous time dynamics coupling both the position and the direction variables to efficiently locate the saddle point with a given index. These saddle points play important roles in the activated process of the randomly perturbed dynamical systems. For index-1 saddle points in non-gradient systems, the GAD requires two direction variables to approximate the eigenvectors of the Jacobian matrix and its transpose, respectively, while in the gradient systems, these two directions collapse to be the single min mode of the Hessian matrix. In this note, we present a simplified GAD which only needs one direction variable even for non-gradient systems. This new method not only reduces computational cost for directions by half, but also can avoid inconvenient operations on the transpose of Jacobian matrix. We prove the same convergence property for the simplified GAD as for the original GAD. The motivation of our simplified GAD is its formal analogy to the Hamiltonian dynamics governing the exit dynamics when the system is perturbed by small noise. Several non-gradient examples are presented to demonstrate our method, including the two dimensional models and the Allen-Cahn equation in the presence of shear flow.

math.DS↗

Quasi-potential Calculation and Minimum Action Method for Limit Cycle

We study the noise-induced escape from a stable limit cycle of a non-gradient dynamical system driven by a small additive noise. The fact that the optimal transition path in this case is infinitely long imposes a severe numerical challenge to resolve it in the minimum action method. We first consider the landscape of the quasi-potential near the limit cycle, which characterizes the minimal cost of the noise to drive the system far away form the limit cycle. We derive and compute the quadratic approximation of this quasi-potential near the limit cy- cle in the form of a positive definite solution to a matrix-valued periodic Riccati differential equation on the limit cycle. We then combine this local approxima- tion in the neighbourhood of the limit cycle with the minimum action method applied outside of the neighbourhood. The neighbourhood size is selected to be compatible with the path discretization error. By several numerical examples, we show that this strategy effectively improve the minimum action method to compute the spiral optimal escape path from limit cycles in various systems.

math.OC↗

Scalable Algorithms for Learning High-Dimensional Linear Mixed Models

Linear mixed models (LMMs) are used extensively to model dependecies of observations in linear regression and are used extensively in many application areas. Parameter estimation for LMMs can be computationally prohibitive on big data. State-of-the-art learning algorithms require computational complexity which depends at least linearly on the dimension $p$ of the covariates, and often use heuristics that do not offer theoretical guarantees. We present scalable algorithms for learning high-dimensional LMMs with sublinear computational complexity dependence on $p$. Key to our approach are novel dual estimators which use only kernel functions of the data, and fast computational techniques based on the subsampled randomized Hadamard transform. We provide theoretical guarantees for our learning algorithms, demonstrating the robustness of parameter estimation. Finally, we complement the theory with experiments on large synthetic and real data.

stat.ML↗