arXiv subjects

Peng Liu

Publications and source records attributed to Peng Liu.

At least 307 records · Page 17Linked to original sources

arXiv2022

A novel holographic quantum phase transition and butterfly velocity

In this paper, we make a systematical and in-depth exploration on the phase structure and the behaviors of butterfly velocity in an Einstein-Maxwell-dilaton-axions (EMDA) model. Depending on the model parameter, there are two kinds of mechanisms driving quantum phase transition (QPT) in this model. One is the infrared (IR) geometry to be renormalization group (RG) unstable, and the other is the strength of lattice deformation leading to some kind of bifurcating solution. We also find a novel QPT in the metal phases. The study on the behavior of the butterfly velocity crossing QPT indicates that the butterfly velocity or its first derivative exhibiting local extreme depends on the QPT mechanism. Further, the scaling behaviors of the butterfly velocity in the zero-temperature limit confirm that different phases are controlled by different IR geometries. Therefore, the butterfly velocity is a good probe to QPT and it also provides a possible way to study QPT beyond holography.

hep-th↗

arXiv2022

Semantic-preserving Reinforcement Learning Attack Against Graph Neural Networks for Malware Detection

As an increasing number of deep-learning-based malware scanners have been proposed, the existing evasion techniques, including code obfuscation and polymorphic malware, are found to be less effective. In this work, we propose a reinforcement learning-based semantics-preserving (i.e.functionality-preserving) attack against black-box GNNs (GraphNeural Networks) for malware detection. The key factor of adversarial malware generation via semantic Nops insertion is to select the appropriate semanticNopsand their corresponding basic blocks. The proposed attack uses reinforcement learning to automatically make these "how to select" decisions. To evaluate the attack, we have trained two kinds of GNNs with five types(i.e., Backdoor, Trojan-Downloader, Trojan-Ransom, Adware, and Worm) of Windows malware samples and various benign Windows programs. The evaluation results have shown that the proposed attack can achieve a significantly higher evasion rate than three baseline attacks, namely the semantics-preserving random instruction insertion attack, the semantics-preserving accumulative instruction insertion attack, and the semantics-preserving gradient-based instruction insertion attack.

cs.CR↗

arXiv2022

Optical Wavelength Meter with Machine Learning Enhanced Precision

Diverse applications in photonics and microwave engineering require a means of measurement of the instantaneous frequency of a signal. A photonic implementation typically applies an interferometer equipped with three or more output ports to measure the frequency dependent phase shift provided by an optical delay line. The components constituting the interferometer are prone to impairments which results in erroneous measurements. It is shown that the information to be retrieved is encoded by a three-component vector that lies on a circular cone within a three-dimensional Cartesian object space. The measured data belongs to the image of the object space under a linear map that describes the action of the interferometer. Assisted by a learning algorithm, an inverse map from the image space into the object space is constructed. The inverse map compensates for a variety of impairments while being robust to noise. Simulation results demonstrate that, to the extent the interferometer model captures all significant impairments, a precision limited only by the level of random noise is attainable. A wavelength meter architecture is fabricated on Si3N4 photonic integration platform to prove the method experimentally. Applied to the measured data, greater than an order of magnitude improvement in precision is achieved by the proposed method compared to the conventional method.

physics.optics↗

arXiv2022

Mixed State Entanglement For Holographic Systems With A Scalar Hair

We study the mixed state entanglement of an asymptotic AdS black hole system with scalar hair. Through numerical calculations, we find that the holographic entanglement entropy (HEE) presents a non-monotonic behavior with the system parameter, depending on the size of the subregion. In addition, the mutual information (MI) also shows non-monotonic behavior in certain ranges of system parameters. However, the entanglement wedge minimum cross-section (EWCS), which is a mixed state entanglement measure, increases monotonically with the AdS radius; meanwhile, shows non-monotonic with the temperature. We also give analytical understandings of the phenomena above.

hep-th↗

arXiv2022

Pessimistic Bootstrapping for Uncertainty-Driven Offline Reinforcement Learning

Offline Reinforcement Learning (RL) aims to learn policies from previously collected datasets without exploring the environment. Directly applying off-policy algorithms to offline RL usually fails due to the extrapolation error caused by the out-of-distribution (OOD) actions. Previous methods tackle such problem by penalizing the Q-values of OOD actions or constraining the trained policy to be close to the behavior policy. Nevertheless, such methods typically prevent the generalization of value functions beyond the offline data and also lack precise characterization of OOD data. In this paper, we propose Pessimistic Bootstrapping for offline RL (PBRL), a purely uncertainty-driven offline algorithm without explicit policy constraints. Specifically, PBRL conducts uncertainty quantification via the disagreement of bootstrapped Q-functions, and performs pessimistic updates by penalizing the value function based on the estimated uncertainty. To tackle the extrapolating error, we further propose a novel OOD sampling method. We show that such OOD sampling and pessimistic bootstrapping yields provable uncertainty quantifier in linear MDPs, thus providing the theoretical underpinning for PBRL. Extensive experiments on D4RL benchmark show that PBRL has better performance compared to the state-of-the-art algorithms.

