Searcharxiv⌕ Search

arXiv subjects

Weiping Li

Publications and source records attributed to Weiping Li.

At least 55 records · Page 3Linked to original sources

Asynchronous Episodic Deep Deterministic Policy Gradient: Towards Continuous Control in Computationally Complex Environments

Deep Deterministic Policy Gradient (DDPG) has been proved to be a successful reinforcement learning (RL) algorithm for continuous control tasks. However, DDPG still suffers from data insufficiency and training inefficiency, especially in computationally complex environments. In this paper, we propose Asynchronous Episodic DDPG (AE-DDPG), as an expansion of DDPG, which can achieve more effective learning with less training time required. First, we design a modified scheme for data collection in an asynchronous fashion. Generally, for asynchronous RL algorithms, sample efficiency or/and training stability diminish as the degree of parallelism increases. We consider this problem from the perspectives of both data generation and data utilization. In detail, we re-design experience replay by introducing the idea of episodic control so that the agent can latch on good trajectories rapidly. In addition, we also inject a new type of noise in action space to enrich the exploration behaviors. Experiments demonstrate that our AE-DDPG achieves higher rewards and requires less time consuming than most popular RL algorithms in Learning to Run task which has a computationally complex environment. Not limited to the control tasks in computationally complex environments, AE-DDPG also achieves higher rewards and 2- to 4-fold improvement in sample efficiency on average compared to other variants of DDPG in MuJoCo environments. Furthermore, we verify the effectiveness of each proposed technique component through abundant ablation study.

cs.LG↗

Hybrid Distortion Aggregated Visual Comfort Assessment for Stereoscopic Image Retargeting

Visual comfort is a quite important factor in 3D media service. Few research efforts have been carried out in this area especially in case of 3D content retargeting which may introduce more complicated visual distortions. In this paper, we propose a Hybrid Distortion Aggregated Visual Comfort Assessment (HDA-VCA) scheme for stereoscopic retargeted images (SRI), considering aggregation of hybrid distortions including structure distortion, information loss, binocular incongruity and semantic distortion. Specifically, a Local-SSIM feature is proposed to reflect the local structural distortion of SRI, and information loss is represented by Dual Natural Scene Statistics (D-NSS) feature extracted from the binocular summation and difference channels. Regarding binocular incongruity, visual comfort zone, window violation, binocular rivalry, and accommodation-vergence conflict of human visual system (HVS) are evaluated. Finally, the semantic distortion is represented by the correlation distance of paired feature maps extracted from original stereoscopic image and its retargeted image by using trained deep neural network. We validate the effectiveness of HDA-VCA on published Stereoscopic Image Retargeting Database (SIRD) and two stereoscopic image databases IEEE-SA and NBU 3D-VCA. The results demonstrate HDA-VCA's superior performance in handling hybrid distortions compared to state-of-the-art VCA schemes.

cs.MM↗

Locating earthquakes with a network of seismic stations via a deep learning method

The accurate and automated determination of earthquake locations is still a challenging endeavor. However, such information is critical for monitoring seismic activity and assessing potential hazards in real time. Recently, a convolutional neural network was applied to detect earthquakes from single-station waveforms and approximately map events across several large surface areas. In this study, we locate 194 earthquakes induced during oil and gas operations in Oklahoma, USA, within an error range of approximately 4.9 km on average to the epicenter and 1.0 km to the depth in catalogs with data from 30 network stations by applying the fully convolutional network. The network is trained by 1,013 historic events, and the output is a 3D volume of the event location probability in the Earth. The trained system requires approximately one hundredth of a second to locate an event without the need for any velocity model or human interference.

physics.geo-ph↗

Review of Deep Learning

In recent years, China, the United States and other countries, Google and other high-tech companies have increased investment in artificial intelligence. Deep learning is one of the current artificial intelligence research's key areas. This paper analyzes and summarizes the latest progress and future research directions of deep learning. Firstly, three basic models of deep learning are outlined, including multilayer perceptrons, convolutional neural networks, and recurrent neural networks. On this basis, we further analyze the emerging new models of convolution neural networks and recurrent neural networks. This paper then summarizes deep learning's applications in many areas of artificial intelligence, including speech processing, computer vision, natural language processing and so on. Finally, this paper discusses the existing problems of deep learning and gives the corresponding possible solutions.

