arXiv subjects

Chen Zhang

Publications and source records attributed to Chen Zhang.

At least 541 records · Page 30Linked to original sources

arXiv2021

More on the cubic versus quartic interaction equivalence in the $O(N)$ model

We compute the scaling dimensions of a family of fixed-charge operators at the infrared fixed point of the $O(N)$ model featuring cubic interactions in $d=6-ε$ for arbitrary $N$ to leading and subleading order in the charge but to all orders in the couplings. The results are used to analyze the conjectured equivalence with the $O(N)$ model displaying quartic interactions at its ultraviolet fixed point. This is performed by comparing the cubic model scaling dimensions against the known large $N$ results for the quartic model and demonstrating that they match. Our results reinforce the conjectured equivalence and further provide novel information on the finite $N$ physics stemming from the computations in the cubic model just below 6 dimensions.

hep-th↗

arXiv2021

CompConv: A Compact Convolution Module for Efficient Feature Learning

Convolutional Neural Networks (CNNs) have achieved remarkable success in various computer vision tasks but rely on tremendous computational cost. To solve this problem, existing approaches either compress well-trained large-scale models or learn lightweight models with carefully designed network structures. In this work, we make a close study of the convolution operator, which is the basic unit used in CNNs, to reduce its computing load. In particular, we propose a compact convolution module, called CompConv, to facilitate efficient feature learning. With the divide-and-conquer strategy, CompConv is able to save a great many computations as well as parameters to produce a certain dimensional feature map. Furthermore, CompConv discreetly integrates the input features into the outputs to efficiently inherit the input information. More importantly, the novel CompConv is a plug-and-play module that can be directly applied to modern CNN structures to replace the vanilla convolution layers without further effort. Extensive experimental results suggest that CompConv can adequately compress the benchmark CNN structures yet barely sacrifice the performance, surpassing other competitors.

cs.CV↗

arXiv2021

Diamond magnetometry and gradiometry towards subpicotesla DC field measurement

Nitrogen vacancy (NV) centers in diamond have developed into a powerful solid-state platform for compact quantum sensors. However, high sensitivity measurements usually come with additional constraints on the pumping intensity of the laser and the pulse control applied. Here, we demonstrate high sensitivity NV ensemble based magnetic field measurements with low-intensity optical excitation. DC magnetometry methods like, e.g., continuous-wave optically detected magnetic resonance and continuously excited Ramsey measurements combined with lock-in detection, are compared to get an optimization. Gradiometry is also investigated as a step towards unshielded measurements of unknown gradients. The magnetometer demonstrates a minimum detectable field of 0.3-0.7 pT in a 73 s measurement by further applying a flux guide with a sensing dimension of 2 mm, corresponding to a magnetic field sensitivity of 2.6-6 pT/Hz^0.5. Combined with our previous efforts on the diamond AC magnetometry, the diamond magnetometer is promising to perform wide bandwidth magnetometry with picotesla sensitivity and a cubic-millimeter sensing volume under ambient conditions.

quant-ph↗

arXiv2021

DynaEval: Unifying Turn and Dialogue Level Evaluation

A dialogue is essentially a multi-turn interaction among interlocutors. Effective evaluation metrics should reflect the dynamics of such interaction. Existing automatic metrics are focused very much on the turn-level quality, while ignoring such dynamics. To this end, we propose DynaEval, a unified automatic evaluation framework which is not only capable of performing turn-level evaluation, but also holistically considers the quality of the entire dialogue. In DynaEval, the graph convolutional network (GCN) is adopted to model a dialogue in totality, where the graph nodes denote each individual utterance and the edges represent the dependency between pairs of utterances. A contrastive loss is then applied to distinguish well-formed dialogues from carefully constructed negative samples. Experiments show that DynaEval significantly outperforms the state-of-the-art dialogue coherence model, and correlates strongly with human judgements across multiple dialogue evaluation aspects at both turn and dialogue level.

cs.CL↗

arXiv2021

Why Machine Reading Comprehension Models Learn Shortcuts?

Recent studies report that many machine reading comprehension (MRC) models can perform closely to or even better than humans on benchmark datasets. However, existing works indicate that many MRC models may learn shortcuts to outwit these benchmarks, but the performance is unsatisfactory in real-world applications. In this work, we attempt to explore, instead of the expected comprehension skills, why these models learn the shortcuts. Based on the observation that a large portion of questions in current datasets have shortcut solutions, we argue that larger proportion of shortcut questions in training data make models rely on shortcut tricks excessively. To investigate this hypothesis, we carefully design two synthetic datasets with annotations that indicate whether a question can be answered using shortcut solutions. We further propose two new methods to quantitatively analyze the learning difficulty regarding shortcut and challenging questions, and revealing the inherent learning mechanism behind the different performance between the two kinds of questions. A thorough empirical analysis shows that MRC models tend to learn shortcut questions earlier than challenging questions, and the high proportions of shortcut questions in training sets hinder models from exploring the sophisticated reasoning skills in the later stage of training.

