Searcharxiv⌕ Search

arXiv subjects

Lei Lei

Publications and source records attributed to Lei Lei.

At least 109 records · Page 6Linked to original sources

A Meta Reinforcement Learning Approach for Predictive Autoscaling in the Cloud

Predictive autoscaling (autoscaling with workload forecasting) is an important mechanism that supports autonomous adjustment of computing resources in accordance with fluctuating workload demands in the Cloud. In recent works, Reinforcement Learning (RL) has been introduced as a promising approach to learn the resource management policies to guide the scaling actions under the dynamic and uncertain cloud environment. However, RL methods face the following challenges in steering predictive autoscaling, such as lack of accuracy in decision-making, inefficient sampling and significant variability in workload patterns that may cause policies to fail at test time. To this end, we propose an end-to-end predictive meta model-based RL algorithm, aiming to optimally allocate resource to maintain a stable CPU utilization level, which incorporates a specially-designed deep periodic workload prediction model as the input and embeds the Neural Process to guide the learning of the optimal scaling actions over numerous application services in the Cloud. Our algorithm not only ensures the predictability and accuracy of the scaling strategy, but also enables the scaling decisions to adapt to the changing workloads with high sample efficiency. Our method has achieved significant performance improvement compared to the existing algorithms and has been deployed online at Alipay, supporting the autoscaling of applications for the world-leading payment platform.

cs.LG↗

Deep Reinforcement Learning Aided Platoon Control Relying on V2X Information

The impact of Vehicle-to-Everything (V2X) communications on platoon control performance is investigated. Platoon control is essentially a sequential stochastic decision problem (SSDP), which can be solved by Deep Reinforcement Learning (DRL) to deal with both the control constraints and uncertainty in the platoon leading vehicle's behavior. In this context, the value of V2X communications for DRL-based platoon controllers is studied with an emphasis on the tradeoff between the gain of including exogenous information in the system state for reducing uncertainty and the performance erosion due to the curse-of-dimensionality. Our objective is to find the specific set of information that should be shared among the vehicles for the construction of the most appropriate state space. SSDP models are conceived for platoon control under different information topologies (IFT) by taking into account `just sufficient' information. Furthermore, theorems are established for comparing the performance of their optimal policies. In order to determine whether a piece of information should or should not be transmitted for improving the DRL-based control policy, we quantify its value by deriving the conditional KL divergence of the transition models. More meritorious information is given higher priority in transmission, since including it in the state space has a higher probability in offsetting the negative effect of having higher state dimensions. Finally, simulation results are provided to illustrate the theoretical analysis.

eess.SY↗

Identifications of RR Lyrae stars and Quasars from the simulated data of Mephisto-W Survey

We have investigated the feasibilities and accuracies of the identifications of RR Lyrae stars and quasars from the simulated data of the Multi-channel Photometric Survey Telescope (Mephisto) W Survey. Based on the variable sources light curve libraries from the Sloan Digital Sky Survey (SDSS) Stripe 82 data and the observation history simulation from the Mephisto-W Survey Scheduler, we have simulated the $uvgriz$ multi-band light curves of RR Lyrae stars, quasars and other variable sources for the first year observation of Mephisto-W Survey. We have applied the ensemble machine learning algorithm Random Forest Classifier (RFC) to identify RR Lyrae stars and quasars, respectively. We build training and test samples and extract ~ 150 features from the simulated light curves and train two RFCs respectively for the RR Lyrae star and quasar classification. We find that, our RFCs are able to select the RR Lyrae stars and quasars with remarkably high precision and completeness, with $purity$ = 95.4 per cent and $completeness$ = 96.9 per cent for the RR Lyrae RFC and $purity$ = 91.4 per cent and $completeness$ = 90.2 per cent for the quasar RFC. We have also derived relative importances of the extracted features utilized to classify RR Lyrae stars and quasars.

astro-ph.IM↗

Federated Reinforcement Learning: Techniques, Applications, and Open Challenges

