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

arXiv 2023年

作者： Liu, Shengcai Chen, Caishun Qu, Xinghua Tang, Ke Ong, Yew-Soon Centre for Frontier AI Research A*STAR Department of Computer Science and Engineering Southern University of Science and Technology China Centre for Frontier AI Research A*STAR Tianqiao & Chrissy Chen Institute United States Guangdong Provincial Key Laboratory of Brain-Inspired Intelligent Computation Southern University of Science and Technology China Centre for Frontier AI Research A*STAR School of Computer Science and Engineering Data Science and Artificial Intelligence Research Centre Nanyang Technological University Singapore

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. Copyright © 2023, The Authors. All rights reserved.

关键词： Combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

A new knowledge gradient-based method for constrained bayesian optimization

arXiv

引用

arXiv 2021年

作者： Chen, Wenjie Liu, Shengcai Tang, Ke Guangdong Provincial Key Laboratory of Brain-inspired Intelligent Computation Department of Computer Science and Engineering Southern University of Science and Technology Shenzhen China

Black-box problems are common in real life like structural design, drug experiments, and machine learning. When optimizing black-box systems, decision-makers always consider multiple performances and give the final decision by comprehensive evaluations. Motivated by such practical needs, we focus on constrained black-box problems where the objective and constraints lack known special structure, and evaluations are expensive and even with noise. We develop a novel constrained Bayesian optimization approach based on the knowledge gradient method (c − KG). A new acquisition function is proposed to determine the next batch of samples considering optimality and feasibility. An unbiased estimator of the gradient of the new acquisition function is derived to implement the c − KG approach. Copyright © 2021, The Authors. All rights reserved.

关键词： Gradient methods

来源：评论

学校读者我要写书评

暂无评论

DeepNFT: Towards Precise Neurofibrillary Tangle Detection via Improving Multi-scale Feature Fusion and Adversary

DeepNFT: Towards Precise Neurofibrillary Tangle Detection vi...

引用

2021 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2021

作者： Jiang, Yankai Zhang, Lei Li, Yiming He, Xiangyang Huang, Hanxiao Zhu, Keqing Tao, Yubo Lin, Hai State Key Laboratory of CADCG College of Computer Science and Technology Zhejiang University Hangzhou China Zhejiang University School of Medicine China Brain Bank and Department of Neurology in Second Affiliated Hospital Key Laboratory of Medical Neurobiology of Zhejiang Province Department of Neurobiology Hangzhou China Department of Pathology Zhejiang University School of Medicine Hangzhou China

ISBN: (纸本)9781665401265

Detecting neurofibrillary tangles is an important procedure in the assessment of the intensity and distribution pattern of hippocampal tau pathology, which are the principal clinical phenotypes associated with Alzheimer's disease. Existing deep learning based detectors still face a critical obstacle: the difficulty in detecting extremely small objects in high resolution images. In this paper, we propose a deep learning framework, named DeepNFT, which combines the multilevel feature aggregation pyramid network (MFAPN) and the adversarial feature generation module (AFGM) to acquire precise detection results with significantly reduced false positives. To prove its universality and robustness, DeepNFT has been validated on two datasets. Experiments show the significant performance gain of our proposed approach over state-of-the-art detectors. Ablation study shows our network components improve the performance of various backbones and detectors. © 2021 IEEE.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

Dynamical causality under invisible confounders

arXiv

引用

arXiv 2024年

作者： Yan, Jinling Zhang, Shao-Wu Zhang, Chihao Huang, Weitian Shi, Jifan Chen, Luonan MOE Key Laboratory of Information Fusion Technology School of Automation Northwestern Polytechnical University Xi’an710072 China Key Laboratory of Systems Biology Shanghai Institute of Biochemistry and Cell Biology Center for Excellence in Molecular Cell Science Chinese Academy of Sciences Shanghai200031 China NCMIS CEMS RCSDS Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100190 China School of Mathematics Sciences University of Chinese Academy of Sciences Beijing100049 China School of Computer Science and Engineering South China University of Technology Guangdong Guangzhou510006 China Guangdong Institute of Intelligence Science and Technology Hengqin Guangdong Zhuhai519031 China Research Institute of Intelligent Complex Systems Fudan University Shanghai200433 China State Key Laboratory of Medical Neurobiology MOE Frontiers Center for Brain Science Institutes of Brain Science Fudan University Shanghai200032 China Shanghai Artificial Intelligence Laboratory Shanghai200232 China Key Laboratory of Systems Health Science of Zhejiang Province School of Life Science Hangzhou Institute for Advanced Study University of Chinese Academy of Sciences Chinese Academy of Sciences Hangzhou310024 China

