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

arXiv 2022年

作者： Hou, Wenzheng Xu, Qianqian Yang, Zhiyong Bao, Shilong He, Yuan Huang, Qingming Key Laboratory of Intelligent Information Processing Institute of Computing Technology CAS Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China State Key Laboratory of Information Security Institute of Information Engineering CAS Beijing China School of Cyber Security University of Chinese Academy of Sciences Beijing China Alibaba Group Beijing China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing China Artificial Intelligence Research Center Peng Cheng Laboratory Shenzhen China

It is well-known that deep learning models are vulnerable to adversarial examples. Existing studies of adversarial training have made great progress against this challenge. As a typical trait, they often assume that the class distribution is overall balanced. However, long-tail datasets are ubiquitous in a wide spectrum of applications, where the amount of head class instances is larger than the tail classes. Under such a scenario, AUC is a much more reasonable metric than accuracy since it is insensitive toward class distribution. Motivated by this, we present an early trial to explore adversarial training methods to optimize AUC. The main challenge lies in that the positive and negative examples are tightly coupled in the objective function. As a direct result, one cannot generate adversarial examples without a full scan of the dataset. To address this issue, based on a concavity regularization scheme, we reformulate the AUC optimization problem as a saddle point problem, where the objective becomes an instance-wise function. This leads to an end-to-end training protocol. Furthermore, we provide a convergence guarantee of the proposed algorithm. Our analysis differs from the existing studies since the algorithm is asked to generate adversarial examples by calculating the gradient of a min-max problem. Finally, the extensive experimental results show the performance and robustness of our algorithm in three long-tail datasets. © 2022, CC BY.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

Suppress Content Shift: Better Diffusion Features via Off-the-Shelf Generation Techniques

arXiv

引用

arXiv 2024年

作者： Meng, Benyuan Xu, Qianqian Wang, Zitai Yang, Zhiyong Cao, Xiaochun Huang, Qingming Institute of Information Engineering CAS China School of Cyber Security University of Chinese Academy of Sciences China Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS China Peng Cheng Laboratory China School of Computer Science and Tech. University of Chinese Academy of Sciences China Key Laboratory of Big Data Mining and Knowledge Management CAS China School of Cyber Science and Tech. Sun Yat-sen University Shenzhen Campus China

Diffusion models are powerful generative models, and this capability can also be applied to discrimination. The inner activations of a pre-trained diffusion model can serve as features for discriminative tasks, namely, diffusion feature. We discover that diffusion feature has been hindered by a hidden yet universal phenomenon that we call content shift. To be specific, there are content differences between features and the input image, such as the exact shape of a certain object. We locate the cause of content shift as one inherent characteristic of diffusion models, which suggests the broad existence of this phenomenon in diffusion feature. Further empirical study also indicates that its negative impact is not negligible even when content shift is not visually perceivable. Hence, we propose to suppress content shift to enhance the overall quality of diffusion features. Specifically, content shift is related to the information drift during the process of recovering an image from the noisy input, pointing out the possibility of turning off-the-shelf generation techniques into tools for content shift suppression. We further propose a practical guideline named GATE to efficiently evaluate the potential benefit of a technique and provide an implementation of our methodology. Despite the simplicity, the proposed approach has achieved superior results on various tasks and datasets, validating its potential as a generic booster for diffusion features. Our code is available at this url. © 2024, CC BY.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Structure-aware random fourier kernel for graphs 21

Structure-aware random fourier kernel for graphs

引用

Proceedings of the 35th International Conference on Neural Information Processing Systems

作者： Jinyuan Fang Qiang Zhang Zaiqiao Meng Shangsong Liang School of Computer Science and Engineering Sun Yat-sen University China and Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou China Hangzhou Innovation Center Zhejiang University China and College of Computer Science and Technology Zhejiang University China and AZFT Knowledge Engine Lab China School of Computing Science University of Glasgow United Kingdom and Mohamed bin Zayed University of Artificial Intelligence United Arab Emirates School of Computer Science and Engineering Sun Yat-sen University China and Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou China and Mohamed bin Zayed University of Artificial Intelligence United Arab Emirates

ISBN: (纸本)9781713845393

