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

Global Convergence Guarantees of (A)GIST for a Family of Nonconvex Sparse Learning Problems

IEEE Transactions on Cybernetics 2022年第5期52卷 3276-3288页

作者： Zhang, Hengmin Qian, Feng Shang, Fanhua Du, Wenli Qian, Jianjun Yang, Jian East China University of Science and Technology Key Laboratory of Advanced Control and Optimization for Chemical Processes of Ministry of Education School of Information Science and Engineering Shanghai200237 China Shanghai Institute of Intelligent Science and Technology Tongji University Shanghai200092 China Xidian University Key Laboratory of Intelligent Perception and Image Understanding of Ministry of Education School of Artificial Intelligence Xi'an710071 China Peng Cheng Laboratory Shenzhen518066 China Nanjing University of Science and Technology Pca Laboratory Key Lab. of Intelligent Percept. and Syst. for High-Dimensional Information of Ministry of Education Nanjing210094 China Nanjing University of Science and Technology Jiangsu Key Laboratory of Image and Video Understanding for Social Security School of Computer Science and Engineering Nanjing210094 China

In recent years, most of the studies have shown that the generalized iterated shrinkage thresholdings (GISTs) have become the commonly used first-order optimization algorithms in sparse learning problems. The nonconvex relaxations of the \ell _{0} -norm usually achieve better performance than the convex case (e.g., \ell _{1} -norm) since the former can achieve a nearly unbiased solver. To increase the calculation efficiency, this work further provides an accelerated GIST version, that is, AGIST, through the extrapolation-based acceleration technique, which can contribute to reduce the number of iterations when solving a family of nonconvex sparse learning problems. Besides, we present the algorithmic analysis, including both local and global convergence guarantees, as well as other intermediate results for the GIST and AGIST, denoted as (A)GIST, by virtue of the Kurdyka-Lojasiewica (KL) property and some milder assumptions. Numerical experiments on both synthetic data and real-world databases can demonstrate that the convergence results of objective function accord to the theoretical properties and nonconvex sparse learning methods can achieve superior performance over some convex ones. © 2013 IEEE.

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

Causal Invariant Hierarchical Molecular Representation for Out-of-distribution Molecular Property Prediction

Causal Invariant Hierarchical Molecular Representation for O...

引用

2024 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2024

作者： Wen, Xinlong Guo, Yifei Wei, Shuoying Long, Wenhan Zhu, Lida Zhu, Rongbo College of Informatics Huazhong Agricultural University Wuhan430070 China Shenzhen Institute of Nutrition and Health Huazhong Agricultural University Shenzhen518000 China Shenzhen Branch Guangdong Laboratory for Lingnan Modern Agriculture Genome Analysis Laboratory of the Ministry of Agriculture Agricultural Genomics Institute at Shenzhen Chinese Academy of Agricultural Sciences Shenzhen518000 China Engineering Research Center of Intelligent Technology for Agriculture Ministry of Education Hubei Wuhan430074 China Key Laboratory of Ministry of Education for Image Processing and Intelligent Control School of Artificial Intelligence and Automation Huazhong University of Science and Technology Hubei Wuhan430074 China

ISBN: (纸本)9798350386226

Molecular representation learning is widely used in the field of drug discovery, due to its ability to accurately capture the complex features of compounds in high-dimensional space. However, existing molecular representation learning models are prone to be influenced by spurious parts during distribution shifts (also known as out-of-distribution, or OOD), which results in models mistakenly treating these spurious parts as crucial features of molecules, thereby limiting the generalization capability of the models. To tackle this issue, a novel invariant molecular representation learning model, called Causal Invariant Hierarchical Molecular Representation Graph Neural Networks (CHiMoGNN), is proposed for OOD molecular property prediction. In CHiMoGNN, a Feature Enhancement (FE) module is designed to leverage the multi-level molecular parts to enhance the expression of invariant features, thereby enhancing the model's capability to capture key molecular information. In addition, a Cartesian Product based Environmental Impact (EI) module is adopted to generate counterfactual samples with environmental diversity. Consequently, these samples are utilized to train a classifier that maintains consistent performance across various environments. Extensive experiments on seven real-world datasets demonstrate that CHiMoGNN outperforms 9 state-of-the-art models, achieving a 5.73% increase in average ROC-AUC, and the results also show that CHiMoGNN can effectively maintain generalization in various distribution shifts. Code and datasets are available at https://***/Chertuion/CHiMoGNN. © 2024 IEEE.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