cs.CL↗

arXiv2021

Parkinsonian Chinese Speech Analysis towards Automatic Classification of Parkinson's Disease

Speech disorders often occur at the early stage of Parkinson's disease (PD). The speech impairments could be indicators of the disorder for early diagnosis, while motor symptoms are not obvious. In this study, we constructed a new speech corpus of Mandarin Chinese and addressed classification of patients with PD. We implemented classical machine learning methods with ranking algorithms for feature selection, convolutional and recurrent deep networks, and an end to end system. Our classification accuracy significantly surpassed state-of-the-art studies. The result suggests that free talk has stronger classification power than standard speech tasks, which could help the design of future speech tasks for efficient early diagnosis of the disease. Based on existing classification methods and our natural speech study, the automatic detection of PD from daily conversation could be accessible to the majority of the clinical population.

eess.AS↗

arXiv2021

Exploiting Position Bias for Robust Aspect Sentiment Classification

Aspect sentiment classification (ASC) aims at determining sentiments expressed towards different aspects in a sentence. While state-of-the-art ASC models have achieved remarkable performance, they are recently shown to suffer from the issue of robustness. Particularly in two common scenarios: when domains of test and training data are different (out-of-domain scenario) or test data is adversarially perturbed (adversarial scenario), ASC models may attend to irrelevant words and neglect opinion expressions that truly describe diverse aspects. To tackle the challenge, in this paper, we hypothesize that position bias (i.e., the words closer to a concerning aspect would carry a higher degree of importance) is crucial for building more robust ASC models by reducing the probability of mis-attending. Accordingly, we propose two mechanisms for capturing position bias, namely position-biased weight and position-biased dropout, which can be flexibly injected into existing models to enhance representations for classification. Experiments conducted on out-of-domain and adversarial datasets demonstrate that our proposed approaches largely improve the robustness and effectiveness of current models.

cs.CL↗

arXiv2021

Large-Signal Grid-Synchronization Stability Analysis of PLL-based VSCs Using Lyapunov's Direct Method

Grid-synchronization stability (GSS) is an emerging stability issue of grid-tied voltage source converters (VSCs), which can be provoked by severe grid voltage sags. Although a qualitative understanding of the mechanism behind the loss of synchronization has been acquired in recent studies, an analytical method for quantitative assessment of GSS of grid-tied VSCs is still missing. To bridge this gap, a dedicated Lyapunov function is analytically proposed, and its corresponding stability criterion for GSS analysis of grid-tied VSCs is rigorously constructed. Both theoretical analysis and simulation result demonstrate that the proposed method can provide a credible GSS evaluation compared to the previous EAC/EF-based method. Therefore, it can be applied for fast GSS evaluation of the grid-tied VSCs as is exemplified in this paper, as well as an analytical tool for some GSS-related issues, e.g., GSS-oriented parameter design and stabilization control.

eess.SY↗

arXiv2021

Dual-side Sparse Tensor Core

Leveraging sparsity in deep neural network (DNN) models is promising for accelerating model inference. Yet existing GPUs can only leverage the sparsity from weights but not activations, which are dynamic, unpredictable, and hence challenging to exploit. In this work, we propose a novel architecture to efficiently harness the dual-side sparsity (i.e., weight and activation sparsity). We take a systematic approach to understand the (dis)advantages of previous sparsity-related architectures and propose a novel, unexplored paradigm that combines outer-product computation primitive and bitmap-based encoding format. We demonstrate the feasibility of our design with minimal changes to the existing production-scale inner-product-based Tensor Core. We propose a set of novel ISA extensions and co-design the matrix-matrix multiplication and convolution algorithms, which are the two dominant computation patterns in today's DNN models, to exploit our new dual-side sparse Tensor Core. Our evaluation shows that our design can fully unleash the dual-side DNN sparsity and improve the performance by up to one order of magnitude with \hl{small} hardware overhead.

cs.AR↗

arXiv2021

Decorating Your Own Bedroom: Locally Controlling Image Generation with Generative Adversarial Networks