cs.LG↗

Distortion Bounds for Source Broadcast Problems

This paper investigates the joint source-channel coding problem of sending a memoryless source over a memoryless broadcast channel. An inner bound and several outer bounds on the admissible distortion region are derived, which respectively generalize and unify several existing bounds. As a consequence, we also obtain an inner bound and an outer bound for the degraded broadcast channel case. When specialized to the Gaussian or binary source broadcast, the inner bound and outer bound not only recover the best known inner bound and outer bound in the literature, but also generate some new results. Besides, we also extend the inner bound and outer bounds to the Wyner-Ziv source broadcast problem, i.e., source broadcast with side information available at decoders. Some new bounds are obtained when specialized to the Wyner-Ziv Gaussian and Wyner-Ziv binary cases.

cs.IT↗

Exploiting Data and Human Knowledge for Predicting Wildlife Poaching

Poaching continues to be a significant threat to the conservation of wildlife and the associated ecosystem. Estimating and predicting where the poachers have committed or would commit crimes is essential to more effective allocation of patrolling resources. The real-world data in this domain is often sparse, noisy and incomplete, consisting of a small number of positive data (poaching signs), a large number of negative data with label uncertainty, and an even larger number of unlabeled data. Fortunately, domain experts such as rangers can provide complementary information about poaching activity patterns. However, this kind of human knowledge has rarely been used in previous approaches. In this paper, we contribute new solutions to the predictive analysis of poaching patterns by exploiting both very limited data and human knowledge. We propose an approach to elicit quantitative information from domain experts through a questionnaire built upon a clustering-based division of the conservation area. In addition, we propose algorithms that exploit qualitative and quantitative information provided by the domain experts to augment the dataset and improve learning. In collaboration with World Wild Fund for Nature, we show that incorporating human knowledge leads to better predictions in a conservation area in Northeastern China where the charismatic species is Siberian Tiger. The results show the importance of exploiting human knowledge when learning from limited data.

cs.CY↗

An influence-based fast preceding questionnaire model for elderly assessments

To improve the efficiency of elderly assessments, an influence-based fast preceding questionnaire model (FPQM) is proposed. Compared with traditional assessments, the FPQM optimizes questionnaires by reordering their attributes. The values of low-ranking attributes can be predicted by the values of the high-ranking attributes. Therefore, the number of attributes can be reduced without redesigning the questionnaires. A new function for calculating the influence of the attributes is proposed based on probability theory. Reordering and reducing algorithms are given based on the attributes' influences. The model is verified through a practical application. The practice in an elderly-care company shows that the FPQM can reduce the number of attributes by 90.56% with a prediction accuracy of 98.39%. Compared with other methods, such as the Expert Knowledge, Rough Set and C4.5 methods, the FPQM achieves the best performance. In addition, the FPQM can also be applied to other questionnaires.

cs.AI↗

Joint Source-Channel Secrecy Using Uncoded Schemes: Towards Secure Source Broadcast

This paper investigates a joint source-channel secrecy problem for the Shannon cipher broadcast system. We suppose list secrecy is applied, i.e., a wiretapper is allowed to produce a list of reconstruction sequences and the secrecy is measured by the minimum distortion over the entire list. For discrete communication cases, we propose a permutation-based uncoded scheme, which cascades a random permutation with a symbol-by-symbol mapping. Using this scheme, we derive an inner bound for the admissible region of secret key rate, list rate, wiretapper distortion, and distortions of legitimate users. For the converse part, we easily obtain an outer bound for the admissible region from an existing result. Comparing the outer bound with the inner bound shows that the proposed scheme is optimal under certain conditions. Besides, we extend the proposed scheme to the scalar and vector Gaussian communication scenarios, and characterize the corresponding performance as well. For these two cases, we also propose another uncoded scheme, orthogonal-transform-based scheme, which achieves the same performance as the permutation-based scheme. Interestingly, by introducing the random permutation or the random orthogonal transform into the traditional uncoded scheme, the proposed uncoded schemes, on one hand, provide a certain level of secrecy, and on the other hand, do not lose any performance in terms of the distortions for legitimate users.

