arXiv subjects

Chao Wang

Publications and source records attributed to Chao Wang.

At least 469 records · Page 26Linked to original sources

arXiv2022

Understanding Concurrency Vulnerabilities in Linux Kernel

While there is a large body of work on analyzing concurrency related software bugs and developing techniques for detecting and patching them, little attention has been given to concurrency related security vulnerabilities. The two are different in that not all bugs are vulnerabilities: for a bug to be exploitable, there needs be a way for attackers to trigger its execution and cause damage, e.g., by revealing sensitive data or running malicious code. To fill the gap, we conduct the first empirical study of concurrency vulnerabilities reported in the Linux operating system in the past ten years. We focus on analyzing the confirmed vulnerabilities archived in the Common Vulnerabilities and Exposures (CVE) database, which are then categorized into different groups based on bug types, exploit patterns, and patch strategies adopted by developers. We use code snippets to illustrate individual vulnerability types and patch strategies. We also use statistics to illustrate the entire landscape, including the percentage of each vulnerability type. We hope to shed some light on the problem, e.g., concurrency vulnerabilities continue to pose a serious threat to system security, and it is difficult even for kernel developers to analyze and patch them. Therefore, more efforts are needed to develop tools and techniques for analyzing and patching these vulnerabilities.

cs.CR↗

arXiv2022

Entanglement entropy scaling of noisy random quantum circuits in two dimensions

Whether noisy quantum devices without error correction can provide quantum advantage over classical computers is a critical issue of current quantum computation. In this work, the random quantum circuits, which are used as the paradigm model to demonstrate quantum advantage, are simulated with depolarizing noise on experiment relevant two-dimensional architecture. With comprehensive numerical simulation and theoretical analysis, we find that the maximum achievable operator entanglement entropy, which indicates maximal simulation cost, has area law scaling with the system size for constant noise rate. On the other hand, we also find that the maximum achievable operator entanglement entropy has power law scaling with the noise rate for fixed system size, and the volume law scaling can be obtained only if the noise rate decreases when system size increase.

quant-ph↗

arXiv2022

State-Aware Proximal Pessimistic Algorithms for Offline Reinforcement Learning

Pessimism is of great importance in offline reinforcement learning (RL). One broad category of offline RL algorithms fulfills pessimism by explicit or implicit behavior regularization. However, most of them only consider policy divergence as behavior regularization, ignoring the effect of how the offline state distribution differs with that of the learning policy, which may lead to under-pessimism for some states and over-pessimism for others. Taking account of this problem, we propose a principled algorithmic framework for offline RL, called \emph{State-Aware Proximal Pessimism} (SA-PP). The key idea of SA-PP is leveraging discounted stationary state distribution ratios between the learning policy and the offline dataset to modulate the degree of behavior regularization in a state-wise manner, so that pessimism can be implemented in a more appropriate way. We first provide theoretical justifications on the superiority of SA-PP over previous algorithms, demonstrating that SA-PP produces a lower suboptimality upper bound in a broad range of settings. Furthermore, we propose a new algorithm named \emph{State-Aware Conservative Q-Learning} (SA-CQL), by building SA-PP upon representative CQL algorithm with the help of DualDICE for estimating discounted stationary state distribution ratios. Extensive experiments on standard offline RL benchmark show that SA-CQL outperforms the popular baselines on a large portion of benchmarks and attains the highest average return.

cs.LG↗

arXiv2022

GlowGAN: Unsupervised Learning of HDR Images from LDR Images in the Wild

Most in-the-wild images are stored in Low Dynamic Range (LDR) form, serving as a partial observation of the High Dynamic Range (HDR) visual world. Despite limited dynamic range, these LDR images are often captured with different exposures, implicitly containing information about the underlying HDR image distribution. Inspired by this intuition, in this work we present, to the best of our knowledge, the first method for learning a generative model of HDR images from in-the-wild LDR image collections in a fully unsupervised manner. The key idea is to train a generative adversarial network (GAN) to generate HDR images which, when projected to LDR under various exposures, are indistinguishable from real LDR images. The projection from HDR to LDR is achieved via a camera model that captures the stochasticity in exposure and camera response function. Experiments show that our method GlowGAN can synthesize photorealistic HDR images in many challenging cases such as landscapes, lightning, or windows, where previous supervised generative models produce overexposed images. We further demonstrate the new application of unsupervised inverse tone mapping (ITM) enabled by GlowGAN. Our ITM method does not need HDR images or paired multi-exposure images for training, yet it reconstructs more plausible information for overexposed regions than state-of-the-art supervised learning models trained on such data.

