Searcharxiv⌕ Search

arXiv subjects

Tong Wang

Publications and source records attributed to Tong Wang.

At least 145 records · Page 8Linked to original sources

Diverse Distributions of Self-Supervised Tasks for Meta-Learning in NLP

Meta-learning considers the problem of learning an efficient learning process that can leverage its past experience to accurately solve new tasks. However, the efficacy of meta-learning crucially depends on the distribution of tasks available for training, and this is often assumed to be known a priori or constructed from limited supervised datasets. In this work, we aim to provide task distributions for meta-learning by considering self-supervised tasks automatically proposed from unlabeled text, to enable large-scale meta-learning in NLP. We design multiple distributions of self-supervised tasks by considering important aspects of task diversity, difficulty, type, domain, and curriculum, and investigate how they affect meta-learning performance. Our analysis shows that all these factors meaningfully alter the task distribution, some inducing significant improvements in downstream few-shot accuracy of the meta-learned models. Empirically, results on 20 downstream tasks show significant improvements in few-shot learning -- adding up to +4.2% absolute accuracy (on average) to the previous unsupervised meta-learning method, and perform comparably to supervised methods on the FewRel 2.0 benchmark.

cs.CL↗

Improved Drug-target Interaction Prediction with Intermolecular Graph Transformer

The identification of active binding drugs for target proteins (termed as drug-target interaction prediction) is the key challenge in virtual screening, which plays an essential role in drug discovery. Although recent deep learning-based approaches achieved better performance than molecular docking, existing models often neglect certain aspects of the intermolecular information, hindering the performance of prediction. We recognize this problem and propose a novel approach named Intermolecular Graph Transformer (IGT) that employs a dedicated attention mechanism to model intermolecular information with a three-way Transformer-based architecture. IGT outperforms state-of-the-art approaches by 9.1% and 20.5% over the second best for binding activity and binding pose prediction respectively, and shows superior generalization ability to unseen receptor proteins. Furthermore, IGT exhibits promising drug screening ability against SARS-CoV-2 by identifying 83.1% active drugs that have been validated by wet-lab experiments with near-native predicted binding poses.

cs.LG↗

Incentivizing Mobile Edge Caching and Sharing: An Evolutionary Game Approach

Mobile Edge Caching is a promising technique to enhance the content delivery quality and reduce the backhaul link congestion, by storing popular content at the network edge or mobile devices (e.g. base stations and smartphones) that are proximate to content requesters. In this work, we study a novel mobile edge caching framework, which enables mobile devices to cache and share popular contents with each other via device-to-device (D2D) links. We are interested in the following incentive problem of mobile device users: whether and which users are willing to cache and share what contents, taking the user mobility and cost/reward into consideration. The problem is challenging in a large-scale network with a large number of users. We introduce the evolutionary game theory, an effective tool for analyzing large-scale dynamic systems, to analyze the mobile users' content caching and sharing strategies. Specifically, we first derive the users' best caching and sharing strategies, and then analyze how these best strategies change dynamically over time, based on which we further characterize the system equilibrium systematically. Simulation results show that the proposed caching scheme outperforms the existing schemes in terms of the total transmission cost and the cellular load. In particular, in our simulation, the total transmission cost can be reduced by 42.5%-55.2% and the cellular load can be reduced by 21.5%-56.4%.

cs.GT↗

Multicriticality of Two-dimensional Class D Disordered Topological Superconductors

A generic two-dimensional disordered topological superconductor in symmetry class D exhibits rich phenomenology and multiple phases: diffusive thermal metal (DTM), Anderson insulator (AI), and thermal quantum Hall (TQH) phase (a topological superconductor). We numerically investigate the phase diagram of a lattice model of such class D superconductor, specifically focusing on transitions between the phases and the associated universal critical behaviors. We confirm the existence of a tricritical point and its repulsive nature at the point on the phase diagram where the three phases meet. We characterize the critical behaviors at various critical points and the tricritical point using numerical evaluation of the localization length, the conductance (or conductivity), and the density of states. We conclude that the two metal-insulator transitions (DTM-TQH and DTM-AI) belong to the same universality class, whereas the tricritical point (TCP) represents a distinct universality class.

cond-mat.dis-nn↗

Renormalization group analysis of Dirac fermions with random mass