cs.LG↗

arXiv2022

Dynamic Properties of Two-Dimensional Latticed Holographic System

We study the anisotropic properties of dynamical quantities: direct current (DC) conductivity, butterfly velocity, and charge diffusion. The anisotropy plays a crucial role in determining the phase structure of the two-lattice system. Even a small deviation from isotropy can lead to distinct phase structures, as well as the IR fixed points of our holographic systems. In particular, for anisotropic cases, the most important property is that the IR fixed point can be non-AdS$_2 \times \mathbb R^2$ even for metallic phases. As that of a one-lattice system, the butterfly velocity and the charge diffusion can also diagnose the quantum phase transition (QPT) in this two-dimensional anisotropic latticed system.

hep-th↗

arXiv2022

Quasi-normal modes of the Einstein-Maxwell-aether Black Hole

We study the quasi-normal modes of the charged scalar perturbations in the background of the Einstein-Maxwell-aether black hole through three methods (WKB method, continued fraction method, generalized eigenvalue method). Then we propose the specific treatment for the generalized effective potential with $ω$-dependence and the complete procedure of transforming calculation continued fraction method into finding the zero point of the corresponding complex function numerically. These methods are valid because the results from different methods are consistent. We also investigate the allowed region of the second kind aether black hole among the system parameters ($c_{13},c_{14},Q$). Finally we show the existence of quasi-resonances of massive perturbation for Einstein-Maxwell-aether black hole even with large aether parameter.

gr-qc↗

arXiv2022

Single Model Deep Learning on Imbalanced Small Datasets for Skin Lesion Classification

Deep convolutional neural network (DCNN) models have been widely explored for skin disease diagnosis and some of them have achieved the diagnostic outcomes comparable or even superior to those of dermatologists. However, broad implementation of DCNN in skin disease detection is hindered by small size and data imbalance of the publically accessible skin lesion datasets. This paper proposes a novel single-model based strategy for classification of skin lesions on small and imbalanced datasets. First, various DCNNs are trained on different small and imbalanced datasets to verify that the models with moderate complexity outperform the larger models. Second, regularization DropOut and DropBlock are added to reduce overfitting and a Modified RandAugment augmentation strategy is proposed to deal with the defects of sample underrepresentation in the small dataset. Finally, a novel Multi-Weighted New Loss (MWNL) function and an end-to-end cumulative learning strategy (CLS) are introduced to overcome the challenge of uneven sample size and classification difficulty and to reduce the impact of abnormal samples on training. By combining Modified RandAugment, MWNL and CLS, our single DCNN model method achieved the classification accuracy comparable or superior to those of multiple ensembling models on different dermoscopic image datasets. Our study shows that this method is able to achieve a high classification performance at a low cost of computational resources and inference time, potentially suitable to implement in mobile devices for automated screening of skin lesions and many other malignancies in low resource settings.

cs.CV↗

arXiv2022

A Survey on Active Deep Learning: From Model-driven to Data-driven

Which samples should be labelled in a large data set is one of the most important problems for trainingof deep learning. So far, a variety of active sample selection strategies related to deep learning havebeen proposed in many literatures. We defined them as Active Deep Learning (ADL) only if theirpredictor is deep model, where the basic learner is called as predictor and the labeling schemes iscalled selector. In this survey, three fundamental factors in selector designation were summarized. Wecategory ADL into model-driven ADL and data-driven ADL, by whether its selector is model-drivenor data-driven. The different characteristics of the two major type of ADL were addressed in indetail respectively. Furthermore, different sub-classes of data-driven and model-driven ADL are alsosummarized and discussed emphatically. The advantages and disadvantages between data-driven ADLand model-driven ADL are thoroughly analyzed. We pointed out that, with the development of deeplearning, the selector in ADL also is experiencing the stage from model-driven to data-driven. Finally,we make discussion on ADL about its uncertainty, explanatory, foundations of cognitive science etc.and survey on the trend of ADL from model-driven to data-driven.

cs.LG↗

arXiv2022

Entanglement Wedge Minimum Cross-Section in Holographic Axion Gravity Theories

