Searcharxiv⌕ Search

arXiv subjects

Xiaodong Wang

Publications and source records attributed to Xiaodong Wang.

At least 163 records · Page 9Linked to original sources
arXiv2020

Real-Time Nonparametric Anomaly Detection in High-Dimensional Settings

Timely detection of abrupt anomalies is crucial for real-time monitoring and security of modern systems producing high-dimensional data. With this goal, we propose effective and scalable algorithms. Proposed algorithms are nonparametric as both the nominal and anomalous multivariate data distributions are assumed unknown. We extract useful univariate summary statistics and perform anomaly detection in a single-dimensional space. We model anomalies as persistent outliers and propose to detect them via a cumulative sum-like algorithm. In case the observed data have a low intrinsic dimensionality, we learn a submanifold in which the nominal data are embedded and evaluate whether the sequentially acquired data persistently deviate from the nominal submanifold. Further, in the general case, we learn an acceptance region for nominal data via Geometric Entropy Minimization and evaluate whether the sequentially observed data persistently fall outside the acceptance region. We provide an asymptotic lower bound and an asymptotic approximation for the average false alarm period of the proposed algorithm. Moreover, we provide a sufficient condition to asymptotically guarantee that the decision statistic of the proposed algorithm does not diverge in the absence of anomalies. Experiments illustrate the effectiveness of the proposed schemes in quick and accurate anomaly detection in high-dimensional settings.

cs.LG↗
arXiv2020

Progressive Local Filter Pruning for Image Retrieval Acceleration

This paper focuses on network pruning for image retrieval acceleration. Prevailing image retrieval works target at the discriminative feature learning, while little attention is paid to how to accelerate the model inference, which should be taken into consideration in real-world practice. The challenge of pruning image retrieval models is that the middle-level feature should be preserved as much as possible. Such different requirements of the retrieval and classification model make the traditional pruning methods not that suitable for our task. To solve the problem, we propose a new Progressive Local Filter Pruning (PLFP) method for image retrieval acceleration. Specifically, layer by layer, we analyze the local geometric properties of each filter and select the one that can be replaced by the neighbors. Then we progressively prune the filter by gradually changing the filter weights. In this way, the representation ability of the model is preserved. To verify this, we evaluate our method on two widely-used image retrieval datasets,i.e., Oxford5k and Paris6K, and one person re-identification dataset,i.e., Market-1501. The proposed method arrives with superior performance to the conventional pruning methods, suggesting the effectiveness of the proposed method for image retrieval.

cs.CV↗
arXiv2020

DeepRecSys: A System for Optimizing End-To-End At-scale Neural Recommendation Inference

Neural personalized recommendation is the corner-stone of a wide collection of cloud services and products, constituting significant compute demand of the cloud infrastructure. Thus, improving the execution efficiency of neural recommendation directly translates into infrastructure capacity saving. In this paper, we devise a novel end-to-end modeling infrastructure, DeepRecInfra, that adopts an algorithm and system co-design methodology to custom-design systems for recommendation use cases. Leveraging the insights from the recommendation characterization, a new dynamic scheduler, DeepRecSched, is proposed to maximize latency-bounded throughput by taking into account characteristics of inference query size and arrival patterns, recommendation model architectures, and underlying hardware systems. By doing so, system throughput is doubled across the eight industry-representative recommendation models. Finally, design, deployment, and evaluation in at-scale production datacenter shows over 30% latency reduction across a wide variety of recommendation models running on hundreds of machines.

cs.DC↗
arXiv2020

Wirelessly Powered Cell-free IoT: Analysis and Optimization

In this paper, we propose a wirelessly powered Internet of Things (IoT) system based on the cell-free massive MIMO technology. In such a system, during the downlink phase, the sensors harvest radio-frequency (RF) energy emitted by the distributed access points (APs). During the uplink phase, sensors transmit data to the APs using the harvested energy. Collocated massive MIMO and small-cell IoT can be treated as special cases of cell-free IoT. We derive the tight closed-form lower bound on the amount of harvested energy, and the closed-form expression of SINR as the metrics of power transfer and data transmission, respectively. To improve the energy efficiency, we jointly optimize the uplink and downlink power control coefficients to minimize the total transmit energy consumption while meeting the target SINRs. Extended simulation results show that cell-free IoT outperforms collocated massive MIMO and small-cell IoT both in terms of the per user throughput for uplink, and the amount of energy harvested for downlink. Moreover, significant gains can be achieved by the proposed joint power control in terms of both per user throughput and energy consumption.

