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

Data-Efficient CLIP-Powered Dual-Branch Networks for Source-Free Unsupervised Domain Adaptation

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Li, Yongguang Cao, Yueqi Li, Jindong Wang, Qi Wang, Shengsheng College of Software Jilin University Changchun130012 China College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China School of Artificial Intelligence Jilin University Changchun130012 China Engineering Research Center of Knowledge-Driven Human-Machine Intelligence Ministry of Education Jilin University Changchun130012 China

Source-free Unsupervised Domain Adaptation (SF-UDA) aims to transfer a model’s performance from a labeled source domain to an unlabeled target domain without direct access to source samples, addressing critical data privacy concerns. However, most existing SF-UDA approaches assume the availability of abundant source domain samples, which is often impractical due to the high cost of data annotation. To address the dual challenges of limited source data and privacy concerns, we introduce a data-efficient, CLIP-powered dual-branch network (CDBN). This architecture consists of a cross-domain feature transfer branch and a target-specific feature learning branch, leveraging high-confidence target domain samples to transfer text features of source domain categories while learning target-specific soft prompts. By fusing the outputs of both branches, our approach not only effectively transfers source domain category semantic information to the target domain but also reduces the negative impacts of noise and domain gaps during target training. Furthermore, we propose an unsupervised optimization strategy driven by accurate classification and diversity, preserving the classification capability learned from the source domain while generating more confident and diverse predictions in the target domain. CDBN achieves near state-of-the-art performance with far fewer source domain samples than existing methods across 31 transfer tasks on seven datasets. © 2024, CC BY.

关键词： Adversarial machine learning

AMPCliff: quantitative definition and benchmarking of activity cliffs in antimicrobial peptides

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Li, Kewei Wu, Yuqian Li, Yinheng Guo, Yutong Wang, Yan Liang, Yiyang Fan, Yusi Huang, Lan Zhang, Ruochi Zhou, Fengfeng College of Computer Science and Technology Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Jilin Changchun130012 China School of Software Jilin University Jilin Changchun130012 China School of Life Sciences Jilin University Jilin Changchun130012 China Department of Computer Science Columbia University 116th and Broadway New York CityNY10027 United States School of Artificial Intelligence Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Jilin Changchun130012 China School of Biology and Engineering Guizhou Medical University Guizhou Guiyang550025 China School of Computer Engineering Changchun University of Engineering Jilin Changchun130103 China Changchun Wenli High School Jilin Changchun130062 China

Since the mechanism of action of drug molecules in the human body is difficult to reproduce in the in vitro environment, it becomes difficult to reveal the causes of the activity cliff phenomenon of drug molecules. We found out the AC of small molecules has been extensively investigated but limited knowledge is accumulated about the AC phenomenon in peptides with canonical amino acids. Understanding the mechanism of AC in canonical amino acids might help understand the one in drug molecules. This study introduces a quantitative definition and benchmarking framework AMPCliff for the AC phenomenon in antimicrobial peptides (AMPs) composed by canonical amino acids. A comprehensive analysis of the existing AMP dataset reveals a significant prevalence of AC within AMPs. AMPCliff quantifies the activities of AMPs by the MIC, and defines 0.9 as the minimum threshold for the normalized BLOSUM62 similarity score between a pair of aligned peptides with at least two-fold MIC changes. This study establishes a benchmark dataset of paired AMPs in Staphylococcus aureus from the publicly available AMP dataset GRAMPA, and conducts a rigorous procedure to evaluate various AMP AC prediction models, including nine machine learning, four deep learning algorithms, four masked language models, and four generative language models. Our analysis reveals that these models are capable of detecting AMP AC events and the pre-trained protein language model ESM2 demonstrates superior performance across the evaluations. The predictive performance of AMP activity cliffs remains to be further improved, considering that ESM2 with 33 layers only achieves the Spearman correlation coefficient 0.4669 for the regression task of the MIC values on the benchmark dataset. Source code and additional resources are available at https://***/supp/or https://***/Kewei2023/AMPCliff-generation. © 2024, CC BY-NC-SA.

关键词： Deep learning

Heterogeneous Graph Reinforcement Learning for Dependency-aware Multi-task Allocation in Spatial Crowdsourcing

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Zhao, Yong Zhu, Zhengqiu Gao, Chen Wang, En Huang, Jincai Wang, Fei-Yue College of Systems Engineering National University of Defense Technology Hunan Province Changsha410073 China BNRist Tsinghua University Beijing100084 China College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China State Key Laboratory for Management and Control of Complex Systems Institute of Automation Chinese Academy of Sciences Beijing100190 China

