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

Performance Evaluation of Evolutionary Multi-Objective Algorithms Using Real-World Problems with an Additional Total Constraint Violation Objective

Performance Evaluation of Evolutionary Multi-Objective Algor...

引用

Congress on Evolutionary Computation

作者： Yang Nan Hisao Ishibuchi Tianye Shu Department of Computer Science and Engineering Guangdong Provinial Key Laboratory of Brain-inspired Intelligent Computation Southern University of Science and Technology Shenzhen China

ISBN: (数字)9798350308365

ISBN: (纸本)9798350308372

In the community of evolutionary multi-objective optimization (EMO), one important issue is the choice of test problems for performance evaluations of EMO algorithms. This is because performance evaluation results of EMO algorithms totally depend on the choice of test problems. This means that the research on new EMO algorithm design is also influenced by the choice of test problems. Recently, researchers have started to use real-world problems for performance evaluation of EMO algorithms. Among them, a real-world problem suite RE has attracted much attention and has been used in many studies. However, most RE problems have been created from real-world constrained problems by using the total constraint violation as an additional objective. That is, the original versions of most RE problems are not unconstrained multi-objective problems. Thus, even when a good solution set is obtained by an EMO algorithm for an RE problem, it can be a poor solution set for its original constrained problem. This is because many well-distributed solutions over the entire Pareto front of the transformed unconstrained problem are usually infeasible solutions of the original constrained problem with some positive total constraint violation values. In this paper, we examine whether good solution sets obtained by EMO algorithms for RE problems are also good solution sets for their original constrained problems. Our experimental results show that good solutions sets for most RE problems include good feasible solution sets for their original constrained problems. However, for a few RE problems, good solution sets obtained by some high performance EMO algorithms do not include good feasible solution sets. Our results show that high-performance EMO algorithms on most RE problems generate good feasible solution sets for their original constrained versions. This observation supports the usefulness of those RE problems as test problems for performance evaluation of EMO algorithms.

关键词： Performance evaluation Constraint handling Sociology Evolutionary computation Search problems Statistics Optimization

来源：评论

学校读者我要写书评

暂无评论

Evolutionary Preference Sampling for Pareto Set Learning

arXiv

引用

arXiv 2024年

作者： Ye, Rongguang Chen, Longcan Zhang, Jinyuan Ishibuchi, Hisao Guangdong Provincial Key Laboratory of Brain-inspired Intelligent Computation Department of Computer Science and Engineering Southern University of Science and Technology Shenzhen China

Recently, Pareto Set Learning (PSL) has been proposed for learning the entire Pareto set using a neural network. PSL employs preference vectors to scalarize multiple objectives, facilitating the learning of mappings from preference vectors to specific Pareto optimal solutions. Previous PSL methods have shown their effectiveness in solving artificial multi-objective optimization problems (MOPs) with uniform preference vector sampling. The quality of the learned Pareto set is influenced by the sampling strategy of the preference vector, and the sampling of the preference vector needs to be decided based on the Pareto front shape. However, a fixed preference sampling strategy cannot simultaneously adapt the Pareto front of multiple MOPs. To address this limitation, this paper proposes an Evolutionary Preference Sampling (EPS) strategy to efficiently sample preference vectors. Inspired by evolutionary algorithms, we consider preference sampling as an evolutionary process to generate preference vectors for neural network training. We integrate the EPS strategy into five advanced PSL methods. Extensive experiments demonstrate that our proposed method has a faster convergence speed than baseline algorithms on 7 testing problems. Our implementation is available at https://***/rG223/EPS. Copyright © 2024, The Authors. All rights reserved.

关键词： Vectors

来源：评论

学校读者我要写书评

暂无评论

Analysis of Algorithm Comparison Results on Real-World Multi-Objective Problems

Analysis of Algorithm Comparison Results on Real-World Multi...

引用

Congress on Evolutionary Computation

作者： Lie Meng Pang Hisao Ishibuchi Ke Shang Department of Computer Science and Engineering Guangdong Provincial Key Laboratory of Brain-inspired Intelligent Computation Southern University of Science and Technology Shenzhen China

ISBN: (数字)9798350308365

ISBN: (纸本)9798350308372

Recently, several real-world multi-objective optimization problem suites have been proposed to facilitate the evaluation of the performance of evolutionary multi-objective optimization (EMO) algorithms. In spite of the importance of using real-world problems to evaluate EMO algorithms, their characteristics are not well understood compared to artificial test problems. Thus, there is a need to examine and understand the challenges posed by these real-world problems. In this study, we attempt to explore the characteristics of the most recently proposed real-world application suite (i.e., RWA suite). Six EMO algorithms are evaluated on the RWA suite, including three classic algorithms and three recently-proposed algorithms. Based on the performance comparison results, we systematically analyze the RWA suite in terms of convergence and diversity difficulties.