This paper presents a comprehensive survey of Federated Reinforcement Learning (FRL), an emerging and promising field in Reinforcement Learning (RL). Starting with a tutorial of Federated Learning (FL) and RL, we then focus on the introduction of FRL as a new method with great potential by leveraging the basic idea of FL to improve the performance of RL while preserving data-privacy. According to the distribution characteristics of the agents in the framework, FRL algorithms can be divided into two categories, i.e. Horizontal Federated Reinforcement Learning (HFRL) and Vertical Federated Reinforcement Learning (VFRL). We provide the detailed definitions of each category by formulas, investigate the evolution of FRL from a technical perspective, and highlight its advantages over previous RL algorithms. In addition, the existing works on FRL are summarized by application fields, including edge computing, communication, control optimization, and attack detection. Finally, we describe and discuss several key research directions that are crucial to solving the open problems within FRL.

cs.LG↗

Joint Optimization of Beam-Hopping Design and NOMA-Assisted Transmission for Flexible Satellite Systems

Next-generation satellite systems require more flexibility in resource management such that available radio resources can be dynamically allocated to meet time-varying and non-uniform traffic demands. Considering potential benefits of beam hopping (BH) and non-orthogonal multiple access (NOMA), we exploit the time-domain flexibility in multi-beam satellite systems by optimizing BH design, and enhance the power-domain flexibility via NOMA. In this paper, we investigate the synergy and mutual influence of beam hopping and NOMA. We jointly optimize power allocation, beam scheduling, and terminal-timeslot assignment to minimize the gap between requested traffic demand and offered capacity. In the solution development, we formally prove the NP-hardness of the optimization problem. Next, we develop a bounding scheme to tightly gauge the global optimum and propose a suboptimal algorithm to enable efficient resource assignment. Numerical results demonstrate the benefits of combining NOMA and BH, and validate the superiority of the proposed BH-NOMA schemes over benchmarks.

cs.IT↗

A kilonova from an ultra-quick merger of a neutron star binary

GRB 060505 was the first well-known nearby (at redshift 0.089) "hybrid" gamma-ray burst that has a duration longer than 2 seconds but without the association of a supernova down to very stringent limits. The prompt $γ-$ray flash lasting $\sim 4$ sec could consist of an intrinsic short burst and its tail emission, but the sizable temporal lag ($\sim 0.35$ sec) as well as the environment properties led to the widely-accepted classification of a long duration gamma-ray burst originated from the collapse of a massive star. Here for the $ first$ time we report the convincing evidence for a thermal-like optical radiation component in the spectral energy distribution of the early afterglow emission. In comparison to AT2017gfo, the thermal radiation is $\sim 2$ times brighter and the temperature is comparable at similar epochs. The optical decline is much quicker than that in X-rays, which is also at odds with the fireball afterglow model but quite natural for the presence of a blue kilonova. Our finding reveals a neutron star merger origin of the hybrid GRB 060505 and strongly supports the theoretical speculation that some binary neutron stars can merge ultra-quickly (within $\sim 1$ Myr) after their formation when the surrounding region is still highly star-forming and the metallicity remains low. Gravitational wave and electromagnetic jointed observations are expected to confirm such scenarios in the near future.

astro-ph.HE↗

Fast Camera Image Denoising on Mobile GPUs with Deep Learning, Mobile AI 2021 Challenge: Report

Image denoising is one of the most critical problems in mobile photo processing. While many solutions have been proposed for this task, they are usually working with synthetic data and are too computationally expensive to run on mobile devices. To address this problem, we introduce the first Mobile AI challenge, where the target is to develop an end-to-end deep learning-based image denoising solution that can demonstrate high efficiency on smartphone GPUs. For this, the participants were provided with a novel large-scale dataset consisting of noisy-clean image pairs captured in the wild. The runtime of all models was evaluated on the Samsung Exynos 2100 chipset with a powerful Mali GPU capable of accelerating floating-point and quantized neural networks. The proposed solutions are fully compatible with any mobile GPU and are capable of processing 480p resolution images under 40-80 ms while achieving high fidelity results. A detailed description of all models developed in the challenge is provided in this paper.

eess.IV↗

An Ensemble Deep Convolutional Neural Network Model for Electricity Theft Detection in Smart Grids

