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

Proceedings of the 38th International Conference on Neural Information processing Systems

作者： Yiming Lei Zilong Li Junping Zhang Hongming Shan Shanghai Key Laboratory of Intelligent Information Processing School of Computer Science Fudan University 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

ISBN: (纸本)9798331314385

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Brain-inspired artificial intelligence research: A review

引用

Science China(Technological Sciences) 2024年第8期67卷 2282-2296页

作者： WANG GuoYin BAO HuaNan LIU Qun ZHOU TianGang WU Si HUANG TieJun YU ZhaoFei LU CeWu GONG YiHong ZHANG ZhaoXiang HE Sheng Chongqing Key Laboratory of Computational Intelligence Chongqing University of Posts and TelecommunicationsChongqing 400065China Key Laboratory of Cyberspace Big Data Intelligent Security Chongqing University of Posts and TelecommunicationsChongqing 400065China College of Computer and Information Science Chongqing Normal UniversityChongqing 401331China State Key Laboratory of Brain and Cognitive Science Institute of BiophysicsChinese Academy of SciencesBeijing 100101China School of Psychological and Cognitive Sciences Peking UniversityBeijing 100871China State Key Laboratory of Multimedia Information Processing School of Computer SciencePeking UniversityBeijing 100871China Department of Computer Science School of ElectronicsInformation and Electrical EngineeringShanghai Jiao Tong UniversityShanghai 200240China Faculty of Electronic and Information Engineering Xi’an Jiaotong UniversityXi’an 710049China The Center for Research on Intelligent Perception and Computing Institute of AutomationChinese Academy of SciencesBeijing 100190China Institute of Biophysics Chinese Academy of SciencesBeijing 100101China

Artificial intelligence(AI) systems surpass certain human intelligence abilities in a statistical sense as a whole, but are not yet the true realization of these human intelligence abilities and behaviors. There are differences, and even contradictions, between the cognition and behavior of AI systems and humans. With the goal of achieving general AI, this study contains a review of the role of cognitive science in inspiring the development of the three mainstream academic branches of AI based on the three-layer framework proposed by David Marr, and the limitations of the current development of AI are explored and analyzed. The differences and inconsistencies between the cognition mechanisms of the human brain and the computation mechanisms of AI systems are analyzed. They are found to be the cause of the differences and contradictions between the cognition and behavior of AI systems and humans. Additionally, eight important research directions and their scientific issues that need to focus on braininspired AI research are proposed: highly imitated bionic information processing, a large-scale deep learning model that balances structure and function, multi-granularity joint problem solving bidirectionally driven by data and knowledge, AI models that simulate specific brain structures, a collaborative processing mechanism with the physical separation of perceptual processing and interpretive analysis, embodied intelligence that integrates the brain cognitive mechanism and AI computation mechanisms,intelligence simulation from individual intelligence to group intelligence(social intelligence), and AI-assisted brain cognitive intelligence.

关键词： artificial intelligence cognitive science brain science intelligence science large language model

来源：评论

学校读者我要写书评

暂无评论

Alignment-Free RGB-T Salient Object Detection: A Large-scale Dataset and Progressive Correlation Network

arXiv

引用

arXiv 2024年

作者： Wang, Kunpeng Chen, Keke Li, Chenglong Tu, Zhengzheng Luo, Bin Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Anhui Provincial Key Laboratory of Multimodal Cognitive Computation School of Computer Science and Technology Anhui University China Anhui Provincial Key Laboratory of Security Artificial Intelligence School of Artificial Intelligence Anhui University China

Alignment-free RGB-Thermal (RGB-T) salient object detection (SOD) aims to achieve robust performance in complex scenes by directly leveraging the complementary information from unaligned visible-thermal image pairs, without requiring manual alignment. However, the labor-intensive process of collecting and annotating image pairs limits the scale of existing benchmarks, hindering the advancement of alignment-free RGB-T SOD. In this paper, we construct a large-scale and high-diversity unaligned RGB-T SOD dataset named UVT20K, comprising 20,000 image pairs, 407 scenes, and 1256 object categories. All samples are collected from real-world scenarios with various challenges, such as low illumination, image clutter, complex salient objects, and so on. To support the exploration for further research, each sample in UVT20K is annotated with a comprehensive set of ground truths, including saliency masks, scribbles, boundaries, and challenge attributes. In addition, we propose a Progressive Correlation Network (PCNet), which models inter- and intra-modal correlations on the basis of explicit alignment to achieve accurate predictions in unaligned image pairs. Extensive experiments conducted on unaligned and aligned datasets demonstrate the effectiveness of our method. Copyright © 2024, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Logical Implication of Structural Integrity Constraints for XML