eess.SP↗
arXiv2019

RecNMP: Accelerating Personalized Recommendation with Near-Memory Processing

Personalized recommendation systems leverage deep learning models and account for the majority of data center AI cycles. Their performance is dominated by memory-bound sparse embedding operations with unique irregular memory access patterns that pose a fundamental challenge to accelerate. This paper proposes a lightweight, commodity DRAM compliant, near-memory processing solution to accelerate personalized recommendation inference. The in-depth characterization of production-grade recommendation models shows that embedding operations with high model-, operator- and data-level parallelism lead to memory bandwidth saturation, limiting recommendation inference performance. We propose RecNMP which provides a scalable solution to improve system throughput, supporting a broad range of sparse embedding models. RecNMP is specifically tailored to production environments with heavy co-location of operators on a single server. Several hardware/software co-optimization techniques such as memory-side caching, table-aware packet scheduling, and hot entry profiling are studied, resulting in up to 9.8x memory latency speedup over a highly-optimized baseline. Overall, RecNMP offers 4.2x throughput improvement and 45.8% memory energy savings.

cs.DC↗
arXiv2019

Orbital Angular Momentum Waves: Generation, Detection and Emerging Applications

Orbital angular momentum (OAM) has aroused a widespread interest in many fields, especially in telecommunications due to its potential for unleashing new capacity in the severely congested spectrum of commercial communication systems. Beams carrying OAM have a helical phase front and a field strength with a singularity along the axial center, which can be used for information transmission, imaging and particle manipulation. The number of orthogonal OAM modes in a single beam is theoretically infinite and each mode is an element of a complete orthogonal basis that can be employed for multiplexing different signals, thus greatly improving the spectrum efficiency. In this paper, we comprehensively summarize and compare the methods for generation and detection of optical OAM, radio OAM and acoustic OAM. Then, we represent the applications and technical challenges of OAM in communications, including free-space optical communications, optical fiber communications, radio communications and acoustic communications. To complete our survey, we also discuss the state of art of particle manipulation and target imaging with OAM beams.

physics.app-ph↗
arXiv2019

Language Model-Driven Unsupervised Neural Machine Translation

Unsupervised neural machine translation(NMT) is associated with noise and errors in synthetic data when executing vanilla back-translations. Here, we explicitly exploits language model(LM) to drive construction of an unsupervised NMT system. This features two steps. First, we initialize NMT models using synthetic data generated via temporary statistical machine translation(SMT). Second, unlike vanilla back-translation, we formulate a weight function, that scores synthetic data at each step of subsequent iterative training; this allows unsupervised training to an improved outcome. We present the detailed mathematical construction of our method. Experimental WMT2014 English-French, and WMT2016 English-German and English-Russian translation tasks revealed that our method outperforms the best prior systems by more than 3 BLEU points.

cs.CL↗
arXiv2019

SubCharacter Chinese-English Neural Machine Translation with Wubi encoding

Neural machine translation (NMT) is one of the best methods for understanding the differences in semantic rules between two languages. Especially for Indo-European languages, subword-level models have achieved impressive results. However, when the translation task involves Chinese, semantic granularity remains at the word and character level, so there is still need more fine-grained translation model of Chinese. In this paper, we introduce a simple and effective method for Chinese translation at the sub-character level. Our approach uses the Wubi method to translate Chinese into English; byte-pair encoding (BPE) is then applied. Our method for Chinese-English translation eliminates the need for a complicated word segmentation algorithm during preprocessing. Furthermore, our method allows for sub-character-level neural translation based on recurrent neural network (RNN) architecture, without preprocessing. The empirical results show that for Chinese-English translation tasks, our sub-character-level model has a comparable BLEU score to the subword model, despite having a much smaller vocabulary. Additionally, the small vocabulary is highly advantageous for NMT model compression.

