arXiv subjects

Zhenyu Zhang

Publications and source records attributed to Zhenyu Zhang.

At least 289 records · Page 16Linked to original sources

arXiv2020

Coarse-to-Fine Pre-training for Named Entity Recognition

More recently, Named Entity Recognition hasachieved great advances aided by pre-trainingapproaches such as BERT. However, currentpre-training techniques focus on building lan-guage modeling objectives to learn a gen-eral representation, ignoring the named entity-related knowledge. To this end, we proposea NER-specific pre-training framework to in-ject coarse-to-fine automatically mined entityknowledge into pre-trained models. Specifi-cally, we first warm-up the model via an en-tity span identification task by training it withWikipedia anchors, which can be deemed asgeneral-typed entities. Then we leverage thegazetteer-based distant supervision strategy totrain the model extract coarse-grained typedentities. Finally, we devise a self-supervisedauxiliary task to mine the fine-grained namedentity knowledge via clustering.Empiricalstudies on three public NER datasets demon-strate that our framework achieves significantimprovements against several pre-trained base-lines, establishing the new state-of-the-art per-formance on three benchmarks. Besides, weshow that our framework gains promising re-sults without using human-labeled trainingdata, demonstrating its effectiveness in label-few and low-resource scenarios

cs.CL↗

arXiv2020

Edge-Enhanced Graph Convolution Networks for Event Detection with Syntactic Relation

Event detection (ED), a key subtask of information extraction, aims to recognize instances of specific event types in text. Previous studies on the task have verified the effectiveness of integrating syntactic dependency into graph convolutional networks. However, these methods usually ignore dependency label information, which conveys rich and useful linguistic knowledge for ED. In this paper, we propose a novel architecture named Edge-Enhanced Graph Convolution Networks (EE-GCN), which simultaneously exploits syntactic structure and typed dependency label information to perform ED. Specifically, an edge-aware node update module is designed to generate expressive word representations by aggregating syntactically-connected words through specific dependency types. Furthermore, to fully explore clues hidden in dependency edges, a node-aware edge update module is introduced, which refines the relation representations with contextual information. These two modules are complementary to each other and work in a mutual promotion way. We conduct experiments on the widely used ACE2005 dataset and the results show significant improvement over competitive baseline methods.

cs.CL↗

arXiv2020

Large-scale inference of correlation among mixed-type biological traits with phylogenetic multivariate probit models

Inferring concerted changes among biological traits along an evolutionary history remains an important yet challenging problem. Besides adjusting for spurious correlation induced from the shared history, the task also requires sufficient flexibility and computational efficiency to incorporate multiple continuous and discrete traits as data size increases. To accomplish this, we jointly model mixed-type traits by assuming latent parameters for binary outcome dimensions at the tips of an unknown tree informed by molecular sequences. This gives rise to a phylogenetic multivariate probit model. With large sample sizes, posterior computation under this model is problematic, as it requires repeated sampling from a high-dimensional truncated normal distribution. Current best practices employ multiple-try rejection sampling that suffers from slow-mixing and a computational cost that scales quadratically in sample size. We develop a new inference approach that exploits 1) the bouncy particle sampler (BPS) based on piecewise deterministic Markov processes to simultaneously sample all truncated normal dimensions, and 2) novel dynamic programming that reduces the cost of likelihood and gradient evaluations for BPS to linear in sample size. In an application with 535 HIV viruses and 24 traits that necessitates sampling from a 12,840-dimensional truncated normal, our method makes it possible to estimate the across-trait correlation and detect factors that affect the pathogen's capacity to cause disease. This inference framework is also applicable to a broader class of covariance structures beyond comparative biology.

stat.ME↗

arXiv2020

Residual Clipping Noise in Multi-layer Optical OFDM: Modeling, Analysis, and Application

