arXiv subjects

Peng Zhang

Publications and source records attributed to Peng Zhang.

At least 523 records · Page 29Linked to original sources

arXiv2022

Noise-Resilient Quantum Power Flow

Quantum power flow (QPF) provides inspiring directions for tackling power flow's computational burdens leveraging quantum computing. However, existing QPF methods are mainly based on noise-sensitive quantum algorithms, whose practical utilization is significantly hindered by the limited capability of today's noisy-intermediate-scale quantum (NISQ) devices. This paper devises a NISQ-QPF algorithm, which enables power flow calculation on noisy quantum computers. The main contributions include: (1) a variational quantum circuit (VQC)-based AC power flow formulation, which enables QPF using short-depth quantum circuits; (2) noise-resilient QPF solvers based on the variational quantum linear solver (VQLS) and modified fast decoupled power flow; (3) a practical NISQ-QPF framework for implementable and reliable power flow analysis on noisy quantum machines. Promising case studies validate the effectiveness and accuracy of NISQ-QPF on IBM's real, noisy quantum devices.

quant-ph↗

arXiv2022

Coherence-Assisted Superradiant Laser with Hz Linewidth and $10^{-10}$W Power

The superradiant laser, based on the clock transition between the electric ground state $^1$S$_0$ and the metastable state $^3$P$_0$ of fermionic alkaline-earth(-like) atoms, has been proposed to be a new promising light source with linewidth being the order of millihertz. However, due to the small $^1$S$_0$-to-$^3$P$_0$ transition strength, the steady-state power in that system is relatively low ($\sim 10^{-12}$W). In this work, we propose an alternative superradiant laser scheme based on a Raman-transition-induced coupling between the $^3$P$_0$ and $^3$P$_1$ states in bosonic alkaline-earth(-like) atoms, and achieve a laser with linewidth $\lesssim 2π\times1$Hz and power $\gtrsim 10^{-10}$W ($\sim 10^{3}$ photons in steady state) at a small pumping cost. The Raman beams play two significant roles in our scheme. First, the coherence between the dark and bright states induced by the Raman beams produce a new local minimum in the pumping-linewidth curve with pumping rate lower than $2π\times 10$kHz, which is beneficial for continuous output. Second, the Raman beams mix the long-lived $^3$P$_0$ state into the lasing state and thus reduce the linewidth. Our work greatly improves the output performance of the superradiant laser system with coherence induced by Raman transitions and may offer a firm foundation for its practical use in future.

quant-ph↗

arXiv2022

Measured potential profile in a quantum anomalous Hall system suggests bulk-dominated current flow

Ideally, quantum anomalous Hall systems should display zero longitudinal resistance. Yet in experimental quantum anomalous Hall systems elevated temperature can make the longitudinal resistance finite, indicating dissipative flow of electrons. Here, we show that the measured potentials at multiple locations within a device at elevated temperature are well-described by solution of Laplace's equation, assuming spatially-uniform conductivity, suggesting non-equilibrium current flows through the two-dimensional bulk. Extrapolation suggests that at even lower temperatures current may still flow primarily through the bulk rather than, as had been assumed, through edge modes. An argument for bulk current flow previously applied to quantum Hall systems supports this picture.

cond-mat.mes-hall↗

arXiv2022

Knowing the Past to Predict the Future: Reinforcement Virtual Learning

Reinforcement Learning (RL)-based control system has received considerable attention in recent decades. However, in many real-world problems, such as Batch Process Control, the environment is uncertain, which requires expensive interaction to acquire the state and reward values. In this paper, we present a cost-efficient framework, such that the RL model can evolve for itself in a Virtual Space using the predictive models with only historical data. The proposed framework enables a step-by-step RL model to predict the future state and select optimal actions for long-sight decisions. The main focuses are summarized as: 1) how to balance the long-sight and short-sight rewards with an optimal strategy; 2) how to make the virtual model interacting with real environment to converge to a final learning policy. Under the experimental settings of Fed-Batch Process, our method consistently outperforms the existing state-of-the-art methods.

cs.LG↗

arXiv2022

Hypergraph Convolutional Network based Weakly Supervised Point Cloud Semantic Segmentation with Scene-Level Annotations