关键词： Evolutionary computation Optimization Convergence

来源：评论

学校读者我要写书评

暂无评论

Distance-Based Subset Selection With a Knee Point for Multi-Objective Optimization

Distance-Based Subset Selection With a Knee Point for Multi-...

引用

International Symposium on Soft Computing and Intelligent Systems (SCIS)

作者： Lie Meng Pang Hisao Ishibuchi Department of Computer Science and Engineering Guangdong Provincial Key Laboratory of Brain-inspired Intelligent Computation Southern University of Science and Technology Shenzhen China

ISBN: (数字)9798350373332

ISBN: (纸本)9798350373349

Recently, the use of an unbounded external archive in the design of evolutionary multi-objective optimization (EMO) algorithms has received increasing attention. An important component in the use of an unbounded external archive is its subset selection method used to select a pre-specified number of solutions from the archive. One of the most commonly used subset selection method is distance-based subset selection (DSS) since it is very easy to calculate and can easily scale to many-objective optimization. However, the DSS's selection mechanism usually lead to a small hypervolume value for the selected subset even when the optimal subset with respect to the minimum distance among the selected solutions is obtained. In this paper, we propose a modification to the DSS algorithm by selecting a knee point as the first solution. The knee point is often a solution of interest to decision makers in the absence of preference information. Experimental results show that the inclusion of a knee point generally has a positive effect on improving the hypervolume value of the selected subset.

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

Reinforcement Learning Based Vertical Scaling for Hybrid Deployment in Cloud Computing 1

引用

17th International Conference on Bio-Inspired Computing: Theories and Applications, BIC-TA 2022

作者： Cao, Jianqi Li, Guiying Yang, Peng Guangdong Provincial Key Laboratory of Brain-Inspired Intelligent Computation Department of Computer Science and Engineering Southern University of Science and Technology Shenzhen518055 China Research Institute of Trustworthy Autonomous Systems Southern University of Science and Technology Shenzhen518055 China Department of Statistics and Data Science Southern University of Science and Technology Shenzhen518055 China

ISBN: (数字)9789819915491

ISBN: (纸本)9789819915484

To maximize the CPU utilization of the server, offline tasks are usually deployed to the same server where the online service is running. Considering the necessity to ensure the service quality of online services, it is common practice to isolate the resources of online services. How to set the resource quota for online services not only affects the service quality of online services, but also affects the number and the stability of offline tasks that can be run on the server. Traditional rule-based methods or prediction-based methods will cause over-provision and fail to consider the stability of offline tasks, which often cannot achieve stability and efficiency. In this paper, reinforcement learning is proposed for the first time to solve the hybrid deployment of online services and offline tasks and dynamically adjust the resource quota of online services more effectively. Compared with the original state of the server, our proposed method reduces CPU idleness rate by 35.32% and increases CPU resource utilization rate by 3.84%. © 2023, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

sEMG-Based Gesture Recognition in Multiple Scenarios Using a Phase Locked Value-Based Deep Learning Method

sEMG-Based Gesture Recognition in Multiple Scenarios Using a...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Xueze Zhang Minjie Wang Zihua Chen Lu Wang Hongbo Wang Xiaoyang Kang MOE Frontiers Center for Brain Science State Key Laboratory of Medical Neurobiology Institute of AI & Robotics Institude of Meta-Medical Academy for Engineering & Technology Laboratory for Neural Interface and Brain Computer Interface Engineering Research Center of AI & Robotics Ministry of Education Shanghai Engineering Research Center of AI & Robotics Fudan University Shanghai China

ISBN: (数字)9798350386226

ISBN: (纸本)9798350386233

Surface electromyography (sEMG) signals-based gesture recognition method is widely employed in human-computer interaction task. In this paper, we proposed a phase locked value (PLV)-based feature extraction method for sEMG-based gesture recognition. We conducted validation experiments on public datasets by integrating the previous proposed gesture recognition algorithms, STCN-GR and ConSSL. PLV-STCN-GR and PLV-ConSSL were utilized to test the performance of proposed feature extraction method in intra-session, inter-session and inter-subject scenarios. In general, the proposed PLV-based sEMG decoding framework has achieved good recognition results on public datasets and demonstrated the possibility of its application in practical scenarios.

关键词： Human computer interaction Deep learning Gesture recognition Feature extraction Electromyography Decoding Bioinformatics