Gaussian Processes (GPs) define distributions over functions and their generalization capabilities depend heavily on the choice of kernels. In this paper, we propose a novel structure-aware random Fourier (SRF) kernel for GPs that brings several benefits when modeling graph-structured data. First, SRF kernel is defined with a spectral distribution based on the Fourier duality given by the Bochner's theorem, transforming the kernel learning problem to a distribution inference problem. Second, SRF kernel admits a random Fourier feature formulation that makes the kernel scalable for optimization. Third, SRF kernel enables to leverage geometric structures by taking subgraphs as inputs. To effectively optimize GPs with SRF kernel, we develop a variational EM algorithm, which alternates between an inference procedure (E-step) and a learning procedure (M-step). Experimental results on five real-world datasets show that our model can achieve state-of-the-art performance in two typical graph learning tasks, i.e., object classification and link prediction.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Survey on Fairness in Large Language Models

arXiv

引用

arXiv 2023年

作者： Li, Yingji Du, Mengnan Song, Rui Wang, Xin Wang, Ying College of Computer Science and Technology Jilin University Changchun130012 China Department of Data Science New Jersey Institute of Technology Newark United States School of Artificial Intelligence Jilin University Changchun130012 China Key Laboratory of Symbol Computation and Knowledge Engineering Jilin University Ministry of Education Changchun130012 China

Large Language Models (LLMs) have shown powerful performance and development prospects and are widely deployed in the real world. However, LLMs can capture social biases from unprocessed training data and propagate the biases to downstream tasks. Unfair LLM systems have undesirable social impacts and potential harms. In this paper, we provide a comprehensive review of related research on fairness in LLMs. Considering the influence of parameter magnitude and training paradigm on research strategy, we divide existing fairness research into oriented to medium-sized LLMs under pre-training and fine-tuning paradigms and oriented to large-sized LLMs under prompting paradigms. First, for medium-sized LLMs, we introduce evaluation metrics and debiasing methods from the perspectives of intrinsic bias and extrinsic bias, respectively. Then, for large-sized LLMs, we introduce recent fairness research, including fairness evaluation, reasons for bias, and debiasing methods. Finally, we discuss and provide insight on the challenges and future directions for the development of fairness in LLMs. Copyright © 2023, The Authors. All rights reserved.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

Uncertainty-based Model Acceleration for Cancer Classification in Whole-Slide Images

Uncertainty-based Model Acceleration for Cancer Classificati...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Zeyu Gao Anyu Mao Jialun Wu Yang Li Chunbao Wang Caixia Ding Tieliang Gong Chen Li School of Computer Science and Technology Xi’an Jiaotong University Xi’an China Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Xi’an Jiaotong University Xi’an China Department of Pathology the First Affiliated Hospital of Xi’an Jiaotong University Xi’an China Department of Pathology Shaanxi Provincial Cancer Hospital Xi’an China

ISBN: (数字)9781665468190

ISBN: (纸本)9781665468206

Computational Pathology (CPATH) offers the possibility for highly accurate and low-cost automated pathological diagnosis. However, the high time cost of model inference is one of the main issues limiting the application of CPATH methods. Due to the large size of Whole-Slide Image (WSI), commonly used CPATH methods divided a WSI into a large number of image patches at relatively high magnification, then predicted each image patch individually, which is time-consuming. In this paper, we propose a novel Uncertainty-based Model Acceleration (UMA) method for reducing the time cost of model inference, thereby relieving the deployment burden of CPATH applications. Enlightened by the slide-viewing process of pathologists, only a few high-uncertain regions are regarded as “suspicious” regions that need to be predicted at high magnification, and most of the regions in WSI are predicted at low magnification, thereby reducing the times of image patch extraction and prediction. Meanwhile, uncertainty estimation ensures prediction accuracy at low magnification. We take two fundamental CPATH classification tasks (i.e., cancer region detection and subtyping) as examples. Extensive experiments on two large-scale renal cell carcinoma classification datasets demonstrate that our UMA can significantly reduce the time cost of model inference while maintaining competitive classification performance.

关键词： Pathology Costs Uncertainty Limiting Hospitals Biological system modeling Computational modeling

来源：评论

学校读者我要写书评

暂无评论

Sparse Training data-Based Hyperspectral Image Super Resolution Via ANFIS Interpolation