A Parallel Read-Write Circuit With Fast Amplitude-Adaptive Matching Scheme to Memristor Crossbar Array

引用

IEEE Transactions on Circuits and Systems I: Regular Papers 2025年

作者： Jiang, Ningye Jiang, Mingxuan Huang, Haoen Yang, Le Huang, Yi Zeng, Zhigang Huazhong University of Science and Technology School of Artificial Intelligence and Automation Key Laboratory of Image Information Processing and Intelligent Control Ministry of Education of China Wuhan430074 China Wuhan Institute of Technology School of Electrical and Information Engineering Wuhan430205 China University of Massachusetts Amherst Department of Electrical and Computer Engineering AmherstMA01003 United States

Memristor crossbar array (MCA) is a computing-in-memory (CIM) module for computational acceleration. However, conventional read-write (R-W) circuits for MCA rely heavily on external components and have shortcoming in long writing times. To address these issues, we propose a parallel R-W circuit with a fast amplitude-adaptive matching (AAM) scheme. The fast AAM scheme is designed to accelerate time of writing memristors in MCA by adaptively adjusting the writing voltage to match an optimal amplitude. The architecture of parallel R-W circuit are outlined with the implementation of R-W processes. The design principles of parallel R-W unit, fast AAM unit, and associated control logic are described for analyzing their functions within the circuit. By integrating the parallel R-W circuit with MCA, a computing block is leveraged in a neural network for classification tasks. The experimental results demonstrate that the neural network with multiple computing blocks maintains high accuracy across various datasets (over 80%). Furthermore, the proposed AAM scheme achieves an average 54% reduction in writing time compared to that one without AAM scheme. Compared to the pulse-width scheme, the parallel R-W circuit exhibits an average 3.05× speedup in adjusting a 5×5 MCA, and the speedup efficiency is higher as the increases of MCA size. © 2025 IEEE.

关键词： Memristors

来源：评论

学校读者我要写书评

暂无评论

Distributed Resource Allocation via Accelerated Saddle Point Dynamics

引用

IEEE/CAA Journal of Automatica Sinica 2021年第9期8卷 1588-1599页

作者： Wen-Ting Lin Yan-Wu Wang Chaojie Li Xinghuo Yu School of Artificial Intelligence and Automation Huazhong University of Science and TechnologyWuhan 430074 Key Laboratory of Image Processing and Intelligent Control Ministry of EducationHuazhong University of Science and TechnologyWuhan 430074China School of Electrical Engineering and Telecommunications University of New South WalesSydney NSW 2052Australia School of Engineering Royal Melbourne Institute of Technology(RMIT University)Melbourne VIC 3000Australia

In this paper,accelerated saddle point dynamics is proposed for distributed resource allocation over a multi-agent network,which enables a hyper-exponential convergence ***,an inertial fast-slow dynamical system with vanishing damping is introduced,based on which the distributed saddle point algorithm is *** dual variables are updated in two time scales,i.e.,the fast manifold and the slow *** the fast manifold,the consensus of the Lagrangian multipliers and the tracking of the constraints are pursued by the consensus *** the slow manifold,the updating of the Lagrangian multipliers is accelerated by inertial ***-exponential stability is defined to characterize a faster convergence of our proposed algorithm in comparison with conventional primal-dual algorithms for distributed resource *** simulation of the application in the energy dispatch problem verifies the result,which demonstrates the fast convergence of the proposed saddle point dynamics.

关键词： Accelerated saddle point dynamic distributed resource allocation hyper-exponential stability power dispatch

来源：评论

