arXiv subjects

Yang Li

Publications and source records attributed to Yang Li.

At least 955 records · Page 53Linked to original sources

arXiv2023

Coordinated Control of Path Tracking and Yaw Stability for Distributed Drive Electric Vehicle Based on AMPC and DYC

Maintaining both path-tracking accuracy and yaw stability of distributed drive electric vehicles (DDEVs) under various driving conditions presents a significant challenge in the field of vehicle control. To address this limitation, a coordinated control strategy that integrates adaptive model predictive control (AMPC) path-tracking control and direct yaw moment control (DYC) is proposed for DDEVs. The proposed strategy, inspired by a hierarchical framework, is coordinated by the upper layer of path-tracking control and the lower layer of direct yaw moment control. Based on the linear time-varying model predictive control (LTV MPC) algorithm, the effects of prediction horizon and weight coefficients on the path-tracking accuracy and yaw stability of the vehicle are compared and analyzed first. According to the aforementioned analysis, an AMPC path-tracking controller with variable prediction horizon and weight coefficients is designed considering the vehicle speed's variation in the upper layer. The lower layer involves DYC based on the linear quadratic regulator (LQR) technique. Specifically, the intervention rule of DYC is determined by the threshold of the yaw rate error and the phase diagram of the sideslip angle. Extensive simulation experiments are conducted to evaluate the proposed coordinated control strategy under different driving conditions. The results show that, under variable speed and low adhesion conditions, the vehicle's yaw stability and path-tracking accuracy have been improved by 21.58\% and 14.43\%, respectively, compared to AMPC. Similarly, under high speed and low adhesion conditions, the vehicle's yaw stability and path-tracking accuracy have been improved by 44.30\% and 14.25\%, respectively, compared to the coordination of LTV MPC and DYC. The results indicate that the proposed adaptive path-tracking controller is effective across different speeds.

cs.RO↗

arXiv2023

An Unsupervised STDP-based Spiking Neural Network Inspired By Biologically Plausible Learning Rules and Connections

The backpropagation algorithm has promoted the rapid development of deep learning, but it relies on a large amount of labeled data and still has a large gap with how humans learn. The human brain can quickly learn various conceptual knowledge in a self-organized and unsupervised manner, accomplished through coordinating various learning rules and structures in the human brain. Spike-timing-dependent plasticity (STDP) is a general learning rule in the brain, but spiking neural networks (SNNs) trained with STDP alone is inefficient and perform poorly. In this paper, taking inspiration from short-term synaptic plasticity, we design an adaptive synaptic filter and introduce the adaptive spiking threshold as the neuron plasticity to enrich the representation ability of SNNs. We also introduce an adaptive lateral inhibitory connection to adjust the spikes balance dynamically to help the network learn richer features. To speed up and stabilize the training of unsupervised spiking neural networks, we design a samples temporal batch STDP (STB-STDP), which updates weights based on multiple samples and moments. By integrating the above three adaptive mechanisms and STB-STDP, our model greatly accelerates the training of unsupervised spiking neural networks and improves the performance of unsupervised SNNs on complex tasks. Our model achieves the current state-of-the-art performance of unsupervised STDP-based SNNs in the MNIST and FashionMNIST datasets. Further, we tested on the more complex CIFAR10 dataset, and the results fully illustrate the superiority of our algorithm. Our model is also the first work to apply unsupervised STDP-based SNNs to CIFAR10. At the same time, in the small-sample learning scenario, it will far exceed the supervised ANN using the same structure.

cs.NE↗

arXiv2023

GammaE: Gamma Embeddings for Logical Queries on Knowledge Graphs

Embedding knowledge graphs (KGs) for multi-hop logical reasoning is a challenging problem due to massive and complicated structures in many KGs. Recently, many promising works projected entities and queries into a geometric space to efficiently find answers. However, it remains challenging to model the negation and union operator. The negation operator has no strict boundaries, which generates overlapped embeddings and leads to obtaining ambiguous answers. An additional limitation is that the union operator is non-closure, which undermines the model to handle a series of union operators. To address these problems, we propose a novel probabilistic embedding model, namely Gamma Embeddings (GammaE), for encoding entities and queries to answer different types of FOL queries on KGs. We utilize the linear property and strong boundary support of the Gamma distribution to capture more features of entities and queries, which dramatically reduces model uncertainty. Furthermore, GammaE implements the Gamma mixture method to design the closed union operator. The performance of GammaE is validated on three large logical query datasets. Experimental results show that GammaE significantly outperforms state-of-the-art models on public benchmarks.

