Searcharxiv⌕ Search

arXiv subjects

Yan Xiao

Publications and source records attributed to Yan Xiao.

51 records · Page 3Linked to original sources

Generalizing Neural Networks by Reflecting Deviating Data in Production

Trained with a sufficiently large training and testing dataset, Deep Neural Networks (DNNs) are expected to generalize. However, inputs may deviate from the training dataset distribution in real deployments. This is a fundamental issue with using a finite dataset. Even worse, real inputs may change over time from the expected distribution. Taken together, these issues may lead deployed DNNs to mis-predict in production. In this work, we present a runtime approach that mitigates DNN mis-predictions caused by the unexpected runtime inputs to the DNN. In contrast to previous work that considers the structure and parameters of the DNN itself, our approach treats the DNN as a blackbox and focuses on the inputs to the DNN. Our approach has two steps. First, it recognizes and distinguishes "unseen" semantically-preserving inputs. For this we use a distribution analyzer based on the distance metric learned by a Siamese network. Second, our approach transforms those unexpected inputs into inputs from the training set that are identified as having similar semantics. We call this process input reflection and formulate it as a search problem over the embedding space on the training set. This embedding space is learned by a Quadruplet network as an auxiliary model for the subject model to improve the generalization. We implemented a tool called InputReflector based on the above two-step approach and evaluated it with experiments on three DNN models trained on CIFAR-10, MNIST, and FMINST image datasets. The results show that InputReflector can effectively distinguish inputs that retain semantics of the distribution (e.g., blurred, brightened, contrasted, and zoomed images) and out-of-distribution inputs from normal inputs.

cs.LG↗

Dessins d'Enfants, Seiberg-Witten Curves and Conformal Blocks

We show how to map Grothendieck's dessins d'enfants to algebraic curves as Seiberg-Witten curves, then use the mirror map and the AGT map to obtain the corresponding 4d $\mathcal{N}=2$ supersymmetric instanton partition functions and 2d Virasoro conformal blocks. We explicitly demonstrate the 6 trivalent dessins with 4 punctures on the sphere. We find that the parametrizations obtained from a dessin should be related by certain duality for gauge theories. Then we will discuss that some dessins could correspond to conformal blocks satisfying certain rules in different minimal models.

hep-th↗

Self-Checking Deep Neural Networks in Deployment

The widespread adoption of Deep Neural Networks (DNNs) in important domains raises questions about the trustworthiness of DNN outputs. Even a highly accurate DNN will make mistakes some of the time, and in settings like self-driving vehicles these mistakes must be quickly detected and properly dealt with in deployment. Just as our community has developed effective techniques and mechanisms to monitor and check programmed components, we believe it is now necessary to do the same for DNNs. In this paper we present DNN self-checking as a process by which internal DNN layer features are used to check DNN predictions. We detail SelfChecker, a self-checking system that monitors DNN outputs and triggers an alarm if the internal layer features of the model are inconsistent with the final prediction. SelfChecker also provides advice in the form of an alternative prediction. We evaluated SelfChecker on four popular image datasets and three DNN models and found that SelfChecker triggers correct alarms on 60.56% of wrong DNN predictions, and false alarms on 2.04% of correct DNN predictions. This is a substantial improvement over prior work (SELFORACLE, DISSECTOR, and ConfidNet). In experiments with self-driving car scenarios, SelfChecker triggers more correct alarms than SELFORACLE for two DNN models (DAVE-2 and Chauffeur) with comparable false alarms. Our implementation is available as open source.

cs.SE↗

Adaptive Prototypical Networks with Label Words and Joint Representation Learning for Few-Shot Relation Classification

Relation classification (RC) task is one of fundamental tasks of information extraction, aiming to detect the relation information between entity pairs in unstructured natural language text and generate structured data in the form of entity-relation triple. Although distant supervision methods can effectively alleviate the problem of lack of training data in supervised learning, they also introduce noise into the data, and still cannot fundamentally solve the long-tail distribution problem of the training instances. In order to enable the neural network to learn new knowledge through few instances like humans, this work focuses on few-shot relation classification (FSRC), where a classifier should generalize to new classes that have not been seen in the training set, given only a number of samples for each class. To make full use of the existing information and get a better feature representation for each instance, we propose to encode each class prototype in an adaptive way from two aspects. First, based on the prototypical networks, we propose an adaptive mixture mechanism to add label words to the representation of the class prototype, which, to the best of our knowledge, is the first attempt to integrate the label information into features of the support samples of each class so as to get more interactive class prototypes. Second, to more reasonably measure the distances between samples of each category, we introduce a loss function for joint representation learning to encode each support instance in an adaptive manner. Extensive experiments have been conducted on FewRel under different few-shot (FS) settings, and the results show that the proposed adaptive prototypical networks with label words and joint representation learning has not only achieved significant improvements in accuracy, but also increased the generalization ability of few-shot RC models.

