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

NONMONOTONE LOCAL MINIMAX METHODS FOR FINDING MULTIPLE SADDLE POINTS

Journal of Computational Mathematics 2024年第3期42卷 851-884页

作者： Wei Liu Ziqing Xie Wenfan Yi South China Research Center for Applied Mathematics and Interdisciplinary Studies South China Normal UniversityGuangzhou 510631China Key Laboratory of Computing and Stochastic Mathematics(Ministry of Education) Hunan Normal UniversityChangshaHunan 410081China Hunan Provincial Key Laboratory of Intelligent Information Processing and Applied Mathematics School of MathematicsHunan UniversityChangshaHunan 410082China

In this paper,by designing a normalized nonmonotone search strategy with the BarzilaiBorwein-type step-size,a novel local minimax method(LMM),which is a globally convergent iterative method,is proposed and analyzed to find multiple(unstable)saddle points of nonconvex functionals in Hilbert *** to traditional LMMs with monotone search strategies,this approach,which does not require strict decrease of the objective functional value at each iterative step,is observed to converge faster with less ***,based on a normalized iterative scheme coupled with a local peak selection that pulls the iterative point back onto the solution submanifold,by generalizing the Zhang-Hager(ZH)search strategy in the optimization theory to the LMM framework,a kind of normalized ZH-type nonmonotone step-size search strategy is introduced,and then a novel nonmonotone LMM is *** feasibility and global convergence results are rigorously carried out under the relaxation of the monotonicity for the functional at the iterative ***,in order to speed up the convergence of the nonmonotone LMM,a globally convergent Barzilai-Borwein-type LMM(GBBLMM)is presented by explicitly constructing the Barzilai-Borwein-type step-size as a trial step-size of the normalized ZH-type nonmonotone step-size search strategy in each ***,the GBBLMM algorithm is implemented to find multiple unstable solutions of two classes of semilinear elliptic boundary value problems with variational structures:one is the semilinear elliptic equations with the homogeneous Dirichlet boundary condition and another is the linear elliptic equations with semilinear Neumann boundary *** numerical results indicate that our approach is very effective and speeds up the LMMs significantly.

关键词： Multiple saddle points Local minimax method Barzilai-Borwein gradient method Normalized nonmonotone search strategy Global convergence

来源：评论

学校读者我要写书评

暂无评论

AR-CNN: an attention ranking network for learning urban perception

引用

Science China(information Sciences) 2022年第1期65卷 164-174页

作者： Zhetao LI Ziwen CHEN Wei-Shi ZHENG Sangyoon OH Kien NGUYEN Key Laboratory of Hunan Province for Internet of Things and Information Security Xiangtan University Key Laboratory of Intelligent Computing & Information Processing of Ministry of Education Xiangtan University School of Data and Computer Science Sun Yat-sen University Department of Computer and Information Engineering Ajou University Graduate School of Engineering Chiba University

An increasing number of deep learning methods is being applied to quantify the perception of urban environments, study the relationship between urban appearance and resident safety, and improve urban appearance. Most advanced methods extract image feature representations from street-level images through conventional visual computation algorithms or deep convolutional neural networks and then directly predict the results using features. Unfortunately, these methods take color and texture information together during processing. Color and texture are prime image features, and they affect human perception and judgment differently. We argue that color and texture should be operated differently; therefore, we formulate an end-to-end learning methodology to process input images according to color and texture information before inputting it into the neural network. The processed images and the original image constitute three input streams for the triad attention ranking convolutional neural network(AR-CNN) model proposed in this *** accordance with the aspects of color and texture, an improved attention mechanism in the convolution layer is proposed. Our objective is to obtain the scores of humans on urban appearance in accordance with the prediction results computed from pairwise comparisons generated by the AR-CNN model.

关键词： ranking network urban perception attribute learning attention network colour and texture

来源：评论

学校读者我要写书评

暂无评论

CHIME: A Cache-Efficient and High-Performance Hybrid Index on Disaggregated Memory 24

CHIME: A Cache-Efficient and High-Performance Hybrid Index o...

引用

30th ACM Symposium on Operating Systems Principles, SOSP 2024