cs.LG↗

arXiv2023

SSBM: A Signed Stochastic Block Model for Multiple Structure Discovery in Large-Scale Exploratory Signed Networks

Signed network structure discovery has received extensive attention and has become a research focus in the field of network science. However, most of the existing studies are focused on the networks with a single structure, e.g., community or bipartite, while ignoring multiple structures, e.g., the coexistence of community and bipartite structures. Furthermore, existing studies were faced with challenge regarding large-scale signed networks due to their high time complexity, especially when determining the number of clusters in the observed network without any prior knowledge. In view of this, we propose a mathematically principled method for signed network multiple structure discovery named the Signed Stochastic Block Model (SSBM). The SSBM can capture the multiple structures contained in signed networks, e.g., community, bipartite, and coexistence of them, by adopting a probabilistic model. Moreover, by integrating the minimum message length (MML) criterion and component-wise EM (CEM) algorithm, a scalable learning algorithm that has the ability of model selection is proposed to handle large-scale signed networks. By comparing state-of-the-art methods on synthetic and real-world signed networks, extensive experimental results demonstrate the effectiveness and efficiency of SSBM in discovering large-scale exploratory signed networks with multiple structures.

cs.SI↗

arXiv2023

Solving the domain wall problem with first-order phase transition

Domain wall networks are two-dimensional topological defects generally predicted in many beyond standard model physics. In this Letter, we propose to solve the domain wall problem with the first-order phase transition. We numerically study the phase transition dynamics, and for the first time show that the domain walls reached scaling regime can be diluted through the interaction with vacuum bubbles during the first-order phase transition. We find that the amplitude of the gravitational waves produced by the second-stage first-order phase transition is several orders higher than that from the domain walls evolution in the scaling regime. The scale of the first-order phase transition that dilute the domain walls can be probed through gravitational waves detection.

hep-ph↗

arXiv2023

Pareto-optimal lane-changing motion planning in mixed traffic

This paper applies the pareto-optimal concept to LC (lane-changing) motion planning in the presence of mixed traffic including manual and autonomous vehicles. Firstly, a multiobjective optimization problem is presented, in which the comfort, efficiency and safety of the LC vehicle and the surrounding vehicles are jointly modelled. Thereafter, the pareto-optimal solutions are obtained through employing the NSGA-II (Non-dominated Sorting Genetic -II) algorithm. Finally, the experiment section analyzes the (macroscopic and microscopic) lane-changing impact from a pareto-optimal perspective. Also, a comprehensive sensitivity analysis is conducted. Our results demonstrate that our algorithm could significantly reduce the lane-changing impact within its region, and the total costs are reduced in the range of 10.94% to 48.66%. This paper could be considered as a preliminary research framework for the application of the pareto-optimal concept. We hope this research will provide valuable insights into autonomous driving technology.

cs.RO↗

arXiv2023

Multi-Microgrid Collaborative Optimization Scheduling Using an Improved Multi-Agent Soft Actor-Critic Algorithm

The implementation of a multi-microgrid (MMG) system with multiple renewable energy sources enables the facilitation of electricity trading. To tackle the energy management problem of a MMG system, which consists of multiple renewable energy microgrids belonging to different operating entities, this paper proposes a MMG collaborative optimization scheduling model based on a multi-agent centralized training distributed execution framework. To enhance the generalization ability of dealing with various uncertainties, we also propose an improved multi-agent soft actor-critic (MASAC) algorithm, which facilitates en-ergy transactions between multi-agents in MMG, and employs automated machine learning (AutoML) to optimize the MASAC hyperparameters to further improve the generalization of deep reinforcement learning (DRL). The test results demonstrate that the proposed method successfully achieves power complementarity between different entities, and reduces the MMG system operating cost. Additionally, the proposal significantly outperforms other state-of-the-art reinforcement learning algorithms with better economy and higher calculation efficiency.

