arXiv subjects

Yifan Li

Publications and source records attributed to Yifan Li.

At least 181 records · Page 10Linked to original sources

arXiv2023

Low-Complexity Three-Dimensional AOA-Cross Geometric Center Localization Methods via Multi-UAV network

Angle of arrival (AOA) is widely used to locate a wireless signal emitter in unmanned aerial vehicle (UAV) localization. Compared with received signal strength (RSS) and time of arrival (TOA), it has higher accuracy and is not sensitive to time synchronization of the distributed sensors. However, there are few works focused on three-dimensional (3-D) scenario. Furthermore, although maximum likelihood estimator (MLE) has a relatively high performance, its computational complexity is ultra high. It is hard to employ it in practical applications. This paper proposed two multiplane geometric center based methods for 3-D AOA in UAV positioning. The first method could estimate the source position and angle measurement noise at the same time by seeking a center of the inscribed sphere, called CIS. Firstly, every sensor could measure two angles, azimuth angle and elevation angle. Based on that, two planes are constructed. Then, the estimated values of source position and angle noise are achieved by seeking the center and radius of the corresponding inscribed sphere. Deleting the estimation of the radius, the second algorithm, called MSD-LS, is born. It is not able to estimate angle noise but has lower computational complexity. Theoretical analysis and simulation results show that proposed methods could approach the Cramer-Rao lower bound (CRLB) and have lower complexity than MLE.

eess.SP↗

arXiv2023

Diffusion Models for Non-autoregressive Text Generation: A Survey

Non-autoregressive (NAR) text generation has attracted much attention in the field of natural language processing, which greatly reduces the inference latency but has to sacrifice the generation accuracy. Recently, diffusion models, a class of latent variable generative models, have been introduced into NAR text generation, showing an improved text generation quality. In this survey, we review the recent progress in diffusion models for NAR text generation. As the background, we first present the general definition of diffusion models and the text diffusion models, and then discuss their merits for NAR generation. As the core content, we further introduce two mainstream diffusion models in existing work of text diffusion, and review the key designs of the diffusion process. Moreover, we discuss the utilization of pre-trained language models (PLMs) for text diffusion models and introduce optimization techniques for text data. Finally, we discuss several promising directions and conclude this paper. Our survey aims to provide researchers with a systematic reference of related research on text diffusion models for NAR generation. We present our collection of text diffusion models at https://github.com/RUCAIBox/Awesome-Text-Diffusion-Models.

cs.CL↗

arXiv2023

Diffusion-NAT: Self-Prompting Discrete Diffusion for Non-Autoregressive Text Generation

Recently, continuous diffusion models (CDM) have been introduced into non-autoregressive (NAR) text-to-text generation. However, the discrete nature of text increases the difficulty of CDM to generate coherent and fluent texts, and also causes the incompatibility problem between CDM and advanced NLP techniques, especially the popular pre-trained language models~(PLMs). To solve it, we propose Diffusion-NAT, which introduces discrete diffusion models~(DDM) into NAR text-to-text generation and integrates BART to improve the performance. By revising the decoding process of BART and the typical settings of DDM, we unify the inference process of BART and the denoising process of DDM into the same NAR masked tokens recovering task. In this way, DDM can rely on BART to perform denoising, which can benefit from both the rich pre-learned knowledge of BART and the iterative refining paradigm of DDM. Besides, we also propose the iterative self-prompting strategy to further improve the generation quality. Experimental results on 7 datasets show that our approach can outperform competitive NAR methods, and even surpass autoregressive methods. Our code and data will be publicly released.

cs.CL↗

arXiv2023

DeePMD-kit v2: A software package for Deep Potential models

DeePMD-kit is a powerful open-source software package that facilitates molecular dynamics simulations using machine learning potentials (MLP) known as Deep Potential (DP) models. This package, which was released in 2017, has been widely used in the fields of physics, chemistry, biology, and material science for studying atomistic systems. The current version of DeePMD-kit offers numerous advanced features such as DeepPot-SE, attention-based and hybrid descriptors, the ability to fit tensile properties, type embedding, model deviation, Deep Potential - Range Correction (DPRc), Deep Potential Long Range (DPLR), GPU support for customized operators, model compression, non-von Neumann molecular dynamics (NVNMD), and improved usability, including documentation, compiled binary packages, graphical user interfaces (GUI), and application programming interfaces (API). This article presents an overview of the current major version of the DeePMD-kit package, highlighting its features and technical details. Additionally, the article benchmarks the accuracy and efficiency of different models and discusses ongoing developments.

physics.chem-ph↗

arXiv2023

Machine Learning Methods for Inferring the Number of UAV Emitters via Massive MIMO Receive Array