cs.CL↗

Chiral Rings, Futaki Invariants, Plethystics, and Groebner Bases

We study chiral rings of 4d $\mathcal{N}=1$ supersymmetric gauge theories via the notion of K-stability. We show that when using Hilbert series to perform the computations of Futaki invariants, it is not enough to only include the test symmetry information in the former's denominator. We discuss a way to modify the numerator so that K-stability can be correctly determined, and a rescaling method is also applied to simplify the calculations involving test configurations. All of these are illustrated with a host of examples, by considering vacuum moduli spaces of various theories. Using Gröbner basis and plethystic techniques, many non-complete intersections can also be addressed, thus expanding the list of known theories in the literature.

hep-th↗

Quiver Mutations, Seiberg Duality and Machine Learning

We initiate the study of applications of machine learning to Seiberg duality, focusing on the case of quiver gauge theories, a problem also of interest in mathematics in the context of cluster algebras. Within the general theme of Seiberg duality, we define and explore a variety of interesting questions, broadly divided into the binary determination of whether a pair of theories picked from a series of duality classes are dual to each other, as well as the multi-class determination of the duality class to which a given theory belongs. We study how the performance of machine learning depends on several variables, including number of classes and mutation type (finite or infinite). In addition, we evaluate the relative advantages of Naive Bayes classifiers versus Convolutional Neural Networks. Finally, we also investigate how the results are affected by the inclusion of additional data, such as ranks of gauge/flavor groups and certain variables motivated by the existence of underlying Diophantine equations. In all questions considered, high accuracy and confidence can be achieved.

hep-th↗

Hybrid Attention-Based Transformer Block Model for Distant Supervision Relation Extraction

With an exponential explosive growth of various digital text information, it is challenging to efficiently obtain specific knowledge from massive unstructured text information. As one basic task for natural language processing (NLP), relation extraction aims to extract the semantic relation between entity pairs based on the given text. To avoid manual labeling of datasets, distant supervision relation extraction (DSRE) has been widely used, aiming to utilize knowledge base to automatically annotate datasets. Unfortunately, this method heavily suffers from wrong labelling due to the underlying strong assumptions. To address this issue, we propose a new framework using hybrid attention-based Transformer block with multi-instance learning to perform the DSRE task. More specifically, the Transformer block is firstly used as the sentence encoder to capture syntactic information of sentences, which mainly utilizes multi-head self-attention to extract features from word level. Then, a more concise sentence-level attention mechanism is adopted to constitute the bag representation, aiming to incorporate valid information of each sentence to effectively represent the bag. Experimental results on the public dataset New York Times (NYT) demonstrate that the proposed approach can outperform the state-of-the-art algorithms on the evaluation dataset, which verifies the effectiveness of our model for the DSRE task.

cs.CL↗

Node-Constrained Traffic Engineering: Theory and Applications

Traffic engineering (TE) is a fundamental task in networking. Conventionally, traffic can take any path connecting the source and destination. Emerging technologies such as segment routing, however, use logical paths going through a predetermined set of middlepoints. Inspired by this, in this work we introduce the problem of node-constrained TE, where traffic must go through a set of middlepoints, and study its theoretical fundamentals. We show that the general node-constrained TE that constrains the traffic to take paths going through one or more middlepoints is NP-hard for directed graphs but strongly polynomial for undirected graphs, unveiling a profound dichotomy between the two cases. We additionally investigate the popular variant of node-constrained TE that uses shortest paths between middlepoints, and show that the problem can now be solved in weakly polynomial time for a fixed number of middlepoints. Yet if we constrain the end-to-end paths to be acyclic, the problem can become NP-hard. This explains why existing work focuses on the computationally tractable variant. An important application of our work concerns the computational complexity of flow centrality, first proposed in 1991 by Freeman et al. [21]: we show that it is NP-hard for directed but strongly polynomial for undirected graphs. Finally, we investigate the middlepoint selection problem in general node-constrained TE. We introduce group flow centrality as a solution concept for multi-commodity networks, study its complexity, and show that it is monotone but not submodular for both directed and undirected graphs. Our work provides a thorough theoretical treatment of node-constrained TE and its applications.

cs.NI↗

Flatness of Minima in Random Inflationary Landscapes

We study the likelihood which relative minima of random polynomial potentials support the slow-roll conditions for inflation. Consistent with renormalizability and boundedness, the coefficients that appear in the potential are chosen to be order one with respect to the energy scale at which inflation transpires. Investigation of the single field case illustrates a window in which the potentials satisfy the slow-roll conditions. When there are two scalar fields, we find that the probability depends on the choice of distribution for the coefficients. A uniform distribution yields a $0.05\%$ probability of finding a suitable minimum in the random potential whereas a maximum entropy distribution yields a $0.1\%$ probability.

hep-th↗

Towards Complex Text-to-SQL in Cross-Domain Database with Intermediate Representation

