arXiv subjects

Lei Wang

Publications and source records attributed to Lei Wang.

At least 1,081 records · Page 60Linked to original sources

arXiv2018

Revisiting lepton-specific 2HDM in light of muon g-2 anomaly

We examine the lepton-specific 2HDM as a solution of muon $g-2$ anomaly under various theoretical and experimental constraints, especially the direct search limits from the LHC and the requirement of a strong first-order phase transition in the early universe. We find that the muon g-2 anomaly can be explained in the region of 32 $<\tanβ<$ 80, 10 GeV $<m_A<$ 65 GeV, 260 GeV $<m_H<$ 620 GeV and 180 GeV $<m_{H^\pm}<$ 620 GeV after imposing the joint constraints from the theory, the precision electroweak data, the 125 GeV Higgs data, the leptonic/semi-hadronic $τ$ decays, the leptonic $Z$ decays and Br$(B_s \to μ^+ μ^-)$. The direct searches from the $h\to AA$ channels can impose stringent upper limits on Br$(h\to AA)$ and the multi-lepton event searches can sizably reduce the allowed region of $m_A$ and $\tanβ$ (10 GeV $<m_A<$ 44 GeV and 32 $<\tanβ<$ 60). Finally, we find that the model can produce a strong first-order phase transition in the region of 14 GeV $<m_A<$ 25 GeV, 310 GeV $<m_H<$ 355 GeV and 250 GeV $<m_{H^\pm}<$ 295 GeV, allowed by the explanation of the muon $g-2$ anomaly.

hep-ph↗

arXiv2018

Neural Network Renormalization Group

We present a variational renormalization group (RG) approach using a deep generative model based on normalizing flows. The model performs hierarchical change-of-variables transformations from the physical space to a latent space with reduced mutual information. Conversely, the neural net directly maps independent Gaussian noises to physical configurations following the inverse RG flow. The model has an exact and tractable likelihood, which allows unbiased training and direct access to the renormalized energy function of the latent variables. To train the model, we employ probability density distillation for the bare energy function of the physical problem, in which the training loss provides a variational upper bound of the physical free energy. We demonstrate practical usage of the approach by identifying mutually independent collective variables of the Ising model and performing accelerated hybrid Monte Carlo sampling in the latent space. Lastly, we comment on the connection of the present approach to the wavelet formulation of RG and the modern pursuit of information preserving RG.

cond-mat.stat-mech↗

arXiv2018

Scalable Quantum Tomography with Fidelity Estimation

We propose a quantum tomography scheme for pure qudit systems which adopts random base measurements and generative learning methods, along with a built-in fidelity estimation approach to assess the reliability of the tomographic states. We prove the validity of the scheme theoretically, and we perform numerically simulated experiments on several target states including three typical quantum information states and randomly initiated states, demonstrating its efficiency and robustness. The number of replicas required by a certain convergence criterion grows in the manner of low-degree polynomial when the system scales, thus the scheme achieves high scalability that is crucial for practical quantum state tomography.

quant-ph↗

arXiv2018

Clustering Residential Electricity Load Curves via Community Detection in Network

Performing analytic of household load curves (LCs) has significant value in predicting individual electricity consumption patterns, and hence facilitate developing demand-response strategy, and finally achieve energy efficiency improvement and emission reduction. LC clustering is a widely used analytic technology, which discovers electricity consumption patterns by grouping similar LCs into same sub-groups. However, previous clustering methods treat each LC in the data set as an individual time series, ignoring the inherent relationship among different LCs, restraining the performance of the clustering methods. What's more, due to the significant volatility and uncertainty of LCs, the previous LC clustering approaches inevitably result in either lager number of clusters or huge variances within a cluster, which is unacceptable for actual application needs. In this paper, we proposed an integrated approach to address this issue. First, we converted the LC clustering task into the community detection task in network. Second, we proposed a clustering approach incorporated with community detection to improve the performance of LC clustering, which includes network construction, community detection and typical load profile extraction. The method convert the data set into a network in which the inherent relationship among LCs is represented by the edges of the network. Third, we construct a multi-layer typical load profile directory to make the trade-off between variances within a cluster and the number of the clusters, enabling the researchers to assess the LCs and the customers in different layers according to practical application requirements. The experiments demonstrate that our integrated approach outperform the state-of-the-art methods.

