arXiv subjects

Peng Yang

Publications and source records attributed to Peng Yang.

At least 145 records · Page 8Linked to original sources

arXiv2022

Accuracy-Guaranteed Collaborative DNN Inference in Industrial IoT via Deep Reinforcement Learning

Collaboration among industrial Internet of Things (IoT) devices and edge networks is essential to support computation-intensive deep neural network (DNN) inference services which require low delay and high accuracy. Sampling rate adaption which dynamically configures the sampling rates of industrial IoT devices according to network conditions, is the key in minimizing the service delay. In this paper, we investigate the collaborative DNN inference problem in industrial IoT networks. To capture the channel variation and task arrival randomness, we formulate the problem as a constrained Markov decision process (CMDP). Specifically, sampling rate adaption, inference task offloading and edge computing resource allocation are jointly considered to minimize the average service delay while guaranteeing the long-term accuracy requirements of different inference services. Since CMDP cannot be directly solved by general reinforcement learning (RL) algorithms due to the intractable long-term constraints, we first transform the CMDP into an MDP by leveraging the Lyapunov optimization technique. Then, a deep RL-based algorithm is proposed to solve the MDP. To expedite the training process, an optimization subroutine is embedded in the proposed algorithm to directly obtain the optimal edge computing resource allocation. Extensive simulation results are provided to demonstrate that the proposed RL-based algorithm can significantly reduce the average service delay while preserving long-term inference accuracy with a high probability.

eess.SY↗

arXiv2022

Cost-Effective Two-Stage Network Slicing for Edge-Cloud Orchestrated Vehicular Networks

In this paper, we study a network slicing problem for edge-cloud orchestrated vehicular networks, in which the edge and cloud servers are orchestrated to process computation tasks for reducing network slicing cost while satisfying the quality of service requirements. We propose a two-stage network slicing framework, which consists of 1) network planning stage in a large timescale to perform slice deployment, edge resource provisioning, and cloud resource provisioning, and 2) network operation stage in a small timescale to perform resource allocation and task dispatching. Particularly, we formulate the network slicing problem as a two-timescale stochastic optimization problem to minimize the network slicing cost. Since the problem is NP-hard due to coupled network planning and network operation stages, we develop a Two timescAle netWork Slicing (TAWS) algorithm by collaboratively integrating reinforcement learning (RL) and optimization methods, which can jointly make network planning and operation decisions. Specifically, by leveraging the timescale separation property of decisions, we decouple the problem into a large-timescale network planning subproblem and a small-timescale network operation subproblem. The former is solved by an RL method, and the latter is solved by an optimization method. Simulation results based on real-world vehicle traffic traces show that the TAWS can effectively reduce the network slicing cost as compared to the benchmark scheme.

cs.NI↗

arXiv2022

Kinematic-Chemical analysis and Time tagging for the Diagonal Ridge Structure of the Galactic Outer Disk with LAMOST Red Giant Branch Stars

We investigate the kinematic-chemical distribution of Red Giant Branch (RGB) stars from the LAMOST survey crossed matched with Gaia DR2 proper motions, and present time tagging for the well-known ridge structures (diagonal distributions for $V_R$ in the $R$, $V_ϕ$ plane) in the range of Galactocentric distance $R$ = 8 to 15 kpc. We detect six ridge structures, including five ridges apparent in the radial velocity distribution and three ridges apparent in the vertical velocity, the sensitive time of which to the perturbations are from young population (0$-$3 Gyr) to old population (9$-$14 Gyr). Based on an analysis of the evolution of angular momentum distribution, we find that four ridges are relatively stationary, while another is evolving with time, which is confirmed by the difference analysis at different populations and supporting that there might be two kinds of dynamical origins. Furthermore, ridge features are also vividly present in the chemical properties ([Fe/H], [$α$/Fe]). The comparison between the north and south hemispheres of the Galaxy does show some differences and the ridge features are asymmetrical. Moreover, we find that diagonal ridge structures may affect the shape of the rotation curve, which is manifested as fluctuations and undulations on top of a smooth profile. Finally we speculate that the bar dynamics should be not enough to explain all ridge properties including the break feature in the $V_Z$-$L_Z$ plane.