cs.IT↗

Source-Channel Secrecy for Shannon Cipher System

Recently, a secrecy measure based on list-reconstruction has been proposed [2], in which a wiretapper is allowed to produce a list of $2^{mR_{L}}$ reconstruction sequences and the secrecy is measured by the minimum distortion over the entire list. In this paper, we show that this list secrecy problem is equivalent to the one with secrecy measured by a new quantity \emph{lossy-equivocation}, which is proven to be the minimum optimistic 1-achievable source coding rate (the minimum coding rate needed to reconstruct the source within target distortion with positive probability for \emph{infinitely many blocklengths}) of the source with the wiretapped signal as two-sided information, and also can be seen as a lossy extension of conventional equivocation. Upon this (or list) secrecy measure, we study source-channel secrecy problem in the discrete memoryless Shannon cipher system with \emph{noisy} wiretap channel. Two inner bounds and an outer bound on the achievable region of secret key rate, list rate, wiretapper distortion, and distortion of legitimate user are given. The inner bounds are derived by using uncoded scheme and (operationally) separate scheme, respectively. Thanks to the equivalence between lossy-equivocation secrecy and list secrecy, information spectrum method is leveraged to prove the outer bound. As special cases, the admissible region for the case of degraded wiretap channel or lossless communication for legitimate user has been characterized completely. For both these two cases, separate scheme is proven to be optimal. Interestingly, however, separation indeed suffers performance loss for other certain cases. Besides, we also extend our results to characterize the achievable region for Gaussian communication case. As a side product optimistic lossy source coding has also been addressed.

cs.IT↗

Comments on "Approximate Characterizations for the Gaussian Source Broadcast Distortion Region"

Recently, Tian et al. [1] considered joint source-channel coding of transmitting a Gaussian source over $K$-user Gaussian broadcast channel, and derived an outer bound on the admissible distortion region. In [1], they stated "due to its nonlinear form, it appears difficult to determine whether it is always looser than the trivial outer bound in all distortion regimes with bandwidth compression". However, in this correspondence we solve this problem and prove that for the bandwidth expansion case ($K\geq2$), this outer bound is strictly tighter than the trivial outer bound with each user being optimal in the point-to-point setting; while for the bandwidth compression or bandwidth match case, this outer bound actually degenerates to the trivial outer bound. Therefore, our results imply that on one hand, the outer bound given in [1] is nontrivial only for Gaussian broadcast communication ($K\geq2$) with bandwidth expansion; on the other hand, unfortunately, no nontrivial outer bound exists so far for Gaussian broadcast communication ($K\geq2$) with bandwidth compression.

cs.IT↗

Comparative Deep Learning of Hybrid Representations for Image Recommendations

In many image-related tasks, learning expressive and discriminative representations of images is essential, and deep learning has been studied for automating the learning of such representations. Some user-centric tasks, such as image recommendations, call for effective representations of not only images but also preferences and intents of users over images. Such representations are termed \emph{hybrid} and addressed via a deep learning approach in this paper. We design a dual-net deep network, in which the two sub-networks map input images and preferences of users into a same latent semantic space, and then the distances between images and users in the latent space are calculated to make decisions. We further propose a comparative deep learning (CDL) method to train the deep network, using a pair of images compared against one user to learn the pattern of their relative distances. The CDL embraces much more training data than naive deep learning, and thus achieves superior performance than the latter, with no cost of increasing network complexity. Experimental results with real-world data sets for image recommendations have shown the proposed dual-net network and CDL greatly outperform other state-of-the-art image recommendation solutions.

cs.CV↗

Secrecy Communication with Security Rate Measure

