检索结果-内蒙古大学图书馆

39th IEEE International Conference on data Engineering, ICDE 2023

作者： Chen, Zhijun Sun, Hailong He, Haoqian Chen, Pengpeng Beihang University Sklsde Lab Beijing China Beihang University Beijing Advanced Innovation Center for Big Data and Brain Computing Beijing China China's Aviation System Engineering Research Institute Beijing China

ISBN: (纸本)9798350322279

This paper explores the integration of symbolic logic knowledge into deep neural networks for learning from noisy crowd labels. We introduce Logic-guided Learning from Noisy Crowd Labels (Logic-LNCL), an EM-alike iterative logic knowledge distillation framework that learns from both noisy labeled data and logic rules of interest. Unlike traditional EM methods, our framework contains a "pseudo-E-step"that distills from the logic rules a new type of learning target, which is then used in the "pseudo-M-step"for training the classifier. Extensive evaluations on two real-world datasets for text sentiment classification and named entity recognition demonstrate that the proposed framework improves the state-of-the-art and provides a new solution to learning from noisy crowd labels. © 2023 IEEE.

关键词： Crowdsourcing

来源：评论

学校读者我要写书评

暂无评论

Ultimate Negative Sampling for Contrastive Learning

Ultimate Negative Sampling for Contrastive Learning

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Huijie Guo Lei Shi Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University

Unsupervised learning has received more attention due to the superior performance of contrastive learning methods. Most contrastive methods use data augmentation techniques to construct positive and negative pairs. The augmented view of the same sample is regarded as a positive sample, while the rest are negative samples. This negative sampling strategy has strong randomness and ignores samples that are semantically similar to anchors, namely sampling bias. This problem has been addressed by weighting the similarity of negative samples. In this paper, we propose a novel ultimate negative sampling for contrastive learning. Unlike random sampling, we set a more extreme negative sample selection mechanism based on the ideal representation of the sample. Furthermore, we constrain the consistency between samples across the space. Experiment results demonstrate the proposed method’s superiority on multiple benchmark datasets.

关键词： Benchmark testing Signal processing Acoustics Speech processing Unsupervised learning

来源：评论

学校读者我要写书评

暂无评论

Cooperative differential games guidance laws for multiple attackers against an active defense target

引用

Chinese Journal of Aeronautics 2022年第5期35卷 374-389页

作者： Fei LIU Xiwang DONG Qingdong LI Zhang REN School of Automation Science and Electrical Engineering Science and Technology on Aircraft Control LaboratoryBeihang UniversityBeijing 100083China Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang UniversityBeijing 100083China Key Laboratory of Dependable Service Computing in Cyber Physical Society Ministry of Education of ChinaChongqing UniversityChongqing 400044China

This paper is concerned with a scenario of multiple attackers trying to intercept a target with active *** types of agents are considered in the guidance:The multiple attackers,the target and the defender,where the attackers aim to pursuit the target from different directions and evade from the defender *** guidance engagement is formulated in the framework of a zero-sum two-person differential game between the two opposing teams,such that the measurements on the maneuver of the target or estimations on the defending strategy of the defender can be *** of the attackers resides in two aspects:redundant interception under the threat of the defender and the relative intercept geometry with the *** miss distances,the relative intercept angle errors and the costs of the agents are combined into a single performance index of the *** formulation enables a unitary approach to the design of guidance laws for the *** minimize the control efforts and miss distances for the attackers,an optimization method is proposed to find the best anticipated miss distances to the defender under the constraint that the defender is endowed with a capture *** simulations with two cases are conducted to illustrate the effectiveness of the proposed cooperative guidance law.

关键词： Active defense Cooperative guidance Differential games Minimum effort optimization Relative intercept angle

来源：评论

学校读者我要写书评

暂无评论

Privacy-preserving graph publishing with disentangled variational information bottleneck

Privacy-preserving graph publishing with disentangled variat...

引用

作者： Ma, Liya Li, Chen Sun, Siqi Guo, Shu Wang, Lihong Li, Jianxin School of Computer Science and Engineering Beihang University Beijing China Beijing Advanced Innovation Center for Big Data and Brain Computing Beijing China ARC LAB Tencent Shenzhen China China Academy of Industrial Internet Beijing China National Computer Network Emergency Response Technical Team Coordination Center of China Beijing China