eess.SY↗

arXiv2023

Evaluating the principle of relatedness: Estimation, drivers and implications for policy

A growing body of research documents that the size and growth of an industry in a place depends on how much related activity is found there. This fact is commonly referred to as the "principle of relatedness". However, there is no consensus on why we observe the principle of relatedness, how best to determine which industries are related or how this empirical regularity can help inform local industrial policy. We perform a structured search over tens of thousands of specifications to identify robust -- in terms of out-of-sample predictions -- ways to determine how well industries fit the local economies of US cities. To do so, we use data that allow us to derive relatedness from observing which industries co-occur in the portfolios of establishments, firms, cities and countries. Different portfolios yield different relatedness matrices, each of which help predict the size and growth of local industries. However, our specification search not only identifies ways to improve the performance of such predictions, but also reveals new facts about the principle of relatedness and important trade-offs between predictive performance and interpretability of relatedness patterns. We use these insights to deepen our theoretical understanding of what underlies path-dependent development in cities and expand existing policy frameworks that rely on inter-industry relatedness analysis.

physics.soc-ph↗

arXiv2023

Integrated lithium niobate optical phased array for two-dimensional beam steering

Optical phased arrays (OPAs) with high speed, low power consumption, and low insertion loss are appealing for many applications, such as light detection and ranging, free-space communication, image projection, and imaging. These OPAs can be achieved by fully leveraging the high electro-optic modulation speed, low driving voltage, and low optical loss of integrated lithium niobate (LN) photonics. Here we present an integrated LN OPA operating in the near-infrared regime, demonstrating a 24 * 8° two-dimensional beam steering, a far-field beam spot with full-width at half-maximum of 2 * 0.6°, and a side lobe suppression level of 10 dB. Additionally, our OPA's phase modulator features a half wave voltage of 6 V. Our OPA opens the door of high speed, low power-consumption, and low loss integrated LN OPAs for various applications.

physics.optics↗

arXiv2023

Bridging the short-term and long-term dynamics of economic structural change

Economic transformation -- change in what an economy produces -- is foundational to development and rising standards of living. Our understanding of this process has been propelled recently by two branches of work in the field of economic complexity, one studying how economies diversify, the other how the complexity of an economy is expressed in the makeup of its output. However, the connection between these branches is not well understood, nor how they relate to a classic understanding of structural transformation. Here, we present a simple dynamical modeling framework that unifies these areas of work, based on the widespread observation that economies diversify preferentially into activities that are related to ones they do already. We show how stylized facts of long-run structural change, as well as complexity metrics, can both emerge naturally from this one observation. However, complexity metrics take on new meanings, as descriptions of the long-term changes an economy experiences rather than measures of complexity per se. This suggests relatedness and complexity metrics are connected, in a hitherto overlooked way: Both describe structural change, on different time scales. Whereas relatedness probes transformation on short time scales, complexity metrics capture long-term change.

physics.soc-ph↗

arXiv2023

MSAT: Biologically Inspired Multi-Stage Adaptive Threshold for Conversion of Spiking Neural Networks

Spiking Neural Networks (SNNs) can do inference with low power consumption due to their spike sparsity. ANN-SNN conversion is an efficient way to achieve deep SNNs by converting well-trained Artificial Neural Networks (ANNs). However, the existing methods commonly use constant threshold for conversion, which prevents neurons from rapidly delivering spikes to deeper layers and causes high time delay. In addition, the same response for different inputs may result in information loss during the information transmission. Inspired by the biological model mechanism, we propose a multi-stage adaptive threshold (MSAT). Specifically, for each neuron, the dynamic threshold varies with firing history and input properties and is positively correlated with the average membrane potential and negatively correlated with the rate of depolarization. The self-adaptation to membrane potential and input allows a timely adjustment of the threshold to fire spike faster and transmit more information. Moreover, we analyze the Spikes of Inactivated Neurons error which is pervasive in early time steps and propose spike confidence accordingly as a measurement of confidence about the neurons that correctly deliver spikes. We use such spike confidence in early time steps to determine whether to elicit spike to alleviate this error. Combined with the proposed method, we examine the performance on non-trivial datasets CIFAR-10, CIFAR-100, and ImageNet. We also conduct sentiment classification and speech recognition experiments on the IDBM and Google speech commands datasets respectively. Experiments show near-lossless and lower latency ANN-SNN conversion. To the best of our knowledge, this is the first time to build a biologically inspired multi-stage adaptive threshold for converted SNN, with comparable performance to state-of-the-art methods while improving energy efficiency.

