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

38th Conference on Neural information processing Systems, NeurIPS 2024

作者： Lei, Yiming Li, Zilong Zhang, Junping Shan, Hongming Shanghai Key Laboratory of Intelligent Information Processing School of Computer Science Fudan University China Institute of Science and Technology for Brain-Inspired Intelligence MOE Key Laboratory of Computational Neuroscience and Brain-Inspired Intelligence MOE Frontiers Center for Brain Science Fudan University China

The explainability of deep neural networks (DNNs) is critical for trust and reliability in AI systems. Path-based attribution methods, such as integrated gradients (IG), aim to explain predictions by accumulating gradients along a path from a baseline to the target image. However, noise accumulated during this process can significantly distort the explanation. While existing methods primarily concentrate on finding alternative paths to circumvent noise, they overlook a critical issue: intermediate-step images frequently diverge from the distribution of training data, further intensifying the impact of noise. This work presents a novel Denoising Diffusion Path (DDPath) to tackle this challenge by harnessing the power of diffusion models for denoising. By exploiting the inherent ability of diffusion models to progressively remove noise from an image, DDPath constructs a piece-wise linear path. Each segment of this path ensures that samples drawn from a Gaussian distribution are centered around the target image. This approach facilitates a gradual reduction of noise along the path. We further demonstrate that DDPath adheres to essential axiomatic properties for attribution methods and can be seamlessly integrated with existing methods such as IG. Extensive experimental results demonstrate that DDPath can significantly reduce noise in the attributions-resulting in clearer explanations-and achieves better quantitative results than traditional path-based methods. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

RRT Autonomous Detection Algorithm Based on Multiple Pilot Point Bias Strategy and Karto SLAM Algorithm

引用

Computers, Materials & Continua 2024年第2期78卷 2111-2136页

作者： Lieping Zhang Xiaoxu Shi Liu Tang Yilin Wang Jiansheng Peng Jianchu Zou Key Laboratory of Advanced Manufacturing and Automation Technology(Guilin University of Technology) Education Department of Guangxi Zhuang Autonomous RegionGuilin541006China College of Mechanical and Control Engineering Guilin University of TechnologyGuilin541006China Guilin Mingfu Robot Technology Company Limited Guilin541199China Key Laboratory of AI and Information Processing(Hechi University) Education Department of Guangxi Zhuang Autonomous RegionYizhou546300China

A Rapid-exploration Random Tree(RRT)autonomous detection algorithm based on the multi-guide-node deflection strategy and Karto Simultaneous Localization and Mapping(SLAM)algorithm was proposed to solve the problems of low efficiency of detecting frontier boundary points and drift distortion in the process of map building in the traditional RRT algorithm in the autonomous detection strategy of mobile ***,an RRT global frontier boundary point detection algorithm based on the multi-guide-node deflection strategy was put forward,which introduces the reference value of guide nodes’deflection probability into the random sampling function so that the global search tree can detect frontier boundary points towards the guide nodes according to random *** that,a new autonomous detection algorithm for mobile robots was proposed by combining the graph optimization-based Karto SLAM algorithm with the previously improved RRT *** algorithm simulation platform based on the Gazebo platform was *** simulation results show that compared with the traditional RRT algorithm,the proposed RRT autonomous detection algorithm can effectively reduce the time of autonomous detection,plan the length of detection trajectory under the condition of high average detection coverage,and complete the task of autonomous detection mapping more ***,with the help of the ROS-based mobile robot experimental platform,the performance of the proposed algorithm was verified in the real environment of different *** experimental results show that in the actual environment of simple and complex obstacles,the proposed RRT autonomous detection algorithm was superior to the traditional RRT autonomous detection algorithm in the time of detection,length of detection trajectory,and average coverage,thus improving the efficiency and accuracy of autonomous detection.

关键词： Autonomous detection RRT algorithm mobile robot ROS Karto SLAM algorithm

来源：评论

学校读者我要写书评

暂无评论

Algorithm for Solving Traveling Salesman Problem Based on Self-Organizing Mapping Network

引用

Journal of Shanghai Jiaotong university(Science) 2024年第3期29卷 463-470页