Causality inference is prone to spurious causal interactions, due to the substantial confounders in a complex system. While many existing methods based on the statistical methods or dynamical methods attempt to address misidentification challenges, there remains a notable lack of effective methods to infer causality, in particular in the presence of invisible/unobservable confounders. As a result, accurately inferring causation with invisible confounders remains a largely unexplored and outstanding issue in data science and AI fields. In this work, we propose a method to overcome such challenges to infer dynamical causality under invisible confounders (CIC method) and further reconstruct the invisible confounders from time-series data by developing an orthogonal decomposition theorem in a delay embedding space. The core of our CIC method lies in its ability to decompose the observed variables not in their original space but in their delay embedding space into the common and private subspaces respectively, thereby quantifying causality between those variables both theoretically and computationally. This theoretical foundation ensures the causal detection for any high-dimensional system even with only two observed variables under many invisible confounders, which is actually a long-standing problem in the field. In addition to the invisible confounder problem, such a decomposition actually makes the intertwined variables separable in the embedding space, thus also solving the non-separability problem of causal inference. Extensive validation of the CIC method is carried out using various real datasets, and the experimental results demonstrates its effectiveness to reconstruct real biological networks even with unobserved confounders. © 2024, CC BY-NC-ND.

关键词： Time series

来源：评论

学校读者我要写书评

暂无评论

Manipulating Piezoelectric and Electro-Strain Properties of BiFeO3-BaTiO3-Based Ceramics Through Chemical Doping-Controlled Domain-Size Engineering

SSRN

引用

SSRN 2025年

作者： Lin, Jiamin Liu, Bing Liu, Mengxiang Yang, Shan Zhou, Linming Hong, Zijian Zhu, Xiaoli Wu, Yongjun Li, Juan Huang, Yuhui School of Materials Science and Engineering State Key Laboratory of Silicon and Advanced Semiconductor Materials Cyrus Tang Center for Sensor Materials and Applications Institute of Fundamental and Transdisciplinary Research Zhejiang University Hangzhou310027 China Nanhu Brain-computer Interface Institute Zhejiang Hangzhou311100 China College of Electronic Information and Engineering Hangzhou Dianzi University Zhejiang Hangzhou310018 China Zhejiang Key Laboratory of Advanced Solid State Energy Storage Technology and Applications Taizhou Institute of Zhejiang University Zhejiang Taizhou318000 China School of Engineering Hangzhou City University Zhejiang Hangzhou310015 China College of Materials and Science Engineering Zhejiang University of Technology Zhejiang Hangzhou310006 China

Ferroelectric domains are crucial for the performance of piezoelectric ceramics, as the size and switching dynamics affect polarization response directly, manipulating both ferroelectric and piezoelectric properties. In this study, we achieved BiFeO3-BaTiO3 ceramics with domain sizes from macroscopic to nanoscale by incorporating a small amount of antiferroelectric phase. Contrary to the long-standing belief that smaller ferroelectric domains own lower polarization switching barriers and yield higher piezoelectricity, we found that in chemical doping-controlled domain size engineering, the smaller the domain size, the more difficult it is for polarization switching. Ceramics with the largest domain exhibited superior positive piezoelectric performance due to the sufficient polarization switching and reduced domain wall pinning, achieving a piezoelectric coefficient (d33) of 460 pC/N at 350°C. Middle-sized domains achieved optimal electro-strain performance determined by the trade-off between the domain walls pinning and the increased local tetragonal or orthorhombic symmetries, with a strain (0.29%) and an excellent piezoelectric strain coefficient (d33*) of 726.4 pm/V at 160°C. This work provides novel insights into how domain-size engineering affects domain switching and local distortion, offering guidance for performance optimization of piezoelectric ceramics. © 2025, The Authors. All rights reserved.

关键词： Piezoelectricity

来源：评论

学校读者我要写书评

暂无评论

A Generic Fundus Image Enhancement Network Boosted by Frequency Self-supervised Representation Learning

arXiv

引用

arXiv 2023年

作者： Li, Heng Liu, Haofeng Fu, Huazhu Xu, Yanwu Shu, Hai Niu, Ke Hu, Yan Liu, Jiang Research Institute of Trustworthy Autonomous Systems Department of Computer Science and Engineering Southern University of Science and Technology Shenzhen China Singapore School of Future Technology South China University of Technology Guangzhou China Pazhou Lab Guangzhou China Department of Biostatistics School of Global Public Health New York University New YorkNY United States Computer School Beijing Information Science and Technology University Beijing China Department of Computer Science and Engineering Southern University of Science and Technology Shenzhen China Guangdong Provincial Key Laboratory of Brain-inspired Intelligent Computation Southern University of Science and Technology Shenzhen China