Spatial Crowdsourcing (SC) is gaining traction in both academia and industry, with tasks on SC platforms becoming increasingly complex and requiring collaboration among workers with diverse skills. Recent research works address complex tasks by dividing them into subtasks with dependencies and assigning them to suitable workers. However, the dependencies among subtasks and their heterogeneous skill requirements, as well as the need for efficient utilization of workers’ limited work time in the multi-task allocation mode, pose challenges in achieving an optimal task allocation scheme. Therefore, this paper formally investigates the problem of Dependency-aware Multi-task Allocation (DMA) and presents a well-designed framework to solve it, known as Heterogeneous Graph Reinforcement Learning-based Task Allocation (HGRL-TA). To address the challenges associated with representing and embedding diverse problem instances to ensure robust generalization, we propose a multi-relation graph model and a Compound-path-based Heterogeneous Graph Attention Network (CHANet) for effectively representing and capturing intricate relations among tasks and workers, as well as providing embedding of problem state. The task allocation decision is determined sequentially by a policy network, which undergoes simultaneous training with CHANet using the proximal policy optimization algorithm. Extensive experiment results demonstrate the effectiveness and generality of the proposed HGRL-TA in solving the DMA problem, leading to average profits that is 21.78% higher than those achieved using the metaheuristic methods. © 2024, CC BY-NC-ND.

关键词： Reinforcement learning

Shortcut Learning in In-Context Learning: A Survey

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Song, Rui Li, Yingji Shi, Lida Giunchiglia, Fausto Xu, Hao College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Jilin University China Department of Information Engineering and Computer Science University of Trento Italy

Shortcut learning refers to the phenomenon where models employ simple, non-robust decision rules in practical tasks, which hinders their generalization and robustness. With the rapid development of Large Language Models (LLMs) in recent years, an increasing number of studies have shown the impact of shortcut learning on LLMs. This paper provides a novel perspective to review relevant research on shortcut learning in In-Context Learning (ICL). It conducts a detailed exploration of the types of shortcuts in ICL tasks, their causes, available benchmarks, and strategies for mitigating shortcuts. Based on the corresponding observations, we summarize the unresolved issues in existing research and attempts to outline the future research landscape of shortcut learning. © 2024, CC BY.

关键词： Contrastive Learning

Toward Moiré-Free and Detail-Preserving Demosaicking

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Li, Xuanchen Niu, Yan Zhao, Bo Shi, Haoyuan An, Zitong State Key Laboratory of Symbol Computation and Knowledge Engineering College of Computer Science and Technology Ministry of Education Jilin University Changchun China The College of Software Jilin University Changchun130012 China

3D convolutions are commonly employed by demosaicking neural models, in the same way as solving other image restoration problems. Counter-intuitively, we show that 3D convolutions implicitly impede the RGB color spectra from exchanging complementary information, resulting in spectral-inconsistent inference of the local spatial high frequency components. As a consequence, shallow 3D convolution networks suffer the Moiré artifacts, but deep 3D convolutions cause over-smoothness. We analyze the fundamental difference between demosaicking and other problems that predict lost pixels between available ones (e.g., super-resolution reconstruction), and present the underlying reasons for the confliction between Moiré-free and detail-preserving. From the new perspective, our work decouples the common standard convolution procedure to spectral and spatial feature aggregations, which allow strengthening global communication in the spectral dimension while respecting local contrast in the spatial dimension. We apply our demosaicking model to two tasks: Joint Demosaicking-Denoising and Independently Demosaicking. In both applications, our model substantially alleviates artifacts such as Moiré and over-smoothness at similar or lower computational cost to currently top-performing models, as validated by diverse evaluations. Source code will be released along with paper publication. Copyright © 2023, The Authors. All rights reserved.

关键词： Convolution

Talking Head Generation for Media Interaction System with Feature Disentanglement

学校读者我要写书评

暂无评论

Talking Head Generation for Media Interaction System with Fe...

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Lei Zhang Qingyang Chen Zhilei Liu College of Intelligence and Computing School of New Media and Communication Tianjin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun P.R. China State Key Laboratory for Novel Software Technology Nanjing University P.R. China School of New Media and Communication Tianjin University Tianjin China College of Intelligence and Computing Tianjin University Tianjin China

The task of talking head generation for the media interaction system is to take images and audio clips of the target face as input, and generate a realistic video of the target synchronized with the audio. Most of the existing works directly take all the information in the image as input, which causes the problem of feature information redundancy. At the same time, in the stage of feature fusion, the image and audio information is directly spliced, and the relationship between the two modal information is ignored. To solve the problems, we initially implement the disentanglement of image by introducing a loss function to separate the image into identity features and content-related features. Besides, we introduce a multi-head selfattention mechanism to learn the relationship between the two modal information of image and audio, and implement the full fusion of multi-modal information. In addition, we validate the effectiveness of our model through extensive quantitative and qualitative analysis of two datasets. Extensive experiments show the superiority of the proposed model in all aspects.