Point cloud segmentation with scene-level annotations is a promising but challenging task. Currently, the most popular way is to employ the class activation map (CAM) to locate discriminative regions and then generate point-level pseudo labels from scene-level annotations. However, these methods always suffer from the point imbalance among categories, as well as the sparse and incomplete supervision from CAM. In this paper, we propose a novel weighted hypergraph convolutional network-based method, called WHCN, to confront the challenges of learning point-wise labels from scene-level annotations. Firstly, in order to simultaneously overcome the point imbalance among different categories and reduce the model complexity, superpoints of a training point cloud are generated by exploiting the geometrically homogeneous partition. Then, a hypergraph is constructed based on the high-confidence superpoint-level seeds which are converted from scene-level annotations. Secondly, the WHCN takes the hypergraph as input and learns to predict high-precision point-level pseudo labels by label propagation. Besides the backbone network consisting of spectral hypergraph convolution blocks, a hyperedge attention module is learned to adjust the weights of hyperedges in the WHCN. Finally, a segmentation network is trained by these pseudo point cloud labels. We comprehensively conduct experiments on the ScanNet and S3DIS segmentation datasets. Experimental results demonstrate that the proposed WHCN is effective to predict the point labels with scene annotations, and yields state-of-the-art results in the community. The source code is available at http://zhiyongsu.github.io/Project/WHCN.html.

cs.CV↗

arXiv2022

Biological free energy transduction is an Achilles heel of mean-field transport theory

Studies of nanoscale biological transport often use a mean-field approximation that is exact only when the system is at equilibrium and there are no interactions between particles on different sites in the network. We explore the limitations of this approximation to describe many-particle transport in the context of enzyme function and biological transport networks. Our focus is on three bioenergetic networks: a linear electron transfer chain (as found in bacterial nanowires), a redox-coupled proton pump (as in complex IV of respiration), and a near reversible electron bifurcation network (as in complex III of respiration and other recently discovered structures). Away from equilibrium and with typical site-site interactions, we find that the mean-field approximation adequately describes linear transport chains. However, the mean-field approximation fails catastrophically to describe energy-transducing systems, as in the redox coupled proton pump and reversible electron bifurcation reactions. The mean-field approximation fails to capture the essential correlations that are needed to prevent slippage events and to produce efficient energy transduction.

physics.bio-ph↗

arXiv2022

MorphTE: Injecting Morphology in Tensorized Embeddings

In the era of deep learning, word embeddings are essential when dealing with text tasks. However, storing and accessing these embeddings requires a large amount of space. This is not conducive to the deployment of these models on resource-limited devices. Combining the powerful compression capability of tensor products, we propose a word embedding compression method with morphological augmentation, Morphologically-enhanced Tensorized Embeddings (MorphTE). A word consists of one or more morphemes, the smallest units that bear meaning or have a grammatical function. MorphTE represents a word embedding as an entangled form of its morpheme vectors via the tensor product, which injects prior semantic and grammatical knowledge into the learning of embeddings. Furthermore, the dimensionality of the morpheme vector and the number of morphemes are much smaller than those of words, which greatly reduces the parameters of the word embeddings. We conduct experiments on tasks such as machine translation and question answering. Experimental results on four translation datasets of different languages show that MorphTE can compress word embedding parameters by about 20 times without performance loss and significantly outperforms related embedding compression methods.

cs.CL↗

arXiv2022

Programming Bare-Metal Accelerators with Heterogeneous Threading Models: A Case Study of Matrix-3000

As the hardware industry moves towards using specialized heterogeneous many-cores to avoid the effects of the power wall, software developers are finding it hard to deal with the complexity of these systems. This article shares our experience when developing a programming model and its supporting compiler and libraries for Matrix-3000, which is designed for next-generation exascale supercomputers but has a complex memory hierarchy and processor organization. To assist its software development, we developed a software stack from scratch that includes a low-level programming interface and a high-level OpenCL compiler. Our low-level programming model offers native programming support for using the bare-metal accelerators of Matrix-3000, while the high-level model allows programmers to use the OpenCL programming standard. We detail our design choices and highlight the lessons learned from developing systems software to enable the programming of bare-metal accelerators. Our programming models have been deployed to the production environment of an exascale prototype system.

cs.PL↗

arXiv2022

Iteratively Reweighte Least Squares Method for Estimating Polyserial and Polychoric Correlation Coefficients

An iteratively reweighted least squares (IRLS) method is proposed for estimating polyserial and polychoric correlation coefficients in this paper. It iteratively calculates the slopes in a series of weighted linear regression models fitting on conditional expected values. For polyserial correlation coefficient, conditional expectations of the latent predictor is derived from the observed ordinal categorical variable, and the regression coefficient is obtained using weighted least squares method. In estimating polychoric correlation coefficient, conditional expectations of the response variable and the predictor are updated in turns. Standard errors of the estimators are obtained using the delta method based on data summaries instead of the whole data. Conditional univariate normal distribution is exploited and a single integral is numerically evaluated in the proposed algorithm, comparing to the double integral computed numerically based on the bivariate normal distribution in the traditional maximum likelihood (ML) approaches. This renders the new algorithm very fast in estimating both polyserial and polychoric correlation coefficients. Thorough simulation studies are conducted to compare the performances of the proposed method with the classical ML methods. Real data analyses illustrate the advantage of the new method in computation speed.

stat.ME↗