Generative Adversarial Networks (GANs) have made great success in synthesizing high-quality images. However, how to steer the generation process of a well-trained GAN model and customize the output image is much less explored. It has been recently found that modulating the input latent code used in GANs can reasonably alter some variation factors in the output image, but such manipulation usually presents to change the entire image as a whole. In this work, we propose an effective approach, termed as LoGAN, to support local editing of the output image. Concretely, we introduce two operators, i.e., content modulation and style modulation, together with a priority mask to facilitate the precise control of the intermediate generative features. Taking bedroom synthesis as an instance, we are able to seamlessly remove, insert, shift, and rotate the individual objects inside a room. Furthermore, our method can completely clear out a room and then refurnish it with customized furniture and styles. Experimental results show the great potentials of steering the image generation of pre-trained GANs for versatile image editing.

cs.CV↗

arXiv2021

KECRS: Towards Knowledge-Enriched Conversational Recommendation System

The chit-chat-based conversational recommendation systems (CRS) provide item recommendations to users through natural language interactions. To better understand user's intentions, external knowledge graphs (KG) have been introduced into chit-chat-based CRS. However, existing chit-chat-based CRS usually generate repetitive item recommendations, and they cannot properly infuse knowledge from KG into CRS to generate informative responses. To remedy these issues, we first reformulate the conversational recommendation task to highlight that the recommended items should be new and possibly interested by users. Then, we propose the Knowledge-Enriched Conversational Recommendation System (KECRS). Specifically, we develop the Bag-of-Entity (BOE) loss and the infusion loss to better integrate KG with CRS for generating more diverse and informative responses. BOE loss provides an additional supervision signal to guide CRS to learn from both human-written utterances and KG. Infusion loss bridges the gap between the word embeddings and entity embeddings by minimizing distances of the same words in these two embeddings. Moreover, we facilitate our study by constructing a high-quality KG, \ie The Movie Domain Knowledge Graph (TMDKG). Experimental results on a large-scale dataset demonstrate that KECRS outperforms state-of-the-art chit-chat-based CRS, in terms of both recommendation accuracy and response generation quality.

cs.CL↗

arXiv2021

Multi-view Clustering via Deep Matrix Factorization and Partition Alignment

Multi-view clustering (MVC) has been extensively studied to collect multiple source information in recent years. One typical type of MVC methods is based on matrix factorization to effectively perform dimension reduction and clustering. However, the existing approaches can be further improved with following considerations: i) The current one-layer matrix factorization framework cannot fully exploit the useful data representations. ii) Most algorithms only focus on the shared information while ignore the view-specific structure leading to suboptimal solutions. iii) The partition level information has not been utilized in existing work. To solve the above issues, we propose a novel multi-view clustering algorithm via deep matrix decomposition and partition alignment. To be specific, the partition representations of each view are obtained through deep matrix decomposition, and then are jointly utilized with the optimal partition representation for fusing multi-view information. Finally, an alternating optimization algorithm is developed to solve the optimization problem with proven convergence. The comprehensive experimental results conducted on six benchmark multi-view datasets clearly demonstrates the effectiveness of the proposed algorithm against the SOTA methods.

cs.LG↗

arXiv2021

Multi-view Clustering with Deep Matrix Factorization and Global Graph Refinement

Multi-view clustering is an important yet challenging task in machine learning and data mining community. One popular strategy for multi-view clustering is matrix factorization which could explore useful feature representations at lower-dimensional space and therefore alleviate dimension curse. However, there are two major drawbacks in the existing work: i) most matrix factorization methods are limited to shadow depth, which leads to the inability to fully discover the rich hidden information of original data. Few deep matrix factorization methods provide a basis for the selection of the new representation's dimensions of different layers. ii) the majority of current approaches only concentrate on the view-shared information and ignore the specific local features in different views. To tackle the above issues, we propose a novel Multi-View Clustering method with Deep semi-NMF and Global Graph Refinement (MVC-DMF-GGR) in this paper. Firstly, we capture new representation matrices for each view by hierarchical decomposition, then learn a common graph by approximating a combination of graphs which are reconstructed from these new representations to refine the new representations in return. An alternate algorithm with proved convergence is then developed to solve the optimization problem and the results on six multi-view benchmarks demonstrate the effectiveness and superiority of our proposed algorithm.

cs.LG↗

arXiv2021

FastLR: Non-Autoregressive Lipreading Model with Integrate-and-Fire