关键词： Analytical models Redundancy Media Synchronization Task analysis Faces

Medicine composition concentration analysis based on least square support vector machine

学校读者我要写书评

暂无评论

Medicine composition concentration analysis based on least s...

International Conference on Machine Learning and Cybernetics (ICMLC)

作者： Xin-Chen Guo Zhou-Yi Chen Li-Rong Teng Chun-Guo Wu Tian-Bao Du Jia-Huilu Qing-Fan Meng Yan-Chun Liang College of Computer Science and Technology Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China College of Computer Science and Technology Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Changchun China College of Science Northeast China Institute of Electric Power Engineering Jilin China EAAF of PLA Institute of General Development and Evaluation of Equipment Beijing China College of Life Science Jilin University Changchun China

This paper presents a method of medicine composition concentration analysis based on least square support vector machines (LS-SVMs) and examines the importance of the hyperparameter choice in improvement of algorithm performance. Simulation results show that the proposed method obtains high quality precision in the generalization, compared with multiple linear regression, and that it is an efficient approach to regression estimation.

关键词： Least squares methods Support vector machines Educational institutions Performance analysis Algorithm design and analysis knowledge engineering Linear regression Spectral analysis Quadratic programming Lagrangian functions

A Survey of Sum-Product Networks Structural Learning

学校读者我要写书评

暂无评论

SSRN

SSRN 2022年

作者： Xia, Riting Zhang, Yan Liu, Xueyan Yang, Bo School of Artificial Intelligence Jilin University Jilin Changchun130012 China School of Computer Science and Technology Jilin University Jilin Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineer Jilin University Ministry of Education Jilin Changchun130012 China College of Communication Engineering Jilin University Jilin Changchun130012 China

Sum-product networks (SPNs) in deep probabilistic models have made great progress in computer vision, robotics, neuro-symbolic artificial intelligence, natural language processing, probabilistic programming languages, and other fields. Compared with probabilistic graphical models and deep probabilistic models, SPNs can balance the tractability and expressive efficiency. In addition, SPNs remain more interpretable than deep neural models. The expressiveness and complexity of SPNs depend on its own structure. Thus, how to design an effective SPN structure learning algorithm that can balance expressiveness and complexity has become a hot research topic in recent years. In this paper, we review SPN structure learning comprehensively, including the motivation of SPN structure learning, a systematic review of related theories, the proper categorization of different SPN structure learning algorithms, several evaluation approaches and some helpful online resources. Moreover, we discuss some open issues and research directions for SPN structure learning. To our knowledge, this is the first survey to focus specifically on SPN structure learning, and we hope to provide useful references for researchers in related fields. © 2022, The Authors. All rights reserved.

关键词： Efficiency

U-HRMLP: Refining Segmentation Boundaries in Histopathology Images

学校读者我要写书评

暂无评论

U-HRMLP: Refining Segmentation Boundaries in Histopathology ...

IEEE International Symposium on Biomedical Imaging

作者： Tao Wang Kai Zhang Weijie Wang Mingrui Ma Ye Zhang He Zhao Guixia Liu College of Computer Science and Technology Jilin University China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University China School of Information Science and Engineering Shandong Normal University China Department of Information Engineering and Computer Science University of Trento Italy Faculty of Information Engineering and Automation Kunming University of Science and Technology China School of Information Science and Technology Northeast Normal University China

ISBN: (数字)9798350313338

ISBN: (纸本)9798350313345

Segmenting regions of interest in histopathology images is a critical prerequisite for biomedical applications. CNN-based models have advanced medical image segmentation, yet accurately delineating boundaries is still challenging. This challenge arises from the loss of spatial resolution due to downsampling and the complexity of capturing contextual information when upsampling to the original resolution. To address these issues, we design U-HRMLP, a U-shaped network based on a hybrid combination of HRNet and Multi-Layer Perceptron (MLP). Specifically, we propose a multi-scale feature fusion module to avoid the loss of image resolution in the encoding stage as much as possible. Simultaneously, we propose an MLP-based decoding block to recover image details and resolution progressively, alleviating the issues related to the inadequate segmentation of smaller objects and the blurring of tissue boundaries. Results on the MoNuSeg and GlaS datasets demonstrate that U-HRMLP outperforms conventional or transformer-based methods and achieves state-of- the-art performance.

关键词： Measurement Image segmentation Histopathology Biological system modeling Semantics Refining Transformers