Optical orthogonal frequency division multiplexing (O-OFDM) schemes are variations of OFDM schemes which produce non-negative signals. Asymmetrically-clipped O-OFDM (ACO-OFDM) is a single-layer O-OFDM scheme, whose spectral efficiency can be enhanced by adopting multiple ACO-OFDM layers or a combination of ACO-OFDM and other O-OFDM schemes. However, since symbol detection in such enhanced ACO-OFDM (eACO-OFDM) is done iteratively, erroneous detection leads to residual clipping noise (RCN) which can degrade performance in practice. Thus, it is important to develop an accurate model for RCN which can be used to design RCN-aware eACO-OFDM schemes. To this end, this paper provides a mathematical analysis of RCN leading to an accurate model of RCN power. The obtained model is used to analyze the performance of various eACO-OFDM schemes. It is shown that the model provides an accurate evaluation of symbol error rate (SER), which would be underestimated if RCN is ignored. Moreover, the model is shown to be useful for designing an RCN-aware resource allocation that increases the robustness of the system in terms of meeting a target SER, compared to an RCN-unaware design.

cs.IT↗

arXiv2020

HIN: Hierarchical Inference Network for Document-Level Relation Extraction

Document-level RE requires reading, inferring and aggregating over multiple sentences. From our point of view, it is necessary for document-level RE to take advantage of multi-granularity inference information: entity level, sentence level and document level. Thus, how to obtain and aggregate the inference information with different granularity is challenging for document-level RE, which has not been considered by previous work. In this paper, we propose a Hierarchical Inference Network (HIN) to make full use of the abundant information from entity level, sentence level and document level. Translation constraint and bilinear transformation are applied to target entity pair in multiple subspaces to get entity-level inference information. Next, we model the inference between entity-level information and sentence representation to achieve sentence-level inference information. Finally, a hierarchical aggregation approach is adopted to obtain the document-level inference information. In this way, our model can effectively aggregate inference information from these three different granularities. Experimental results show that our method achieves state-of-the-art performance on the large-scale DocRED dataset. We also demonstrate that using BERT representations can further substantially boost the performance.

cs.CL↗

arXiv2020

Dirac Fermions in Antiferromagnetic FeSn Kagome Lattices with Combined Space Inversion and Time Reversal Symmetry

Symmetry principles play a critical role in formulating the fundamental laws of nature, with a large number of symmetry-protected topological states identified in recent studies of quantum materials. As compelling examples, massless Dirac fermions are jointly protected by the space inversion symmetry $P$ and time reversal symmetry $T$ supplemented by additional crystalline symmetry, while evolving into Weyl fermions when either $P$ or $T$ is broken. Here, based on first-principles calculations, we reveal that massless Dirac fermions are present in a layered FeSn crystal containing antiferromagnetically coupled ferromagnetic Fe kagome layers, where each of the $P$ and $T$ symmetries is individually broken but the combined $PT$ symmetry is preserved. These stable Dirac fermions protected by the combined $PT$ symmetry with additional non-symmorphic $S_{\rm{2z}}$ symmetry can be transformed to either massless/massive Weyl or massive Dirac fermions by breaking the $PT$ or $S_{\rm{2z}}$ symmetry. Our angle-resolved photoemission spectroscopy experiments indeed observed the Dirac states in the bulk and two-dimensional Weyl-like states at the surface. The present study substantially enriches our fundamental understanding of the intricate connections between symmetries and topologies of matter, especially with the spin degree of freedom playing a vital role.

cond-mat.mtrl-sci↗

arXiv2020

Artificial Intelligence for High-Throughput Discovery of Topological Insulators: the Example of Alloyed Tetradymites

Significant advances have been made in predicting new topological materials using high-throughput empirical descriptors or symmetry-based indicators. To date, these approaches have been applied to materials in existing databases, and are severely limited to systems with well-defined symmetries, leaving a much larger materials space unexplored. Using tetradymites as a prototypical class of examples, we uncover a novel two-dimensional descriptor by applying an artificial intelligence (AI) based approach for fast and reliable identification of the topological characters of a drastically expanded range of materials, without prior determination of their specific symmetries and detailed band structures. By leveraging this descriptor that contains only the atomic number and electronegativity of the constituent species, we have readily scanned a huge number of alloys in the tetradymite family. Strikingly, nearly half of which are identified to be topological insulators, revealing a much larger territory of the topological materials world. The present work also attests the increasingly important role of such AI-based approaches in modern materials discovery.