作者：朱江辉叶航航姚莉秀蔡云泽 Department of Automation Shanghai Jiao Tong UniversityShanghai 200240China Key Laboratory of System Control and Information Processing Ministry of EducationShanghai 200240China Shanghai Engineering Research Center of Intelligent Control and Management Shanghai 200240China Key Laboratory of Marine Intelligent Equipment and System Ministry of EducationShanghai 200240China Huawei Technologies Co. Ltd.Shanghai 201206China

Traveling salesman problem(TSP)is a classic non-deterministic polynomial-hard optimization *** on the characteristics of self-organizing mapping(SOM)network,this paper proposes an improved SOM network from the perspectives of network update strategy,initialization method,and parameter *** paper compares the performance of the proposed algorithms with the performance of existing SOM network algorithms on the TSP and compares them with several heuristic *** show that compared with existing SOM networks,the improved SOM network proposed in this paper improves the convergence rate and algorithm *** with iterated local search and heuristic algorithms,the improved SOM net-work algorithms proposed in this paper have the advantage of fast calculation speed on medium-scale TSP.

关键词： traveling salesman problem(TSP) self-organizing mapping(SOM) combinatorial optimization neu-ral network

来源：评论

学校读者我要写书评

暂无评论

ANALYSIS OF TRIPARTITE GAME IN POWER SYSTEMS BASED ON UNCERTAIN NASH EQUILIBRIUM THEORY

引用

UPB Scientific Bulletin, Series A: Applied Mathematics and Physics 2025年第1期87卷 117-128页

作者： Wu, Liang Yan, Xiaolin Yao, Zhangsong Zhao, Teng School of Management and Ningxia Key Laboratory of intelligent information and Big Data Processing North Minzu University Ningxia Yinchuan750021 China School of Mathematical Sciences Tiangong University Tianjin300387 China School of Information Engineering Nanjing Xiaozhuang University Nanjing211171 China School of Mathematics and Information Science North Minzu University Ningxia Yinchuan750021 China

Power systems serve as the fundamental infrastructure for the socioeconomic development of modern societies. Researching power systems can stimulate the growth of the power industry and contribute to the sustainable development of society. This paper aims to address uncertainties prevalent in power systems, including extreme weather events, disruptions in renewable energy supply, and adjustments in economic policies. To achieve this objective, an uncertain Nash equilibrium model is established. Subsequently, a game theoretic analysis is conducted to maximize the interests of users, grid companies, and proxy purchasers. Under the condition of not necessarily continuous differentiability, the Riemann-Stieltjes discrete approximation method has been proposed. The difficulty of calculating the expectation of the optimal revenue function has been resolved. Weak first-order equilibrium condition based on Clarke’s generalized gradient, the convergence and convergence rate of uncertain Nash equilibrium solutions are proved. © 2025, Politechnica University of Bucharest. All rights reserved.

关键词： power system tripartite game uncertain Nash equilibrium uncertainty theory

来源：评论

学校读者我要写书评

暂无评论

Curve-Suppression-Based Event-Triggered Mechanisms for Quasi-Synchronization of Fuzzy Delayed Neural Networks on Time Scales

引用

IEEE Transactions on Systems, Man, and Cybernetics: Systems 2025年第5期55卷 3174-3187页

作者： Wan, Peng Zhou, Yufeng Zeng, Zhigang Lai, Jingang Wuhan University of Science and Technology School of Artificial Intelligence and Automation Engineering Research Center of Metallurgical Automation and Measurement Technology Wuhan430081 China Huazhong University of Science and Technology School of Artificial Intelligence and Automation Key Laboratory of Image Processing and Intelligent control of Education Ministry of China Wuhan430074 China

The vast majority of published event-triggered mechanisms (ETMs) are constructed based on measurement errors, which introduces a problem naturally that they are updated when the measurement errors exceed the thresholds although the current obtained sampling states can make systems converge well. With this problem in mind, we redesign ETMs for quasi-synchronization of T-S fuzzy neural networks (FNNs) with time delays on time scales. First, a novel ETM is designed for continuous-time FNNs with time-varying delays to achieve quasi-synchronization, with which synchronization errors is suppressed to globally exponentially converge to a ball. Second, we introduce the ETM for continuous-time FNNs to discrete-time FNNs, owing to the existence of discrete-time states, the Lypunov function of synchronization errors run over the exponentially decay curve, but it can be suppressed to evolve under another exponentially decay curve. Third, for FNNs on time scales with constant and time-varying delays, we estimate the forward jump operator of the Lyapunov functions and design ETMs to guarantee that the Lypunov functions evolve under the exponentially decay curves, so quasi-synchronization can be achieved. Last but not least, we prove that Zeno behavior will not happen and four numerical examples are introduced to verify the validity and the superiority of the proposed ETMs in reducing information transmission. © 2013 IEEE.