Fundus photography is prone to suffer from image quality degradation that impacts clinical examination performed by ophthalmologists or intelligent systems. Though enhancement algorithms have been developed to promote fundus observation on degraded images, high data demands and limited applicability hinder their clinical deployment. To circumvent this bottleneck, a generic fundus image enhancement network (GFE-Net) is developed in this study to robustly correct unknown fundus images without supervised or extra data. Levering image frequency information, self-supervised representation learning is conducted to learn robust structure-aware representations from degraded images. Then with a seamless architecture that couples representation learning and image enhancement, GFE-Net can accurately correct fundus images and meanwhile preserve retinal structures. Comprehensive experiments are implemented to demonstrate the effectiveness and advantages of GFE-Net. Compared with state-of-the-art algorithms, GFE-Net achieves superior performance in data dependency, enhancement performance, deployment efficiency, and scale generalizability. Follow-up fundus image analysis is also facilitated by GFE-Net, whose modules are respectively verified to be effective for image enhancement. Copyright © 2023, The Authors. All rights reserved.

关键词： Image enhancement

来源：评论

学校读者我要写书评

暂无评论

Training Quantized Deep Neural Networks via Cooperative Coevolution

arXiv

引用

arXiv 2021年

作者： Peng, Fu Liu, Shengcai Lu, Ning Tang, Ke Guangdong Key Laboratory of Brain-Inspired Intelligent Computation Department of Computer Science and Engineering Southern University of Science and Technology Shenzhen518055 China

This work considers a challenging Deep Neural Network (DNN) quantization task that seeks to train quantized DNNs without involving any full-precision operations. Most previous quantization approaches are not applicable to this task since they rely on full-precision gradients to update network weights. To fill this gap, in this work we advocate using Evolutionary Algorithms (EAs) to search for the optimal low-bits weights of DNNs. To efficiently solve the induced large-scale discrete problem, we propose a novel EA based on cooperative coevolution that repeatedly groups the network weights based on the confidence in their values and focuses on optimizing the ones with the least confidence. To the best of our knowledge, this is the first work that applies EAs to train quantized DNNs. Experiments show that our approach surpasses previous quantization approaches and can train a 4-bit ResNet-20 on the Cifar-10 dataset with the same test accuracy as its full-precision counterpart. Copyright © 2021, The Authors. All rights reserved.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

Experience-Based Evolutionary Algorithms for Expensive Optimization

arXiv

引用

arXiv 2023年

作者： Yu, Xunzhao Wang, Yan Zhu, Ling Filev, Dimitar Yao, Xin The CERCIA School of Computer Science University of Birmingham BirminghamB15 2TT United Kingdom The Research Institute of Trustworthy Autonomous Systems Guangdong Provincial Key Laboratory of Brain-inspired Computation Department of Computer Science and Engineering Southern University of Science and Technology Shenzhen China The Ford Motor Company 2101 Village Rd DearbornMI48124 United States

Optimization algorithms are very different from human optimizers. A human being would gain more experiences through problem-solving, which helps her/him in solving a new unseen problem. Yet an optimization algorithm never gains any experiences by solving more problems. In recent years, efforts have been made towards endowing optimization algorithms with some abilities of experience learning, which is regarded as experience-based optimization. In this paper, we argue that hard optimization problems could be tackled efficiently by making better use of experiences gained in related problems. We demonstrate our ideas in the context of expensive optimization, where we aim to find a near-optimal solution to an expensive optimization problem with as few fitness evaluations as possible. To achieve this, we propose an experience-based surrogate-assisted evolutionary algorithm (SAEA) framework to enhance the optimization efficiency of expensive problems, where experiences are gained across related expensive tasks via a novel meta-learning method. These experiences serve as the task-independent parameters of a deep kernel learning surrogate, then the solutions sampled from the target task are used to adapt task-specific parameters for the surrogate. With the help of experience learning, competitive regression-based surrogates can be initialized using only 1d solutions from the target task (d is the dimension of the decision space). Our experimental results on expensive multi-objective and constrained optimization problems demonstrate that experiences gained from related tasks are beneficial for the saving of evaluation budgets on the target problem. Copyright © 2023, The Authors. All rights reserved.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