cond-mat.mtrl-sci↗

arXiv2020

Joint Extraction of Entities and Relations Based on a Novel Decomposition Strategy

Joint extraction of entities and relations aims to detect entity pairs along with their relations using a single model. Prior work typically solves this task in the extract-then-classify or unified labeling manner. However, these methods either suffer from the redundant entity pairs, or ignore the important inner structure in the process of extracting entities and relations. To address these limitations, in this paper, we first decompose the joint extraction task into two interrelated subtasks, namely HE extraction and TER extraction. The former subtask is to distinguish all head-entities that may be involved with target relations, and the latter is to identify corresponding tail-entities and relations for each extracted head-entity. Next, these two subtasks are further deconstructed into several sequence labeling problems based on our proposed span-based tagging scheme, which are conveniently solved by a hierarchical boundary tagger and a multi-span decoding algorithm. Owing to the reasonable decomposition strategy, our model can fully capture the semantic interdependency between different steps, as well as reduce noise from irrelevant entity pairs. Experimental results show that our method outperforms previous work by 5.2%, 5.9% and 21.5% (F1 score), achieving a new state-of-the-art on three public datasets

cs.CL↗

arXiv2019

Large-area, periodic, and tunable intrinsic pseudo-magnetic fields in low-angle twisted bilayer graphene

A properly strained graphene monolayer or bilayer is expected to harbour periodic pseudo-magnetic fields with high symmetry, yet to date, a convincing demonstration of such pseudo-magnetic fields has been lacking, especially for bilayer graphene. Here, we report the first definitive experimental proof for the existence of large-area, periodic pseudo-magnetic fields, as manifested by vortex lattices in commensurability with the moiré patterns of low-angle twisted bilayer graphene. The pseudo-magnetic fields are strong enough to confine the massive Dirac electrons into circularly localized pseudo-Landau levels, as observed by scanning tunneling microscopy/spectroscopy, and also corroborated by tight-binding calculations. We further demonstrate that the geometry, amplitude, and periodicity of the pseudo-magnetic field can be fine-tuned by both the rotation angle and heterostrain applied to the system. Collectively, the present study substantially enriches twisted bilayer graphene as a powerful enabling platform for exploration of new and exotic physical phenomena, including quantum valley Hall effects and quantum anomalous Hall effects.

cond-mat.str-el↗

arXiv2019

Proximal Policy Optimization with Mixed Distributed Training

Instability and slowness are two main problems in deep reinforcement learning. Even if proximal policy optimization (PPO) is the state of the art, it still suffers from these two problems. We introduce an improved algorithm based on proximal policy optimization, mixed distributed proximal policy optimization (MDPPO), and show that it can accelerate and stabilize the training process. In our algorithm, multiple different policies train simultaneously and each of them controls several identical agents that interact with environments. Actions are sampled by each policy separately as usual, but the trajectories for the training process are collected from all agents, instead of only one policy. We find that if we choose some auxiliary trajectories elaborately to train policies, the algorithm will be more stable and quicker to converge especially in the environments with sparse rewards.

cs.LG↗

arXiv2019

Formalism for Supporting the Development of Verifiably Safe Medical Guidelines with Statecharts

Improving the effectiveness and safety of patient care is the ultimate objective for medical cyber-physical systems. Many medical best practice guidelines exist, but most of the existing guidelines in handbooks are difficult for medical staff to remember and apply clinically. Furthermore, although the guidelines have gone through clinical validations, validations by medical professionals alone do not provide guarantees for the safety of medical cyber-physical systems. Hence, formal verification is also needed. The paper presents the formal semantics for a framework that we developed to support the development of verifiably safe medical guidelines. The framework allows computer scientists to work together with medical professionals to transform medical best practice guidelines into executable statechart models, Yakindu in particular, so that medical functionalities and properties can be quickly prototyped and validated. Existing formal verification technologies, UPPAAL timed automata in particular, is integrated into the framework to provide formal verification capabilities to verify safety properties. However, some components used/built into the framework, such as the open-source Yakindu statecharts as well as the transformation rules from statecharts to timed automata, do not have built-in semantics. The ambiguity becomes unavoidable unless formal semantics is defined for the framework, which is what the paper is to present.