We present a neural approach called IRNet for complex and cross-domain Text-to-SQL. IRNet aims to address two challenges: 1) the mismatch between intents expressed in natural language (NL) and the implementation details in SQL; 2) the challenge in predicting columns caused by the large number of out-of-domain words. Instead of end-to-end synthesizing a SQL query, IRNet decomposes the synthesis process into three phases. In the first phase, IRNet performs a schema linking over a question and a database schema. Then, IRNet adopts a grammar-based neural model to synthesize a SemQL query which is an intermediate representation that we design to bridge NL and SQL. Finally, IRNet deterministically infers a SQL query from the synthesized SemQL query with domain knowledge. On the challenging Text-to-SQL benchmark Spider, IRNet achieves 46.7% accuracy, obtaining 19.5% absolute improvement over previous state-of-the-art approaches. At the time of writing, IRNet achieves the first position on the Spider leaderboard.

cs.CL↗

Centrality-based Middlepoint Selection for Traffic Engineering with Segment Routing

Segment routing is an emerging technology to simplify traffic engineering implementation in WANs. It expresses an end-to-end logical path as a sequence of segments through a set of middlepoints. Traffic along each segment is routed along shortest paths. In this paper, we study practical traffic engineering (TE) with segment routing in SDN based WANs. We consider two common types of TE, and show that the TE problem can be solved in weakly polynomial time when the number of middlepoints is fixed and not part of the input. However, the corresponding linear program is of large scale and computationally expensive. For this reason, existing methods that work by taking each node as a candidate middlepoint are inefficient. Motivated by this, we propose to select just a few important nodes as middlepoints for all traffic. We use node centrality concepts from graph theory, notably group shortest path centrality, for middlepoint selection. Our performance evaluation using realistic topologies and traffic traces shows that a small percentage of the most central nodes can achieve good results with orders of magnitude lower runtime.

cs.NI↗

Standard Model Plethystics

We study the vacuum geometry prescribed by the gauge invariant operators of the MSSM via the Plethystic Programme. This is achieved by using several tricks to perform the highly computationally challenging Molien-Weyl integral, from which we extract the Hilbert series, encoding the invariants of the geometry at all degrees. The fully refined Hilbert series is presented as the explicit sum of 1422 rational functions. We found a good choice of weights to unrefine the Hilbert series into a rational function of a single variable, from which we can read off the dimension and the degree of the vacuum moduli space of the MSSM gauge invariants. All data in Mathematica format are also presented.

hep-th↗

Beyond Precision: A Study on Recall of Initial Retrieval with Neural Representations

Vocabulary mismatch is a central problem in information retrieval (IR), i.e., the relevant documents may not contain the same (symbolic) terms of the query. Recently, neural representations have shown great success in capturing semantic relatedness, leading to new possibilities to alleviate the vocabulary mismatch problem in IR. However, most existing efforts in this direction have been devoted to the re-ranking stage. That is to leverage neural representations to help re-rank a set of candidate documents, which are typically obtained from an initial retrieval stage based on some symbolic index and search scheme (e.g., BM25 over the inverted index). This naturally raises a question: if the relevant documents have not been found in the initial retrieval stage due to vocabulary mismatch, there would be no chance to re-rank them to the top positions later. Therefore, in this paper, we study the problem how to employ neural representations to improve the recall of relevant documents in the initial retrieval stage. Specifically, to meet the efficiency requirement of the initial stage, we introduce a neural index for the neural representations of documents, and propose two hybrid search schemes based on both neural and symbolic indices, namely the parallel search scheme and the sequential search scheme. Our experiments show that both hybrid index and search schemes can improve the recall of the initial retrieval stage with small overhead.

cs.IR↗

A Comprehensive Survey of Brane Tilings

An infinite class of $4d$ $\mathcal{N}=1$ gauge theories can be engineered on the worldvolume of D3-branes probing toric Calabi-Yau 3-folds. This kind of setup has multiple applications, ranging from the gauge/gravity correspondence to local model building in string phenomenology. Brane tilings fully encode the gauge theories on the D3-branes and have substantially simplified their connection to the probed geometries. The purpose of this paper is to push the boundaries of computation and to produce as comprehensive a database of brane tilings as possible. We develop efficient implementations of brane tiling tools particularly suited for this search. We present the first complete classification of toric Calabi-Yau 3-folds with toric diagrams up to area 8 and the corresponding brane tilings. This classification is of interest to both physicists and mathematicians alike.

hep-th↗

Seiberg Duality, Quiver Gauge Theories, and Ihara Zeta Function

We study Ihara zeta function for graphs in the context of quivers arising from gauge theories, especially under Seiberg duality transformations. The distribution of poles is studied as we proceed along the duality tree, in light of the weak and strong graph versions of the Riemann Hypothesis. As a by-product, we find a refined version of Ihara zeta function to be the generating function for the generic superpotential of the gauge theory.

hep-th↗