引用

Chinese Journal of Electronics 2023年第2期18卷 243-248页

作者： Jianmei Zhang Shiqun Tao Jiye Liang Key Laboratory of Computational Intelligence and Chinese Information Processing of Ministry of Education School of Computer and Information Technology Shanxi University Taiyuan China Changzhi University Changzhi China

For tree XML, constraints that specify structural relationships among nodes or paths are very natural. In this paper, we introduce the concept of structural integrity constraints for XML (XSICs), which specify path implication, path cooccurrence, path mutual-exclusion, element obligatory inclusion and exclusive inclusion, and define the syntax and semantics of XSICs. For reasoning about XSICs, we rewrite all the other constraints into path implication constraints, and develop a sound and complete set of inference rules for path implication constraints. Meanwhile, we propose the concept of path implication closure. By using the path implication closure, we prove the completeness of inference rules, and determine the implication decision about XSICs.

关键词： Semantics XML Medical services Syntactics Cognition

来源：评论

学校读者我要写书评

暂无评论

Improving generalization in offline reinforcement learning via adversarial data splitting 24

Improving generalization in offline reinforcement learning v...

引用

Proceedings of the 41st International Conference on Machine Learning

作者： Da Wang Lin Li Wei Wei Qixian Yu Jianye Hao Jiye Liang Key Laboratory of Computational Intelligence and Chinese Information Processing of Ministry of Education School of Computer and Information Technology Shanxi University Taiyuan China College of Intelligence and Computing Tianjin University Tianjin China

Offline Reinforcement Learning (RL) commonly suffers from the out-of-distribution (OOD) overestimation issue due to the distribution shift. Prior work gradually shifts their focus from suppressing OOD overestimation to avoiding overly conservative learning from suboptimal behavior policies to improve generalization. However, most approaches explicitly delimit boundaries for OOD actions based on the support in the dataset, which can potentially impede the data near these boundaries from acquiring realistic estimates. This paper investigates how to loosen the rigid demarcation of OOD boundaries, adaptively extracting knowledge from empirical data to implicitly improve the model's generalization to nearby unseen data. We introduce an adversarial data splitting (ADS) framework that enforces the model to generalize the distribution shifts simulated from the train=validation subsets splitting of the dataset. Specifically, ADS is modeled as a min-max optimization problem inspired by metalearning and solved by iterating over the following two steps. First, we train the model on the train-subset to minimize its loss on the validation-subset. Then, we adversarially generate the "hardest" train=validation subsets with the maximum distribution shift, making the model incapable of generalization at that splitting. We derive a generalization error bound for theoretically understanding ADS and verify the effectiveness with extensive experiments. Code is available at https://***/DkING-lv6/ADS.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Integrating Conjugate Gradients Into Evolutionary Algorithms for Large-Scale Continuous Multi-Objective Optimization

引用

IEEE/CAA Journal of Automatica Sinica 2022年第10期9卷 1801-1817页

作者： Ye Tian Haowen Chen Haiping Ma Xingyi Zhang Kay Chen Tan Yaochu Jin the Information Materials and Intelligent Sensing Laboratory of Anhui Province Institutes of Physical Science and Information TechnologyAnhui UniversityHefei 230601China the Institute of Artificial Intelligence Hefei Comprehensive National Science CenterHefei 230601China IEEE the Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Artificial IntelligenceAnhui UniversityHefei 230601China the Department of Computing The Hong Kong Polytechnic UniversityHong Kong SARChina the Faculty of Technology Bielefeld UniversityBielefeld 33619Germany