cs.NE↗

arXiv2023

A reproducible approach to merging behavior analysis based on High Definition Map

Existing research on merging behavior generally prioritize the application of various algorithms, but often overlooks the fine-grained process and analysis of trajectories. This leads to the neglect of surrounding vehicle matching, the opaqueness of indicators definition, and reproducible crisis. To address these gaps, this paper presents a reproducible approach to merging behavior analysis. Specifically, we outline the causes of subjectivity and irreproducibility in existing studies. Thereafter, we employ lanelet2 High Definition (HD) map to construct a reproducible framework, that minimizes subjectivities, defines standardized indicators, identifies alongside vehicles, and divides scenarios. A comparative macroscopic and microscopic analysis is subsequently conducted. More importantly, this paper adheres to the Reproducible Research concept, providing all the source codes and reproduction instructions. Our results demonstrate that although scenarios with alongside vehicles occur in less than 6% of cases, their characteristics are significantly different from others, and these scenarios are often accompanied by high risk. This paper refines the understanding of merging behavior, raises awareness of reproducible studies, and serves as a watershed moment.

cs.RO↗

arXiv2023

Simple and Fast Polarization Tracking algorithm for Continuous-Variable Quantum Key Distribution System Using Orthogonal Pilot Tone

To reduce the influence of random channel polarization variation, especially fast polarization perturbation,for continuous-variable quantum key distribution (CV-QKD) systems, a simple and fast polarization tracking algorithm is proposed and experimentally demonstrated. The algorithm is implemented by an orthogonal pilot tone scheme, one of the pilot tones is used for estimating the polarization rotation angle, and the other one is used for compensating the polarization perturbation introduced phase noise. Meanwhile, residual effects are compensated precisely with the help of a real-valued FIR filter. In this case, the excess noise introduced by polarization perturbation is effectively suppressed. Experimental results show that the polarization scrambling rate 12.57 krad/s can be tracked by using the proposed algorithm, and a good estimated parameters performance is achieved. Compared to conventional polarization tracking algorithms such as the constant modulus algorithm (CMA), experimental results show that the polarization tracking apability of the proposed algorithm is significantly improved. Furthermore, much faster polarization tracking performance is evaluated by digital simulations, and the simulation results show that about 188.50 Mrad/s can be tracked by the proposed algorithm. Thus, our method provides effective technology for the practical application of fiber-based CV-QKD.

quant-ph↗

arXiv2023

Ensemble Nonlinear Model Predictive Control for Residential Solar-Battery Energy Management

In a dynamic distribution market environment, residential prosumers with solar power generation and battery energy storage devices can flexibly interact with the power grid via power exchange. Providing a schedule of this bidirectional power dispatch can facilitate the operational planning for the grid operator and bring additional benefits to the prosumers with some economic incentives. However, the major obstacle to achieving this win-win situation is the difficulty in 1) predicting the nonlinear behaviors of battery degradation under unknown operating conditions and 2) addressing the highly uncertain generation/load patterns, in a computationally viable way. This paper thus establishes a robust short-term dispatch framework for residential prosumers equipped with rooftop solar photovoltaic panels and household batteries. The objective is to achieve the minimum-cost operation under the dynamic distribution energy market environment with stipulated dispatch rules. A general nonlinear optimization problem is formulated, taking into consideration the operating costs due to electricity trading, battery degradation, and various operating constraints. The optimization problem is solved in real-time using a proposed ensemble nonlinear model predictive control-based economic dispatch strategy, where the uncertainty in the forecast has been addressed adequately albeit with limited local data. The effectiveness of the proposed algorithm has been validated using real-world prosumer datasets.