关键词： Continuous time systems

来源：评论

学校读者我要写书评

暂无评论

MoME: Mixture of Multi-Domain Experts for Multivariate Long-Term Series Forecasting

MoME: Mixture of Multi-Domain Experts for Multivariate Long-...

引用

2025 IEEE International Conference on Acoustics, Speech, and Signal processing, ICASSP 2025

作者： Li, Xinyu Yang, Zhiheng Xu, Hao Cai, Yunqi Lu, Hong Wang, Xin Zhao, Jin Qi, Fenglin Shen, Jiajie School of Computer Science Fudan University Shanghai China Shanghai Key Laboratory of Intelligent Information Processing Fudan University Shanghai China Informatization Office Fudan University Shanghai China

ISBN: (纸本)9798350368741

Time series forecasting is always important, with multivariate long-term series forecasting being its most challenging task. Here, the existing methods typically learn only in a single domain and focus on optimizing model structures, leading to incomplete information mining and imprecise predictions. To address this, we propose a generalized Mixture of Multi-Domain Experts (MoME) for multivariate long-term series forecasting. Unlike most existing methods, MoME focuses on multi-perspective information mining and fusing. To this end, MoME transforms time series into the frequency and spatial domains to learn their respective representations. MoME regards variates information as embedded features and applies fast Fourier transform to the time dimension. Then it learns embedded features in the frequency domain. In spatial domain learning, MoME applies self-attention mechanism on the variates dimension to efficiently capture dependencies among multiple variates. Finally, MoME fuses the outputs from all domains, reinterprets and integrates information across multiple domains, and predicts future time series. Extensive experiments prove that MoME outperforms state-of-the-art (SOTA) methods. Code is available at: https://***/lxy-PhD2022/MoME. © 2025 IEEE.

关键词： Generalized MoE Multi-Domain learning Multivariate long-term forecasting Time series forecasting

来源：评论

学校读者我要写书评

暂无评论

AUCSeg: AUC-oriented Pixel-level Long-tail Semantic Segmentation 38

AUCSeg: AUC-oriented Pixel-level Long-tail Semantic Segmenta...

引用

38th Conference on Neural information processing Systems, NeurIPS 2024

作者： Han, Boyu Xu, Qianqian Yang, Zhiyong Bao, Shilong Wen, Peisong Jiang, Yangbangyan Huang, Qingming Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS China School of Computer Science and Tech. University of Chinese Academy of Sciences China Peng Cheng Laboratory China Key Laboratory of Big Data Mining and Knowledge Management CAS China

The Area Under the ROC Curve (AUC) is a well-known metric for evaluating instance-level long-tail learning problems. In the past two decades, many AUC optimization methods have been proposed to improve model performance under long-tail distributions. In this paper, we explore AUC optimization methods in the context of pixel-level long-tail semantic segmentation, a much more complicated scenario. This task introduces two major challenges for AUC optimization techniques. On one hand, AUC optimization in a pixel-level task involves complex coupling across loss terms, with structured inner-image and pairwise inter-image dependencies, complicating theoretical analysis. On the other hand, we find that mini-batch estimation of AUC loss in this case requires a larger batch size, resulting in an unaffordable space complexity. To address these issues, we develop a pixel-level AUC loss function and conduct a dependency-graph-based theoretical analysis of the algorithm's generalization ability. Additionally, we design a Tail-Classes Memory Bank (T-Memory Bank) to manage the significant memory demand. Finally, comprehensive experiments across various benchmarks confirm the effectiveness of our proposed AUCSeg method. The code is available at https://***/boyuh/AUCSeg. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Unified convergence analysis of a second-order method of multipliers for nonlinear conic programming

引用

Science China Mathematics 2022年第11期65卷 2397-2422页