cs.CL↗
arXiv2019

Secure Distributed Dynamic State Estimation in Wide-Area Smart Grids

Smart grid is a large complex network with a myriad of vulnerabilities, usually operated in adversarial settings and regulated based on estimated system states. In this study, we propose a novel highly secure distributed dynamic state estimation mechanism for wide-area (multi-area) smart grids, composed of geographically separated subregions, each supervised by a local control center. We firstly propose a distributed state estimator assuming regular system operation, that achieves near-optimal performance based on the local Kalman filters and with the exchange of necessary information between local centers. To enhance the security, we further propose to (i) protect the network database and the network communication channels against attacks and data manipulations via a blockchain (BC)-based system design, where the BC operates on the peer-to-peer network of local centers, (ii) locally detect the measurement anomalies in real-time to eliminate their effects on the state estimation process, and (iii) detect misbehaving (hacked/faulty) local centers in real-time via a distributed trust management scheme over the network. We provide theoretical guarantees regarding the false alarm rates of the proposed detection schemes, where the false alarms can be easily controlled. Numerical studies illustrate that the proposed mechanism offers reliable state estimation under regular system operation, timely and accurate detection of anomalies, and good state recovery performance in case of anomalies.

cs.CR↗
arXiv2019

Multi-target Position and Velocity Estimation Using OFDM Communication Signals

In this paper, we consider a passive radar system that estimates the positions and velocities of multiple moving targets by using OFDM signals transmitted by a totally un-coordinated and un-synchronizated illuminator and multiple receivers. It is assumed that data demodulation is performed separately based on the direct-path signal, and the error-prone estimated data symbols are made available to the passive radar receivers, which estimate the positions and velocities of the targets in two stages. First, we formulate a problem of joint estimation of the delay-Doppler of reflectors and the demodulation errors, by exploiting two types of sparsities of the system, namely, the numbers of reflectors (i.e., targets and clutters) and demodulation errors are both small. This problem is non-convex and a conjugate gradient descent method is proposed to solve it. Then in the second stage we determine the positions and velocities of targets based on the estimated delay-Doppler in the first stage. And two methods are proposed: the first is based on numerically solving a set of nonlinear equations, while the second is based on the back propagation neural network, which is more efficient. The performance of the proposed passive OFDM radar receiver algorithm is evaluated through extensive simulations.

cs.IT↗
arXiv2019

Multi-dimensional Spectral Super-Resolution with Prior Knowledge via Frequency-Selective Vandermonde Decomposition and ADMM

This paper is concerned with estimation of multiple frequencies from incomplete and/or noisy samples based on a low-CP-rank tensor data model where each CP vector is an array response vector of one frequency. Suppose that it is known a priori that the frequencies lie in some given intervals, we develop efficient super-resolution estimators by exploiting such prior knowledge based on frequency-selective (FS) atomic norm minimization. We study the MD Vandermonde decomposition of block Toeplitz matrices in which the frequencies are restricted to lie in given intervals. We then propose to solve the FS atomic norm minimization problems for the low-rank spectral tensor recovery by converting them into semidefinite programs based on the MD Vandermonde decomposition. We also develop fast solvers for solving these semidefinite programs via the alternating direction method of multipliers (ADMM), where each iteration involves a number of refinement steps to utilize the prior knowledge. Extensive simulation results are presented to illustrate the high performance of the proposed methods.

cs.IT↗
arXiv2019

Deep Learning Recommendation Model for Personalization and Recommendation Systems

With the advent of deep learning, neural network-based recommendation models have emerged as an important tool for tackling personalization and recommendation tasks. These networks differ significantly from other deep learning networks due to their need to handle categorical features and are not well studied or understood. In this paper, we develop a state-of-the-art deep learning recommendation model (DLRM) and provide its implementation in both PyTorch and Caffe2 frameworks. In addition, we design a specialized parallelization scheme utilizing model parallelism on the embedding tables to mitigate memory constraints while exploiting data parallelism to scale-out compute from the fully-connected layers. We compare DLRM against existing recommendation models and characterize its performance on the Big Basin AI platform, demonstrating its usefulness as a benchmark for future algorithmic experimentation and system co-design.