Social networks collect enormous amounts of user personal and behavioral data, which could threaten users' privacy if published or shared directly. Privacy-preserving graph publishing (PPGP) can make user data available while protecting private information. For this purpose, in PPGP, anonymization methods like perturbation and generalization are commonly used. However, traditional anonymization methods are challenging in balancing high-level privacy and utility, ineffective at defending against both various link and hybrid inference attacks, as well as vulnerable to graph neural network (GNN)-based attacks. To solve those problems, we present a novel privacy-disentangled approach that disentangles private and non-private information for a better privacy-utility trade-off. Moreover, we propose a unified graph deep learning framework for PPGP, denoted privacy-disentangled variational information bottleneck (PDVIB). Using low-dimensional perturbations, the model generates an anonymized graph to defend against various inference attacks, including GNN-based attacks. Particularly, the model fits various privacy settings by employing adjustable perturbations at the node level. With three real-world datasets, PDVIB is demonstrated to generate robust anonymous graphs that defend against various privacy inference attacks while maintaining the utility of non-private information. © 2023 John Wiley & Sons Ltd.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Personalized Federated Learning with Collaborative Aggregation Networks for Multi-Site brain Disorder Diagnosis 4

Personalized Federated Learning with Collaborative Aggregati...

引用

4th International Conference on Industrial Automation, Robotics and Control Engineering, IARCE 2024

作者： Si, Qian Li, Yang School of Cyber Science and Technology Beihang University Beijing China Department of Automation Science and Electrical Engineering The Beijing Advanced Innovation Center for Big Data and Brain Computing State Key Laboratory of Virtual Reality Technology and Systems Beijing China Advanced Institute of Information Technology Peking University Beijing China Beihang University Beijing China

ISBN: (纸本)9798350380323

In multi-site brain disease diagnosis studies, traditional centralized training methods necessitate sharing medical data, posing significant privacy risks. Federated learning (FL) offers a privacy-preserving solution by enabling global model training through aggregating locally trained models from multiple data centers without sharing raw data. However, current FL approaches rely on a server-based network topology, where central server failure disrupts training. Additionally, data heterogeneity across sites often slows convergence and reduces accuracy. To overcome these issues, we introduce a decentralized personalized federated learning collaborative aggregation network (pFedCAN). This framework has two core components: (1) separating local models into shared and personalized layers, and (2) forming a collaborative aggregation network via similarity detection in the shared layers. Specifically, each center trains its local model, then separates it into shared and personalized layers. The shared layer is exchanged with other centers, while the personalized layer remains local. data centers analyze similarities in received shared layers to build a collaborative network, where shared layers from similar centers are aggregated to refine the model. This approach flexibly adapts to varying levels of data heterogeneity, enhancing model training efficiency. Validation on public datasets, ABIDE I and ADHD, shows that the proposed method outperforms current leading techniques. © 2024 IEEE.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Pre-training with asynchronous supervised learning for reinforcement learning based autonomous driving

引用

Frontiers of Information Technology & Electronic Engineering 2021年第5期22卷 673-686页

作者： Yunpeng WANG Kunxian ZHENG Daxin TIAN Xuting DUAN Jianshan ZHOU Beijing Advanced.Innovation Center for Big Data and Brain Computing School of Transportation Science and EngineeringBeihang UniversityBeijing 100191China

Rule-based autonomous driving systems may suffer from increased complexity with large-scale intercoupled rules,so many researchers are exploring learning-based *** learning(RL)has been applied in designing autonomous driving systems because of its outstanding performance on a wide variety of sequential control ***,poor initial performance is a major challenge to the practical implementation of an RL-based autonomous driving *** training requires extensive training data before the model achieves reasonable performance,making an RL-based model inapplicable in a real-world setting,particularly when data are *** propose an asynchronous supervised learning(ASL)method for the RL-based end-to-end autonomous driving model to address the problem of poor initial performance before training this RL-based model in real-world ***,prior knowledge is introduced in the ASL pre-training stage by asynchronously executing multiple supervised learning processes in parallel,on multiple driving demonstration data *** pre-training,the model is deployed on a real vehicle to be further trained by RL to adapt to the real environment and continuously break the performance *** presented pre-training method is evaluated on the race car simulator,TORCS(The Open Racing Car Simulator),to verify that it can be sufficiently reliable in improving the initial performance and convergence speed of an end-to-end autonomous driving model in the RL training *** addition,a real-vehicle verification system is built to verify the feasibility of the proposed pre-training method in a real-vehicle *** results show that using some demonstrations during a supervised pre-training stage allows significant improvements in initial performance and convergence speed in the RL training stage.

关键词： Self-driving Autonomous vehicles Reinforcement learning Supervised learning

来源：评论

学校读者我要写书评

暂无评论

Non-salient region erasure for time series augmentation

引用

Frontiers of Computer Science 2022年第6期16卷 203-205页

作者： Pin LIU Xiaohui GUO Bin SHI Rui WANG Tianyu WO Xudong LIU State Key Lab of Software Development Environment(SKLSDE) Beihang UniversityBeijing100191China Beijing Advanced Innovation Center for Big Data and Brain Computing(BDBC) Beijing100191China Hangzhou Innovation Institute Beihang UniversityHangzhou310052China School of Computer Science and Technology Xi’an Jiaotong UniversityXi’an710049China