作者： Liang Chen Junyuan Zhu Xinyuan Zhao School of Mathematics Hunan UniversityChangsha 410082China Hunan Provincial Key Laboratory of Intelligent Information Processing and Applied Mathematics Changsha 410082China School of Mathematics Beijing University of TechnologyBeijing 100124China

In this paper,we accomplish the unified convergence analysis of a second-order method of multipliers(i.e.,a second-order augmented Lagrangian method)for solving the conventional nonlinear conic optimization ***,the algorithm that we investigate incorporates a specially designed nonsmooth(generalized)Newton step to furnish a second-order update rule for the *** first show in a unified fashion that under a few abstract assumptions,the proposed method is locally convergent and possesses a(nonasymptotic)superlinear convergence rate,even though the penalty parameter is fixed and/or the strict complementarity ***,we demonstrate that for the three typical scenarios,i.e.,the classic nonlinear programming,the nonlinear second-order cone programming and the nonlinear semidefinite programming,these abstract assumptions are nothing but exactly the implications of the iconic sufficient conditions that are assumed for establishing the Q-linear convergence rates of the method of multipliers without assuming the strict complementarity.

关键词： second-order method of multipliers augmented Lagrangian method convergence rate generalized Newton method second-order cone programming semidefinite programming

来源：评论

学校读者我要写书评

暂无评论

GOAL: Generalized Jointly Sparse Linear Discriminant Regression for Feature Extraction

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2024年第10期5卷 4959-4971页

作者： Lu, Haoquan Lai, Zhihui Zhang, Junhong Yu, Zhuozhen Wen, Jiajun Shenzhen University Computer Vision Institute College of Computer Science and Software Engineering Guangdong Provincial Key Laboratory of Intelligent Information Processing Shenzhen518060 China Peking University Shenzhen Graduate School School of Electronic and Computer Engineering Shenzhen518055 China

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 capability of feature representation. Moreover, these methods with L2-norm metric and regularization cannot extract highly robust features from data with corruption. To address these problems, in this article, we propose generalized jointly sparse linear discriminant regression (GOAL), a novel regression method based on joint L2,1-norm and capped-L2-norm, which can integrate sparsity, locality, and discriminability into one model to learn a full-rank robust feature extractor. The sparsely selected discriminative features are robust enough to characterize the decision boundary between classes. Locality is related to manifold structure and Laplacian smoothing, which can enhance the robustness of the model. By using the multinorm metric and regularization regression framework, the proposed method obtains the projection with joint sparsity and guarantees that the rank of the projection matrix will not be limited by the number of classes. An iterative algorithm is proposed to compute the optimal solution. Complexity analysis and proofs of convergence are also given in the article. Experiments on well-known datasets demonstrate our model's superiority and generalization ability. © 2020 IEEE.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Channel Estimation for Underwater Acoustic OFDM Communications: Recent Advances

引用

Recent Patents on Engineering 2025年第3期19卷 13-24页

作者： Zhou, Mingzhang Sun, Haixin Wang, Junfeng Xie, Zhuofan Feng, Xiao Key Laboratory of Southeast Coast Marine Information Intelligent Perception and Application MNR China School of Informatics Xiamen University Xiamen China School of Integrated Circuit Science and Engineering Tianjin University of Technology Tianjin China

Background: To resist the time-variant underwater acoustic (UWA) channel, large amounts of channel estimation algorithms for the UWA orthogonal frequency division multiplexing (OFDM) are presented. An updated review of the recent UWA OFDM channel estimators is suggested in this article. Objective: The goal of this patent is to review and conclude the development of different types of channel estimators. The possible perspectives about the future UWA channel estimator design are also discussed. Methodology: The principles and performances of the linear channel estimators, the compressed sensing (CS)-based channel estimators, and the neural network (NN)-based channel estimators are reviewed and discussed. Simulations are conducted to compare the typical implementations of the different methods. Conclusion: To take more channel state characteristics into account, the data-driven methods have been applied in the channel estimator design. Compared with the linear and CS-based methods, the NN-based channel estimator shows the higher performance, robustness and lower complexity, which is promising to be applied with the proper structure and training sets. © 2025 Bentham Science Publishers.

关键词： Orthogonal frequency division multiplexing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：