Frequent road incidents cause significant physical harm and economic losses globally. The key to ensuring road safety lies in accurately perceiving surrounding road incidents. However, the highly dynamic nature o...
详细信息
Intensity modulation/direct detection(IM/DD) optical fiber communication system is an appropriate candidate for optical interconnect applications due to its low cost and low power consumption characteristics [1]. 4-le...
详细信息
Intensity modulation/direct detection(IM/DD) optical fiber communication system is an appropriate candidate for optical interconnect applications due to its low cost and low power consumption characteristics [1]. 4-level pulse amplitude modulation(PAM-4) is widely discussed in optical interconnects due to its simpler transceiver configuration and implementation [2].
Dear Editor,This letter focuses on the node localization problem in underwater acoustic sensor networks(UWASNs) with the time-dependent property and various noise disturbances. A range-based localization scheme aided ...
详细信息
Dear Editor,This letter focuses on the node localization problem in underwater acoustic sensor networks(UWASNs) with the time-dependent property and various noise disturbances. A range-based localization scheme aided with an integral-feedback-based neurodynamics(IND)model is proposed and referred to as IND-RS, which has the stability against the internal perturbations encountered during the solving process.
With the development of image restoration technology based on deep learning,more complex problems are being solved,especially in image semantic inpainting based on ***,image semantic inpainting techniques are becoming...
详细信息
With the development of image restoration technology based on deep learning,more complex problems are being solved,especially in image semantic inpainting based on ***,image semantic inpainting techniques are becoming more ***,due to the limitations of memory,the instability of training,and the lack of sample diversity,the results of image restoration are still encountering difficult problems,such as repairing the content of glitches which cannot be well integrated with the original ***,we propose an image inpainting network based on Wasserstein generative adversarial network(WGAN)*** the corresponding technology having been adjusted and improved,we attempted to use the Adam algorithm to replace the traditional stochastic gradient descent,and another algorithm to optimize the training used in recent *** evaluated our algorithm on the ImageNet *** obtained high-quality restoration results,indicating that our algorithm improves the clarity and consistency of the image.
Due to the presence of a large amount of personal sensitive information in social networks,privacy preservation issues in social networks have attracted the attention of many *** by the self-nonself discrimination par...
详细信息
Due to the presence of a large amount of personal sensitive information in social networks,privacy preservation issues in social networks have attracted the attention of many *** by the self-nonself discrimination paradigmin the biological immune system,the negative representation of information indicates features such as simplicity and efficiency,which is very suitable for preserving social network ***,we suggest a method to preserve the topology privacy and node attribute privacy of attribute social networks,called ***,a negative survey-based method is developed to disturb the relationship between nodes in the social network so that the topology structure can be kept ***,a negative database-based method is proposed to hide node attributes,so that the privacy of node attributes can be preserved while supporting the similarity estimation between different node attributes,which is crucial to the analysis of social *** evaluate the performance of the AttNetNRI,empirical studies have been conducted on various attribute social networks and compared with several state-of-the-art methods tailored to preserve the privacy of social *** experimental results show the superiority of the developed method in preserving the privacy of attribute social networks and demonstrate the effectiveness of the topology disturbing and attribute hiding *** experimental results show the superiority of the developed methods in preserving the privacy of attribute social networks and demonstrate the effectiveness of the topological interference and attribute-hiding components.
Offline reinforcement learning aims to maximize the use of static offline datasets to train agents without interacting with the environment. For the problem of distribution shifts, most approaches avoid out-of-distrib...
Offline reinforcement learning aims to maximize the use of static offline datasets to train agents without interacting with the environment. For the problem of distribution shifts, most approaches avoid out-of-distribution actions through strong constraints, and do not consider generalization and learning within these domains. Based on this problem, we propose a novel method offline reinforcement learning based on next state supervision (NSS), which consists of two main components, the guidance policy and an adaptive coefficient. The guidance policy outputs the next-state with the highest value within a certain range around the current state and an adaptive coefficient regulates the weight of the penalty term in the learned policy. Empirical studies show that the method improves the performance of the baseline method with constraints while having some generalization ability.
Offline reinforcement learning is an approach for transforming static datasets into powerful decision engines. It cannot interact with the environment online, which leads to distribution shifts. Previous approaches ad...
Offline reinforcement learning is an approach for transforming static datasets into powerful decision engines. It cannot interact with the environment online, which leads to distribution shifts. Previous approaches addressed this problem by making the current policy as close as possible to the behavior policy. However, this type of approach severely limits the generalization ability of Q-functions. To address the above concerns, offline reinforcement learning with policy guidance and uncertainty estimation (PGUE) is proposed. PGUE proposes a fine-grained adjustment approach that improves the generalization ability of Q-functions using a perturbation model. The enhancement of the out-of-distribution generalization of Q-functions is achieved through the implicit guidance of the state space via a deterministic latent policy. Meanwhile, integrating uncertainty estimation into the loss function improves the in-distribution generalization of Q-functions. On the D4RL benchmark, PGUE has better performance than baselines. Moreover, we verify the state distribution and its out-of-distribution generalization ability.
In recent years, offline reinforcement learning has attracted considerable attention in artificial intelligence. By generating a static dataset through a behavior policy, it is unable to engage in online interactions ...
In recent years, offline reinforcement learning has attracted considerable attention in artificial intelligence. By generating a static dataset through a behavior policy, it is unable to engage in online interactions with the environment. However, this inevitably leads to states or actions undergoing inherent distribution shifts. To address the above concerns, offline reinforcement learning with generative adversarial networks and uncertainty estimation (GANUE) is proposed. This approach parameterizes the conditional generative adversarial networks and avoids the over-constraint problem that would be introduced when using a distance metric. Estimating the Q-value through ensemble uncertainty not only relaxes the policy constraint strength but also enhances the out-of-distribution generalization ability. The experimental results show that GANUE significantly performs better on the Maze2D and Adroit tasks than multiple baselines. In addition, we perform sensitivity analysis experiments for the parameters of the perturbation model.
In this paper,we propose an Unsupervised Nonlinear Adaptive Manifold Learning method(UNAML)that considers both global and local *** this approach,we apply unlabeled training samples to study nonlinear manifold feature...
详细信息
In this paper,we propose an Unsupervised Nonlinear Adaptive Manifold Learning method(UNAML)that considers both global and local *** this approach,we apply unlabeled training samples to study nonlinear manifold features,while considering global pairwise distances and maintaining local topology *** method aims at minimizing global pairwise data distance errors as well as local structural *** order to enable our UNAML to be more efficient and to extract manifold features from the external source of new data,we add a feature approximate error that can be used to learn a linear ***,we add a feature approximate error that can be used to learn a linear *** addition,we use a method of adaptive neighbor selection to calculate local structural *** paper uses the kernel matrix method to optimize the original *** algorithm proves to be more effective when compared with the experimental results of other feature extraction methods on real face-data sets and object data sets.
Ridge regression (RR)-based methods aim to obtain a low-dimensional subspace for feature extraction. However, the subspace's dimensionality does not exceed the number of data categories, hence compromising its cap...
详细信息
暂无评论