Large-scale multi-objective optimization problems(LSMOPs)pose challenges to existing optimizers since a set of well-converged and diverse solutions should be found in huge search *** evolutionary algorithms are good at solving small-scale multi-objective optimization problems,they are criticized for low efficiency in converging to the optimums of *** contrast,mathematical programming methods offer fast convergence speed on large-scale single-objective optimization problems,but they have difficulties in finding diverse solutions for ***,how to integrate evolutionary algorithms with mathematical programming methods to solve LSMOPs remains *** this paper,a hybrid algorithm is tailored for LSMOPs by coupling differential evolution and a conjugate gradient *** the one hand,conjugate gradients and differential evolution are used to update different decision variables of a set of solutions,where the former drives the solutions to quickly converge towards the Pareto front and the latter promotes the diversity of the solutions to cover the whole Pareto *** the other hand,objective decomposition strategy of evolutionary multi-objective optimization is used to differentiate the conjugate gradients of solutions,and the line search strategy of mathematical programming is used to ensure the higher quality of each offspring than its *** comparison with state-of-the-art evolutionary algorithms,mathematical programming methods,and hybrid algorithms,the proposed algorithm exhibits better convergence and diversity performance on a variety of benchmark and real-world LSMOPs.

关键词： Conjugate gradient differential evolution evolutionary computation large-scale multi-objective optimization mathematical programming

来源：评论

学校读者我要写书评

暂无评论

Federated Client-tailored Adapter for Medical Image Segmentation

arXiv

引用

arXiv 2025年

作者： Hu, Guyue Song, Siyuan Kang, Yukun Yin, Zhu Zhao, Gangming Li, Chenglong Tang, Jin Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Anhui Provincial Key Laboratory of Security Artificial Intelligence School of Artificial Intelligence Anhui University Hefei230601 China School of Internet Anhui University Hefei230601 China Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Anhui Provincial Key Laboratory of Multimodal Cognitive Computation School of Computer Science and Technology Anhui University Hefei230601 China Department of Computer Science The University of Hong Kong Hong Kong

Medical image segmentation in X-ray images is beneficial for computer-aided diagnosis and lesion localization. Existing methods mainly fall into a centralized learning paradigm, which is inapplicable in the practical medical scenario that only has access to distributed data islands. Federated Learning has the potential to offer a distributed solution but struggles with heavy training instability due to client-wise domain heterogeneity (including distribution diversity and class imbalance). In this paper, we propose a novel Federated Client-tailored Adapter (FCA) framework for medical image segmentation, which achieves stable and client-tailored adaptive segmentation without sharing sensitive local data. Specifically, the federated adapter stirs universal knowledge in off-the-shelf medical foundation models to stabilize the federated training process. In addition, we develop two client-tailored federated updating strategies that adaptively decompose the adapter into common and individual components, then globally and independently update the parameter groups associated with common client-invariant and individual client-specific units, respectively. They further stabilize the heterogeneous federated learning process and realize optimal client-tailored instead of sub-optimal global-compromised segmentation models. Extensive experiments on three large-scale datasets demonstrate the effectiveness and superiority of the proposed FCA framework for federated medical segmentation. © 2025, CC BY.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Federated Multitask Learning for HyperFace

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial intelligence 2022年第5期3卷 788-797页

作者： Zhang, Chen Bai, Hang Zhang, Yonggang Niu, Xinyi Yu, Bin Gao, Yuan Xie, Yu Xidian University School of Computer Science and Technology Xi'an710071 China Shaanxi Province Science and Technology Resources Coordination Center Xi'an710071 China Xidian University Key Laboratory of Intelligent Perception and Image Understanding Ministry of Education Xi'an710071 China Shanxi University Key Laboratory of Computational Intelligence and Chinese Information Processing Ministry of Education Taiyuan030006 China

Multitask learning (MTL) is a promising field in machine learning owing to its capability to improve the generalization performance of all tasks by sharing knowledge among the related tasks. MTL has attracted a large amount of attention in the multitask-related community. In recent years, with the rapid development of distributed machine learning, MTL in a distributed environment becomes a hot research topic. Although MTL can reap great fruit in a distributed environment, the sensitive information, such as photos and voice recordings of the owner, in distributed data may be leaked during training. Consequently, in the distributed settings, one prominent challenge of MTL is to prevent the disclosure of sensitive private data. In this article, we propose a novel approach, federated multitask learning (FMTL), which applies federated learning to MTL in a distributed environment in order to protect the MTL model from being leaked and to better optimize the utility of the MTL model. In FMTL, all the participants independently train their local models on their own dataset in parallel and only transmit their model updates to the central server for aggregation at every epoch. As a result, their learning accuracy is enhanced beyond what is achieved only on their own training data. In this manner, it can achieve the best tradeoff between the utility and privacy: participants not only preserve the privacy of their own data, but also benefit from the models of other participants. The experimental results on annotated facial landmarks in the wild (AFLW) and annotated faces in the wild (AFW) benchmark datasets verify the effectiveness of our framework. © 2020 IEEE.