作者： Luo, Xuchuan Shen, Jiacheng Zuo, Pengfei Wang, Xin Lyu, Michael R. Zhou, Yangfan National Key Laboratory of Parallel and Distributed Computing Changsha China School of Computer Science Fudan University Shanghai China Duke Kunshan University Kunshan China Huawei Cloud Shenzhen China Shanghai Key Laboratory of Intelligent Information Processing Shanghai China The Chinese University of Hong Kong Hong Kong Hong Kong

ISBN: (纸本)9798400712517

Disaggregated memory (DM) is a widely discussed datacenter architecture in academia and industry. It decouples computing and memory resources from monolithic servers into two network-connected resource pools. Range indexes are widely adopted by storage systems on DM to efficiently locate and query remote data. However, existing range indexes on DM suffer from either high computing-side cache consumption or high memory-side read amplifications. In this paper, we propose CHIME, a hybrid index combining B+ trees with hopscotch hashing, to achieve low cache consumption and low read amplifications simultaneously. There are three challenges in constructing CHIME on DM, i.e., the complicated optimistic synchronization, the extra metadata access, and the read amplifications introduced by hopscotch hashing. CHIME leverages 1) a three-level optimistic synchronization scheme to synchronize read and write operations with various granularities, 2) an access-aggregated metadata management technique to eliminate extra metadata accesses by piggybacking and replicating metadata, and 3) an effective hotness-aware speculative read mechanism to mitigate the read amplifications of hopscotch hashing. Experimental results show that CHIME outperforms the state-of-the-art range indexes on DM by up to 5.1× with the same cache size and achieves similar performance with up to 8.7× lower cache consumption. © 2024 Copyright is held by the owner/author(s). Publication rights licensed to ACM.

关键词： Memory architecture

来源：评论

学校读者我要写书评

暂无评论

Evolutionary Multi-Objective Neural Architecture Search for Generalized Cognitive Diagnosis Models 5

Evolutionary Multi-Objective Neural Architecture Search for ...

引用

5th International Conference on Data-Driven Optimization of Complex Systems, DOCS 2023

作者： Yang, Shangshang Zhen, Cheng Tian, Ye Ma, Haiping Liu, Yuanchao Zhang, Panpan Zhang, Xingyi School of Artificial Intelligence Anhui University Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Hefei China Institutes of Physical Science and Information Technology Anhui University Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Hefei China Automation for Process Industries Northeastern University State Key Laboratory of Synthetical Shenyang China

ISBN: (纸本)9798350393521

Cognitive diagnosis models (CDMs) with high generalization are essential for intelligent education systems to reveal students' knowledge states in multiple datasets. However, existing CDMs' architectures are designed dependent on researcher expertise and experience from observing and summarizing partial students' learning behaviors, which makes handcrafted models not cover all learning behaviors well and thus limits their generalization. To develop generalized CDMs, this paper proposes an evolutionary neural architecture search to design CDMs' architectures effective on multiple datasets automatically. Specifically, we first formulate the search task as a multi-objective optimization problem (MOP), which maximizes model performance on multiple datasets containing learning behaviors as many as possible to ensure model generalization. Then, an expressive search space is devised to contain as many potential architectures as possible, where each architecture is denoted by a unified form, taking three given inputs and integrating them in a linear or no-linear manner for prediction. Finally, an evolutionary algorithm with a tailored deduplication strategy is employed to solve the MOP, where each architecture is further represented by a single-root computation tree for easy optimization. Experiments on multiple datasets demonstrate the generalization and effectiveness of the best architecture searched by the proposed approach, and the searched architecture also holds as good interpretability as handcrafted architectures. © 2023 IEEE.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

Leveraging Catastrophic Forgetting to Develop Safe Diffusion Models against Malicious Finetuning 38

Leveraging Catastrophic Forgetting to Develop Safe Diffusion...

引用

38th Conference on Neural information processing Systems, NeurIPS 2024

作者： Pan, Jiadong Gao, Hongcheng Wu, Zongyu Hu, Taihang Su, Li Huang, Qingming Li, Liang Key Laboratory of Intelligent Information Processing Institute of Computing Technology CAS China University of Chinese Academy of Sciences China The Pennsylvania State University United States Nankai University China