astro-ph.GA↗

arXiv2022

Style-Label-Free: Cross-Speaker Style Transfer by Quantized VAE and Speaker-wise Normalization in Speech Synthesis

Cross-speaker style transfer in speech synthesis aims at transferring a style from source speaker to synthesised speech of a target speaker's timbre. Most previous approaches rely on data with style labels, but manually-annotated labels are expensive and not always reliable. In response to this problem, we propose Style-Label-Free, a cross-speaker style transfer method, which can realize the style transfer from source speaker to target speaker without style labels. Firstly, a reference encoder structure based on quantized variational autoencoder (Q-VAE) and style bottleneck is designed to extract discrete style representations. Secondly, a speaker-wise batch normalization layer is proposed to reduce the source speaker leakage. In order to improve the style extraction ability of the reference encoder, a style invariant and contrastive data augmentation method is proposed. Experimental results show that the method outperforms the baseline. We provide a website with audio samples.

cs.SD↗

arXiv2022

Back-Translation-Style Data Augmentation for Mandarin Chinese Polyphone Disambiguation

Conversion of Chinese Grapheme-to-Phoneme (G2P) plays an important role in Mandarin Chinese Text-To-Speech (TTS) systems, where one of the biggest challenges is the task of polyphone disambiguation. Most of the previous polyphone disambiguation models are trained on manually annotated datasets, and publicly available datasets for polyphone disambiguation are scarce. In this paper we propose a simple back-translation-style data augmentation method for mandarin Chinese polyphone disambiguation, utilizing a large amount of unlabeled text data. Inspired by the back-translation technique proposed in the field of machine translation, we build a Grapheme-to-Phoneme (G2P) model to predict the pronunciation of polyphonic character, and a Phoneme-to-Grapheme (P2G) model to predict pronunciation into text. Meanwhile, a window-based matching strategy and a multi-model scoring strategy are proposed to judge the correctness of the pseudo-label. We design a data balance strategy to improve the accuracy of some typical polyphonic characters in the training set with imbalanced distribution or data scarcity. The experimental result shows the effectiveness of the proposed back-translation-style data augmentation method.

cs.SD↗

arXiv2022

CU-Net: LiDAR Depth-Only Completion With Coupled U-Net

LiDAR depth-only completion is a challenging task to estimate dense depth maps only from sparse measurement points obtained by LiDAR. Even though the depth-only methods have been widely developed, there is still a significant performance gap with the RGB-guided methods that utilize extra color images. We find that existing depth-only methods can obtain satisfactory results in the areas where the measurement points are almost accurate and evenly distributed (denoted as normal areas), while the performance is limited in the areas where the foreground and background points are overlapped due to occlusion (denoted as overlap areas) and the areas where there are no measurement points around (denoted as blank areas) since the methods have no reliable input information in these areas. Building upon these observations, we propose an effective Coupled U-Net (CU-Net) architecture for depth-only completion. Instead of directly using a large network for regression, we employ the local U-Net to estimate accurate values in the normal areas and provide the global U-Net with reliable initial values in the overlap and blank areas. The depth maps predicted by the two coupled U-Nets are fused by learned confidence maps to obtain final results. In addition, we propose a confidence-based outlier removal module, which removes outliers using simple judgment conditions. Our proposed method boosts the final results with fewer parameters and achieves state-of-the-art results on the KITTI benchmark. Moreover, it owns a powerful generalization ability under various depth densities, varying lighting, and weather conditions.

cs.CV↗

arXiv2022

KeypartX: Graph-based Perception (Text) Representation

The availability of big data has opened up big opportunities for individuals, businesses and academics to view big into what is happening in their world. Previous works of text representation mostly focused on informativeness from massive words' frequency or cooccurrence. However, big data is a double-edged sword which is big in volume but unstructured in format. The unstructured edge requires specific techniques to transform 'big' into meaningful instead of informative alone. This study presents KeypartX, a graph-based approach to represent perception (text in general) by key parts of speech. Different from bag-of-words/vector-based machine learning, this technique is human-like learning that could extracts meanings from linguistic (semantic, syntactic and pragmatic) information. Moreover, KeypartX is big-data capable but not hungry, which is even applicable to the minimum unit of text:sentence.