Two-dimensional (2D) disordered superconductor (SC) in class D exhibits a disorder-induced quantum multicritical phenomenon among diffusive thermal metal (DTM), topological superconductor (TS), and conventional localized (AI) phases. To characterize the quantum tricritical point where these three phases meet, we carry out a two-loop renormalization group (RG) analysis for 2D Dirac fermion with random mass in terms of the $ε$-expansion in the spatial dimension $d=2-ε$. In 2D ($ε=0$), the random mass is marginally irrelevant around a clean-limit fixed point of the gapless Dirac fermion, while there exists an IR unstable fixed point at finite disorder strength that corresponds to the tricritical point. The critical exponent, dynamical exponent, and scaling dimension of the (uniform) mass term are evaluated around the tricritical point by the two-loop RG analysis. Using a mapping between an effective theory for the 2D random-mass Dirac fermion and the (1+1)-dimensional Gross-Neveu model, we further deduce the four-loop evaluation of the critical exponent, and the scaling dimension of the uniform mass around the tricritical point. Both the two-loop and four-loop results suggest that criticalities of a AI-DTM transition line as well as TS-DTM transition line are controlled by other saddle-point fixed point(s) at finite uniform mass.

cond-mat.dis-nn↗

Bringing Structure into Summaries: a Faceted Summarization Dataset for Long Scientific Documents

Faceted summarization provides briefings of a document from different perspectives. Readers can quickly comprehend the main points of a long document with the help of a structured outline. However, little research has been conducted on this subject, partially due to the lack of large-scale faceted summarization datasets. In this study, we present FacetSum, a faceted summarization benchmark built on Emerald journal articles, covering a diverse range of domains. Different from traditional document-summary pairs, FacetSum provides multiple summaries, each targeted at specific sections of a long document, including the purpose, method, findings, and value. Analyses and empirical results on our dataset reveal the importance of bringing structure into summaries. We believe FacetSum will spur further advances in summarization research and foster the development of NLP systems that can leverage the structured information in both long texts and summaries.

cs.CL↗

A Holistic Approach to Interpretability in Financial Lending: Models, Visualizations, and Summary-Explanations

Lending decisions are usually made with proprietary models that provide minimally acceptable explanations to users. In a future world without such secrecy, what decision support tools would one want to use for justified lending decisions? This question is timely, since the economy has dramatically shifted due to a pandemic, and a massive number of new loans will be necessary in the short term. We propose a framework for such decisions, including a globally interpretable machine learning model, an interactive visualization of it, and several types of summaries and explanations for any given decision. The machine learning model is a two-layer additive risk model, which resembles a two-layer neural network, but is decomposable into subscales. In this model, each node in the first (hidden) layer represents a meaningful subscale model, and all of the nonlinearities are transparent. Our online visualization tool allows exploration of this model, showing precisely how it came to its conclusion. We provide three types of explanations that are simpler than, but consistent with, the global model: case-based reasoning explanations that use neighboring past cases, a set of features that were the most important for the model's prediction, and summary-explanations that provide a customized sparse explanation for any particular lending decision made by the model. Our framework earned the FICO recognition award for the Explainable Machine Learning Challenge, which was the first public challenge in the domain of explainable machine learning.

cs.LG↗

Causal Rule Sets for Identifying Subgroups with Enhanced Treatment Effect

A key question in causal inference analyses is how to find subgroups with elevated treatment effects. This paper takes a machine learning approach and introduces a generative model, Causal Rule Sets (CRS), for interpretable subgroup discovery. A CRS model uses a small set of short decision rules to capture a subgroup where the average treatment effect is elevated. We present a Bayesian framework for learning a causal rule set. The Bayesian model consists of a prior that favors simple models for better interpretability as well as avoiding overfitting, and a Bayesian logistic regression that captures the likelihood of data, characterizing the relation between outcomes, attributes, and subgroup membership. The Bayesian model has tunable parameters that can characterize subgroups with various sizes, providing users with more flexible choices of models from the \emph{treatment efficient frontier}. We find maximum a posteriori models using iterative discrete Monte Carlo steps in the joint solution space of rules sets and parameters. To improve search efficiency, we provide theoretically grounded heuristics and bounding strategies to prune and confine the search space. Experiments show that the search algorithm can efficiently recover true underlying subgroups. We apply CRS on public and real-world datasets from domains where interpretability is indispensable. We compare CRS with state-of-the-art rule-based subgroup discovery models. Results show that CRS achieved consistently competitive performance on datasets from various domains, represented by high treatment efficient frontiers.

cs.AI↗

Partially Interpretable Estimators (PIE): Black-Box-Refined Interpretable Machine Learning

We propose Partially Interpretable Estimators (PIE) which attribute a prediction to individual features via an interpretable model, while a (possibly) small part of the PIE prediction is attributed to the interaction of features via a black-box model, with the goal to boost the predictive performance while maintaining interpretability. As such, the interpretable model captures the main contributions of features, and the black-box model attempts to complement the interpretable piece by capturing the "nuances" of feature interactions as a refinement. We design an iterative training algorithm to jointly train the two types of models. Experimental results show that PIE is highly competitive to black-box models while outperforming interpretable baselines. In addition, the understandability of PIE is comparable to simple linear models as validated via a human evaluation.