来源：评论

学校读者我要写书评

暂无评论

Pose as a Modality: A Psychology-Inspired Network for Personality Recognition with a New Multimodal Dataset

arXiv

引用

arXiv 2025年

作者： Tang, Bin Pan, Ke-Qi Zheng, Miao Zhou, Ning Sui, Jia-Lu Zhu, Dandan Deng, Cheng-Long Kuai, Shu-Guang School of Computer Science and Technology Shanghai Institute of Artificial Intelligence for Education Lab of Artificial Intelligence for Education East China Normal University Shanghai China School of Psychology and Cognitive Science Institute of Brain and Education Innovation Shanghai Key Laboratory of Mental Health and Psychological Crisis Intervention Shanghai Key Laboratory of Brain Functional Genomics Key Laboratory of Brain Functional Genomics East China Normal University Shanghai China Shanghai Center for Brain Science and Brain-Inspired Technology Shanghai China NYU-ECNU Institute of Brain and Cognitive Science New York University Shanghai Shanghai China

In recent years, predicting Big Five personality traits from multimodal data has received significant attention in artificial intelligence (AI). However, existing computational models often fail to achieve satisfactory performance. Psychological research has shown a strong correlation between pose and personality traits, yet previous research has largely ignored pose data in computational models. To address this gap, we develop a novel multimodal dataset that incorporates full-body pose data. The dataset includes video recordings of 287 participants completing a virtual interview with 36 questions, along with self-reported Big Five personality scores as labels. To effectively utilize this multimodal data, we introduce the Psychology-Inspired Network (PINet), which consists of three key modules: Multimodal Feature Awareness (MFA), Multimodal Feature Interaction (MFI), and Psychology-Informed Modality Correlation Loss (PIMC Loss). The MFA module leverages the Vision Mamba Block to capture comprehensive visual features related to personality, while the MFI module efficiently fuses the multimodal features. The PIMC Loss, grounded in psychological theory, guides the model to emphasize different modalities for different personality dimensions. Experimental results show that the PINet outperforms several state-of-the-art baseline models. Furthermore, the three modules of PINet contribute almost equally to the model’s overall performance. Incorporating pose data significantly enhances the model’s performance, with the pose modality ranking mid-level in importance among the five modalities. These findings address the existing gap in personality-related datasets that lack full-body pose data and provide a new approach for improving the accuracy of personality prediction models, highlighting the importance of integrating psychological insights into AI frameworks. Copyright © 2025, The Authors. All rights reserved.

关键词： Psychoacoustic

来源：评论

学校读者我要写书评

暂无评论

Transcriptomic and Macroscopic Architectures of Multimodal Covariance Network Reveal Molecular–Structural–Functional Co-alterations

引用

Research 2024年第1期2023卷 471-487页

作者： Lin Jiang Yueheng Peng Runyang He Qingqing Yang Chanlin Yi Yuqin Li Bin Zhu Yajing Si Tao Zhang Bharat B.Biswal Dezhong Yao Lan Xiong Fali Li Peng Xu The Clinical Hospital of Chengdu Brain Science Institute MOE Key Lab for NeuroinformationUniversity of Electronic Science and Technology of ChinaChengdu 611731China School of Life Science and Technology Center for Information in BioMedicineUniversity of Electronic Science and Technology of ChinaChengdu 611731China School of Psychology Xinxiang Medical UniversityXinxiang 453003China School of Science Xihua UniversityChengdu 610039China Department of Biomedical Engineering New Jersey Institute of TechnologyNewarkNJUSA School of Electrical Engineering Zhengzhou UniversityZhengzhou 450001China Research Unit of NeuroInformation Chinese Academy of Medical Sciences2019RU035ChengduChina Montreal Neurological Institute and Hospital McGill UniversityMontrealQCCanada Department of Electrical and Computer Engineering Faculty of Science and TechnologyUniversity of MacaoMacaoChina Radiation Oncology Key Laboratory of Sichuan Province 610041 ChengduChina Rehabilitation Center Qilu Hospital of Shandong UniversityJinan 250012China