cs.CL↗

arXiv2022

Energy-Sensitive Trajectory Design and Restoration Areas Allocation for UAV-Enabled Grassland Restoration

Grassland restoration is a critical means to safeguard grassland ecological degradation. To alleviate the extensive human labors and boost the restoration efficiency, UAV is promising for its fully automatic capability yet still waits to be exploited. This paper progresses this emerging technology by explicitly considering the realistic constraints of the UAV and the grassland degradation while planning the grassland restoration. To this end, the UAV-enabled restoration process is first mathematically modeled as the maximization of restoration areas of the UAV under the limited battery energy of UAV, the grass seeds weight, the number of restored areas, and the corresponding sizes. Then we analyze that, by considering these constraints, this original problem emerges two conflict objectives, namely the shortest flight path and the optimal areas allocation. As a result, the maximization of restoration areas turns out to be a composite of a trajectory design problem and an areas allocation problem that are highly coupled. From the perspective of optimization, this requires solving two NP-hard problems of both the traveling salesman problem (TSP) and the multidimensional knapsack problem (MKP) at the same time. To tackle this complex problem, we propose a cooperative optimization algorithm, called CHAPBILM, to solve those two problems interlacedly by utilizing the interdependencies between them. Multiple simulations verify the conflicts between the trajectory design and areas allocation. The effectiveness of the cooperative optimization algorithm is also supported by the comparisons with traditional optimization methods which do not utilize the interdependencies between the two problems. As a result, the proposed algorithm successfully solves the multiple simulation instances in a near-optimal way.

cs.NE↗

arXiv2022

Cavity locking with spatial modulation of optical phase front for laser stabilization

We study optical cavity locking for laser stabilization through spatial modulation of the phase front of a light beam. A theoretical description of the underlying principle is developed for this method and special attention is paid to residual amplitude modulation (RAM) caused by experimental imperfections, especially the manufacture errors of the spatial phase modulator. The studied locking method owns the common advantages of the Pound-Drever-Hall method and the tilt-locking one, and it can provide a more artful way to eliminate RAM noise in phase modulation for the ultimate stability of lasers. In situations where cost and portability are a practical issue, the studied method allows one to realize compact laser stabilization systems locked to Fabry-P$\acute{\mbox{e}}$rot cavities without use of expensive bulky devices, such as signal generators and electro-optic modulators.

physics.optics↗

arXiv2022

One Loss for Quantization: Deep Hashing with Discrete Wasserstein Distributional Matching

Image hashing is a principled approximate nearest neighbor approach to find similar items to a query in a large collection of images. Hashing aims to learn a binary-output function that maps an image to a binary vector. For optimal retrieval performance, producing balanced hash codes with low-quantization error to bridge the gap between the learning stage's continuous relaxation and the inference stage's discrete quantization is important. However, in the existing deep supervised hashing methods, coding balance and low-quantization error are difficult to achieve and involve several losses. We argue that this is because the existing quantization approaches in these methods are heuristically constructed and not effective to achieve these objectives. This paper considers an alternative approach to learning the quantization constraints. The task of learning balanced codes with low quantization error is re-formulated as matching the learned distribution of the continuous codes to a pre-defined discrete, uniform distribution. This is equivalent to minimizing the distance between two distributions. We then propose a computationally efficient distributional distance by leveraging the discrete property of the hash functions. This distributional distance is a valid distance and enjoys lower time and sample complexities. The proposed single-loss quantization objective can be integrated into any existing supervised hashing method to improve code balance and quantization error. Experiments confirm that the proposed approach substantially improves the performance of several representative hashing~methods.

cs.CV↗

arXiv2022

Construction and analysis of the quadratic finite volume methods on tetrahedral meshes