cs.LG↗

Universality classes of the Anderson transition in three-dimensional symmetry classes AIII, BDI, C, D and CI

We clarify universal critical properties of delocalization-localization transitions in three-dimensional (3D) unitary and orthogonal classes with particle-hole and/or chiral symmetries (classes AIII, BDI, D, C and CI). We first introduce tight-binding models on cubic lattice that belong to these five nonstandard symmetry classes respectively. Unlike the Bogoliubov-de Gennes Hamiltonian for superconductors, all the five models have finite areas of Fermi surfaces in the momentum space in the clean limit. Thereby, the scaling theory of the Anderson transition guarantees the presence of the delocalization-localization transitions at finite disorder strength in these models. Based on this expectation, we carry out extensive transfer matrix calculations of the Lyapunov exponents for zero-energy eigenstates of the disordered tight-binding models with quasi-one-dimensional geometry. Near the Anderson transition point, the correlation length diverges with a universal critical exponent $ν$. Using finite-size scaling analysis of the localization length, we determine the critical exponent of the transitions and scaling function of the (normalized) localization length in the three non-standard unitary symmetry classes: $ν_{\text{AIII}}=1.06\pm0.02$, $ν_{\text{D}}=0.87\pm0.03$, and $ν_{\text{C}}=0.996\pm0.012$. Our result of the class C is consistent with a previous study of classical network model [M. Ortuño et al, Phys. Rev. Lett. 102, 070603 (2009)]. The critical exponents of the two non-standard orthogonal classes are estimated as $ν_{\text{CI}}=1.17 \pm 0.02$ and $ν_{\text{BDI}}=1.12 \pm 0.06$. Our result of the class CI is consistent with another previous study of a lattice model, while the exponent of the class BDI is at variance with the previous evaluation of nodal Dirac ring model [X. L. Luo et al, Phys. Rev. B. 101, 020202(R) (2020)].

cond-mat.dis-nn↗

An Empirical Study on Neural Keyphrase Generation

Recent years have seen a flourishing of neural keyphrase generation (KPG) works, including the release of several large-scale datasets and a host of new models to tackle them. Model performance on KPG tasks has increased significantly with evolving deep learning research. However, there lacks a comprehensive comparison among different model designs, and a thorough investigation on related factors that may affect a KPG system's generalization performance. In this empirical study, we aim to fill this gap by providing extensive experimental results and analyzing the most crucial factors impacting the generalizability of KPG models. We hope this study can help clarify some of the uncertainties surrounding the KPG task and facilitate future research on this topic.

cs.CL↗

Personalized Entity Resolution with Dynamic Heterogeneous Knowledge Graph Representations

The growing popularity of Virtual Assistants poses new challenges for Entity Resolution, the task of linking mentions in text to their referent entities in a knowledge base. Specifically, in the shopping domain, customers tend to use implicit utterances (e.g., "organic milk") rather than explicit names, leading to a large number of candidate products. Meanwhile, for the same query, different customers may expect different results. For example, with "add milk to my cart", a customer may refer to a certain organic product, while some customers may want to re-order products they regularly purchase. To address these issues, we propose a new framework that leverages personalized features to improve the accuracy of product ranking. We first build a cross-source heterogeneous knowledge graph from customer purchase history and product knowledge graph to jointly learn customer and product embeddings. After that, we incorporate product, customer, and history representations into a neural reranking model to predict which candidate is most likely to be purchased for a specific customer. Experiments show that our model substantially improves the accuracy of the top ranked candidates by 24.6% compared to the state-of-the-art product search model.

cs.CL↗

Adaptive Class Suppression Loss for Long-Tail Object Detection

To address the problem of long-tail distribution for the large vocabulary object detection task, existing methods usually divide the whole categories into several groups and treat each group with different strategies. These methods bring the following two problems. One is the training inconsistency between adjacent categories of similar sizes, and the other is that the learned model is lack of discrimination for tail categories which are semantically similar to some of the head categories. In this paper, we devise a novel Adaptive Class Suppression Loss (ACSL) to effectively tackle the above problems and improve the detection performance of tail categories. Specifically, we introduce a statistic-free perspective to analyze the long-tail distribution, breaking the limitation of manual grouping. According to this perspective, our ACSL adjusts the suppression gradients for each sample of each class adaptively, ensuring the training consistency and boosting the discrimination for rare categories. Extensive experiments on long-tail datasets LVIS and Open Images show that the our ACSL achieves 5.18% and 5.2% improvements with ResNet50-FPN, and sets a new state of the art. Code and models are available at https://github.com/CASIA-IVA-Lab/ACSL.