We study the mixed state entanglement properties in two holographic axion models by examining the behavior of the entanglement wedge minimum cross section (EWCS), and comparing it with the holographic entanglement entropy (HEE) and mutual information (MI). We find that the behavior of HEE, MI and EWCS with Hawking temperature is monotonic, while the behavior with the axion parameter $k$ is more rich, which depends on the size of the configuration and the values of the other two parameters. Interestingly, the EWCS monotonically increases with the coupling constant $κ$ between the axion field and the Maxwell field, while HEE and MI can be non-monotonic. It suggests that the EWCS, as a mixed state entanglement measure, captures distinct degrees of freedom from the HEE and MI indeed. We also provide analytical understandings for most of the numerical results.

hep-th↗

arXiv2022

Entanglement Wedge Minimum Cross-Section for Holographic Aether Gravity

We study the entanglement wedge cross-section (EWCS) in holographic Aether gravity theory, a gravity theory with Lorentz symmetry violation while keeping the general covariance intact. We find that only a limited parameter space is allowed to obtain a black brane with positive Hawking temperature. Subject to these allowed parameter regions, we find that the EWCS could exhibit non-monotonic behaviors with system parameters. Meanwhile, the holographic entanglement entropy (HEE), and the corresponding mutual information (MI), can only exhibit monotonic behaviors. These phenomena suggest that the EWCS could capture much more rich content of the entanglement than that of the HEE and the MI. The role of the Lorentz violation in determining the behaviors of quantum information-related quantities is also analyzed.

hep-th↗

arXiv2022

Reflected Entropy in Double Holography

Recently, the reflected entropy is proposed in holographic approach to describe the entanglement of a bipartite quantum system in a mixed state, which is identified as the area of the reflected minimal surface inside the entanglement wedge. In this paper, we study the reflected entropy in the doubly holographic setup, which contains the degrees of freedom of quantum matter in the bulk. In this context, we propose a notion of quantum entanglement wedge cross-section, which may describe the reflected entropy with higher-order quantum corrections. We numerically compute the reflected entropy in pure AdS background and black hole background in four dimensions, respectively. In general, the reflected entropy contains the contribution from the geometry on the brane and the contribution from the CFT. We compute their proportion for different Newton constants and find that their behaviors are in agreement with the results based on the semi-classical gravity and the correlation of CFT coupled to the bath CFT.

hep-th↗

arXiv2022

Bayesian Nonparametric Mixtures of Exponential Random Graph Models for Ensembles of Networks

Ensembles of networks arise in various fields where multiple independent networks are observed on the same set of nodes, for example, a collection of brain networks constructed on the same brain regions for different individuals. However, there are few models that describe both the variations and characteristics of networks in an ensemble at the same time. In this paper, we propose to model the ensemble of networks using a Dirichlet Process Mixture of Exponential Random Graph Models (DPM-ERGMs), which divides the ensemble into different clusters and models each cluster of networks using a separate Exponential Random Graph Model (ERGM). By employing a Dirichlet process mixture, the number of clusters can be determined automatically and changed adaptively with the data provided. Moreover, in order to perform full Bayesian inference for DPM-ERGMs, we employ the intermediate importance sampling technique inside the Metropolis-within-slice sampling scheme, which addressed the problem of sampling from the intractable ERGMs on an infinite sample space. We also demonstrate the performance of DPM-ERGMs with both simulated and real datasets.

stat.ME↗

arXiv2022

A Symmetry-orientated Divide-and-Conquer Method for Crystal Structure Prediction

Crystal structure prediction has been a subject of topical interest, but remains a substantial challenge, especially for complex structures as it deals with the global minimization of the extremely rugged high-dimensional potential energy surface. In this manuscript, a symmetry-orientated divide-and-conquer scheme was proposed to construct a symmetry tree graph, where the entire search space is decomposed into a finite number of symmetry-dependent subspaces. An artificial intelligence-based symmetry selection strategy was subsequently devised to select the low-lying subspaces with high symmetries for global exploration and in-depth exploitation. Our approach can significantly simplify the problem of crystal structure prediction by avoiding exploration of the most complex P1 subspace on the entire search space and have the advantage of preserving the crystal symmetry during structure evolution, making it well suitable for predicting the complex crystal structures. The effectiveness of the method has been validated by successful prediction of the candidate structures of binary Lennard-Jones mixtures and high-pressure phase of ice, containing more than one hundred atoms in the simulation cell. The work, therefore, opens up an opportunity towards achieving the long-sought goal for crystal structure prediction of complex systems.

cond-mat.mtrl-sci↗

arXiv2021

Incompressible hypersurface, positive scalar curvature and positive mass theorem