Smart grids extremely rely on Information and Communications Technology (ICT) and smart meters to control and manage numerous parameters of the network. However, using these infrastructures make smart grids more vulnerable to cyber threats especially electricity theft. Electricity Theft Detection (EDT) algorithms are typically used for such purpose since this Non-Technical Loss (NTL) may lead to significant challenges in the power system. In this paper, an Ensemble Deep Convolutional Neural Network (EDCNN) algorithm for ETD in smart grids has been proposed. As the first layer of the model, a random under bagging technique is applied to deal with the imbalance data, and then Deep Convolutional Neural Networks (DCNN) are utilized on each subset. Finally, a voting system is embedded, in the last part. The evaluation results based on the Area Under Curve (AUC), precision, recall, f1-score, and accuracy verify the efficiency of the proposed method compared to the existing method in the literature.

cs.LG↗

An Overview of Generic Tools for Information-Theoretic Secrecy Performance Analysis over Wiretap Fading Channels

An alternative or supplementary approach named as physical layer security has been proposed to afford an extra security layer on top of the conventional cryptography technique. In this paper, an overview of secrecy performance investigations over the classic Alice-Bob-Eve wiretap fading channels is conducted. On the basis of the classic wiretap channel model, we have comprehensively listed and thereafter compared the existing works on physical layer secrecy analysis considering the small-scale, large-scale, composite, and cascaded fading channel models. Exact secrecy metrics expressions, including secrecy outage probability (SOP), the probability of non-zero secrecy capacity (PNZ), average secrecy capacity (ASC), and secrecy bounds, including the lower bound of SOP and ergodic secrecy capacity, are presented. In order to encompass the aforementioned four kinds of fading channel models with a more generic and flexible distribution, the mixture gamma (MG), mixture of Gaussian (MoG), and Fox's $H$-function distributions are three useful candidates to largely include the above-mentioned four kinds of fading channel models. It is shown that they are flexible and general when assisting the secrecy analysis to obtain closed-form expressions. Their advantages and limitations are also highlighted. Conclusively, these three approaches are proven to provide a unified secrecy analysis framework and can cover all types of independent wiretap fading channel models. Apart from those, revisiting the existing secrecy enhancement techniques based on our system configuration, the on-off transmission scheme, jamming approach (including artificial noise (AN) & artificial fast fading (AFF)), antenna selection, and security region are presented.

cs.IT↗

Dynamic Energy Dispatch Based on Deep Reinforcement Learning in IoT-Driven Smart Isolated Microgrids

Microgrids (MGs) are small, local power grids that can operate independently from the larger utility grid. Combined with the Internet of Things (IoT), a smart MG can leverage the sensory data and machine learning techniques for intelligent energy management. This paper focuses on deep reinforcement learning (DRL)-based energy dispatch for IoT-driven smart isolated MGs with diesel generators (DGs), photovoltaic (PV) panels, and a battery. A finite-horizon Partial Observable Markov Decision Process (POMDP) model is formulated and solved by learning from historical data to capture the uncertainty in future electricity consumption and renewable power generation. In order to deal with the instability problem of DRL algorithms and unique characteristics of finite-horizon models, two novel DRL algorithms, namely, finite-horizon deep deterministic policy gradient (FH-DDPG) and finite-horizon recurrent deterministic policy gradient (FH-RDPG), are proposed to derive energy dispatch policies with and without fully observable state information. A case study using real isolated MG data is performed, where the performance of the proposed algorithms are compared with the other baseline DRL and non-DRL algorithms. Moreover, the impact of uncertainties on MG performance is decoupled into two levels and evaluated respectively.

cs.LG↗

Resource Optimization with Load Coupling in Multi-cell NOMA

Optimizing non-orthogonal multiple access (NOMA) in multi-cell scenarios is much more challenging than the single-cell case because inter-cell interference must be considered. Most papers addressing NOMA consider a single cell. We take a significant step of analyzing NOMA in multi-cell scenarios. We explore the potential of NOMA networks in achieving optimal resource utilization with arbitrary topologies. Towards this goal, we investigate a broad class of problems consisting in optimizing power allocation and user pairing for any cost function that is monotonically increasing in time-frequency resource consumption. We propose an algorithm that achieves global optimality for this problem class. The basic idea is to prove that solving the joint optimization problem of power allocation, user pair selection, and time-frequency resource allocation amounts to solving a so-called iterated function without a closed form. We prove that the algorithm approaches optimality with fast convergence. Numerically, we evaluate and demonstrate the performance of NOMA for multi-cell scenarios in terms of resource efficiency and load balancing.

cs.IT↗

NOMA-Enabled Multi-Beam Satellite Systems: Joint Optimization to Overcome Offered-Requested Data Mismatches