To provide important prior knowledge for the DOA estimation of UAV emitters in future wireless networks, we present a complete DOA preprocessing system for inferring the number of emitters via massive MIMO receive array. Firstly, in order to eliminate the noise signals, two high-precision signal detectors, square root of maximum eigenvalue times minimum eigenvalue (SR-MME) and geometric mean (GM), are proposed. Compared to other detectors, SR-MME and GM can achieve a high detection probability while maintaining extremely low false alarm probability. Secondly, if the existence of emitters is determined by detectors, we need to further confirm their number. Therefore, we perform feature extraction on the the eigenvalue sequence of sample covariance matrix to construct feature vector and innovatively propose a multi-layer neural network (ML-NN). Additionally, the support vector machine (SVM), and naive Bayesian classifier (NBC) are also designed. The simulation results show that the machine learning-based methods can achieve good results in signal classification, especially neural networks, which can always maintain the classification accuracy above 70\% with massive MIMO receive array. Finally, we analyze the classical signal classification methods, Akaike (AIC) and Minimum description length (MDL). It is concluded that the two methods are not suitable for scenarios with massive MIMO arrays, and they also have much worse performance than machine learning-based classifiers.

eess.SP↗

arXiv2022

Recent Advances in RecBole: Extensions with more Practical Considerations

RecBole has recently attracted increasing attention from the research community. As the increase of the number of users, we have received a number of suggestions and update requests. This motivates us to make some significant improvements on our library, so as to meet the user requirements and contribute to the research community. In order to show the recent update in RecBole, we write this technical report to introduce our latest improvements on RecBole. In general, we focus on the flexibility and efficiency of RecBole in the past few months. More specifically, we have four development targets: (1) more flexible data processing, (2) more efficient model training, (3) more reproducible configurations, and (4) more comprehensive user documentation. Readers can download the above updates at: https://github.com/RUCAIBox/RecBole.

cs.IR↗

arXiv2022

A 2030 United States Macro Grid Unlocking Geographical Diversity to Accomplish Clean Energy Goals

Some U.S. states have set clean energy goals and targets in an effort to decarbonize their electricity sectors. There are many reasons for such goals and targets, including the increasingly apparent effects of climate change. A handful of states (Washington, California, New York, and Virginia) are aiming for deep decarbonization by 2050 or earlier, a mere 30 years or less from today. The urgency of substantial carbon emissions reduction (50% or more by 2030) needed to avoid catastrophic climate impacts requires even more ambitious efforts than some of the original targets (e.g., a 30% renewable portfolio standard) set for between now and 2030. With the cost of solar and wind energy falling faster than expected in recent years, economics are also driving rapid expansion of clean energy investments. With this in mind, this report examines combinations of interregional AC and High-Voltage DC (HVDC) transmission upgrades and additions to evaluate the benefits of large-scale transmission expansion.

eess.SY↗

arXiv2022

Einstein-Podolsky-Rosen experiment with two Bose-Einstein condensates

In 1935, Einstein, Podolsky and Rosen (EPR) conceived a Gedankenexperiment which became a cornerstone of quantum technology and still challenges our understanding of reality and locality today. While the experiment has been realized with small quantum systems, a demonstration of the EPR paradox with spatially separated, massive many-particle systems has so far remained elusive. We observe the EPR paradox in an experiment with two spatially separated Bose-Einstein condensates containing about 700 Rubidium atoms each. EPR entanglement in conjunction with individual manipulation of the two condensates on the quantum level, as demonstrated here, constitutes an important resource for quantum metrology and information processing with many-particle systems. Our results show that the conflict between quantum mechanics and local realism does not disappear as the system size is increased to over a thousand massive particles.

quant-ph↗

arXiv2022

Affective Behaviour Analysis Using Pretrained Model with Facial Priori

Affective behaviour analysis has aroused researchers' attention due to its broad applications. However, it is labor exhaustive to obtain accurate annotations for massive face images. Thus, we propose to utilize the prior facial information via Masked Auto-Encoder (MAE) pretrained on unlabeled face images. Furthermore, we combine MAE pretrained Vision Transformer (ViT) and AffectNet pretrained CNN to perform multi-task emotion recognition. We notice that expression and action unit (AU) scores are pure and intact features for valence-arousal (VA) regression. As a result, we utilize AffectNet pretrained CNN to extract expression scores concatenating with expression and AU scores from ViT to obtain the final VA features. Moreover, we also propose a co-training framework with two parallel MAE pretrained ViT for expression recognition tasks. In order to make the two views independent, we random mask most patches during the training process. Then, JS divergence is performed to make the predictions of the two views as consistent as possible. The results on ABAW4 show that our methods are effective.

cs.CV↗

arXiv2022

Deep Learning Based DOA Estimation for Hybrid Massive MIMO Receive Array with Overlapped Subarrays