CEBRA Method: Decoding brain Activity for Advanced brain-computer interface technology

CEBRA Method: Decoding Brain Activity for Advanced Brain-Com...

引用

Annual International Conference of the IEEE Engineering in Medicine and Biology Society (EMBC)

作者： Jingcheng Yang Frank Kulwa Xuanwei Liu Yiqing Lu Yufa Fu Guanglin Li Yaping Huai Xin Zhang Yongcheng Li CAS Key Laboratory of Human-Machine Intelligence Synergy Systems Shenzhen Institute of Advanced Technology Chinese Academy of Sciences (CAS) Shenzhen China Faculty of Information Engineering and Automation Kunming University of Science and Technology Kunming China Shenzhen College of Advanced Technology University of Chinese Academy of Sciences Shenzhen China Shenzhen Dapeng New District Nanao People’s Hospital Shenzhen China Department of Rehabilitation Medicine Shenzhen Longhua District Central Hospital Shenzhen China Brain Cognition and Brain-Computer Intelligence Integration Group Kunming University of Science and Technology Kunming China Shandong Zhongke Advanced Technology Co. Ltd. Jinan China

ISBN: (数字)9798350371499

ISBN: (纸本)9798350371505

The emerging neurorehabilitation technology, brain-computer interface (BCI), provides a novel prospect for stroke recovery. However, decoding brain activity during the movement present substantial challenges, and feature extraction is crutial to build a better decoder. In this study the CEBRA method were employed to extract features first based on electroencephalogram(EEG) data during Motor Execution(ME) and Motor lmagery (Ml) tasks for 20 participants (including 10 stroke patients). The results revealed that, in MI tasks, CEBRA-RF (Random Forests) achieved an average classification accuracy of 91.33%, with an average F1-score of 91.19%, and CEBRA-SVM (Support Vector Machine) achieved an average classification accuracy of 91.32%, with an average F1-score of 90.83%. Compared to other conventional feature extraction methods, CEBRA shows significantly higher accuracy (t-test, p<0.01). However, in ME tasks, CEBRA-RF achieved an average classification accuracy of 75.67%, with an average F1-score of 75.39%, and CEBRA-SVM achieved an average classification accuracy of 76.13%, with an average F1-score of 75.80%. Nevertheless, no significant differences were observed compared to other feature extraction methods. These findings demonstrate the potential of CEBRA in decoding patients’ brain activity. The results of this study hold promise in addressing the current challenges of low decoding accuracy in BCI systems, offering a new approach for designing BCI-assisted rehabilitation systems for stroke patients.

关键词： Support vector machines brain Accuracy Stroke (medical condition) Feature extraction Motors brain-computer interfaces Neurorehabilitation Decoding Paralysis

来源：评论

学校读者我要写书评

暂无评论

Deep Fusion of Shifted MLP and CNN for Medical Image Segmentation

Deep Fusion of Shifted MLP and CNN for Medical Image Segment...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Chengyu Yuan Hao Xiong Guoqing Shangguan Hualei Shen Dong Liu Haojie Zhang Zhonghua Liu Kun Qian Bin Hu Björn W. Schuller Yoshiharu Yamamoto Shlomo Berkovsky College of Computer and Information Engineering Henan Normal University China Key Laboratory of Artificial Intelligence and Personalized Learning in Education Henan China Big Data Engineering Lab of Teaching Resources & Assessment of Education Quality Henan China Centre for Health Informatics Australian Institute of Health Innovation Macquarie University Australia Key Laboratory of Brain Health Intelligent Evaluation and Intervention (BIT) Ministry of Education China School of Medical Technology Beijing Institute of Technology China School of Information Engineering Zhejiang Ocean University China GLAM – Group on Language Audio & Music Imperial College London U.K. Chair of Embedded Intelligence for Health Care and Wellbeing University of Augsburg Germany Educational Physiology Laboratory Graduate School of Education The University of Tokyo Japan

Medical image segmentation is an important task in modern analysis of medical images. Current methods tend to extract either local features with convolutions or global features with Transformers. However, few of them are able to effectively fuse global and local features to facilitate segmentation. In this work, we propose a novel hybrid network that involves three main branches: the Multi-Layer Perception (MLP) branch, the Convolutional Neural Network (CNN) branch, and a Fusion branch. The MLP and CNN branches aim to learn global and local features, respectively. To fuse these, the fusion branch introduces a novel hierarchical fusion that performs multi-layered fusions that generate high-level representations to enhance segmentation. Our evaluation with two datasets shows strong performance of the proposed method compared to state-of-the-art baselines.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：