学校读者我要写书评

暂无评论

Tiny noise, big mistakes: adversarial perturbations induce errors in brain–computer interface spellers

引用

National Science Review 2021年第4期8卷 78-90页

作者： Xiao Zhang Dongrui Wu Lieyun Ding Hanbin Luo Chin-Teng Lin Tzyy-Ping Jung Ricardo Chavarriaga Ministry of Education Key Laboratory of Image Processing and Intelligent Control School of Artificial Intelligence and AutomationHuazhong University of Science and Technology School of Civil Engineering and Mechanics Huazhong University of Science and Technology Centre of Artificial Intelligence Faculty of Engineering and Information Technology University of Technology Sydney Swartz Center for Computational Neuroscience Institute for Neural ComputationUniversity of California San Diego Center for Advanced Neurological Engineering Institute of Engineering in Medicine University of California San Diego ZHAW Data Lab Zürich University of Applied Sciences

An electroencephalogram(EEG)-based brain–computer interface(BCI) speller allows a user to input text to a computer by thought. It is particularly useful to severely disabled individuals, e.g. amyotrophic lateral sclerosis patients, who have no other effective means of communication with another person or a *** studies so far focused on making EEG-based BCI spellers faster and more reliable; however, few have considered their security. This study, for the first time, shows that P300 and steady-state visual evoked potential BCI spellers are very vulnerable, i.e. they can be severely attacked by adversarial perturbations,which are too tiny to be noticed when added to EEG signals, but can mislead the spellers to spell anything the attacker wants. The consequence could range from merely user frustration to severe misdiagnosis in clinical applications. We hope our research can attract more attention to the security of EEG-based BCI spellers, and more broadly, EEG-based BCIs, which has received little attention before.

关键词： electroencephalogram brain-computer interfaces BCI spellers adversarial examples

来源：评论

学校读者我要写书评

暂无评论

Virtually-Federated Scheduling of Parallel Real-Time Tasks 42

Virtually-Federated Scheduling of Parallel Real-Time Tasks

引用

42nd IEEE Real-Time Systems Symposium, RTSS 2021

作者： Jiang, Xu Guan, Nan Liang, Haochun Tang, Yue Qiao, Lei Yi, Wang Key Laboratory of Intelligent Computing in Medical Image Ministry of Education Northeastern University China City University of Hong Kong Hong Kong Beijing Institute of Control Engineering China Uppsala University Sweden

ISBN: (纸本)9781665428026

Federated scheduling is a promising approach to schedule parallel real-time tasks, where each task exclusively executes on a set of dedicated processors. However, federated scheduling suffers significant resource wasting since a task typically only uses part of the processing capacity allocated to it, while the unused part cannot be shared with other tasks. To solve this problem, we present a virtually-federated scheduling approach, which both enjoys the good analyzability of federated scheduling and allows tasks to efficiently share processors with others. The main idea is to construct virtual processors on physical processors, and let a task exclusively execute on a set of virtual processors. As a physical processor is shared by virtual processors, tasks effectively share processors with each other. On the other hand, as each task exclusively executes on its own virtual processor set, the good analyzability of federated scheduling can be carried into to our virtually-federated scheduling approach. We conduct comprehensive performance evaluation to compare our proposed approach with existing methods of different types. Experiment results show that our approach consistently outperforms existing methods to a considerable extent under a wide range of parameter settings. ©2021 IEEE

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

Isoform Function Prediction Based on Heterogeneous Graph Attention Networks

Isoform Function Prediction Based on Heterogeneous Graph Att...

引用

2023 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2023

作者： Guo, Kuo Li, Yifan Chen, Hao Shen, Hong-Bin Yang, Yang Shanghai Jiao Tong University Key Lab. of Shanghai Education Commission for Intelligent Interaction and Cognitive Engineering Department of Computer Science and Engineering Shanghai200240 China Shanghai Jiao Tong University Key Laboratory of System Control and Information Processing Ministry of Education of China Institute of Image Processing and Pattern Recognition Shanghai200240 China Carnegie Mellon University School of Computer Science Computational Biology Department PittsburghPA15213 United States