1 Introduction Time seriesaugmentationis an essential approachto solvethe overfitting problem on the time series classification(TSC)task[1,2].Although existing approaches perform better in mitigating this problem,none of them focus on protecting saliency regions on time *** key informative shapelets contained in these regions are the core basis for distinguishing categories(e.g.,upward spikes in ECG and high amplitude in Sensor).

关键词： Sensor series series

来源：评论

学校读者我要写书评

暂无评论

Three-dimensional cooperative guidance strategy and guidance law for intercepting highly maneuvering target

引用

Chinese Journal of Aeronautics 2021年第5期34卷 485-495页

作者： Ziyan CHEN Jianglong YU Xiwang DONG Zhang REN School of Automation Science and Electrical Engineering Science and Technology on Aircraft Control LaboratoryBeihang UniversityBeijing 100191China Beijing Advanced Innovation Center for Big Data cmd Brain Computing Beihang UniversityBeijing 100191China

Cooperative interception of the target with strong maneuverability by multiple missiles with weak maneuverability in the three-dimensional nonlinear model is ***,the three-dimensional nonlinear model of cooperative guidance is *** three-dimensional reachable region is represented composed of lateral acceleration and longitudinal acceleration in the two-dimensional coordinate ***,the problem of the multiple missile’s reachable coverage area is transformed into the problem of cooperative coverage.A cooperative coverage strategy is proposed and an algorithm for quickly calculating the number of required missiles is ***,the guidance law based on the cooperative coverage strategy is proposed,and it is proved that cooperative interception of the target can be achieved under the acceleration ***,the relations among the number of missiles,the initial array position of terminal guidance and the coverage area of the target’s large maneuver are *** dynamic adjustment strategy of guidance parameters is proposed to reduce the guidance ***,simulation results show that multiple missiles with low maneuverability can achieve effective interception of target with strong maneuverability through the proposed cooperative strategy and cooperative guidance method.

关键词： Acceleration constraint Cooperative interception Coverage strategy Guidance law Highly maneuvering target

来源：评论

学校读者我要写书评

暂无评论

Dynamic Formation Tracking of Multi-agent Systems with Bounded Unknown Leader Input 5th

Dynamic Formation Tracking of Multi-agent Systems with Bou...

引用

5th Chinese Conference on Swarm Intelligence and Cooperative Control, CCSICC 2021

作者： Su, Piaoyi Dong, Xiwang Zhao, Qin Li, Qingdong Ren, Zhang School of Automation Science and Electronic Engineering Science and Technology on Aircraft Control Laboratory Beihang University Beijing100191 China Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University Beijing100191 China Beijing Institute of Control and Electronics Technology Beijing100038 China

ISBN: (纸本)9789811939976

This literature investigate the dynamic formation tracking problem of multiple Lagrange systems with linear nonautonomous leader over directed topology. In order to estimate the leader system, a distributed control scheme is proposed firstly by constructing adaptive distributed observer. Secondly, this paper design a nonlinear function to decrease the influence from the leader’s bounded unknown input. Then, the dynamic formation tracking problem of multiple Euler-Lagrange systems with nonlinear uncertainties and disturbances is solved by distributed tracking algorithm. © 2023, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

Hyperbolic Geometric Latent Diffusion Model for Graph Generation 41

Hyperbolic Geometric Latent Diffusion Model for Graph Genera...

引用

41st International Conference on Machine Learning, ICML 2024

作者： Fu, Xingcheng Gao, Yisen Wei, Yuecen Sun, Qingyun Peng, Hao Li, Jianxin Li, Xianxian Key Lab of Education Blockchain and Intelligent Technology Ministry of Education Guangxi Normal University Guilin China Institute of Artificial Intelligence Beihang University Beijing China School of Software Beihang University Beijing China Beijing Advanced Innovation Center for Big Data and Brain Computing School of Computer Science and Engineering Beihang University Beijing China

Diffusion models have made significant contributions to computer vision, sparking a growing interest in the community recently regarding the application of them to graph generation. Existing discrete graph diffusion models exhibit heightened computational complexity and diminished training efficiency. A preferable and natural way is to directly diffuse the graph within the latent space. However, due to the non-Euclidean structure of graphs is not isotropic in the latent space, the existing latent diffusion models effectively make it difficult to capture and preserve the topological information of graphs. To address the above challenges, we propose a novel geometrically latent diffusion framework HypDiff. Specifically, we first establish a geometrically latent space with interpretability measures based on hyperbolic geometry, to define anisotropic latent diffusion processes for graphs. Then, we propose a geometrically latent diffusion process that is constrained by both radial and angular geometric properties, thereby ensuring the preservation of the original topological properties in the generative graphs. Extensive experimental results demonstrate the superior effectiveness of HypDiff for graph generation with various topologies. Copyright 2024 by the author(s)

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：