cs.CV↗

arXiv2022

A Multi-Transformation Evolutionary Framework for Influence Maximization in Social Networks

Influence maximization is a crucial issue for mining the deep information of social networks, which aims to select a seed set from the network to maximize the number of influenced nodes. To evaluate the influence spread of a seed set efficiently, existing studies have proposed transformations with lower computational costs to replace the expensive Monte Carlo simulation process. These alternate transformations, based on network prior knowledge, induce different search behaviors with similar characteristics to various perspectives. Specifically, it is difficult for users to determine a suitable transformation a priori. This article proposes a multi-transformation evolutionary framework for influence maximization (MTEFIM) with convergence guarantees to exploit the potential similarities and unique advantages of alternate transformations and to avoid users manually determining the most suitable one. In MTEFIM, multiple transformations are optimized simultaneously as multiple tasks. Each transformation is assigned an evolutionary solver. Three major components of MTEFIM are conducted via: 1) estimating the potential relationship across transformations based on the degree of overlap across individuals of different populations, 2) transferring individuals across populations adaptively according to the inter-transformation relationship, and 3) selecting the final output seed set containing all the transformation's knowledge. The effectiveness of MTEFIM is validated on both benchmarks and real-world social networks. The experimental results show that MTEFIM can efficiently utilize the potentially transferable knowledge across multiple transformations to achieve highly competitive performance compared to several popular IM-specific methods. The implementation of MTEFIM can be accessed at https://github.com/xiaofangxd/MTEFIM.

cs.NE↗

arXiv2022

A Bayesian realized threshold measurement GARCH framework for financial tail risk forecasting

This paper proposes an innovative threshold measurement equation to be employed in a Realized-GARCH framework. The proposed framework incorporates a nonlinear threshold regression specification to consider the leverage effect and model the contemporaneous dependence between the observed realized measure and hidden volatility. A Bayesian Markov Chain Monte Carlo method is adapted and employed for model estimation, with its validity assessed via a simulation study. The validity of incorporating the proposed measurement equation in Realized-GARCH type models is evaluated via an empirical study, forecasting the 1% and 2.5% Value-at-Risk and Expected Shortfall on six market indices with two different out-of-sample sizes. The proposed framework is shown to be capable of producing competitive tail risk forecasting results in comparison to the GARCH and Realized-GARCH type models.

q-fin.RM↗

arXiv2022

Thermodynamic geometry of the RN-AdS black hole and non-local observables

In this paper, we show the relation between the thermodynamic geometry of a four-dimensional Reissner-Nordstrom-AdS (RN-AdS) black hole and non-local observables in boundary field theory. Instead of introducing the critical point associating with the black hole charge to nondimensionalize the thermodynamics parameters, we use the cosmological constant to rescale these variables, so that a universal specific equation of state of the black hole is obtained. Further, the correspondence between thermodynamic properties of the black hole and the oscillating behaviors of the non-local observables has been studied numerically. Our results indicate that the study of the dual field theory will reveal to us the thermodynamic geometry of the AdS black hole.

gr-qc↗

arXiv2022

Ruppeiner geometry and the fluctuation of the RN-AdS black hole in framework of the extensive thermodynamics

The Ruppeiner geometry and the fluctuation for a four-dimensional charged AdS black hole in the framework of the extensive thermodynamics have been investigated. By fixing the AdS radius of Vissers construction, the extensive thermodynamics of the RN-AdS black hole is established, and the central charge plays the role of particle number. With the thermodynamic variables density, we reexamine the phase transition of the black hole, and the result will hold for the black holes under different gravitational models. Moreover, we have studied the Ruppeiner geometry and the black hole fluctuation, and show that the increase of central charge will reduce the fluctuation probability.

gr-qc↗

arXiv2022

Generalization to the Natural Gradient Descent