We introduce a new measure on secrecy, which is established based on rate-distortion theory. It is named \emph{security rate}, which is the minimum (infimum) of the additional rate needed to reconstruct the source within target distortion level with any positive probability for wiretapper. It denotes the minimum distance in information metric (bits) from what wiretapper has received to any decrypted reconstruction (where decryption is defined as reconstruction within target distortion level with some positive possibility). By source coding theorem, it is equivalent to a distortion-based equivocation $\mathop{\min}\limits _{p\left(v^{n}|s^{n},m\right):Ed\left(S^{n},V^{n}\right)\le D_{E}}\frac{1}{n}I\left(S^{n};V^{n}|M\right)$ which can be seen as a direct extension of equivocation $\frac{1}{n}H\left(S^{n}|M\right)$ to lossy decryption case, given distortion level $D_{E}$ and the received (encrypted) message $M$ of wiretapper. In this paper, we study it in Shannon cipher system with lossless communication, where a source is transmitted from sender to legitimate receiver secretly and losslessly, and also eavesdropped by a wiretapper. We characterize the admissible region of secret key rate, coding rate of the source, wiretapper distortion, and security rate (distortion-based equivocation). Since the security rate equals the distortion-based equivocation, and the equivocation is a special case of the distortion-based equivocation (with Hamming distortion measure and $D_{E}=0$), this gives an answer for the meaning of the maximum equivocation.

cs.IT↗

$SL_2(\mathbb{C})$-Character Variety of a Hyperbolic Link and Regulator

In this paper, we study the $SL_2(\mathbb{C})$ character variety of a hyperbolic link in $S^3$. We analyze a special smooth projective variety $Y^h$ arising from some 1-dimensional irreducible slices on the character variety. We prove that a natural symbol obtained from these 1-dimensional slices is a torsion in $K_2({\mathbb C}(Y^h))$. By using the regulator map from $K_2$ to the corresponding Deligne cohomology, we get some variation formulae on some Zariski open subset of $Y^h$. From this we give some discussions on a possible parametrized volume conjecture for both hyperbolic links and knots.

math.GT↗

A Poincaré-Hopf type formula for Chern character numbers

For two complex vector bundles admitting a homomorphism with isolated singularities between them, we establish a Poincaré-Hopf type formula for the difference of the Chern character numbers of these two vector bundles. As a consequence, we extend the original Poincaré-Hopf index formula to the case of complex vector fields (to appear in Mathematische Zeitschrift)

math.GT↗

On a spectral sequence for twisted cohomologies

Let ($Ω^{\ast}(M), d$) be the de Rham cochain complex for a smooth compact closed manifolds $M$ of dimension $n$. For an odd-degree closed form $H$, there are a twisted de Rham cochain complex $(Ω^{\ast}(M), d+H_\wedge)$ and its associated twisted de Rham cohomology $H^*(M,H)$. We show that there exists a spectral sequence $\{E^{p, q}_r, d_r\}$ derived from the filtration $F_p(Ω^{\ast}(M))=\bigoplus_{i\geq p}Ω^i(M)$ of $Ω^{\ast}(M)$, which converges to the twisted de Rham cohomology $H^*(M,H)$. We also show that the differentials in the spectral sequence can be given in terms of cup products and specific elements of Massey products as well, which generalizes a result of Atiyah and Segal. Some results about the indeterminacy of differentials are also given in this paper.

math.AT↗

Massey Product and Twisted Cohomology of A-infinity Algebras

We study the twisted cohomology groups of $A_\infty$-algebras defined by twisting elements and their behavior under morphisms and homotopies using the bar construction. We define higher Massey products on the cohomology groups of general $A_\infty$-algebras and establish the naturality under morphisms and their dependency on defining systems. The above constructions are also considered for $C_\infty$-algebras. We construct a spectral sequence converging to the twisted cohomology groups an show that the higher differentials are given by the $A_\infty$-algebraic Massey products.

math.AT↗

On the Generalized Volume Conjecture and Regulator

In this paper, by using the regulator map of Beilinson-Deligne on a curve, we show that the quantization condition posed by Gukov is true for the SL_2(C) character variety of the hyperbolic knot in S^3. Furthermore, we prove that the corresponding $\mathbb{C}^{*}$-valued closed 1-form is a secondary characteristic class (Chern-Simons) arising from the vanishing first Chern class of the flat line bundle over the smooth part of the character variety, where the flat line bundle is the pullback of the universal Heisenberg line bundle over $\mathbb{C}^{*}\times \mathbb{C}^{*}$. Based on this result, we give a reformulation of Gukov's generalized volume conjecture from a motivic perspective.

math.GT↗