A family of quadratic finite volume method (FVM) schemes are constructed and analyzed over tetrahedral meshes. In order to prove stability and error estimate, we propose the minimum V-angle condition on tetrahedral meshes, and the surface and volume orthogonal conditions on dual meshes. Through the element analysis technique, the local stability is equivalent to a positive definiteness of a $9\times9$ element matrix, which is difficult to analyze directly or even numerically. With the help of the surface orthogonal condition and congruent transformation, this element matrix is reduced into a block diagonal matrix, then we carry out the stability result under the minimum V-angle condition. It is worth mentioning that the minimum V-angle condition of the tetrahedral case is very different from a simple extension of the minimum angle condition for triangular meshes, while it is also convenient to use in practice. Based on the stability, we prove the optimal $ H^{1} $ and $L^2$ error estimates respectively, where the orthogonal conditions play an important role in ensuring optimal $L^2$ convergence rate. Numerical experiments are presented to illustrate our theoretical results.

math.NA↗

arXiv2022

Practical considerations for the effect of finite coverage on the azimuthal dependence of global spin alignment

The global spin alignment of vector mesons is a powerful probe to study the vorticity field of the system produced in non-central relativistic heavy-ion collisions. Since the experimental observables of global spin alignment are sensitive to many factors, proper corrections are need to be taken care of when measuring the global spin alignment of vector mesons. In this paper, we propose a method to correct the effect of finite pseudo-rapidity coverage when extract the azimuthal dependence of spin alignment parameter $ρ_{00}$. The effects of the finite pseudo-rapidity coverage on the azimuthal dependence of $ϕ$ meson spin alignment and the potentially exist intrinsic spin alignment effects are taken into consideration. The method presented in this paper is verified in a Monte-Carlo simulation, it allows the measurements of azimuthal dependence of global spin alignment to be conducted properly and accurately.

nucl-th↗

arXiv2022

Over-the-Air Federated Learning via Second-Order Optimization

Federated learning (FL) is a promising learning paradigm that can tackle the increasingly prominent isolated data islands problem while keeping users' data locally with privacy and security guarantees. However, FL could result in task-oriented data traffic flows over wireless networks with limited radio resources. To design communication-efficient FL, most of the existing studies employ the first-order federated optimization approach that has a slow convergence rate. This however results in excessive communication rounds for local model updates between the edge devices and edge server. To address this issue, in this paper, we instead propose a novel over-the-air second-order federated optimization algorithm to simultaneously reduce the communication rounds and enable low-latency global model aggregation. This is achieved by exploiting the waveform superposition property of a multi-access channel to implement the distributed second-order optimization algorithm over wireless networks. The convergence behavior of the proposed algorithm is further characterized, which reveals a linear-quadratic convergence rate with an accumulative error term in each iteration. We thus propose a system optimization approach to minimize the accumulated error gap by joint device selection and beamforming design. Numerical results demonstrate the system and communication efficiency compared with the state-of-the-art approaches.

cs.IT↗

arXiv2022

Machine Learning Empowered Intelligent Data Center Networking: A Survey

To support the needs of ever-growing cloud-based services, the number of servers and network devices in data centers is increasing exponentially, which in turn results in high complexities and difficulties in network optimization. To address these challenges, both academia and industry turn to artificial intelligence technology to realize network intelligence. To this end, a considerable number of novel and creative machine learning-based (ML-based) research works have been put forward in recent few years. Nevertheless, there are still enormous challenges faced by the intelligent optimization of data center networks (DCNs), especially in the scenario of online real-time dynamic processing of massive heterogeneous services and traffic data. To best of our knowledge, there is a lack of systematic and original comprehensively investigations with in-depth analysis on intelligent DCN. To this end, in this paper, we comprehensively investigate the application of machine learning to data center networking, and provide a general overview and in-depth analysis of the recent works, covering flow prediction, flow classification, load balancing, resource management, routing optimization, and congestion control. In order to provide a multi-dimensional and multi-perspective comparison of various solutions, we design a quality assessment criteria called REBEL-3S to impartially measure the strengths and weaknesses of these research works. Moreover, we also present unique insights into the technology evolution of the fusion of data center network and machine learning, together with some challenges and potential future research opportunities.

