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

41st International Conference on Machine Learning, ICML 2024

作者： Wang, Yunke Dong, Minjing Zhao, Yukun Du, Bo Xu, Chang School of Computer Science National Engineering Research Center for Multimedia Software Institute of Artificial Intelligence Wuhan Institute of Data Intelligence Wuhan University China Department of Computer Science City University of Hong Kong Hong Kong School of Computer Science Faculty of Engineering The University of Sydney Australia

Imitation learning has emerged as a promising approach for addressing sequential decision-making problems, with the assumption that expert demonstrations are optimal. However, in real-world scenarios, most demonstrations are often imperfect, leading to challenges in the effectiveness of imitation learning. While existing research has focused on optimizing with imperfect demonstrations, the training typically requires a certain proportion of optimal demonstrations to guarantee performance. To tackle these problems, we propose to purify the potential noises in imperfect demonstrations first, and subsequently conduct imitation learning from these purified demonstrations. Motivated by the success of diffusion model, we introduce a two-step purification via diffusion process. In the first step, we apply a forward diffusion process to smooth potential noises in imperfect demonstrations by introducing additional noise. Subsequently, a reverse generative process is utilized to recover the optimal demonstration from the diffused ones. We provide theoretical evidence supporting our approach, demonstrating that the distance between the purified and optimal demonstration can be bounded. Empirical results on MuJoCo and RoboSuite demonstrate the effectiveness of our method from different aspects. Copyright 2024 by the author(s)

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Unlearnable 3D Point Clouds: Class-wise Transformation Is All You Need 38

Unlearnable 3D Point Clouds: Class-wise Transformation Is Al...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Wang, Xianlong Li, Minghui Liu, Wei Zhang, Hangtao Hu, Shengshan Zhang, Yechao Zhou, Ziqi Jin, Hai National Engineering Research Center for Big Data Technology and System China Services Computing Technology and System Lab China Cluster and Grid Computing Lab China Hubei Engineering Research Center on Big Data Security China Hubei Key Laboratory of Distributed System Security China School of Cyber Science and Engineering Huazhong University of Science and Technology China School of Software Engineering Huazhong University of Science and Technology China School of Computer Science and Technology Huazhong University of Science and Technology China

Traditional unlearnable strategies have been proposed to prevent unauthorized users from training on the 2D image data. With more 3D point cloud data containing sensitivity information, unauthorized usage of this new type data has also become a serious concern. To address this, we propose the first integral unlearnable framework for 3D point clouds including two processes: (i) we propose an unlearnable data protection scheme, involving a class-wise setting established by a category-adaptive allocation strategy and multi-transformations assigned to samples;(ii) we propose a data restoration scheme that utilizes class-wise inverse matrix transformation, thus enabling authorized-only training for unlearnable data. This restoration process is a practical issue overlooked in most existing unlearnable literature, i.e., even authorized users struggle to gain knowledge from 3D unlearnable data. Both theoretical and empirical results (including 6 datasets, 16 models, and 2 tasks) demonstrate the effectiveness of our proposed unlearnable framework. Our code is available at https://***/CGCL-codes/UnlearnablePC. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

RoSe: Rotation-Invariant Sequence-Aware Consensus for Robust Correspondence Pruning 24

RoSe: Rotation-Invariant Sequence-Aware Consensus for Robust...

引用

32nd ACM International Conference on Multimedia, MM 2024

作者： Liu, Yizhang Zhou, Weiwei Li, Yanping Zhao, Shengjie School of Software Engineering Tongji University Shanghai China College of Computer and Data Science Fuzhou University Fuzhou China Department of Computer Science and Technology Tongji University Shanghai China Engineering Research Center of Key Software Technologies for Smart City Perception and Planning Ministry of Education Shanghai China

ISBN: (纸本)9798400706868