Diffusion models (DMs) have demonstrated remarkable proficiency in producing images based on textual prompts. Numerous methods have been proposed to ensure these models generate safe images. Early methods attempt to incorporate safety filters into models to mitigate the risk of generating harmful images but such external filters do not inherently detoxify the model and can be easily bypassed. Hence, model unlearning and data cleaning are the most essential methods for maintaining the safety of models, given their impact on model parameters. However, malicious fine-tuning can still make models prone to generating harmful or undesirable images even with these methods. Inspired by the phenomenon of catastrophic forgetting, we propose a training policy using contrastive learning to increase the latent space distance between clean and harmful data distribution, thereby protecting models from being fine-tuned to generate harmful images due to forgetting. The experimental results demonstrate that our methods not only maintain clean image generation capabilities before malicious fine-tuning but also effectively prevent DMs from producing harmful images after malicious fine-tuning. Our method can also be combined with other safety methods to maintain their safety against malicious fine-tuning further. WARNING: This paper contains offensive images generated by models. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Note on a New Construction of Kantorovich Form q-Bernstein Operators Related to Shape Parameter λ

引用

Computer Modeling in Engineering & Sciences 2022年第3期130卷 1479-1493页

作者： Qingbo Cai Resat Aslan Fujian Provincial Key Laboratory of Data-Intensive Computing Key Laboratory of Intelligent Computing and Information ProcessingSchool of Mathematics and Computer ScienceQuanzhou Normal UniversityQuanzhou362000China Department of Mathematics Faculty of Sciences and ArtsHarran UniversitySanlıurfa63300Turkey

The main purpose of this paper is to introduce some approximation properties of a Kantorovich kind q-Bernstein operators related to B′ezier basis functions with shape parameterλ∈[−1,1].Firstly,we compute some basic results such as moments and central moments,and derive the Korovkin type approximation theorem for these ***,we estimate the order of convergence in terms of the usual modulus of continuity,for the functions belong to Lipschitz-type class and Peetre’s K-functional,***,with the aid of Maple software,we present the comparison of the convergence of these newly defined operators to the certain function with some graphical illustrations and error estimation table.

关键词： q-calculus (λ,q)-Bernstein polynomials order of convergence Lipschitz-type function Peetre’s K-functional

来源：评论

学校读者我要写书评

暂无评论

Dual-axial self-attention network for text classification

引用

Science China(information Sciences) 2021年第12期64卷 80-90页

作者： Xiaochuan ZHANG Xipeng QIU Jianmin PANG Fudong LIU Xingwei LI State Key Laboratory of Mathematical Engineering and Advanced Computing Shanghai Key Laboratory of Intelligent Information Processing Fudan University School of Computer Science Fudan University

Text classification is an important task in natural language processing and numerous studies aim to improve the accuracy and efficiency of text classification models. In this study, we propose an effective and efficient text classification model which is based on self-attention solely. The recently proposed multidimensional self-attention significantly improved the performance of self-attention. However, existing models suffer from two major limitations:(1) the previous multi-dimensional self-attention models are quite timeconsuming;(2) the dependencies of elements along the feature axis are not taken into account. To overcome these problems, in this paper, a much more computational efficient multi-dimensional self-attention model is proposed, and two parallel self-attention modules, called dual-axial self-attention, are applied to capture rich dependencies along the feature axis as well as the text axis. A text classification model is then *** experimental results on eight representative datasets show that the proposed text classification model can obtain state-of-the-art results and the proposed self-attention outperforms conventional self-attention models.

关键词： text classification dual-axial self-attention feature-axial dependency

来源：评论

学校读者我要写书评

暂无评论

A method for generating Dunhuang dance instrumental images based on optimized diffusion model

A method for generating Dunhuang dance instrumental images b...

引用

2024 International Conference on Algorithms, High Performance computing, and Artificial Intelligence, AHPCAI 2024

作者： Wang, Jiaxin He, Xiangzhen Suzuki, Kenneth M. Northwest Minzu University Key Laboratory of Linguistic and Cultural Computing Ministry of Education Gansu Lanzhou730030 China Northwest Minzu University Key Laboratory of Minzu Languages and Cultures Intelligent Information Processing Gansu Lanzhou730030 China