arXiv2022

Secure and Efficient Multi-Signature Schemes for Fabric: An Enterprise Blockchain Platform

Digital signature is a major component of transactions on Blockchain platforms, especially in enterprise Blockchain platforms, where multiple signatures from a set of peers need to be produced to endorse a transaction. However, such process is often complex and time-consuming. Multi-signature, which can improve transaction efficiency by having a set of signers cooperate to produce a joint signature, has attracted extensive attentions. In this work, we propose two multi-signature schemes, GMS and AGMS, which are proved to be more secure and efficient than state-of-the-art multi-signature schemes. Besides, we implement the proposed schemes in a real Enterprise Blockchain platform, Fabric. Experiment results show that the proposed AGMS scheme helps achieve the goal of high transaction efficiency, low storage complexity, as well as high robustness against rogue-key attacks and k-sum problem attacks.

cs.CR↗

arXiv2022

DART: Articulated Hand Model with Diverse Accessories and Rich Textures

Hand, the bearer of human productivity and intelligence, is receiving much attention due to the recent fever of digital twins. Among different hand morphable models, MANO has been widely used in vision and graphics community. However, MANO disregards textures and accessories, which largely limits its power to synthesize photorealistic hand data. In this paper, we extend MANO with Diverse Accessories and Rich Textures, namely DART. DART is composed of 50 daily 3D accessories which varies in appearance and shape, and 325 hand-crafted 2D texture maps covers different kinds of blemishes or make-ups. Unity GUI is also provided to generate synthetic hand data with user-defined settings, e.g., pose, camera, background, lighting, textures, and accessories. Finally, we release DARTset, which contains large-scale (800K), high-fidelity synthetic hand images, paired with perfect-aligned 3D labels. Experiments demonstrate its superiority in diversity. As a complement to existing hand datasets, DARTset boosts the generalization in both hand pose estimation and mesh recovery tasks. Raw ingredients (textures, accessories), Unity GUI, source code and DARTset are publicly available at dart2022.github.io

cs.CV↗

arXiv2022

First search for the absorption of fermionic dark matter with the PandaX-4T experiment

Compared with the signature of dark matter elastic scattering off nuclei, the absorption of fermionic dark matter by nuclei opens up a new searching channel for light dark matter with a characteristic monoenergetic signal. In this Letter, we explore the $95.0$-day data from the PandaX-4T commissioning run and report the first dedicated searching results of the fermionic dark matter absorption signal through a neutral current process. No significant signal was found, and the lowest limit on the dark matter-nucleon interaction cross section is set to be $1.5\times10^{-50}$ cm$^2$ for a fermionic dark matter mass of $40$ MeV/$c^2$ with 90\% confidence level.

hep-ex↗

arXiv2022

Multi-Scale Wavelet Transformer for Face Forgery Detection

Currently, many face forgery detection methods aggregate spatial and frequency features to enhance the generalization ability and gain promising performance under the cross-dataset scenario. However, these methods only leverage one level frequency information which limits their expressive ability. To overcome these limitations, we propose a multi-scale wavelet transformer framework for face forgery detection. Specifically, to take full advantage of the multi-scale and multi-frequency wavelet representation, we gradually aggregate the multi-scale wavelet representation at different stages of the backbone network. To better fuse the frequency feature with the spatial features, frequency-based spatial attention is designed to guide the spatial feature extractor to concentrate more on forgery traces. Meanwhile, cross-modality attention is proposed to fuse the frequency features with the spatial features. These two attention modules are calculated through a unified transformer block for efficiency. A wide variety of experiments demonstrate that the proposed method is efficient and effective for both within and cross datasets.

cs.CV↗

arXiv2022

OAG-BERT: Towards A Unified Backbone Language Model For Academic Knowledge Services

Academic knowledge services have substantially facilitated the development of the science enterprise by providing a plenitude of efficient research tools. However, many applications highly depend on ad-hoc models and expensive human labeling to understand scientific contents, hindering deployments into real products. To build a unified backbone language model for different knowledge-intensive academic applications, we pre-train an academic language model OAG-BERT that integrates both the heterogeneous entity knowledge and scientific corpora in the Open Academic Graph (OAG) -- the largest public academic graph to date. In OAG-BERT, we develop strategies for pre-training text and entity data along with zero-shot inference techniques. In OAG-BERT, we develop strategies for pre-training text and entity data along with zero-shot inference techniques. Its zero-shot capability furthers the path to mitigate the need of expensive annotations. OAG-BERT has been deployed for real-world applications, such as the reviewer recommendation function for National Nature Science Foundation of China (NSFC) -- one of the largest funding agencies in China -- and paper tagging in AMiner. All codes and pre-trained models are available via the CogDL toolkit.

cs.CL↗

arXiv2022