To improve the accuracy of direction-of-arrival (DOA) estimation, a deep learning (DL)-based method called CDAE-DNN is proposed for hybrid analog and digital (HAD) massive MIMO receive array with overlapped subarray (OSA) architecture in this paper. In the proposed method, the sample covariance matrix (SCM) is first input to a convolution denoise autoencoder (CDAE) to remove the approximation error, then the output of CDAE is imported to a fully-connected (FC) network to get the estimation result. Based on the simulation results, the proposed CDAE-DNN has great performance advantages over traditional MUSIC algorithm and CNN-based method, especially in the situations with low signal to noise ratio (SNR) and low snapshot numbers. And the OSA architecture has also been shown to significantly improve the estimation accuracy compared to non-overlapped subarray (NOSA) architecture. In addition, the Cramer-Rao lower bound (CRLB) for the HAD-OSA architecture is presented.

eess.SP↗

arXiv2022

Distributed Processing of k Shortest Path Queries over Dynamic Road Networks

The problem of identifying the k-shortest paths (KSPs for short) in a dynamic road network is essential to many location-based services. Road networks are dynamic in the sense that the weights of the edges in the corresponding graph constantly change over time, representing evolving traffic conditions. Very often such services have to process numerous KSP queries over large road networks at the same time, thus there is a pressing need to identify distributed solutions for this problem. However, most existing approaches are designed to identify KSPs on a static graph in a sequential manner (i.e., the (i+1)-th shortest path is generated based on the i-th shortest path), restricting their scalability and applicability in a distributed setting. We therefore propose KSP-DG, a distributed algorithm for identifying k-shortest paths in a dynamic graph. It is based on partitioning the entire graph into smaller subgraphs, and reduces the problem of determining KSPs into the computation of partial KSPs in relevant subgraphs, which can execute in parallel on a cluster of servers. A distributed two-level index called DTLP is developed to facilitate the efficient identification of relevant subgraphs. A salient feature of DTLP is that it indexes a set of virtual paths that are insensitive to varying traffic conditions, leading to very low maintenance cost in dynamic road networks. This is the first treatment of the problem of processing KSP queries over dynamic road networks. Extensive experiments conducted on real road networks confirm the superiority of our proposal over baseline methods.

cs.DB↗

arXiv2022

LQoCo: Learning to Optimize Cache Capacity Overloading in Storage Systems

Cache plays an important role to maintain high and stable performance (i.e. high throughput, low tail latency and throughput jitter) in storage systems. Existing rule-based cache management methods, coupled with engineers' manual configurations, cannot meet ever-growing requirements of both time-varying workloads and complex storage systems, leading to frequent cache overloading. In this paper, we for the first time propose a light-weight learning-based cache bandwidth control technique, called \LQoCo which can adaptively control the cache bandwidth so as to effectively prevent cache overloading in storage systems. Extensive experiments with various workloads on real systems show that LQoCo, with its strong adaptability and fast learning ability, can adapt to various workloads to effectively control cache bandwidth, thereby significantly improving the storage performance (e.g. increasing the throughput by 10\%-20\% and reducing the throughput jitter and tail latency by 2X-6X and 1.5X-4X, respectively, compared with two representative rule-based methods).

cs.AR↗

arXiv2022

$\rm ^{83}Rb$/$\rm ^{83m}Kr$ production and cross-section measurement with 3.4 MeV and 20 MeV proton beams

$\rm ^{83m}Kr$, with a short lifetime, is an ideal calibration source for liquid xenon or liquid argon detectors. The $\rm ^{83m}Kr$ isomer can be generated through the decay of $\rm ^{83} Rb$ isotope which is usually produced by proton beams bombarding natural krypton atoms. In this paper, we report a successful production of $\rm ^{83}Rb/^{83m}Kr$ with a proton beam energy of 3.4 MeV, and the first measurement of the production rate with such low energy proton beams. Another production attempt is performed using the newly available 20 MeV proton beam in China, and the measured production rate is consistent with previous measurements. The produced $\rm ^{83m}Kr$ source has been successfully injected into the PandaX-II liquid xenon detector, yielding enough statistics for detector calibration.

nucl-ex↗

arXiv2021

Identifying and mitigating bias in algorithms used to manage patients in a pandemic

Numerous COVID-19 clinical decision support systems have been developed. However many of these systems do not have the merit for validity due to methodological shortcomings including algorithmic bias. Methods Logistic regression models were created to predict COVID-19 mortality, ventilator status and inpatient status using a real-world dataset consisting of four hospitals in New York City and analyzed for biases against race, gender and age. Simple thresholding adjustments were applied in the training process to establish more equitable models. Results Compared to the naively trained models, the calibrated models showed a 57% decrease in the number of biased trials, while predictive performance, measured by area under the receiver/operating curve (AUC), remained unchanged. After calibration, the average sensitivity of the predictive models increased from 0.527 to 0.955. Conclusion We demonstrate that naively training and deploying machine learning models on real world data for predictive analytics of COVID-19 has a high risk of bias. Simple implemented adjustments or calibrations during model training can lead to substantial and sustained gains in fairness on subsequent deployment.