Non-Orthogonal Multiple Access (NOMA) has potentials to improve the performance of multi-beam satellite systems. The performance optimization in satellite-NOMA systems can be different from that in terrestrial-NOMA systems, e.g., considering distinctive channel models, performance metrics, power constraints, and limited flexibility in resource management. In this paper, we adopt a metric, Offered Capacity to requested Traffic Ratio (OCTR), to measure the requested-offered data (or rate) mismatch in multi-beam satellite systems. In the considered system, NOMA is applied to mitigate intra-beam interference while precoding is implemented to reduce inter-beam interference. We jointly optimize power, decoding orders, and terminal-timeslot assignment to improve the max-min fairness of OCTR. The problem is inherently difficult due to the presence of combinatorial and non-convex aspects. We first fix the terminal-timeslot assignment, and develop an optimal fast-convergence algorithmic framework based on Perron-Frobenius theory (PF) for the remaining joint power-allocation and decoding-order optimization problem. Under this framework, we propose a heuristic algorithm for the original problem, which iteratively updates the terminal-timeslot assignment and improves the overall OCTR performance. Numerical results verify that max-min OCTR is a suitable metric to address the mismatch issue, and is able to improve the fairness among terminals. In average, the proposed algorithm improves the max-min OCTR by 40.2% over Orthogonal Multiple Access (OMA).

cs.IT↗

Energy Minimization in UAV-Aided Networks: Actor-Critic Learning for Constrained Scheduling Optimization

In unmanned aerial vehicle (UAV) applications, the UAV's limited energy supply and storage have triggered the development of intelligent energy-conserving scheduling solutions. In this paper, we investigate energy minimization for UAV-aided communication networks by jointly optimizing data-transmission scheduling and UAV hovering time. The formulated problem is combinatorial and non-convex with bilinear constraints. To tackle the problem, firstly, we provide an optimal relax-and-approximate solution and develop a near-optimal algorithm. Both the proposed solutions are served as offline performance benchmarks but might not be suitable for online operation. To this end, we develop a solution from a deep reinforcement learning (DRL) aspect. The conventional RL/DRL, e.g., deep Q-learning, however, is limited in dealing with two main issues in constrained combinatorial optimization, i.e., exponentially increasing action space and infeasible actions. The novelty of solution development lies in handling these two issues. To address the former, we propose an actor-critic-based deep stochastic online scheduling (AC-DSOS) algorithm and develop a set of approaches to confine the action space. For the latter, we design a tailored reward function to guarantee the solution feasibility. Numerical results show that, by consuming equal magnitude of time, AC-DSOS is able to provide feasible solutions and saves 29.94% energy compared with a conventional deep actor-critic method. Compared to the developed near-optimal algorithm, AC-DSOS consumes around 10% higher energy but reduces the computational time from minute-level to millisecond-level.

eess.SP↗

Deep Reinforcement Learning for Autonomous Internet of Things: Model, Applications and Challenges

The Internet of Things (IoT) extends the Internet connectivity into billions of IoT devices around the world, where the IoT devices collect and share information to reflect status of the physical world. The Autonomous Control System (ACS), on the other hand, performs control functions on the physical systems without external intervention over an extended period of time. The integration of IoT and ACS results in a new concept - autonomous IoT (AIoT). The sensors collect information on the system status, based on which the intelligent agents in the IoT devices as well as the Edge/Fog/Cloud servers make control decisions for the actuators to react. In order to achieve autonomy, a promising method is for the intelligent agents to leverage the techniques in the field of artificial intelligence, especially reinforcement learning (RL) and deep reinforcement learning (DRL) for decision making. In this paper, we first provide a tutorial of DRL, and then propose a general model for the applications of RL/DRL in AIoT. Next, a comprehensive survey of the state-of-art research on DRL for AIoT is presented, where the existing works are classified and summarized under the umbrella of the proposed general DRL model. Finally, the challenges and open issues for future research are identified.

cs.LG↗

Performance Modeling and Analysis of a Hyperledger-based System Using GSPN