关键词： Linearization

来源：评论

学校读者我要写书评

暂无评论

A general elevating framework for label noise filters

引用

Pattern Recognition 2024年 147卷

作者： Chen, Qingqiang Jiang, Gaoxia Cao, Fuyuan Men, Changqian Wang, Wenjian School of Computer and Information Technology Shanxi University Shanxi Taiyuan030006 China Key Laboratory of Computational Intelligence and Chinese Information Processing of Ministry of Education Shanxi University Shanxi Taiyuan030006 China

In real applications, label noise has a great influence on data modeling. As one kind of label noise treatment method, noise filter has attracted extensive attention recently. The existing filters perform well in dealing with label noise completely at random (NCAR) but poorly in dealing with the label noise in the form of clusters (LLC). Besides, the existing filters may over remove the samples located at the classification boundaries, thereby affecting the generalization performance of classifiers. To fill these gaps, we propose a general elevating framework for label noise filters. The core idea of the framework is to improve the filtering performance of the existing filters by sample reduction. Specifically, since most of the existing filters are based on classifier prediction, and the complexity of samples at the boundary will affect the prediction performance of classifiers. Therefore, reducing the complexity of the boundary sample is very helpful to improve the performance of the filters. To this end, we propose a sample reduction method, which can not only reduce the complexity of the sample at the boundary but also convert LLC to NCAR, to get some representative samples. Next, the filter based on classifier prediction is employed to recognize the noisy representative samples. Finally, the noisy labeled samples in the given data set are found according to the identified noisy representatives. Furthermore, through empirical analysis, we found that compared with some classical metrics for evaluating the performance of noise filters, classification accuracy is more suitable to measure the performance of filters. Exhaustive experiments testify the validity of the framework, and the experimental results demonstrate that the performance of our framework is especially outstanding for LLC treatment. © 2023 Elsevier Ltd

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

An Empirical Study on Neural Networks Pruning: Trimming for Reducing Memory or Workload

An Empirical Study on Neural Networks Pruning: Trimming for ...

引用

Data-driven Optimization of Complex Systems (DOCS), International Conference on

作者： Kaiwen Xiao Xiaodong Cai Ke Xu School of Artificial Intelligence Anhui University Hefei China Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Hefei China

Most of existing studies on neural network pruning only consider memory-based pruning strategies. However pruning for computational workload is often more important in hardware deployments due to a greater focus on model computation reductions. In addition, most pruning schemes restore model accuracy during pruning at the expense of adding hyperparameters, extending training time and training complexity. This work proposes a statistical-based globally soft iterative pruning scheme. With little extra calculation, an extremely sparse model can be obtained without additional hyperparameters and extended training time. Moreover, this work proposes the concept of computational intensity to balance model memory and computational workload during pruning. Focusing on memory orientated pruning, we can achieve $\mathbf{303}\times, \mathbf{100}\times$ and $\mathbf{25}\times$ parameter compression on LeNet-5 (MNIST), VGG (CIFAR-10) and AlexNet (ImageNet) models, respectively. In particular, combined with cluster quantization, the LeNet-5 model parameters can be compressed to $\mathbf{3232}\times$ . Focusing on workload orientated pruning, we can reduce the computation by $\mathbf{7}.\mathbf{6}\times$ on the AlexNet model, without accuracy loss, significantly higher than prior work. In addition, in order to verify the versatility of the pruning method, we also migrate the pruning task to the object detection and implement $\mathbf{10}\times$ parameter compression and $\mathbfcomputational.\mathbf{8}\times$ computation compression for YOLOv2 with reduced mAP within 1%.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：