Correspondence pruning has recently drawn considerable attention as a crucial step in image matching. Existing methods typically achieve this by constructing neighborhoods for each feature point and imposing neighborhood consistency. However, the nearest-neighbor matching strategy often results in numerous many-to-one correspondences, thereby reducing the reliability of neighborhood information. Furthermore, the smoothness constraint fails in cases of large-scale rotations, leading to misjudgments. To address the above issues, this paper proposes a novel robust correspondence pruning method termed RoSe, which is based on rotation-invariant sequence-aware consensus. We formulate the correspondence pruning problem as a mathematical optimization problem and derive a closed-form solution. Specifically, we devise a rectified local neighborhood construction strategy that effectively enlarges the distribution between inliers and outliers. Meanwhile, to accommodate large-scale rotation, we propose a relative sequence-aware consistency as an alternative to existing smoothness constraints, which can better characterize the topological structure of inliers. Experimental results on image matching and registration tasks demonstrate the effectiveness of our method. Robustness analysis involving diverse feature descriptors and varying rotation degrees further showcases the efficacy of our method. © 2024 ACM.

关键词： correspondence pruning

来源：评论

学校读者我要写书评

暂无评论

Nearly Optimal Regret for Decentralized Online Convex Optimization 37

Nearly Optimal Regret for Decentralized Online Convex Optimi...

引用

37th Annual Conference on Learning Theory, COLT 2024

作者： Wan, Yuanyu Wei, Tong Song, Mingli Zhang, Lijun The State Key Laboratory of Blockchain and Data Security Zhejiang University Hangzhou China School of Software Technology Zhejiang University Ningbo China Institute of Blockchain and Data Security Hangzhou China School of Computer Science and Engineering Southeast University Nanjing China National Key Laboratory for Novel Software Technology Nanjing University Nanjing China

We investigate decentralized online convex optimization (D-OCO), in which a set of local learners are required to minimize a sequence of global loss functions using_only local computations and communications. Previous studies have established O(n5/4ρ-1/2 √T) and O(n3/2ρ-1 log T) regret bounds for convex and strongly convex functions respectively, where n is the number of local learners, ρ -1/4 √T) and Õ(nρ-1/2 log T). The primary technique is to design an online accelerated gossip strategy that enjoys a faster average consensus among local learners. Furthermore, by carefully exploiting the spectral properties of a specific network topology, we enhance the lower bounds for convex and strongly convex functions to Ω(nρ-14 √T) and Ω(nρ-1/2), respectively. These lower bounds suggest that our algorithms are nearly optimal in terms of T, n, and ρ. © 2024 Y. Wan, T. Wei, M. Song & L. Zhang.

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

Rumor Detection Based on Macro-Micro Public Opinion Modeling and Sentiment Scores

Rumor Detection Based on Macro-Micro Public Opinion Modeling...

引用

2024 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2024

作者： Li, Li Hu, Jingyang Fu, Shihao Xing, Xin Zhou, Wei School of Big Data and Software Engineering Chongqing University Chongqing400030 China School of Computer Science and Mathematics Anyang University Henan Province 455000 China Chongqing Academy of Metrology and Quality Inspection China

ISBN: (纸本)9781665410205

Existing rumor detection methods have not ade-quately considered which features should be addressed at the macroscopic or micro levels. Furthermore, the fundamental manifestation of news dissemination-public opinion-has received insufficient attention. We propose a macro-micro based public opinion (MMPO) modeling method to address these gaps. This approach enables a better understanding of news dissemination on social media platforms. Firstly, we incorporate post sentiment as a crucial feature. Secondly, we examine how the propagation at the micro-level influences sub-posts. Next, we investigate the temporal variations in public opinion from a macro perspective. Lastly, we integrate the acquired general propagation information with textual data to obtain more distinct representations of news propagation. By leveraging the macro perspective, the proposed model effectively captures the fine-grained characteristics of news propagation and helps smooth out the noise in user comments. The experimental evaluation showcases the superiority of our model in rumor detection compared to existing methods. © 2024 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Applying Hybrid Clustering in Pulsar Candidate Sifting with Multi-modality for FAST Survey

引用

Research in Astronomy and Astrophysics 2024年第3期24卷 283-296页