cs.DS↗

arXiv2018

BigDataBench: A Scalable and Unified Big Data and AI Benchmark Suite

Several fundamental changes in technology indicate domain-specific hardware and software co-design is the only path left. In this context, architecture, system, data management, and machine learning communities pay greater attention to innovative big data and AI algorithms, architecture, and systems. Unfortunately, complexity, diversity, frequently-changed workloads, and rapid evolution of big data and AI systems raise great challenges. First, the traditional benchmarking methodology that creates a new benchmark or proxy for every possible workload is not scalable, or even impossible for Big Data and AI benchmarking. Second, it is prohibitively expensive to tailor the architecture to characteristics of one or more application or even a domain of applications. We consider each big data and AI workload as a pipeline of one or more classes of units of computation performed on different initial or intermediate data inputs, each class of which we call a data motif. On the basis of our previous work that identifies eight data motifs taking up most of the run time of a wide variety of big data and AI workloads, we propose a scalable benchmarking methodology that uses the combination of one or more data motifs---to represent diversity of big data and AI workloads. Following this methodology, we present a unified big data and AI benchmark suite---BigDataBench 4.0, publicly available from~\url{http://prof.ict.ac.cn/BigDataBench}. This unified benchmark suite sheds new light on domain-specific hardware and software co-design: tailoring the system and architecture to characteristics of the unified eight data motifs other than one or more application case by case. Also, for the first time, we comprehensively characterize the CPU pipeline efficiency using the benchmarks of seven workload types in BigDataBench 4.0.

cs.DC↗

arXiv2018

Translating a Math Word Problem to an Expression Tree

Sequence-to-sequence (SEQ2SEQ) models have been successfully applied to automatic math word problem solving. Despite its simplicity, a drawback still remains: a math word problem can be correctly solved by more than one equations. This non-deterministic transduction harms the performance of maximum likelihood estimation. In this paper, by considering the uniqueness of expression tree, we propose an equation normalization method to normalize the duplicated equations. Moreover, we analyze the performance of three popular SEQ2SEQ models on the math word problem solving. We find that each model has its own specialty in solving problems, consequently an ensemble model is then proposed to combine their advantages. Experiments on dataset Math23K show that the ensemble model with equation normalization significantly outperforms the previous state-of-the-art methods.

cs.CL↗

arXiv2018

Anomaly Analysis for Co-located Datacenter Workloads in the Alibaba Cluster

In warehouse-scale cloud datacenters, co-locating online services and offline batch jobs is an efficient approach to improving datacenter utilization. To better facilitate the understanding of interactions among the co-located workloads and their real-world operational demands, Alibaba recently released a cluster usage and co-located workload dataset, which is the first publicly dataset with precise information about the category of each job. In this paper, we perform a deep analysis on the released Alibaba workload dataset, from the perspective of anomaly analysis and diagnosis. Through data preprocessing, node similarity analysis based on Dynamic Time Warping (DTW), co-located workloads characteristics analysis and anomaly analysis based on iForest, we reveals several insights including: (1) The performance discrepancy of machines in Alibaba's production cluster is relatively large, for the distribution and resource utilization of co-located workloads is not balanced. For instance, the resource utilization (especially memory utilization) of batch jobs is fluctuating and not as stable as that of online containers, and the reason is that online containers are long-running jobs with more memory-demanding and most batch jobs are short jobs, (2) Based on the distribution of co-located workload instance numbers, the machines can be classified into 8 workload distribution categories1. And most patterns of machine resource utilization curves are similar in the same workload distribution category. (3) In addition to the system failures, unreasonable scheduling and workload imbalance are the main causes of anomalies in Alibaba's cluster.

cs.DC↗

arXiv2018

Method for Quantitative Estimation of the Risk Propagation Threshold in Electric Power CPS Based on Seepage Probability

Because of the non-uniformity of the electric power CPS network and the dynamic nature of the risk propagation process, it is difficult to quantify the critical point of a cyber risk explosion. From the perspective of the dependency network, this paper proposes a method for quantitative evaluation of the risk propagation threshold of power CPS networks based on the percolation theory. First, the power CPS network is abstracted as a dual-layered network-directed unweighted graph according to topology correlation and coupling logic, and the asymmetrical balls-into-bins allocation method is used to establish a "one-to-many" and "partially coupled" non-uniform power CPS characterization model. Then, considering the directionality between the cyber layer and the physical layer link, the probability of percolation flow is introduced to establish the propagation dynamic equations for the internal coupling relationship of each layer. Finally, the risk propagation threshold is numerically quantified by defining the survival function of power CPS network nodes, and the validity of the proposed method is verified by the IEEE 30-bus system and 150-node Barabsi-Albert model.

physics.soc-ph↗

arXiv2018

Performance assessment of the deep learning technologies in grading glaucoma severity

Objective: To validate and compare the performance of eight available deep learning architectures in grading the severity of glaucoma based on color fundus images. Materials and Methods: We retrospectively collected a dataset of 5978 fundus images and their glaucoma severities were annotated by the consensus of two experienced ophthalmologists. We preprocessed the images to generate global and local regions of interest (ROIs), namely the global field-of-view images and the local disc region images. We then divided the generated images into three independent sub-groups for training, validation, and testing purposes. With the datasets, eight convolutional neural networks (CNNs) (i.e., VGG16, VGG19, ResNet, DenseNet, InceptionV3, InceptionResNet, Xception, and NASNetMobile) were trained separately to grade glaucoma severity, and validated quantitatively using the area under the receiver operating characteristic (ROC) curve and the quadratic kappa score. Results: The CNNs, except VGG16 and VGG19, achieved average kappa scores of 80.36% and 78.22% when trained from scratch on global and local ROIs, and 85.29% and 82.72% when fine-tuned using the pre-trained weights, respectively. VGG16 and VGG19 achieved reasonable accuracy when trained from scratch, but they failed when using pre-trained weights for global and local ROIs. Among these CNNs, the DenseNet had the highest classification accuracy (i.e., 75.50%) based on pre-trained weights when using global ROIs, as compared to 65.50% when using local ROIs. Conclusion: The experiments demonstrated the feasibility of the deep learning technology in grading glaucoma severity. In particular, global field-of-view images contain relatively richer information that may be critical for glaucoma assessment, suggesting that we should use the entire field-of-view of a fundus image for training a deep learning network.

cs.CV↗

arXiv2018

Data Motif-based Proxy Benchmarks for Big Data and AI Workloads

For the architecture community, reasonable simulation time is a strong requirement in addition to performance data accuracy. However, emerging big data and AI workloads are too huge at binary size level and prohibitively expensive to run on cycle-accurate simulators. The concept of data motif, which is identified as a class of units of computation performed on initial or intermediate data, is the first step towards building proxy benchmark to mimic the real-world big data and AI workloads. However, there is no practical way to construct a proxy benchmark based on the data motifs to help simulation-based research. In this paper, we embark on a study to bridge the gap between data motif and a practical proxy benchmark. We propose a data motif-based proxy benchmark generating methodology by means of machine learning method, which combine data motifs with different weights to mimic the big data and AI workloads. Furthermore, we implement various data motifs using light-weight stacks and apply the methodology to five real-world workloads to construct a suite of proxy benchmarks, considering the data types, patterns, and distributions. The evaluation results show that our proxy benchmarks shorten the execution time by 100s times on real systems while maintaining the average system and micro-architecture performance data accuracy above 90%, even changing the input data sets or cluster configurations. Moreover, the generated proxy benchmarks reflect consistent performance trends across different architectures. To facilitate the community, we will release the proxy benchmarks on the project homepage http://prof.ict.ac.cn/BigDataBench.

cs.DC↗

arXiv2018

Monge-Ampère Flow for Generative Modeling

We present a deep generative model, named Monge-Ampère flow, which builds on continuous-time gradient flow arising from the Monge-Ampère equation in optimal transport theory. The generative map from the latent space to the data space follows a dynamical system, where a learnable potential function guides a compressible fluid to flow towards the target density distribution. Training of the model amounts to solving an optimal control problem. The Monge-Ampère flow has tractable likelihoods and supports efficient sampling and inference. One can easily impose symmetry constraints in the generative model by designing suitable scalar potential functions. We apply the approach to unsupervised density estimation of the MNIST dataset and variational calculation of the two-dimensional Ising model at the critical point. This approach brings insights and techniques from Monge-Ampère equation, optimal transport, and fluid dynamics into reversible flow-based generative models.

cs.LG↗

arXiv2018

Deep Learning for Quality Control of Subcortical Brain 3D Shape Models

We present several deep learning models for assessing the morphometric fidelity of deep grey matter region models extracted from brain MRI. We test three different convolutional neural net architectures (VGGNet, ResNet and Inception) over 2D maps of geometric features. Further, we present a novel geometry feature augmentation technique based on a parametric spherical mapping. Finally, we present an approach for model decision visualization, allowing human raters to see the areas of subcortical shapes most likely to be deemed of failing quality by the machine. Our training data is comprised of 5200 subjects from the ENIGMA Schizophrenia MRI cohorts, and our test dataset contains 1500 subjects from the ENIGMA Major Depressive Disorder cohorts. Our final models reduce human rater time by 46-70%. ResNet outperforms VGGNet and Inception for all of our predictive tasks.

q-bio.NC↗

arXiv2018

Singular cycles connecting saddle periodic orbit and saddle equilibrium in piecewise smooth systems

For flows, the singular cycles connecting saddle periodic orbit and saddle equilibrium can poten- tially result in the so-called singular horseshoe, which means the existence of a non-uniformly hyperbolic chaotic invariant set. However, it is very hard to find a specific dynamical system that exhibits such singular cycles in general. In this paper, the existence of the singular cycles involved in saddle periodic orbits is studied by two types of piecewise affine systems: one is the piecewise affine system having an admissible saddle point with only real eigenvalues and an admissible saddle periodic orbit, and the other is the piecewise affine system having an admissible saddle- focus and an admissible saddle periodic orbit. Precisely, several kinds of sufficient conditions are obtained for the existence of only one heteroclinic cycle or only two heteroclinic cycles in the two types of piecewise affine systems, respectively. In addition, some examples are presented to illustrate the results.

math.DS↗

arXiv2018

Data Motifs: A Lens Towards Fully Understanding Big Data and AI Workloads

The complexity and diversity of big data and AI workloads make understanding them difficult and challenging. This paper proposes a new approach to modelling and characterizing big data and AI workloads. We consider each big data and AI workload as a pipeline of one or more classes of units of computation performed on different initial or intermediate data inputs. Each class of unit of computation captures the common requirements while being reasonably divorced from individual implementations, and hence we call it a data motif. For the first time, among a wide variety of big data and AI workloads, we identify eight data motifs that take up most of the run time of those workloads, including Matrix, Sampling, Logic, Transform, Set, Graph, Sort and Statistic. We implement the eight data motifs on different software stacks as the micro benchmarks of an open-source big data and AI benchmark suite ---BigDataBench 4.0 (publicly available from http://prof.ict.ac.cn/BigDataBench), and perform comprehensive characterization of those data motifs from perspective of data sizes, types, sources, and patterns as a lens towards fully understanding big data and AI workloads. We believe the eight data motifs are promising abstractions and tools for not only big data and AI benchmarking, but also domain-specific hardware and software co-design.

cs.DC↗

arXiv2018

Antenna Current Optimization and Realizations for Far-Field Pattern Shaping

Far-field shaping of small antennas is a challenge and the realizations of non-dipole radiation of small to intermediate sized antennas are difficult. Here we examine the antenna bandwidth cost associated with such constraints, and in certain cases we design antennas that approach the bounds. Far-field shaping is in particular interesting for Internet-of-things (IoT) and Wi-Fi applications since e.g. spatial filtering can mitigate package loss through a reduction of mutual interference, and hence increase the power efficiency of the devices. Even a rather careful far-field shaping of smaller antennas can be associated with a steep reduction in the best available bandwidth. It is thus important to develop constraints that a small antenna can support. We describe a power front-to-back ratio, and a related, beam-shaping constraint that can be used in optimization for the minimum Q-factor. We show that such a non-convex Q-factor optimization can be solved with the semi-definite relaxation technique. We furthermore show that certain of the above optimized non-standard radiation patterns can be realized with a multi-position feeding strategy with a moderate loss of Q-factor: $Q_\text{antenna}\leq 1.61Q_\text{optimal}$.

physics.app-ph↗

arXiv2018

Maxwell-Stefan theory based lattice Boltzmann model for diffusion in multicomponent mixtures

The phenomena of diffusion in multicomponent (more than two components) mixtures are very universal in both science and engineering, and from mathematical point of view, they are usually described by the Maxwell-Stefan (MS) based continuum equations. In this paper, we propose a multiple-relaxation-time lattice Boltzmann (LB) model for the mass diffusion in multicomponent mixtures, and also perform a Chapman-Enskog analysis to show that the MS based continuum equations can be correctly recovered from the developed LB model. In addition, considering the fact that the MS based continuum equations are just a diffusion type of partial differential equations, we can also adopt much simpler lattice structures to reduce the computational cost of present LB model. We then conduct some simulations to test this model, and find that the results are in good agreement with some available works. Besides, the reverse diffusion, osmotic diffusion and diffusion barrier phenomena are also captured. Finally, compared to the kinetic theory based LB models for multicomponent gas diffusion, the present model does not include any complicated interpolations, and its collision process can be still implemented locally. Therefore, the advantages of single-component LB method can also be preserved in present LB model.

physics.comp-ph↗

arXiv2018

Image Registration and Predictive Modeling: Learning the Metric on the Space of Diffeomorphisms

We present a method for metric optimization in the Large Deformation Diffeomorphic Metric Mapping (LDDMM) framework, by treating the induced Riemannian metric on the space of diffeomorphisms as a kernel in a machine learning context. For simplicity, we choose the kernel Fischer Linear Discriminant Analysis (KLDA) as the framework. Optimizing the kernel parameters in an Expectation-Maximization framework, we define model fidelity via the hinge loss of the decision function. The resulting algorithm optimizes the parameters of the LDDMM norm-inducing differential operator as a solution to a group-wise registration and classification problem. In practice, this may lead to a biology-aware registration, focusing its attention on the predictive task at hand such as identifying the effects of disease. We first tested our algorithm on a synthetic dataset, showing that our parameter selection improves registration quality and classification accuracy. We then tested the algorithm on 3D subcortical shapes from the Schizophrenia cohort Schizconnect. Our Schizpohrenia-Control predictive model showed significant improvement in ROC AUC compared to baseline parameters.

cs.CV↗

arXiv2018

Learning and Inference on Generative Adversarial Quantum Circuits

Quantum mechanics is inherently probabilistic in light of Born's rule. Using quantum circuits as probabilistic generative models for classical data exploits their superior expressibility and efficient direct sampling ability. However, training of quantum circuits can be more challenging compared to classical neural networks due to lack of efficient differentiable learning algorithm. We devise an adversarial quantum-classical hybrid training scheme via coupling a quantum circuit generator and a classical neural network discriminator together. After training, the quantum circuit generative model can infer missing data with quadratic speed up via amplitude amplification. We numerically simulate the learning and inference of generative adversarial quantum circuit using the prototypical Bars-and-Stripes dataset. Generative adversarial quantum circuits is a fresh approach to machine learning which may enjoy the practically useful quantum advantage on near-term quantum devices.

quant-ph↗