ISBN: (纸本)9798350337488

Isoforms refer to different mRNA molecules transcribed from the same gene, which can be translated into proteins with varying structures and functions. Predicting the functions of isoforms is an essential topic in bioinformatics as it can provide valuable insights into the intricate mechanisms of gene regulation and biological processes. Conventionally, gene function labels are standardized in Gene Ontology (GO) terms. However, traditional methods for predicting isoform function are largely limited by the absence of isoform-specific labels, sparse annotations, and the vast number of GO terms. To address these issues, we propose HANIso, a deep learning-based method for isoform function prediction. HANIso leverages a pretrained protein language model to extract features from protein sequences. It also integrates heterogeneous information, such as isoform sequence features, GO annotations, and isoform interaction data, using a Heterogeneous Graph Attention Network (HAN). This allows the model to learn the importance of different sources of information and their semantic relationships through the attention mechanism. Our method can predict function labels at both the gene level and isoform level. We conduct experiments on two species datasets, and the results demonstrate that our method outperforms existing methods on both AUROC and AUPRC. HANIso has the potential to overcome the limitations of traditional methods and provide a more accurate and comprehensive understanding of isoform function. © 2023 IEEE.

关键词： alternative splicing gene ontology heterogeneous graph attention network isoform function prediction protein language model

来源：评论

学校读者我要写书评

暂无评论

SliceProp: A Slice-Wise Bidirectional Propagation Model for Interactive 3D Medical image Segmentation 1

SliceProp: A Slice-Wise Bidirectional Propagation Model for ...

引用

1st IEEE International Conference on Medical Artificial Intelligence, MedAI 2023

作者： Xu, Xin Lu, Wenjing Lei, Jiahao Qiu, Peng Shen, Hong-Bin Yang, Yang Shanghai Jiao Tong University Key Lab. of Shanghai Education Commission for Intelligent Interaction and Cognitive Engineering Department of Computer Science and Engineering Shanghai200240 China Shanghai Ninth People's Hospital Shanghai Jiao Tong University School of Medicine Department of Vascular Surgery China Shanghai Jiao Tong University Institute of Image Processing and Pattern Recognition Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai200240 China

ISBN: (纸本)9798350358780

Interactive medical image segmentation methods have become increasingly popular in recent years. These methods combine manual labeling and automatic segmentation, reducing the workload of annotation while maintaining high accuracy. However, most current interactive segmentation frameworks are limited to 2D image data, and are not suitable for 3D image data due to the large size and high complexity of 3D data, as well as the challenges posed by information asymmetry and sparse annotation. In this paper, we propose SliceProp, an interactive segmentation framework that implements slice-wise Label Bidirectional Propagation (LBP) for 3D medical image segmentation. SliceProp extends the interactive 2D image segmentation algorithm to 3D image segmentation, and can handle 3D data with large size and high complexity. Moreover, equipped with a Backtracking Feedback Check (BFC) module, SliceProp effectively addresses the issues of information asymmetry and spatial sparse annotation in 3D medical image segmentation. Additionally, we adopt an uncertainty-based criterion to pri-oritize the slices to be refined interactively, which enhances the efficiency of the interaction process by enabling the model to focus on the regions with the most unreliable predictions. SliceProp is evaluated on two datasets and achieves promising results compared to state-of-the-art methods. © 2023 IEEE.

关键词： Medical imaging

来源：评论

学校读者我要写书评

暂无评论

Adaptive Homophily Clustering: Structure Homophily Graph Learning with Adaptive Filter for Hyperspectral image

arXiv

引用

arXiv 2025年

作者： Ding, Yao Kang, Weijie Yang, Aitao Zhang, Zhili Zhao, Junyang Feng, Jie Hong, Danfeng Zheng, Qinghe The Key Laboratory of Intelligent Control PLA Rocket Force University of Engineering Xi’an710025 China The Key Laboratory of Intelligent Perception and Image Understanding of Ministry of Education of China Xidian University Xi’an710071 China The Aerospace Information Research Institute Chinese Academy of Sciences Beijing100094 China The School of Electronic Electrical and Communication Engineering University of Chinese Academy of Sciences Beijing100049 China