cs.LG↗

arXiv2021

Semi-$G$-normal: a Hybrid between Normal and $G$-normal (Full Version)

The $G$-expectation framework is a generalization of the classical probabilistic system motivated by Knightian uncertainty, where the $G$-normal plays a central role. However, from a statistical perspective, $G$-normal distributions look quite different from the classical normal ones. For instance, its uncertainty is characterized by a set of distributions which covers not only classical normal with different variances, but additional distributions typically having non-zero skewness. The $G$-moments of $G$-normals are defined by a class of fully nonlinear PDEs called $G$-heat equations. To understand $G$-normal in a probabilistic and stochastic way that is more friendly to statisticians and practitioners, we introduce a substructure called semi-$G$-normal, which behaves like a hybrid between normal and $G$-normal: it has variance uncertainty but zero-skewness. We will show that the non-zero skewness arises when we impose the $G$-version sequential independence on the semi-$G$-normal. More importantly, we provide a series of representations of random vectors with semi-$G$-normal marginals under various types of independence. Each of these representations under a typical order of independence is closely related to a class of state-space volatility models with a common graphical structure. In short, semi-$G$-normal gives a (conceptual) transition from classical normal to $G$-normal, allowing us a better understanding of the distributional uncertainty of $G$-normal and the sequential independence.

math.PR↗

arXiv2021

Bayesian optimization assisted unsupervised learning for efficient intra-tumor partitioning in MRI and survival prediction for glioblastoma patients

Glioblastoma is profoundly heterogeneous in microstructure and vasculature, which may lead to tumor regional diversity and distinct treatment response. Although successful in tumor sub-region segmentation and survival prediction, radiomics based on machine learning algorithms, is challenged by its robustness, due to the vague intermediate process and track changes. Also, the weak interpretability of the model poses challenges to clinical application. Here we proposed a machine learning framework to semi-automatically fine-tune the clustering algorithms and quantitatively identify stable sub-regions for reliable clinical survival prediction. Hyper-parameters are automatically determined by the global minimum of the trained Gaussian Process (GP) surrogate model through Bayesian optimization(BO) to alleviate the difficulty of tuning parameters for clinical researchers. To enhance the interpretability of the survival prediction model, we incorporated the prior knowledge of intra-tumoral heterogeneity, by segmenting tumor sub-regions and extracting sub-regional features. The results demonstrated that the global minimum of the trained GP surrogate can be used as sub-optimal hyper-parameter solutions for efficient. The sub-regions segmented based on physiological MRI can be applied to predict patient survival, which could enhance the clinical interpretability for the machine learning model.

eess.IV↗

arXiv2021

RP2K: A Large-Scale Retail Product Dataset for Fine-Grained Image Classification

We introduce RP2K, a new large-scale retail product dataset for fine-grained image classification. Unlike previous datasets focusing on relatively few products, we collect more than 500,000 images of retail products on shelves belonging to 2000 different products. Our dataset aims to advance the research in retail object recognition, which has massive applications such as automatic shelf auditing and image-based product information retrieval. Our dataset enjoys following properties: (1) It is by far the largest scale dataset in terms of product categories. (2) All images are captured manually in physical retail stores with natural lightings, matching the scenario of real applications. (3) We provide rich annotations to each object, including the sizes, shapes and flavors/scents. We believe our dataset could benefit both computer vision research and retail industry. Our dataset is publicly available at https://www.pinlandata.com/rp2k_dataset.

cs.CV↗

arXiv2021

Adaptive unsupervised learning with enhanced feature representation for intra-tumor partitioning and survival prediction for glioblastoma

Glioblastoma is profoundly heterogeneous in regional microstructure and vasculature. Characterizing the spatial heterogeneity of glioblastoma could lead to more precise treatment. With unsupervised learning techniques, glioblastoma MRI-derived radiomic features have been widely utilized for tumor sub-region segmentation and survival prediction. However, the reliability of algorithm outcomes is often challenged by both ambiguous intermediate process and instability introduced by the randomness of clustering algorithms, especially for data from heterogeneous patients. In this paper, we propose an adaptive unsupervised learning approach for efficient MRI intra-tumor partitioning and glioblastoma survival prediction. A novel and problem-specific Feature-enhanced Auto-Encoder (FAE) is developed to enhance the representation of pairwise clinical modalities and therefore improve clustering stability of unsupervised learning algorithms such as K-means. Moreover, the entire process is modelled by the Bayesian optimization (BO) technique with a custom loss function that the hyper-parameters can be adaptively optimized in a reasonably few steps. The results demonstrate that the proposed approach can produce robust and clinically relevant MRI sub-regions and statistically significant survival predictions.

cs.LG↗