cs.NI↗

arXiv2021

Robust Dynamic Network Embedding via Ensembles

Dynamic Network Embedding (DNE) has recently attracted considerable attention due to the advantage of network embedding in various fields and the dynamic nature of many real-world networks. An input dynamic network to DNE is often assumed to have smooth changes over snapshots, which however would not hold for all real-world scenarios. It is natural to ask if existing DNE methods can perform well for an input dynamic network without smooth changes. To quantify it, an index called Degree of Changes (DoCs) is suggested so that the smaller DoCs indicates the smoother changes. Our comparative study shows several DNE methods are not robust enough to different DoCs even if the corresponding input dynamic networks come from the same dataset, which would make these methods unreliable and hard to use for unknown real-world applications. To propose an effective and more robust DNE method, we follow the notion of ensembles where each base learner adopts an incremental Skip-Gram embedding model. To further boost the performance, a simple yet effective strategy is designed to enhance the diversity among base learners at each timestep by capturing different levels of local-global topology. Extensive experiments demonstrate the superior effectiveness and robustness of the proposed method compared to state-of-the-art DNE methods, as well as the benefits of special designs in the proposed method and its scalability.

cs.SI↗

arXiv2021

Networking of Internet of UAVs: Challenges and Intelligent Approaches

Internet of unmanned aerial vehicle (I-UAV) networks promise to accomplish sensing and transmission tasks quickly, robustly, and cost-efficiently via effective cooperation among UAVs. To achieve the promising benefits, the crucial I-UAV networking issue should be tackled. This article argues that I-UAV networking can be classified into three categories, quality-of-service (QoS) driven networking, quality-of-experience (QoE) driven networking, and situation aware networking. Each category of networking poses emerging challenges which have severe effects on the safe and efficient accomplishment of I-UAV missions. This article elaborately analyzes these challenges and expounds on the corresponding intelligent approaches to tackle the I-UAV networking issue. Besides, considering the uplifting effect of extending the scalability of I-UAV networks through cooperating with high altitude platforms (HAPs), this article gives an overview of the integrated HAP and I-UAV networks and presents the corresponding networking challenges and intelligent approaches.

cs.NI↗

arXiv2021

Instability of Holographic Superfuids in Optical Lattice

The instability of superfluids in optical lattice has been investigated using the holographic model. The static and steady flow solutions are numerically obtained from the static equations of motion and the solutions are described as Bloch waves with different Bloch wave vector $k$. Based on these Bloch waves, the instability is investigated at two levels. At the linear perturbation level, we show that there is a critical $k_{c}$ above which the superflow is unstable. At the fully nonlinear level, the intermediate state and final state of unstable superflow are identified through numerical simulation of the full equations of motion. The results show that during the time evolution, the unstable superflow will undergo a chaotic state, where solitons will appear and disappear. The system will settle down to a stable state with $k<k_{c}$ eventually, with a smaller current and a larger condensate.

hep-th↗

arXiv2021

Approaching the Transient Stability Boundary of a Power System: Theory and Applications

Estimating the stability boundary is a fundamental and challenging problem in transient stability studies. It is known that a proper level set of a Lyapunov function or an energy function can provide an inner approximation of the stability boundary, and the estimation can be expanded by trajectory reversing methods. In this paper, we streamline the theoretical foundation of the expansion methodology, and generalize it by relaxing the request that the initial guess should be a subset of the stability region. We investigate topological characteristics of the expanded boundary, showing how an initial guess can approach the exact stability boundary locally or globally. We apply the theory to transient stability assessment, and propose expansion algorithms to improve the well-known Potential Energy Boundary Surface (PEBS) and Boundary of stability region based Controlling Unstable equilibrium point (BCU) methods. Case studies on the IEEE 39-bus system well verify our results and demonstrate that estimations of the stability boundary and the critical clearing time can be significantly improved with modest computational cost.

eess.SY↗