As a highly scalable permissioned blockchain platform, Hyperledger Fabric supports a wide range of industry use cases ranging from governance to finance. In this paper, we propose a model to analyze the performance of a Hyperledgerbased system by using Generalised Stochastic Petri Nets (GSPN). This model decomposes a transaction flow into multiple phases and provides a simulation-based approach to obtain the system latency and throughput with a specific arrival rate. Based on this model, we analyze the impact of different configurations of ordering service on system performance to find out the bottleneck. Moreover, a mathematical configuration selection approach is proposed to determine the best configuration which can maximize the system throughput. Finally, extensive experiments are performed on a running system to validate the proposed model and approaches.

cs.DC↗

Towards Power-Efficient Aerial Communications via Dynamic Multi-UAV Cooperation

Aerial base stations (BSs) attached to unmanned aerial vehicles (UAVs) constitute a new paradigm for next-generation cellular communications. However, the flight range and communication capacity of aerial BSs are usually limited due to the UAVs' size, weight, and power (SWAP) constraints. To address this challenge, in this paper, we consider dynamic cooperative transmission among multiple aerial BSs for power-efficient aerial communications. Thereby, a central controller intelligently selects the aerial BSs navigating in the air for cooperation. Consequently, the large virtual array of moving antennas formed by the cooperating aerial BSs can be exploited for low-power information transmission and navigation, taking into account the channel conditions, energy availability, and user demands. Considering both the fronthauling and the data transmission links, we jointly optimize the trajectories, cooperation decisions, and transmit beamformers of the aerial BSs for minimization of the weighted sum of the power consumptions required by all BSs. Since obtaining the global optimal solution of the formulated problem is difficult, we propose a low-complexity iterative algorithm that can efficiently find a Karush-Kuhn-Tucker (KKT) solution to the problem. Simulation results show that, compared with several baseline schemes, dynamic multi-UAV cooperation can significantly reduce the communication and navigation powers of the UAVs to overcome the SWAP limitations, while requiring only a small increase of the transmit power over the fronthauling links.

cs.IT↗

Multi-user Resource Control with Deep Reinforcement Learning in IoT Edge Computing

By leveraging the concept of mobile edge computing (MEC), massive amount of data generated by a large number of Internet of Things (IoT) devices could be offloaded to MEC server at the edge of wireless network for further computational intensive processing. However, due to the resource constraint of IoT devices and wireless network, both the communications and computation resources need to be allocated and scheduled efficiently for better system performance. In this paper, we propose a joint computation offloading and multi-user scheduling algorithm for IoT edge computing system to minimize the long-term average weighted sum of delay and power consumption under stochastic traffic arrival. We formulate the dynamic optimization problem as an infinite-horizon average-reward continuous-time Markov decision process (CTMDP) model. One critical challenge in solving this MDP problem for the multi-user resource control is the curse-of-dimensionality problem, where the state space of the MDP model and the computation complexity increase exponentially with the growing number of users or IoT devices. In order to overcome this challenge, we use the deep reinforcement learning (RL) techniques and propose a neural network architecture to approximate the value functions for the post-decision system states. The designed algorithm to solve the CTMDP problem supports semi-distributed auction-based implementation, where the IoT devices submit bids to the BS to make the resource control decisions centrally. Simulation results show that the proposed algorithm provides significant performance improvement over the baseline algorithms, and also outperforms the RL algorithms based on other neural network architectures.

eess.SP↗

Patent Analytics Based on Feature Vector Space Model: A Case of IoT

The number of approved patents worldwide increases rapidly each year, which requires new patent analytics to efficiently mine the valuable information attached to these patents. Vector space model (VSM) represents documents as high-dimensional vectors, where each dimension corresponds to a unique term. While originally proposed for information retrieval systems, VSM has also seen wide applications in patent analytics, and used as a fundamental tool to map patent documents to structured data. However, VSM method suffers from several limitations when applied to patent analysis tasks, such as loss of sentence-level semantics and curse-of-dimensionality problems. In order to address the above limitations, we propose a patent analytics based on feature vector space model (FVSM), where the FVSM is constructed by mapping patent documents to feature vectors extracted by convolutional neural networks (CNN). The applications of FVSM for three typical patent analysis tasks, i.e., patents similarity comparison, patent clustering, and patent map generation are discussed. A case study using patents related to Internet of Things (IoT) technology is illustrated to demonstrate the performance and effectiveness of FVSM. The proposed FVSM can be adopted by other patent analysis studies to replace VSM, based on which various big data learning tasks can be performed.

cs.CL↗