cs.SE↗

arXiv2019

Topological Weyl-like Phonons and Nodal Line Phonons in Graphene

By means of first-principles calculations and modeling analysis, we have predicted that the traditional 2D-graphene hosts the topological phononic Weyl-like points (PWs) and phononic nodal line (PNL) in its phonon spectrum. The phonon dispersion of graphene hosts three type-I PWs (both PW1 and PW2 at the BZ corners \emph{K} and \emph{K}', and PW3 locating along the $Γ$-\emph{K} line), one type-II PW4 locating along the $Γ$-\emph{M} line, and one PNL surrounding the centered $Γ$ point in the $q_{x,y}$ plane. The calculations further reveal that Berry curvatures are vanishingly zero throughout the whole BZ, except for the positions of these four pairs of Weyl-like phonons, at which the non-zero singular Berry curvatures appear with the Berry phase of $π$ or -$π$, confirming its topological non-trivial nature. The topologically protected non-trivial phononic edge states have been also evidenced along both the zigzag-edged and armchair-edged boundaries. These results would pave the ways for further studies of topological phononic properties of graphene, such as phononic destructive interference with a suppression of backscattering and intrinsic phononic quantum Hall-like effects.

cond-mat.mes-hall↗

arXiv2019

Evidence for Weyl fermions in the elemental semiconductor tellurium

The recent discovery of Weyl fermions in solids enables exploitation of relativistic physics and development of a spectrum of intriguing physical phenomena. They are constituted of pairs of Weyl points with two-fold band degeneracy, which in principle can be hosted in any materials without inversion or time-reversal symmetry. However, previous studies of Weyl fermions have been limited exclusively to semimetals. Here, by combining magneto-transport measurements, angle-resolved photoemission spectroscopy, and band structure calculations, Weyl fermions are identified in an elemental semiconductor tellurium. This is mainly achieved by direct observation of the representative transport signatures of the chiral anomaly, including the negative longitudinal magnetoresistance and the planar Hall effect. Semiconductor materials are well suited for band engineering, and therefore provide an ideal platform for manipulating the fundamental Weyl fermionic behaviors. Furthermore, introduction of Weyl physics into semiconductors to develop "Weyl semiconductors" also creates a new degree of freedom for the future design of semiconductor electronic and optoelectronic devices.

cond-mat.mtrl-sci↗

arXiv2019

Pattern-Affinitive Propagation across Depth, Surface Normal and Semantic Segmentation

In this paper, we propose a novel Pattern-Affinitive Propagation (PAP) framework to jointly predict depth, surface normal and semantic segmentation. The motivation behind it comes from the statistic observation that pattern-affinitive pairs recur much frequently across different tasks as well as within a task. Thus, we can conduct two types of propagations, cross-task propagation and task-specific propagation, to adaptively diffuse those similar patterns. The former integrates cross-task affinity patterns to adapt to each task therein through the calculation on non-local relationships. Next the latter performs an iterative diffusion in the feature space so that the cross-task affinity patterns can be widely-spread within the task. Accordingly, the learning of each task can be regularized and boosted by the complementary task-level affinities. Extensive experiments demonstrate the effectiveness and the superiority of our method on the joint three tasks. Meanwhile, we achieve the state-of-the-art or competitive results on the three related datasets, NYUD-v2, SUN-RGBD and KITTI.

cs.CV↗

arXiv2019

Gradients do grow on trees: a linear-time ${\cal O}\hspace{-0.2em}\left( N \right)$-dimensional gradient for statistical phylogenetics

Calculation of the log-likelihood stands as the computational bottleneck for many statistical phylogenetic algorithms. Even worse is its gradient evaluation, often used to target regions of high probability. Order ${\cal O}\hspace{-0.2em}\left( N \right)$-dimensional gradient calculations based on the standard pruning algorithm require ${\cal O}\hspace{-0.2em}\left( N^2 \right)$ operations where N is the number of sampled molecular sequences. With the advent of high-throughput sequencing, recent phylogenetic studies have analyzed hundreds to thousands of sequences, with an apparent trend towards even larger data sets as a result of advancing technology. Such large-scale analyses challenge phylogenetic reconstruction by requiring inference on larger sets of process parameters to model the increasing data heterogeneity. To make this tractable, we present a linear-time algorithm for ${\cal O}\hspace{-0.2em}\left( N \right)$-dimensional gradient evaluation and apply it to general continuous-time Markov processes of sequence substitution on a phylogenetic tree without a need to assume either stationarity or reversibility. We apply this approach to learn the branch-specific evolutionary rates of three pathogenic viruses: West Nile virus, Dengue virus and Lassa virus. Our proposed algorithm significantly improves inference efficiency with a 126- to 234-fold increase in maximum-likelihood optimization and a 16- to 33-fold computational performance increase in a Bayesian framework.

stat.CO↗

arXiv2019

Non-parametric dark energy reconstruction using the tomographic Alcock-Paczynski test

The tomographic Alcock-Paczynski (AP) method can result in tight cosmological constraints by using small and intermediate clustering scales of the large scale structure (LSS) of the galaxy distribution. By focusing on the redshift dependence, the AP distortion can be distinguished from the distortions produced by the redshift space distortions (RSD). In this work, we combine the tomographic AP method with other recent observational datasets of SNIa+BAO+CMB+$H_0$ to reconstruct the dark energy equation-of-state $w$ in a non-parametric form. The result favors a dynamical DE at $z\lesssim1$, and shows a mild deviation ($\lesssim2σ$) from $w=-1$ at $z=0.5-0.7$. We find the addition of the AP method improves the low redshift ($z\lesssim0.7$) constraint by $\sim50\%$.

astro-ph.CO↗

arXiv2019

Online Adaptation through Meta-Learning for Stereo Depth Estimation

In this work, we tackle the problem of online adaptation for stereo depth estimation, that consists in continuously adapting a deep network to a target video recordedin an environment different from that of the source training set. To address this problem, we propose a novel Online Meta-Learning model with Adaption (OMLA). Our proposal is based on two main contributions. First, to reducethe domain-shift between source and target feature distributions we introduce an online feature alignment procedurederived from Batch Normalization. Second, we devise a meta-learning approach that exploits feature alignment forfaster convergence in an online learning setting. Additionally, we propose a meta-pre-training algorithm in order toobtain initial network weights on the source dataset whichfacilitate adaptation on future data streams. Experimentally, we show that both OMLA and meta-pre-training helpthe model to adapt faster to a new environment. Our proposal is evaluated on the wellestablished KITTI dataset,where we show that our online method is competitive withstate of the art algorithms trained in a batch setting.

cs.CV↗

arXiv2019

Joint Entity Linking with Deep Reinforcement Learning

Entity linking is the task of aligning mentions to corresponding entities in a given knowledge base. Previous studies have highlighted the necessity for entity linking systems to capture the global coherence. However, there are two common weaknesses in previous global models. First, most of them calculate the pairwise scores between all candidate entities and select the most relevant group of entities as the final result. In this process, the consistency among wrong entities as well as that among right ones are involved, which may introduce noise data and increase the model complexity. Second, the cues of previously disambiguated entities, which could contribute to the disambiguation of the subsequent mentions, are usually ignored by previous models. To address these problems, we convert the global linking into a sequence decision problem and propose a reinforcement learning model which makes decisions from a global perspective. Our model makes full use of the previous referred entities and explores the long-term influence of current selection on subsequent decisions. We conduct experiments on different types of datasets, the results show that our model outperforms state-of-the-art systems and has better generalization performance.

cs.CL↗