Sparse Training Data-Based Hyperspectral Image Super Resolut...

引用

IEEE International Conference on Fuzzy Systems (FUZZ-IEEE)

作者： Jing Yang Changjing Shang Lu Chen Pan Su Qiang Shen School of Automation and Software Engineering Shanxi University Taiyuan China Department of Computer Science Aberystwyth University Aberystwyth UK Insti. of Big Data Science & Industry Shanxi University Taiyuan China Department of Computer Hebei Key Laboratory of Knowledge Computing for Energy & Power Baoding North China Electric Power University China

Hyperspectral image super resolution aims to improve the spatial resolution of given hyperspectral images, which has become a highly attractive topic in the field of image processing. Existing techniques typically focus on super resolution with sufficient training data. However, restricted by data acquisition conditions, certain hyperspectral images or band images are very different to obtain, resulted in insufficient training data. In order to solve this problem, a new hyperspectral image super resolution method is proposed in this paper in an effort to conduct the super resolution task over insufficient (sparse) training data, by applying the recently introduced ANFIS (Adaptive Network-based Fuzzy Inference System) interpolation method. Particularly, the training dataset is divided into several subsets. For the subsets with sufficient training data, the relevant ANFIS models are trained using standard ANFIS learning algorithm, while for the subsets with sparse training data, the corresponding ANFIS models are interpolated through the use of ANFIS interpolation. Experimental results indicate that compared with the methods using sufficient training data, the proposed method can achieve very similar result, showing its effectiveness for situations where only sparse training data is available.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Tent Lévy Flying Sparrow Search Algorithm for Feature Selection: A COVID-19 Case Study

arXiv

引用

arXiv 2022年

作者： Yang, Qinwen Gao, Yuelin Song, Yanjie School of Computer Science and Engineering North Minzu University Yinchuan750021 China School of Mathematics and Information Science North Minzu University Yinchuan750021 China Ningxia Key Laboratory of Intelligent Information and Big Data Processing Yinchuan750021 China Ningxia Province Cooperative Innovation Center of Scientific Computing and Intelligent in Formation Processing North Minzu University Yinchuan750021 China College of Systems Engineering National University of Defense Technology Changsha410073 China

The "Curse of Dimensionality" induced by the rapid development of information science, might have a negative impact when dealing with big datasets. In this paper, we propose a variant of the sparrow search algorithm (SSA), called Tent Lévy flying sparrow search algorithm (TFSSA), and use it to select the best subset of features in the packing pattern for classification purposes. SSA is a recently proposed algorithm that has not been systematically applied to feature selection problems. After verification by the CEC2020 benchmark function, TFSSA is used to select the best feature combination to maximize classification accuracy and minimize the number of selected features. The proposed TFSSA is compared with nine algorithms in the literature. Nine evaluation metrics are used to properly evaluate and compare the performance of these algorithms on twenty-one datasets from the UCI repository. Furthermore, the approach is applied to the coronavirus disease (COVID-19) dataset, yielding the best average classification accuracy and the average number of feature selections, respectively, of 93.47% and 2.1. Experimental results confirm the advantages of the proposed algorithm in improving classification accuracy and reducing the number of selected features compared to other wrapper-based algorithms. Copyright © 2022, The Authors. All rights reserved.

关键词： COVID-19

来源：评论

学校读者我要写书评

暂无评论

Adaptive Structure-Constrained Robust Latent Low-Rank Coding for Image Recovery

Adaptive Structure-Constrained Robust Latent Low-Rank Coding...

引用

IEEE International Conference on data Mining (ICDM)

作者： Zhao Zhang Lei Wang Sheng Li Yang Wang Zheng Zhang Zhengjun Zha Meng Wang School of Computer Science and Technology Soochow University Suzhou China Key Laboratory of Knowledge Engineering with Big Data (Ministry of Education) Hefei University of Technology School of Computer Science and Information Engineering Hefei University of Technology Hefei China Department of Computer Science University of Georgia Athens GA Bio-Computing Research Center Harbin Institute of Technology (Shenzhen) Shenzhen China School of Information Science and Technology University of Science and Technology of China Hefei China