作者： Zi-Yi You Yun-Rong Pan Zhi Ma Li Zhang Shuo Xiao Dan-Dan Zhang Shi-Jun Dang Ru-Shuang Zhao Pei Wang Ai-Jun Dong Jia-Tao Jiang Ji-Bing Leng Wei-An Li Si-Yao Li School of Physics and Electronic Science Guizhou Normal UniversityGuiyang 550025China Guizhou Provincial Key Laboratory of Radio Astronomy and Data Processing Guizhou Normal UniversityGuiyang 550025China College of Big Data and Information Engineering Guizhou UniversityGuiyang 550025China CAS Key Laboratory of FAST National Astronomical ObservatoriesChinese Academy of SciencesBeijing 100101China Key Laboratory of Information and Computing Guizhou Province Guizhou Normal UniversityGuiyang 550001China School of Big data and Computer Science Guizhou Normal UniversityGuiyang 550025China Guizhou Software Engineering Research Center Guiyang 550000China

Pulsar search is always the basis of pulsar navigation,gravitational wave detection and other research ***,the volume of pulsar candidates collected by the Five-hundred-meter Aperture Spherical radio Telescope(FAST)shows an explosive growth rate that has brought challenges for its pulsar candidate filtering ***,the multi-view heterogeneous data and class imbalance between true pulsars and non-pulsar candidates have negative effects on traditional single-modal supervised classification *** this study,a multi-modal and semi-supervised learning based on a pulsar candidate sifting algorithm is presented,which adopts a hybrid ensemble clustering scheme of density-based and partition-based methods combined with a feature-level fusion strategy for input data and a data partition strategy for *** on both High Time Resolution Universe SurveyⅡ(HTRU2)and actual FAST observation data demonstrate that the proposed algorithm could excellently identify pulsars:On HTRU2,the precision and recall rates of its parallel mode reach0.981 and 0.988 *** FAST data,those of its parallel mode reach 0.891 and 0.961,meanwhile,the running time also significantly decreases with the increment of parallel nodes within ***,we can conclude that our algorithm could be a feasible idea for large scale pulsar candidate sifting for FAST drift scan observation.

关键词： methods data analysis-surveys-methods numerical

来源：评论

学校读者我要写书评

暂无评论

Deep Learning Methods Used in Remote Sensing Images: A Review

引用

Journal of Environmental & Earth sciences 2023年第1期5卷 33-64页

作者： Ekram M.Rewhel Jianqiang Li Amal A.Hamed Hatem M.Keshk Amira S.Mahmoud Sayed A.Sayed Ehab Samir Hind H.Zeyada Sayed A.Mohamed Marwa S.Moustafa Ayman H.Nasr Ashraf K.Helmy School of Software Engineering Beijing University of Science and TechnologyBeijing100083China Data Reception Analysis and Receiving Station DivisionNational Authority for Remote Sensing and Space ScienceCairo1564Egypt

Undeniably,Deep Learning(DL)has rapidly eroded traditional machine learning in Remote Sensing(RS)and geoscience domains with applications such as scene understanding,material identification,extreme weather detection,oil spill identification,among many *** machine learning algorithms are given less and less attention in the era of big ***,a substantial amount of work aimed at developing image classification approaches based on the DL model’s success in computer *** number of relevant articles has nearly doubled every year since *** in remote sensing technology,as well as the rapidly expanding volume of publicly available satellite imagery on a worldwide scale,have opened up the possibilities for a wide range of modern ***,there are some challenges related to the availability of annotated data,the complex nature of data,and model parameterization,which strongly impact *** this article,a comprehensive review of the literature encompassing a broad spectrum of pioneer work in remote sensing image classification is presented including network architectures(vintage Convolutional Neural Network,CNN;Fully Convolutional Networks,FCN;encoder-decoder,recurrent networks;attention models,and generative adversarial models).The characteristics,capabilities,and limitations of current DL models were examined,and potential research directions were discussed.

关键词： Deep Learning(DL) Satellite imaging Image classification Segmentation and object detection

来源：评论

学校读者我要写书评

暂无评论

A Multistage Framework for Detection of Very Small Objects 23

A Multistage Framework for Detection of Very Small Objects

引用

6th International Conference on Machine Vision and Applications, ICMVA 2023

作者： Don, Duleep Rathgamage Aygun, Ramazan Karakaya, Mahmut School of Data Science and Analytics College of Computing and Software Engineering Kennesaw State University MariettaGA30060 United States Department of Computer Science College of Computing and Software Engineering Kennesaw State University MariettaGA30060 United States

ISBN: (纸本)9781450399531