In this paper, we prove for $n\leq 7$ that if a differentiable $n$-manifold contains a relatively incompressible essential hypersurface in some class $\mathcal C_{deg}$, then it admits no complete metric with positive scalar curvature. Based on this result, we show for $n\leq 7$ that surgeries between orientable $n$-manifolds and $n$-torus along incompressible sub-torus with codimension no less than $2$ still preserve the obstruction for complete metrics with positive scalar curvature. As an application, we establish positive mass theorem with incompressible conditions for asymptotically flat/conical manifolds with flat fiber $F$ (including ALF and ALG manifolds), which can be viewed as a generalization of the classical positive mass theorem from \cite{SY79PMT} and \cite{SY2017}. Finally, we investigate Gromov's fill-in problem and bound the total mean curvature for nonnegative scalar curvature fill-ins of flat $2$-toruses (an optimal bound is obtained for product $2$-toruses). This confirms the validity of Mantoulidis-Miao's definition of generalized Brown-York mass in \cite{MM2017} for flat $2$-toruses.

math.DG↗

arXiv2021

Sample Average Approximation for Stochastic Optimization with Dependent Data: Performance Guarantees and Tractability

Sample average approximation (SAA), a popular method for tractably solving stochastic optimization problems, enjoys strong asymptotic performance guarantees in settings with independent training samples. However, these guarantees are not known to hold generally with dependent samples, such as in online learning with time series data or distributed computing with Markovian training samples. In this paper, we show that SAA remains tractable when the distribution of unknown parameters is only observable through dependent instances and still enjoys asymptotic consistency and finite sample guarantees. Specifically, we provide a rigorous probability error analysis to derive $1 - β$ confidence bounds for the out-of-sample performance of SAA estimators and show that these estimators are asymptotically consistent. We then, using monotone operator theory, study the performance of a class of stochastic first-order algorithms trained on a dependent source of data. We show that approximation error for these algorithms is bounded and concentrates around zero, and establish deviation bounds for iterates when the underlying stochastic process is $ϕ$-mixing. The algorithms presented can be used to handle numerically inconvenient loss functions such as the sum of a smooth and non-smooth function or of non-smooth functions with constraints. To illustrate the usefulness of our results, we present several stochastic versions of popular algorithms such as stochastic proximal gradient descent (S-PGD), stochastic relaxed Peaceman--Rachford splitting algorithms (S-rPRS), and numerical experiment.

math.OC↗

arXiv2021

Association study between gene expression and multiple phenotypes in omics applications of complex diseases

Studying phenotype-gene association can uncover mechanism of diseases and develop efficient treatments. In complex disease where multiple phenotypes are available and correlated, analyzing and interpreting associated genes for each phenotype respectively may decrease statistical power and lose intepretation due to not considering the correlation between phenotypes. The typical approaches are many global testing methods, such as multivariate analysis of variance (MANOVA), which tests the overall association between phenotypes and each gene, without considersing the heterogeneity among phenotypes. In this paper, we extend and evaluate two p-value combination methods, adaptive weighted Fisher's method (AFp) and adaptive Fisher's method (AFz), to tackle this problem, where AFp stands out as our final proposed method, based on extensive simulations and a real application. Our proposed AFp method has three advantages over traditional global testing methods. Firstly, it can consider the heterogeneity of phenotypes and determines which specific phenotypes a gene is associated with, using phenotype specific 0-1 weights. Secondly, AFp takes the p-values from the test of association of each phenotype as input, thus can accommodate different types of phenotypes (continuous, binary and count). Thirdly, we also apply bootstrapping to construct a variability index for the weight estimator of AFp and generate a co-membership matrix to categorize (cluster) genes based on their association-patterns for intuitive biological investigations. Through extensive simulations, AFp shows superior performance over global testing methods in terms of type I error control and statistical power, as well as higher accuracy of 0-1 weights estimation over AFz. A real omics application with transcriptomic and clinical data of complex lung diseases demonstrates insightful biological findings of AFp.

stat.ME↗

arXiv2021

GreedyFool: Multi-Factor Imperceptibility and Its Application to Designing a Black-box Adversarial Attack

Adversarial examples are well-designed input samples, in which perturbations are imperceptible to the human eyes, but easily mislead the output of deep neural networks (DNNs). Existing works synthesize adversarial examples by leveraging simple metrics to penalize perturbations, that lack sufficient consideration of the human visual system (HVS), which produces noticeable artifacts. To explore why the perturbations are visible, this paper summarizes four primary factors affecting the perceptibility of human eyes. Based on this investigation, we design a multi-factor metric MulFactorLoss for measuring the perceptual loss between benign examples and adversarial ones. In order to test the imperceptibility of the multi-factor metric, we propose a novel black-box adversarial attack that is referred to as GreedyFool. GreedyFool applies differential evolution to evaluate the effects of perturbed pixels on the confidence of a target DNN, and introduces greedy approximation to automatically generate adversarial perturbations. We conduct extensive experiments on the ImageNet and CIFRA-10 datasets and a comprehensive user study with 60 participants. The experimental results demonstrate that MulFactorLoss is a more imperceptible metric than the existing pixelwise metrics, and GreedyFool achieves a 100% success rate in a black-box manner.

cs.LG↗