Hyperspectral image (HSI) clustering has been a fundamental but challenging task with zero training labels. Currently, some deep graph clustering methods have been successfully explored for HSI due to their outstanding performance in effective spatial structural information encoding. Nevertheless, insufficient structural information utilization, poor feature presentation ability, and weak graph update capability limit their performance. Thus, in this paper, a homophily structure graph learning with an adaptive filter clustering method (AHSGC) for HSI is proposed. Specifically, homogeneous region generation is first developed for HSI processing and constructing the original graph. Afterward, an adaptive filter graph encoder is designed to adaptively capture the high and low frequency features on the graph for subsequence processing. Then, a graph embedding clustering self-training decoder is developed with KL Divergence, with which the pseudo-label is generated for network training. Meanwhile, homophily-enhanced structure learning is introduced to update the graph according to the clustering task, in which the orient correlation estimation is adopted to estimate the node connection, and graph edge sparsification is designed to adjust the edges in the graph dynamically. Finally, a joint network optimization is introduced to achieve network self-training and update the graph. The K-means is adopted to express the latent features. Extensive experiments and repeated comparative analysis have verified that our AHSGC contains high clustering accuracy, low computational complexity, and strong robustness. The code source will be available at https://***/DY-HYX. Copyright © 2025, The Authors. All rights reserved.

关键词： Adaptive filters

来源：评论

学校读者我要写书评

暂无评论

ADMEOOD: Out-of-Distribution Benchmark for Drug Property Prediction

ADMEOOD: Out-of-Distribution Benchmark for Drug Property Pre...

引用

2023 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2023

作者： Wei, Shuoying Li, Songquan Guo, Yifei Zhu, Lida Wen, Xinlong Zhu, Rongbo College of Informatics Huazhong Agricultural University Wuhan430070 China Shenzhen Institute of Nutrition and Health Huazhong Agricultural University Shenzhen518000 China Shenzhen Branch Guangdong Laboratory for Lingnan Modern Agriculture Genome Analysis Laboratory of the Ministry of Agriculture Agricultural Genomics Institute at Shenzhen Chinese Academy of Agricultural Sciences Shenzhen518000 China Engineering Research Center of Intelligent Technology for Agriculture Ministry of Education Hubei Wuhan430074 China Key Laboratory of Ministry of Education for Image Processing and Intelligent Control School of Artificial Intelligence and Automation Huazhong University of Science and Technology Hubei Wuhan430074 China

ISBN: (纸本)9798350337488

Obtaining accurate and effective information for drug molecules is a crucial and challenging task, which relies on high-quality chemical knowledge. However, chemical knowledge has been accumulated over the past 100 years from various regions, laboratories, and experimental purposes, which contains a lot of noise and inconsistency, leading to the out-of-distribution (OOD) problem. OOD may results in weak robustness and unsatisfied performance. In order to solve OOD learning problem with noise, a novel benchmark: ADMEOOD is proposed, which is a systematic OOD dataset curator and specifically designed for drug property prediction. ADMEOOD screens 27 Absorption, Distribution, Metabolism and Excretion (ADME) drug properties from Chembl and relevant literature. This paper explicitly make distinctions between two kinds of OOD data shifts: Noise Shift and Concept Conflict Drift (CCD). Overall, ADME contains 6 domain annotations combined with noise, CCD and no shifts, resulting in 18 different splits in total. ADMEOOD provides performance results on a variety of SOTA OOD models. The results demonstrate a significant difference performance between in-distribution and OOD data. Moreover, Empirical Risk Minimization and other models exhibit distinct trends in different domains and measurement types. The ADMEOOD benchmark can be accessed via https://***/qweasdzxc-wsy/ADMEOOD/. © 2023 IEEE.

关键词： ADME Benchmark Drug property prediction Out-of-distribution

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：