Human cognition is usually underpinned by intrinsic structure and functional neural co-activation in spatially distributed brain *** to lacking an effective approach to quantifying the covarying of structure and functional responses,how the structural–functional circuits interact and how genes encode the relationships,to deepen our knowledge of human cognition and disease,are still ***,we propose a multimodal covariance network(MCN)construction approach to capture interregional covarying of the structural skeleton and transient functional activities for a single *** further explored the potential association between brain-wide gene expression patterns and structural–functional covarying in individuals involved in a gambling task and individuals with major depression disorder(MDD),adopting multimodal data from a publicly available human brain transcriptomic atlas and 2 independent *** analysis showed a replicable cortical structural–functional fine map in healthy individuals,and the expression of cognition-and disease phenotype-related genes was found to be spatially correlated with the corresponding MCN *** analysis of cell type-specific signature genes suggests that the excitatory and inhibitory neuron transcriptomic changes could account for most of the observed correlation with task-evoked MCN differences.

关键词： alterations evoked spatially

来源：评论

学校读者我要写书评

暂无评论

Large Language Models as Evolutionary Optimizers 13

Large Language Models as Evolutionary Optimizers

引用

13th IEEE Congress on Evolutionary Computation, CEC 2024

作者： Liu, Shengcai Chen, Caishun Qu, Xinghua Tang, Ke Ong, Yew-Soon Southern University of Science and Technology Centre for Frontier Ai Research A∗star Department of Computer Science and Engineering China Centre for Frontier Ai Research A∗star Singapore Tianqiao & Chrissy Chen Institute China Southern University of Science and Technology Guangdong Provincial Key Laboratory of Brain-Inspired Intelligent Computation Department of Computer Science and Engineering China Nanyang Technological University Centre for Frontier Ai Research A∗star College of Computing and Data Science Singapore

ISBN: (纸本)9798350308365

Evolutionary algorithms (EAs) have achieved remarkable success in tackling complex combinatorial optimization problems. However, EAs often demand carefully-designed operators with the aid of domain expertise to achieve satisfactory performance. In this work, we present the first study on large language models (LLMs) as evolutionary combinatorial optimizers. The main advantage is that it requires minimal domain knowledge and human efforts, as well as no additional training of the model. This approach is referred to as LLM-driven EA (LMEA). Specifically, in each generation of the evolutionary search, LMEA instructs the LLM to select parent solutions from current population, and perform crossover and mutation to generate offspring solutions. Then, LMEA evaluates these new solutions and include them into the population for the next generation. LMEA is equipped with a self-adaptation mechanism that controls the temperature of the LLM. This enables it to balance between exploration and exploitation and prevents the search from getting stuck in local optima. We investigate the power of LMEA on the classical traveling salesman problems (TSPs) widely used in combinatorial optimization research. Notably, the results show that LMEA performs competitively to traditional heuristics in finding high-quality solutions on TSP instances with up to 20 nodes. Additionally, we also study the effectiveness of LLM-driven crossover/mutation and the self- adaptation mechanism in evolutionary search. In summary, our results reveal the great potentials of LLMs as evolutionary optimizers for solving combinatorial problems. We hope our research shall inspire future explorations on LLM-driven EAs for complex optimization challenges. © 2024 IEEE.

关键词： Traveling salesman problem

来源：评论

学校读者我要写书评

暂无评论

Lingxi: A diversity-Aware chinese modern poetry generation system 61

Lingxi: A diversity-Aware chinese modern poetry generation s...

引用

61st Annual Meeting of the Association for Computational Linguistics, ACL-DEMO 2023

作者： Zhang, Xinran Sun, Maosong Liu, Jiafeng Li, Xiaobing Department of AI Music and Music Information Technology Central Conservatory of Music United Kingdom Key Laboratory of Music and Brain Science Central Conservatory of Music Ministry of Education China Laboratory of AI Music Central Conservatory of Music Laboratory of Philosophy and Social Sciences Ministry of Education China Department of Computer Science and Technology Tsinghua University China

ISBN: (纸本)9781959429708

Chinese modern poetry generation has been a challenging task. One issue is the Chinese word segmentation (CWS) which is critical to comprehend the Chinese language but was not always considered in common tokenization methods. Another is the decoding (sampling) method which may induce repetition and boredom and severely lower the diversity of the generated poetry. To address these issues, we present Lingxi, a diversityaware Chinese modern poetry generation system. For the CWS issue, we propose a novel framework that incorporates CWS in the tokenization process. The proposed method can achieve a high vocabulary coverage rate with a reasonable vocabulary size. For the decoding method and the diversity issue, we propose a novel sampling algorithm that flattens the high likelihood part of the predicted distribution of the language model to emphasize the comparatively low-likelihood words and increase the diversity of generated poetry. Empirical results show that even when the top 60% of cumulative probability mass of the predicted distribution is flattened, our method achieves comparable or even better performance than baseline sampling methods. Our system is available at http://***. © ACL-DEMO 2023. All rights reserved.

关键词： Probability distributions

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：