In this paper, we propose a robust representation learning model called Adaptive Structure-constrained Low-Rank Coding (AS-LRC) for the latent representation of data. To recover the underlying subspaces more accurately, AS-LRC seamlessly integrates an adaptive weighting based block-diagonal structure-constrained low-rank representation and the group sparse salient feature extraction into a unified framework. Specifically, AS-LRC performs the latent decomposition of given data into a low-rank reconstruction by a block-diagonal codes matrix, a group sparse locality-adaptive salient feature part and a sparse error part. To enforce the block-diagonal structures adaptive to different real datasets for the low-rank recovery, AS-LRC clearly computes an auto-weighting matrix based on the locality-adaptive features and multiplies by the low-rank coefficients for direct minimization at the same time. This encourages the codes to be block-diagonal and can avoid the tricky issue of choosing optimal neighborhood size or kernel width for the weight assignment, suffered in most local geometrical structures-preserving low-rank coding methods. In addition, our AS-LRC selects the L2, 1-norm on the projection for extracting group sparse features rather than learning low-rank features by Nuclear-norm regularization, which can make learnt features robust to noise and outliers in samples, and can also make the feature coding process efficient. Extensive visualizations and numerical results demonstrate the effectiveness of our AS-LRC for image representation and recovery.

关键词：

来源：评论

学校读者我要写书评

暂无评论

基于Web Services的信息系统的实施研究

基于Web Services的信息系统的实施研究

引用

第15届海峡两岸信息管理发展与策略学术研讨会(2009)

作者： Zuo Meiyun 左美云 Wang Shijuan 王世娟 In formation School and Key Laboratory of Data Engineering and Knowledge Engineering MOE Renmin Univ 中国人民大学信息学院数据工程与知识工程教育部重点实验室北京

基于Web Services的信息系统将会是今后信息系统建设的一种重要模式。论文在对23个实施基于WebServices的信息系统的二手资料分析的基础上，归纳了基于Web Services的信息系统的类型、实施策略和实施过程。

关键词：企业管理信息系统控制策略网络服务

来源：评论

学校读者我要写书评

暂无评论

Dictionary Pair-based data-Free Fast Deep Neural Network Compression

Dictionary Pair-based Data-Free Fast Deep Neural Network Com...

引用

IEEE International Conference on data Mining (ICDM)

作者： Yangcheng Gao Zhao Zhang Haijun Zhang Mingbo Zhao Yi Yang Meng Wang School of Computer Science and Information Engineering Hefei University of Technology Hefei China Key Laboratory of Knowledge Engineering with Big Data (Ministry of Education) & Intelligent Interconnected Systems Laboratory of Anhui Province Hefei University of Technology Hefei China Harbin Institute of Technology (Shenzhen) Xili University Town Shenzhen China City University of Hong Kong Hong Kong SAR Centre for Artificial Intelligence University of Technology Sydney Sydney NSW Australia

ISBN: (纸本)9781665423991

Deep neural network (DNN) compression can reduce the memory footprint of deep networks effectively, so that the deep model can be deployed on the portable devices. However, most of the existing model compression methods cost lots of time, e.g., vector quantization or pruning, which makes them inept to the real-world applications that need fast online computation. In this paper, we therefore explore how to accelerate the model compression process by reducing the computation cost. Then, we propose a new deep model compression method, termed Dictionary Pair-based data-Free Fast DNN Compression, which aims at reducing the memory consumption of DNNs without extra training and can greatly improve the compression efficiency. Specifically, our proposed method performs tensor decomposition on the DNN model with a fast dictionary pair learning-based reconstruction approach, which can be deployed on different layers (e.g., convolution and fully-connection layers). Given a pre-trained DNN model, we first divide the parameters (i.e., weights) of each layer into a series of partitions for dictionary pair-based fast reconstruction, which can potentially discover more fine-grained information and provide the possibility for parallel model compression. Then, dictionaries of less memory occupation are learned to reconstruct the weights. Extensive experiments on popular DNNs (i.e., VGG-16, ResNet-18 and ResNet-50) showed that our proposed weight compression method can significantly reduce the memory footprint and speed up the compression process, with less performance loss.

关键词： Deep learning Training Performance evaluation Dictionaries Tensors Costs Computational modeling

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：