Enhanced Secure Wireless Transmission Using IRS-aided Directional Modulation

As an excellent aided communication tool, intelligent reflecting surface (IRS) can make a significant rate enhancement and coverage extension. In this paper, we present an investigation on beamforming in an IRS-aided directional modulation (DM) network. To fully explore the advantages of IRS, two beamforming methods with enhanced secrecy rate (SR) performance are proposed. The first method of maximizing secrecy rate (Max-SR) alternately optimizes confidential message (CM) beamforming vector, artificial noise (AN) beamforming vector and phase shift matrix. The first optimization vector is directly computed by the Rayleigh ratio and the last two are solved with generalized power iteration (GPI). This method is called Max-SR-GPI. To reduce the computational complexity, a new method of maximizing receive power with zero-forcing constraint (Max-RP-ZFC) of only reflecting CM and no AN is proposed. Simulation results show that the proposed two methods harvest about 30 percent rate gains over the cases of random-phase IRS and no IRS, and the proposed Max-SR-GPI performs slightly better than the Max-RP-ZFC in terms of SR, particularly in the small-large IRS.

eess.SP↗

arXiv2022

DyStyle: Dynamic Neural Network for Multi-Attribute-Conditioned Style Editing

The semantic controllability of StyleGAN is enhanced by unremitting research. Although the existing weak supervision methods work well in manipulating the style codes along one attribute, the accuracy of manipulating multiple attributes is neglected. Multi-attribute representations are prone to entanglement in the StyleGAN latent space, while sequential editing leads to error accumulation. To address these limitations, we design a Dynamic Style Manipulation Network (DyStyle) whose structure and parameters vary by input samples, to perform nonlinear and adaptive manipulation of latent codes for flexible and precise attribute control. In order to efficient and stable optimization of the DyStyle network, we propose a Dynamic Multi-Attribute Contrastive Learning (DmaCL) method: including dynamic multi-attribute contrastor and dynamic multi-attribute contrastive loss, which simultaneously disentangle a variety of attributes from the generative image and latent space of model. As a result, our approach demonstrates fine-grained disentangled edits along multiple numeric and binary attributes. Qualitative and quantitative comparisons with existing style manipulation methods verify the superiority of our method in terms of the multi-attribute control accuracy and identity preservation without compromising photorealism.

cs.CV↗

arXiv2022

Multi-frequency PolSAR Image Fusion Classification Based on Semantic Interactive Information and Topological Structure

Compared with the rapid development of single-frequency multi-polarization SAR image classification technology, there is less research on the land cover classification of multifrequency polarimetric SAR (MF-PolSAR) images. In addition, the current deep learning methods for MF-PolSAR classification are mainly based on convolutional neural networks (CNNs), only local spatiality is considered but the nonlocal relationship is ignored. Therefore, based on semantic interaction and nonlocal topological structure, this paper proposes the MF semantics and topology fusion network (MF-STFnet) to improve MF-PolSAR classification performance. In MF-STFnet, two kinds of classification are implemented for each band, semantic information-based (SIC) and topological property-based (TPC). They work collaboratively during MF-STFnet training, which can not only fully leverage the complementarity of bands, but also combine local and nonlocal spatial information to improve the discrimination between different categories. For SIC, the designed crossband interactive feature extraction module (CIFEM) is embedded to explicitly model the deep semantic correlation among bands, thereby leveraging the complementarity of bands to make ground objects more separable. For TPC, the graph sample and aggregate network (GraphSAGE) is employed to dynamically capture the representation of nonlocal topological relations between land cover categories. In this way, the robustness of classification can be further improved by combining nonlocal spatial information. Finally, an adaptive weighting fusion (AWF) strategy is proposed to merge inference from different bands, so as to make the MF joint classification decisions of SIC and TPC. The comparative experiments show that MF-STFnet can achieve more competitive classification performance than some state-of-the-art methods.

eess.IV↗

arXiv2022

Graph Contrastive Learning for Anomaly Detection

Graph-based anomaly detection has been widely used for detecting malicious activities in real-world applications. Existing attempts to address this problem have thus far focused on structural feature engineering or learning in the binary classification regime. In this work, we propose to leverage graph contrastive coding and present the supervised GraphCAD model for contrasting abnormal nodes with normal ones in terms of their distances to the global context (e.g., the average of all nodes). To handle scenarios with scarce labels, we further enable GraphCAD as a self-supervised framework by designing a graph corrupting strategy for generating synthetic node labels. To achieve the contrastive objective, we design a graph neural network encoder that can infer and further remove suspicious links during message passing, as well as learn the global context of the input graph. We conduct extensive experiments on four public datasets, demonstrating that 1) GraphCAD significantly and consistently outperforms various advanced baselines and 2) its self-supervised version without fine-tuning can achieve comparable performance with its fully supervised version.

cs.LG↗