Lipreading is an impressive technique and there has been a definite improvement of accuracy in recent years. However, existing methods for lipreading mainly build on autoregressive (AR) model, which generate target tokens one by one and suffer from high inference latency. To breakthrough this constraint, we propose FastLR, a non-autoregressive (NAR) lipreading model which generates all target tokens simultaneously. NAR lipreading is a challenging task that has many difficulties: 1) the discrepancy of sequence lengths between source and target makes it difficult to estimate the length of the output sequence; 2) the conditionally independent behavior of NAR generation lacks the correlation across time which leads to a poor approximation of target distribution; 3) the feature representation ability of encoder can be weak due to lack of effective alignment mechanism; and 4) the removal of AR language model exacerbates the inherent ambiguity problem of lipreading. Thus, in this paper, we introduce three methods to reduce the gap between FastLR and AR model: 1) to address challenges 1 and 2, we leverage integrate-and-fire (I\&F) module to model the correspondence between source video frames and output text sequence. 2) To tackle challenge 3, we add an auxiliary connectionist temporal classification (CTC) decoder to the top of the encoder and optimize it with extra CTC loss. We also add an auxiliary autoregressive decoder to help the feature extraction of encoder. 3) To overcome challenge 4, we propose a novel Noisy Parallel Decoding (NPD) for I\&F and bring Byte-Pair Encoding (BPE) into lipreading. Our experiments exhibit that FastLR achieves the speedup up to 10.97$\times$ comparing with state-of-the-art lipreading model with slight WER absolute increase of 1.5\% and 5.5\% on GRID and LRS2 lipreading datasets respectively, which demonstrates the effectiveness of our proposed method.

eess.AS↗

arXiv2021

Temperature evolution of quasiparticle dispersion dynamics in semimetallic 1T-TiTe2 via high-resolution angle-resolved photoemission spectroscopy and ultrafast optical pump-probe spectroscopy

High-resolution angle-resolved photoemission spectroscopy and ultrafast optical pump-probe spectroscopy were used to study semimetallic 1T - TiTe2 quasiparticle dispersion and dynamics. A kink and a flat band, having the same energy scale and temperature-dependent behaviors along the G-M direction, were detected. Both manifested at low temperatures but blurred as temperature increased. The kink was formed by an electron-phonon coupling. And the localized flat band might be closely related to an electron-phonon coupling. Ultrafast optical spectroscopy identified multiple distinct time scales in the 10-300 K range. Quantitative analysis of the fastest decay process evidenced a significant lifetime temperature dependence at high temperatures, while this starts to change slowly below ~ 100 K where an anomalous Hall coefficient occurred. At low temperature, a coherent A1g phonon mode with a frequency of ~ 4.36 THz was extracted. Frequency temperature dependence suggests that phonon hardening occurs as temperature falls and anharmonic effects can explain it. Frequency fluence dependence indicates that the phonons soften as fluence increases.

cond-mat.mtrl-sci↗

arXiv2021

CARE: Commonsense-Aware Emotional Response Generation with Latent Concepts

Rationality and emotion are two fundamental elements of humans. Endowing agents with rationality and emotion has been one of the major milestones in AI. However, in the field of conversational AI, most existing models only specialize in one aspect and neglect the other, which often leads to dull or unrelated responses. In this paper, we hypothesize that combining rationality and emotion into conversational agents can improve response quality. To test the hypothesis, we focus on one fundamental aspect of rationality, i.e., commonsense, and propose CARE, a novel model for commonsense-aware emotional response generation. Specifically, we first propose a framework to learn and construct commonsense-aware emotional latent concepts of the response given an input message and a desired emotion. We then propose three methods to collaboratively incorporate the latent concepts into response generation. Experimental results on two large-scale datasets support our hypothesis and show that our model can produce more accurate and commonsense-aware emotional responses and achieve better human ratings than state-of-the-art models that only specialize in one aspect.

cs.CL↗

arXiv2021

Charging the $O(N)$ model

We determine, for the first time, the scaling dimensions of a family of fixed-charge operators stemming from the critical $O(N)$ model in 4-$ε$ dimensions to the leading and next to leading order terms in the charge expansion but to all-orders in the coupling. We test our results to the maximum known order in perturbation theory while determining higher order terms.

hep-th↗

arXiv2021

Untangling scaling dimensions of fixed charge operators in Higgs Theories

We go beyond a systematic review of the semiclassical approaches for determining the scaling dimensions of fixed-charge operators in $U(1)$ and $O(N)$ models by introducing a general strategy apt at determining the relation between a given charge configuration and the associated operators for more involved symmetry groups such as the $U(N) \times U(M)$. We show how, varying the charge configuration, it is possible to access anomalous dimensions of different operators transforming according to a variety of irreducible representations of the non-abelian symmetry group without the aid of diagrammatical computations. We illustrate our computational strategy by determining the anomalous dimensions of several composite operators to the next-to-leading order in the semiclassical expansion for the $U(N) \times U(M)$ conformal field theory (CFT) in $4-ε$ dimensions. Thanks to the powerful interplay between semiclassical methods and group theory we can, for the first time, extract scaling dimensions for a wide range of operators.

hep-th↗