cs.IR↗
arXiv2019

Remarks on a mean field equation on $\mathbb{S}^{2}$

In this note, we study symmetry of solutions of the elliptic equation \begin{equation*} -Δ_{\mathbb{S}^{2}}u+3=e^{2u}\ \ \hbox{on}\ \ \mathbb{S}^{2}, \end{equation*} that arises in the study of rigidity problem of Hawking mass in general relativity. We provide various conditions under which this equation has only constant solutions, and consequently imply the rigidity of Hawking mass for stable constant mean curvature (CMC) sphere.

math.AP↗
arXiv2019

Deterministic and Probabilistic Conditions for Finite Completability of Low-Tucker-Rank Tensor

We investigate the fundamental conditions on the sampling pattern, i.e., locations of the sampled entries, for finite completability of a low-rank tensor given some components of its Tucker rank. In order to find the deterministic necessary and sufficient conditions, we propose an algebraic geometric analysis on the Tucker manifold, which allows us to incorporate multiple rank components in the proposed analysis in contrast with the conventional geometric approaches on the Grassmannian manifold. This analysis characterizes the algebraic independence of a set of polynomials defined based on the sampling pattern, which is closely related to finite completion. Probabilistic conditions are then studied and a lower bound on the sampling probability is given, which guarantees that the proposed deterministic conditions on the sampling patterns for finite completability hold with high probability. Furthermore, using the proposed geometric approach for finite completability, we propose a sufficient condition on the sampling pattern that ensures there exists exactly one completion for the sampled tensor.

math.NA↗
arXiv2019

Compressive Multidimensional Harmonic Retrieval with Prior Knowledge

This paper concerns the problem of estimating multidimensional (MD) frequencies using prior knowledge of the signal spectral sparsity from partial time samples. In many applications, such as radar, wireless communications, and super-resolution imaging, some structural information about the signal spectrum might be known beforehand. Suppose that the frequencies lie in given intervals, the goal is to improve the frequency estimation performance by using the prior information. We study the MD Vandermonde decomposition of block Toeplitz matrices in which the frequencies are restricted to given intervals. We then propose to solve the frequency-selective atomic norm minimization by converting them into semidefinite program based on the MD Vandermonde decomposition. Numerical simulation results are presented to illustrate the good performance of the proposed method.

cs.IT↗
arXiv2019

Joint Timing Offset and Channel Estimation for Multi-user UFMC Uplink

Universal filtered multi-carrier (UFMC), which groups and filters subcarriers before transmission, is a potential multi-carrier modulation technique investigated for the emerging Machine-Type Communications (MTC). Considering the relaxed timing synchronization requirement of UFMC, we design a novel joint timing synchronization and channel estimation method for multi-user UFMC uplink transmission. Aiming at reducing overhead for higher system performance, the joint estimation problem is formulated using atomic norm minimization that enhances the sparsity of timing offset in the continuous frequency domain. Simulation results show that the proposed method can achieve considerable performance gain, as compared with its counterparts.

eess.SP↗
arXiv2019

Radar and Communication Co-existence: an Overview

Increased amounts of bandwidth are required to guarantee both high-quality/high-rate wireless services (4G and 5G) and reliable sensing capabilities such as automotive radar, air traffic control, earth geophysical monitoring and security applications. Therefore, co-existence between radar and communication systems using overlapping bandwidths has been a primary investigation field in recent years. Various signal processing techniques such as interference mitigation, pre-coding or spatial separation, and waveform design allow both radar and communications to share the spectrum. This article reviews recent work on co-existence between radar and communication systems, including signal models, waveform design and signal processing techniques. Our goal is to survey contributions in this area in order to provide a primary starting point for new researchers interested in these problems.

eess.SP↗