cs.CV↗

Stochastic social behavior coupled to COVID-19 dynamics leads to waves, plateaus and an endemic state

It is well recognized that population heterogeneity plays an important role in the spread of epidemics. While individual variations in social activity are often assumed to be persistent, i.e. constant in time, here we discuss the consequences of dynamic heterogeneity. By integrating the stochastic dynamics of social activity into traditional epidemiological models we demonstrate the emergence of a new long timescale governing the epidemic in broad agreement with empirical data. Our model captures multiple features of real-life epidemics such as COVID-19, including prolonged plateaus and multiple waves, which are transiently suppressed due to the dynamic nature of social activity. The existence of the long timescale due to the interplay between epidemic and social dynamics provides a unifying picture of how a fast-paced epidemic typically will transition to the endemic state.

q-bio.PE↗

Quantum Transport in Two-Dimensional WS$_2$ with High-Efficiency Carrier Injection Through Indium Alloy Contacts

Two-dimensional transition metal dichalcogenides (TMDCs) have properties attractive for optoelectronic and quantum applications. A crucial element for devices is the metal-semiconductor interface. However, high contact resistances have hindered progress. Quantum transport studies are scant as low-quality contacts are intractable at cryogenic temperatures. Here, temperature-dependent transfer length measurements are performed on chemical vapour deposition grown single-layer and bilayer WS$_2$ devices with indium alloy contacts. The devices exhibit low contact resistances and Schottky barrier heights (\sim10 k$Ω$\si{\micro\metre} at 3 K and 1.7 meV). Efficient carrier injection enables high carrier mobilities ($\sim$190 cm$^2$V$^{-1}$s$^{-1}$) and observation of resonant tunnelling. Density functional theory calculations provide insights into quantum transport and properties of the WS$_2$-indium interface. Our results reveal significant advances towards high-performance WS$_2$ devices using indium alloy contacts.

cond-mat.mtrl-sci↗

Exploring the Regulatory Function of the N-terminal Domain of SARS-CoV-2 Spike Protein Through Molecular Dynamics Simulation

SARS-CoV-2 is what has caused the COVID-19 pandemic. Early viral infection is mediated by the SARS-CoV-2 homo-trimeric Spike (S) protein with its receptor binding domains (RBDs) in the receptor-accessible state. We performed molecular dynamics simulation on the S protein with a focus on the function of its N-terminal domains (NTDs). Our study reveals that the NTD acts as a "wedge" and plays a crucial regulatory role in the conformational changes of the S protein. The complete RBD structural transition is allowed only when the neighboring NTD that typically prohibits the RBD's movements as a wedge detaches and swings away. Based on this NTD "wedge" model, we propose that the NTD-RBD interface should be a potential drug target.

q-bio.BM↗

A Novel Method to Design Controller Parameters by Using Uniform Design Algorithm

Parameter selection is one of the most important parts for nearly all the control strategies. Traditionally, controller parameters are chosen by utilizing trial and error, which is always tedious and time consuming. Moreover, such method is highly dependent on the experience of researchers, which means that it is hard to be popularized. In this light, this paper proposes a novel parameter searching approach by utilizing uniform design (UD) algorithm. By which the satisfactory controller parameters under a performance index could be selected. In this end, two simulation examples are conducted to verify the effectiveness of proposed scheme. Simulation results show that this novel approach, as compared to other intelligent tuning algorithms, excels in efficiency and time saving.

eess.SY↗

Augmented Fairness: An Interpretable Model Augmenting Decision-Makers' Fairness

We propose a model-agnostic approach for mitigating the prediction bias of a black-box decision-maker, and in particular, a human decision-maker. Our method detects in the feature space where the black-box decision-maker is biased and replaces it with a few short decision rules, acting as a "fair surrogate". The rule-based surrogate model is trained under two objectives, predictive performance and fairness. Our model focuses on a setting that is common in practice but distinct from other literature on fairness. We only have black-box access to the model, and only a limited set of true labels can be queried under a budget constraint. We formulate a multi-objective optimization for building a surrogate model, where we simultaneously optimize for both predictive performance and bias. To train the model, we propose a novel training algorithm that combines a nondominated sorting genetic algorithm with active learning. We test our model on public datasets where we simulate various biased "black-box" classifiers (decision-makers) and apply our approach for interpretable augmented fairness.

cs.LG↗