Optimization problem, which is aimed at finding the global minimal value of a given cost function, is one of the central problem in science and engineering. Various numerical methods have been proposed to solve this problem, among which the Gradient Descent (GD) method is the most popular one due to its simplicity and efficiency. However, the GD method suffers from two main issues: the local minima and the slow convergence especially near the minima point. The Natural Gradient Descent(NGD), which has been proved as one of the most powerful method for various optimization problems in machine learning, tensor network, variational quantum algorithms and so on, supplies an efficient way to accelerate the convergence. Here, we give a unified method to extend the NGD method to a more general situation which keeps the fast convergence by looking for a more suitable metric through introducing a 'proper' reference Riemannian manifold. Our method generalizes the NDG, and may give more insight of the optimization methods.

math.OC↗

arXiv2022

A Principled Design of Image Representation: Towards Forensic Tasks

Image forensics is a rising topic as the trustworthy multimedia content is critical for modern society. Like other vision-related applications, forensic analysis relies heavily on the proper image representation. Despite the importance, current theoretical understanding for such representation remains limited, with varying degrees of neglect for its key role. For this gap, we attempt to investigate the forensic-oriented image representation as a distinct problem, from the perspectives of theory, implementation, and application. Our work starts from the abstraction of basic principles that the representation for forensics should satisfy, especially revealing the criticality of robustness, interpretability, and coverage. At the theoretical level, we propose a new representation framework for forensics, called Dense Invariant Representation (DIR), which is characterized by stable description with mathematical guarantees. At the implementation level, the discrete calculation problems of DIR are discussed, and the corresponding accurate and fast solutions are designed with generic nature and constant complexity. We demonstrate the above arguments on the dense-domain pattern detection and matching experiments, providing comparison results with state-of-the-art descriptors. Also, at the application level, the proposed DIR is initially explored in passive and active forensics, namely copy-move forgery detection and perceptual hashing, exhibiting the benefits in fulfilling the requirements of such forensic tasks.

cs.CV↗

arXiv2022

A quantum spin liquid phase in the Kitaev-Hubbard model

The quantum spin liquid (QSL) state has been searched intensively in Kitaev-like materials, such as the Iridium oxides $A_2$IrO$_3$ and $α$-RuCl$_3$. The half-filled Kitaev-Hubbard model with bond dependent hopping terms is used to describe the Kitaev-like materials, which is calculated using the state-of-the-art fermionic projected entangled pair states (fPEPS) method. We find a QSL phase near the Mott insulator transition, which has a strong first-order transition to the semi-metal phase with the decrease of Hubbard $U$. We suggest that a promising routine to find the QSL is to find the Iridium oxides that are near the Mott insulator transitions.

cond-mat.str-el↗

arXiv2022

Hybrid Eyes: Design and Evaluation of the Prediction-level Cooperative Driving with a Real-world Automated Driving System

Currently, there are still various situations in which automated driving systems (ADS) cannot perform as well as a human driver, particularly in predicting the behaviour of surrounding traffic. As humans are still surpassing state-of-the-art ADS in this task, a new concept enabling human driver to help ADS to better anticipate the behaviour of other road users was developed. Preliminary results suggested that the collaboration at the prediction level can effectively enhance the experience and comfort of ADS. For an in-depth investigation of the concept, we implemented an interactive prototype, called Prediction-level Cooperative Automated Driving system (PreCoAD), adapting an existing ADS that has been previously validated on the public road. The results of a driving simulator study among 15 participants in different highway scenarios showed that PreCoAD could enhance automated driving performance and provide a positive user experience. Follow-up interviews with participants also provided insights into the improvement of the system.

cs.HC↗

arXiv2022

A Cooperative Deception Strategy for Covert Communication in Presence of a Multi-antenna Adversary

Covert transmission is investigated for a cooperative deception strategy, where a cooperative jammer (Jammer) tries to attract a multi-antenna adversary (Willie) and degrade the adversary's reception ability for the signal from a transmitter (Alice). For this strategy, we formulate an optimization problem to maximize the covert rate when three different types of channel state information (CSI) are available. The total power is optimally allocated between Alice and Jammer subject to Kullback-Leibler (KL) divergence constraint. Different from the existing literature, in our proposed strategy, we also determine the optimal transmission power at the jammer when Alice is silent, while existing works always assume that the jammer's power is fixed. Specifically, we apply the S-procedure to convert infinite constraints into linear-matrix-inequalities (LMI) constraints. When statistical CSI at Willie is available, we convert double integration to single integration using asymptotic approximation and substitution method. In addition, the transmission strategy without jammer deception is studied as a benchmark. Finally, our simulation results show that for the proposed strategy, the covert rate is increased with the number of antennas at Willie. Moreover, compared to the benchmark, our proposed strategy is more robust in face of imperfect CSI.