ISBN: (纸本)9781510685840

Dunhuang culture is a treasure house of human history and culture. As an integral part of Dunhuang culture, Dunhuang dance is famous for its unique national characteristics and artistic characteristics. In the form of Dunhuang dance, instrumental music and props are used to greatly enrich the stage expression, forming a unique dance form of "holding music while dancing, dancing with instruments". However, the phenomenon of homogenization of instrumental props occurs frequently, which hinders the overall presentation effect and beauty of Dunhuang dance. The development based on the generative diffusion model provides new ideas for the design of Dunhuang dance instrumental props. First, the role played by musical instruments and props in the presentation of Dunhuang dance art was sorted out, and the Dunhuang dance instrumental props were digitally collected and processed, and a special data set was constructed. Secondly, based on the recognition of related instruments, a diffusion model instrumental prop image generation that can be used in the Chinese context is trained. Experimental results show that the instrumental props generated by this method not only conform to realistic logic but also have strong applicability. © 2024 SPIE.

关键词： Photons

来源：评论

学校读者我要写书评

暂无评论

Boundary Cue Guidance and Contextual Feature Mining for Glass Segmentation 48

Boundary Cue Guidance and Contextual Feature Mining for Glas...

引用

48th IEEE International Conference on Acoustics, Speech and Signal processing, ICASSP 2023

作者： Xiao, Qiquan Zhang, Yuan Li, Xuanya Hu, Kai Xiangtan University Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education Xiangtan411105 China Baidu Inc. Beijing100085 China

ISBN: (纸本)9781728163277

Glass is ubiquitous in the real world, and its perception has many applications, including robot navigation and drone tracking. However, due to the transparent property of glass, the interior of a glass area can be any surrounding scene or object, which brings challenges for computer vision. Inspired by the human senses, boundary cues are one of the crucial factors for people to judge the location of glass contours. Hence, we propose a boundary cue guidance and contextual feature mining network (BCNet) to accurately and efficiently segment glass. Specifically, we first design a multi-branch boundary extraction module (MBEM) for learning accurate boundary cues combined with multi-level encoded features. Second, we propose a boundary cue guidance module (BCGM), inject the boundary cues into the representation learning, and provide constraints with object structure semantics to guide feature extraction. Besides, we design a contextual feature mining module (CFMM) to dynamically capture the contextual information of different receptive fields for the detection of different sizes and shapes of the glass. Finally, extensive experiments on two benchmark glass datasets, GDD and GSD. The results demonstrate that our BCNet achieves state-of-the-art segmentation performance against existing methods. © 2023 IEEE.

关键词： Boundary cue guidance Contextual feature Convolutional neural network Glass segmentation

来源：评论

学校读者我要写书评

暂无评论

Edge computing based multi-objective equilibrium task unloading of Internet of Vehicles 2

Edge computing based multi-objective equilibrium task unload...

引用

2nd International Conference on Electronic information Technology, EIT 2023

作者： Wang, Lingjiao Tang, Chen Guo, Hua Key Laboratory of Intelligent Computing and Information Processing Ministry of Education Xiang Tan University 411105 China School of Automation and Electronic Information Xiang Tan University 411105 China

ISBN: (数字)9781510666627

ISBN: (纸本)9781510666610

The requirements of the Internet of Vehicles on the quality of service (QoS) of computing task offloading are constantly improving. The processing mode of edge computing, which deploys computing, bandwidth and storage resources near the user side, effectively improves the user experience. However, the computing capacity of edge servers is limited. Task offloading requests are overloaded and inefficient due to uneven server loads. Traditional cloud computing consumes a lot of energy and time. To solve the above problem, a KDQN based edge computing balanced task unloading mechanism is proposed: Q learning and convolutional neural network are used to obtain the optimal unloading strategy according to the returns of each step and continuous iterative updates, which reduces the convergence time of task unloading;K-means clustering is used to distribute part of the load of the overloaded server to the server with the closest European distance to achieve server load balancing. The experimental results show that compared to the existing offload mechanism, the new mechanism can reduce the average server energy consumption by 12.8%, the average service delay by 8.2%, and the average overload rate by 29.8%. © 2023 SPIE.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：