Small object detection is one of the most challenging problems in computer vision. Algorithms based on state-of-the-art object detection methods such as R-CNN, SSD, FPN, and YOLO fail to detect objects of very small sizes. In this study, we propose a novel method to detect very small objects, smaller than 8×8 pixels, that appear in a complex background. The proposed method is a multistage framework consisting of an unsupervised algorithm and three separately trained supervised algorithms. The unsupervised algorithm extracts ROIs from a high-resolution image. Then the ROIs are upsampled using SRGAN, and the enhanced ROIs are detected by our two-stage cascade classifier based on two ResNet50 models. The maximum size of the images used for training the proposed framework is 32×32 pixels. The experiments are conducted using rescaled German Traffic Sign Recognition Benchmark dataset (GTSRB) and downsampled German Traffic Sign Detection Benchmark dataset (GTSDB). Unlike MS COCO and DOTA datasets, the resulting GTSDB turns out to be very challenging for any small object detection algorithm due to not only the size of objects of interest but the complex textures of the background as well. Our experimental results show that the proposed method detects small traffic signs with an average precision of 0.332 at the intersection over union of 0.3. © 2023 ACM.

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

SeeMe: An intelligent edge server selection method for location-aware business task computing over IIoT

SeeMe: An intelligent edge server selection method for locat...

引用

作者： Dou, Wanchun Liu, Bowen Duan, Jirun Dai, Fei Qi, Lianyong Xu, Xiaolong State Key Laboratory for Novel Software Technology Nanjing University Nanjing China College of Big Data and Intelligent Engineering Southwest Forestry University Kunming China School of Computer Science Qufu Normal University Qufu China School of Computer and Software Nanjing University of Information Science and Technology Nanjing China

In the past few years, latency-sensitive task computing over the industrial internet of things (IIoT) has played a key role in an increasing number of intelligent applications, such as intelligent self-driving vehicles and unmanned aircraft systems. The edge computing paradigm provides a basic functional infrastructure for across-domain business task computing on distributed edge servers. With this observation, a trade-off between the mobile devices and the fixed edge servers is needed to run moving task computing in a low-latency way. Given this challenge, an intelligent server selection method, named SeeMe, is proposed in this paper. Technically speaking, this method aims at minimizing the communication capacity and the transferring capacity in a multiobjective optimization way to find a low-latency edge server. The experiments and comparison analysis verify the availability of our method. © 2022 John Wiley & Sons Ltd.

关键词： Economic and social effects

来源：评论

学校读者我要写书评

暂无评论

Open Source software Supply Chain Recommendation Based on Heterogeneous Information Network 14th

Open Source Software Supply Chain Recommendation Based on H...

引用

14th International Symposium on Benchmarking, Measuring, and Optimization, Bench 2022

作者： Lin, HaiMing Liang, Guanyu Wu, Yanjun Wu, Bin Tian, Chunqi Wang, Wei Nanjing Institute of Software Technology Nanjing211135 China School of Computer and Science Tongji University Shanghai201804 China Institude of Software Chinese Academy of Science Beijing100190 China School of Data Science and Engineering East China Normal University Shanghai200062 China

ISBN: (纸本)9783031311796

In the GitHub open-source collaborative development scenario, each entity type and the link relationship between them have natural heterogeneous attributes. In order to improve the accuracy of project recommendation, it is necessary to effectively integrate this multi-source information. Therefore, for the project recommendation scenario, this paper defines an open source weighted heterogeneous information network to represent the different entity types and link relationships in the GitHub open source collaborative development scenario, and effectively model the complex interaction among developers, projects and other entities. Using the weighted heterogeneous information network embedding method, extract and use the rich structural and semantic information in the weighted heterogeneous open source information network to learn the node representation of developers and projects, and fuse the personalized nonlinear fusion function into the matrix decomposition model for open source project recommendation. Finally, this paper makes a large number of comparative experiments based on the real GitHub open data set, and compares it with other project recommendation methods to verify the effectiveness of our proposed open source project recommendation model. At the same time, it also explores the impact of different metapaths on the effect of project recommendation. The experimental results show that the recommendation method based on heterogeneous information network can effectively improve the recommendation quality. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Open source software

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：