eess.SP↗

arXiv2022

The path integral formula for the stochastic evolutionary game dynamics in the Moran process

The Moran process is one of an basic mathematical structure in the evolutionary game theory. In this work, we introduce the formulation of the path integral approach for evolutionary game theory based on the Moran process. We derive the transition probability by the path integral from the initial state to the final state with updating rule of the Moran process. In this framework, the transition probability is the sum of all the evolutionary paths. The path integral formula of the transition probability maybe expected to be a new mathematical tool to explore the stochastic game evolutionary dynamics.

q-bio.PE↗

arXiv2022

K-doped Ba122 epitaxial thin film on MgO substrate by buffer engineering

Molecular beam epitaxy of K-doped Ba122 (Ba$_{1-x}$K$_x$Fe$_\text{2}$As$_\text{2}$) superconductor was realized on a MgO substrate. Microstructural observation revealed that the undoped Ba122 served as a perfect buffer layer for epitaxial growth of the K-doped Ba122. The film exhibited a high critical temperature of 39.8 K and a high critical current density of 3.9 MA/cm$^\text{2}$ at 4 K. The successful growth of epitaxial thin film will enable artificial single grain boundary on oxide bicrystal substrates and reveal the grain boundary transport nature of K-doped Ba122.

cond-mat.supr-con↗

arXiv2022

Deciphering the long-distance penguin contribution to $\bar B_{d, s} \to γγ$ decays

We compute for the first time the long-distance penguin contribution to the double radiative $B$-meson decays due to the purely hadronic operators acting with the electromagnetic current in the background soft-gluon field from first field-theoretical principles by introducing a novel subleading $B$-meson distribution amplitude. The numerically dominant penguin amplitude arises from the soft-gluon radiation off the light up-quark loop rather than the counterpart charm-loop effect on account of the peculiar analytical behaviour of the short-distance hard-collinear function. Importantly the long-distance up-quark penguin contribution brings about the substantial cancellation of the known factorizable power correction possessing the same multiplication CKM parameters, thus enabling $B_{d, \, s} \to γγ$ to become new benchmark probes of physics beyond the Standard Model.

hep-ph↗

arXiv2022

FL-Tuning: Layer Tuning for Feed-Forward Network in Transformer

Prompt tuning is an emerging way of adapting pre-trained language models to downstream tasks. However, the existing studies are mainly to add prompts to the input sequence. This way would not work as expected due to the intermediate multi-head self-attention and feed-forward network computation, making model optimization not very smooth. Hence, we propose a novel tuning way called layer tuning, aiming to add learnable parameters in Transformer layers. Specifically, we focus on layer tuning for feed-forward network in the Transformer, namely FL-tuning. It introduces additional units into the hidden layer of each feed-forward network. We conduct extensive experiments on the public CLUE benchmark. The results show that: 1) Our FL-tuning outperforms prompt tuning methods under both full-data and few-shot settings in almost all cases. In particular, it improves accuracy by 17.93% (full-data setting) on WSC 1.0 and F1 by 16.142% (few-shot setting) on CLUENER over P-tuning v2. 2) Our FL-tuning is more stable and converges about 1.17 times faster than P-tuning v2. 3) With only about 3% of Transformer's parameters to be trained, FL-tuning is comparable with fine-tuning on most datasets, and significantly outperforms fine-tuning (e.g., accuracy improved by 12.9% on WSC 1.1) on several datasets. The source codes are available at https://github.com/genggui001/FL-Tuning.

cs.CL↗

arXiv2022

Rethinking Reinforcement Learning based Logic Synthesis

Recently, reinforcement learning has been used to address logic synthesis by formulating the operator sequence optimization problem as a Markov decision process. However, through extensive experiments, we find out that the learned policy makes decisions independent from the circuit features (i.e., states) and yields an operator sequence that is permutation invariant to some extent in terms of operators. Based on these findings, we develop a new RL-based method that can automatically recognize critical operators and generate common operator sequences generalizable to unseen circuits. Our algorithm is verified on both the EPFL benchmark, a private dataset and a circuit at industrial scale. Experimental results demonstrate that it achieves a good balance among delay, area and runtime, and is practical for industrial usage.

cs.LG↗