eess.SY↗

arXiv2023

ProxyBO: Accelerating Neural Architecture Search via Bayesian Optimization with Zero-cost Proxies

Designing neural architectures requires immense manual efforts. This has promoted the development of neural architecture search (NAS) to automate the design. While previous NAS methods achieve promising results but run slowly, zero-cost proxies run extremely fast but are less promising. Therefore, it is of great potential to accelerate NAS via those zero-cost proxies. The existing method has two limitations, which are unforeseeable reliability and one-shot usage. To address the limitations, we present ProxyBO, an efficient Bayesian optimization (BO) framework that utilizes the zero-cost proxies to accelerate neural architecture search. We apply the generalization ability measurement to estimate the fitness of proxies on the task during each iteration and design a novel acquisition function to combine BO with zero-cost proxies based on their dynamic influence. Extensive empirical studies show that ProxyBO consistently outperforms competitive baselines on five tasks from three public benchmarks. Concretely, ProxyBO achieves up to 5.41x and 3.86x speedups over the state-of-the-art approaches REA and BRP-NAS.

cs.LG↗

arXiv2023

Optimizing Utility-Energy Efficiency for the Metaverse over Wireless Networks under Physical Layer Security

The Metaverse, an emerging digital space, is expected to offer various services mirroring the real world. Wireless communications for mobile Metaverse users should be tailored to meet the following user characteristics: 1) emphasizing application-specific perceptual utility instead of simply the transmission rate, 2) concerned with energy efficiency due to the limited device battery and energy intensiveness of some applications, and 3) caring about security as the applications may involve sensitive personal data. To this end, this paper incorporates application-specific utility, energy efficiency, and physical-layer security (PLS) into the studied optimization in a wireless network for the Metaverse. Specifically, after introducing utility-energy efficiency (UEE) to represent each Metaverse user's application-specific objective under PLS, we formulate an optimization to maximize the network's weighted sum-UEE by deciding users' transmission powers and communication bandwidths. The formulated problem belongs to the sum-of-ratios optimization, for which prior studies have demonstrated its difficulty. Nevertheless, our proposed algorithm 1) obtains the global optimum for the weighted sum-UEE optimization, via a transform to parametric convex optimization problems, 2) applies to any utility function which is concave, increasing, and twice differentiable, and 3) achieves a linear time complexity in the number of users (the optimal complexity in the order sense). Simulations confirm the superiority of our algorithm over other approaches. We explain that our technique for solving the sum-of-ratios optimization is applicable to other optimization problems in wireless networks and mobile computing.

cs.SI↗

arXiv2023

Multi-Task Sub-Band Network For Deep Residual Echo Suppression

This paper introduces the SWANT team entry to the ICASSP 2023 AEC Challenge. We submit a system that cascades a linear filter with a neural post-filter. Particularly, we adopt sub-band processing to handle full-band signals and shape the network with multi-task learning, where dual signal voice activity detection (DSVAD) and echo estimation are adopted as auxiliary tasks. Moreover, we particularly improve the time frequency convolution module (TFCM) to increase the receptive field using small convolution kernels. Finally, our system has ranked 4th in ICASSP 2023 AEC Challenge Non-personalized track.

eess.AS↗

arXiv2023

Resource Allocation of Federated Learning Assisted Mobile Augmented Reality System in the Metaverse

Metaverse has become a buzzword recently. Mobile augmented reality (MAR) is a promising approach to providing users with an immersive experience in the Metaverse. However, due to limitations of bandwidth, latency and computational resources, MAR cannot be applied on a large scale in the Metaverse yet. Moreover, federated learning, with its privacy-preserving characteristics, has emerged as a prospective distributed learning framework in the future Metaverse world. In this paper, we propose a federated learning assisted MAR system via non-orthogonal multiple access for the Metaverse. Additionally, to optimize a weighted sum of energy, latency and model accuracy, a resource allocation algorithm is devised by setting appropriate transmission power, CPU frequency and video frame resolution for each user. Experimental results demonstrate that our proposed algorithm achieves an overall good performance compared to a random algorithm and greedy algorithm.

cs.SI↗