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

IEEE International Conference on High Performance Computing and Communications (HPCC)

作者： Hongliang Li Dong Xu Zhewen Xu Xiang Li College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering of the Ministry of Education Changchun China

Nowadays, data parallelism has been widely applied to train large datasets on distributed deep learning clusters, but it has suffered from costly global parameter updates at batch barriers. Performance imbalance among worker instances, introduced by uneven workload partitioning or biased resource allocation, can cause straggly workers, which can lead to severe impacts on both training speed and result accuracy. This paper studies the issue focusing on the tradeoff between training speed and result accuracy. We propose Cooperate Grouping Parallel (CGP), a hybrid parameter update solution that allows the flexibility of both synchronous and asynchronous update schemes. We introduce a novel Cooperate Worker Grouping Problem (CWGP) that seeks a task grouping configuration that leads to maximum model accuracy and holds customized training speed guarantees. We propose an evolution-based Pareto local searching algorithm to compute efficient worker grouping configurations. Comprehensive evaluation results are presented to demonstrate the effectiveness of CGP under both persistent and fluctuant imbalances. The proposed method alleviates the imbalance impacts without introducing extra adjustment over-heads.

关键词： Training Deep learning computational modeling Focusing Distributed databases Parallel processing Resource management

来源：评论

学校读者我要写书评

暂无评论

Closed Loop Networks for Open-Set Semi-Supervised Learning

SSRN

引用

SSRN 2023年

作者： Ouyang, Jihong Meng, Qingyi Li, Ximing Zhang, Zhengjie Li, Changchun Wang, Wenting College of Computer Science and Technology Jilin University China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University China Department of Computer Science University of Texas Dallas United States

Open-Set Semi-Supervised Learning (OS-SSL) refers to the task of learning classifiers with labeled and unlabeled instances, but the unlabeled data may contain the instances associated with unseen labels, dubbed as Out-Of-Distribution (OOD) instances. The main idea of OS-SSL is to detect and filter out the OOD instances to avoid the negative effects for classifier training. The current methods treat the detection of OOD instances and the classification of seen labels as two specific tasks, and achieve OS-SSL by using a shared backbone with two task-specific heads. However, we found that such way may result in a conflict problem between the two specific heads by observing the gradients of the shared backbone parameters. To solve this problem, we develop a novel OS-SSL method, namely Closed LOop NEtworks (CLONE), which employs two respective networks to detect OOD instances and classify seen labels, but makes a feedback loop between them. We can train CLONE in an end-to-end manner efficiently. We empirically compare CLONE with the existing OS-SSL methods on several benchmark datasets. The experimental results indicate that CLONE can outperform existing baseline methods in most settings. © 2023, The Authors. All rights reserved.

关键词： Cloning

来源：评论

学校读者我要写书评

暂无评论

Todo: Task Offloading Decision Optimizer for the Efficient Provision of Offloading Schemes

SSRN

引用

SSRN 2023年

作者： Chen, Shilin Wang, Xingwang Sun, Yafeng College of Computer Science and Technology Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China College of Computer Science and Technology Jilin University Changchun130012 China

As the volume of data stored on local devices increases, users turn to edge devices to help with processing tasks. Developing offloading schemes is challenging due to the varying configurations of edge devices and user preferences. While traditional methods provide schemes for offloading in various scenarios, they face unavoidable challenges, including the requirement to manage device workloads in real-time, significant computational costs, and the difficulty of balancing multi-objectives in offloading schemes. To solve these problems, we propose the Task Offloading Decision Optimizer, which offers efficient multi-objective offloading schemes considering real-time device workload and user preference. The proposed offloading scheme contains three goals: reducing task execution time, decreasing device energy consumption, and lowering rental costs. It comprises two important parts: Scheme Maker and Scheme Assistor. Scheme Maker utilizes deep reinforcement learning, optimizes the internal architecture, and enhances the performance of the operation. It optimizes buffer storage to generate dependable multi-objective offloading schemes considering real-time environmental conditions. Scheme Assistor utilizes the data in the Scheme Maker buffer to enhance efficiency by reducing computational costs. Extensive experiments have proved that the proposed framework efficiently provides offloading schemes considering the real-time conditions of the devices and the users, and it offers offloading schemes that enhance task completion rate by 50%. Compared to the baseline, the task execution time is reduced by 12.1%, and the device energy consumption is reduced by 11.4%. © 2023, The Authors. All rights reserved.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Multi-Task Self-Supervised Learning for Medical Image Segmentation

Multi-Task Self-Supervised Learning for Medical Image Segmen...

引用

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

作者： Bo Wang Hang Zhao Xiongfei Li Mingjie Tian Bo Huang Feiyang Yang Intelligent Information Processing Laboratory Yanbian University Yanji China College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China School of Artificial Intelligence Jilin University Changchun China

Although medical image segmentation has achieved remarkable results with supervised learning, obtaining labeled data remains challenging and costly. To counteract this, we present the MTSPSeg, a multi-task self-supervised learning framework. We establish the dynamic gradient learning rate (DGLR) strategy and the dynamic multi-task loss weight adjustment method (DWL) to relieve potential early convergence and diverse learning difficulties of self-supervised learning. Our method deeply integrates the prior knowledge inherent in medical images, facilitates collaborative learning among tasks, and delves further into the latent information within the images. Experimental results demonstrate that regardless of the proportion of labeled data, our method outperforms baseline models on the KiTS19 and LiTS datasets, achieving state-of-the-art performance on the KiTS19 dataset.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Task-Oriented Multi-Modal Mutual Learning for Vision-Language Models

Task-Oriented Multi-Modal Mutual Learning for Vision-Languag...

引用

International Conference on Computer Vision (ICCV)

作者： Sifan Long Zhen Zhao Junkun Yuan Zichang Tan Jiangjiang Liu Luping Zhou Shengsheng Wang Jingdong Wang College of Computer Science and Technology Jilin University Jilin China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Jilin China Baidu VIS University of Sydney Zhejiang University

Prompt learning has become one of the most efficient paradigms for adapting large pre-trained vision-language models to downstream tasks. Current state-of-the-art methods, like CoOp and ProDA, tend to adopt soft prompts to learn an appropriate prompt for each specific task. Recent CoCoOp further boosts the base-to-new generalization performance via an image-conditional prompt. However, it directly fuses identical image semantics to prompts of different labels and significantly weakens the discrimination among different classes as shown in our experiments. Motivated by this observation, we first propose a class-aware text prompt (CTP) to enrich generated prompts with label-related image information. Unlike CoCoOp, CTP can effectively involve image semantics and avoid introducing extra ambiguities into different prompts. On the other hand, instead of reserving the complete image representations, we propose text-guided feature tuning (TFT) to make the image branch attend to class-related representation. A contrastive loss is employed to align such augmented text and image representations on downstream tasks. In this way, the image-to-text CTP and text-to-image TFT can be mutually promoted to enhance the adaptation of VLMs for downstream tasks. Extensive experiments demonstrate that our method outperforms the existing methods by a significant margin. Especially, compared to CoCoOp, we achieve an average improvement of 4.03% on new classes and 3.19% on harmonic-mean over eleven classification benchmarks.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Instance-adaptive zero-shot chain-of-thought prompting 24

Instance-adaptive zero-shot chain-of-thought prompting

引用

Proceedings of the 38th International Conference on Neural Information Processing Systems

作者： Xiaosong Yuan Chen Shen Shaotian Yan Xiaofeng Zhang Liang Xie Wenxiao Wang Renchu Guan Ying Wang Jieping Ye College of Computer Science and Technology Jilin University and Key Laboratory of Symbolic Computation and Knowledge Engineering MoE Jilin University Alibaba Cloud Computing Shanghai Jiao Tong University College of Computer Science and Technology Zhejiang University of Technology College of Software Zhejiang University

ISBN: (纸本)9798331314385

Zero-shot Chain-of-Thought (CoT) prompting emerges as a simple and effective strategy for enhancing the performance of large language models (LLMs) in real-world reasoning tasks. Nonetheless, the efficacy of a singular, task-level prompt uniformly applied across the whole of instances is inherently limited since one prompt cannot be a good partner for all, a more appropriate approach should consider the interaction between the prompt and each instance meticulously. This work introduces an instance-adaptive prompting algorithm as an alternative zero-shot CoT reasoning scheme by adaptively differentiating good and bad prompts. Concretely, we first employ analysis on LLMs through the lens of information flow to detect the mechanism under zero-shot CoT reasoning, in which we discover that information flows from question to prompt and question to rationale jointly influence the reasoning results most. We notice that a better zero-shot CoT reasoning needs the prompt to obtain semantic information from the question, and then the rationale aggregates sufficient information from the question directly and via the prompt indirectly. On the contrary, lacking any of those would probably lead to a bad one. Stem from that, we further propose an instance-adaptive prompting strategy (IAP) for zero-shot CoT reasoning. Experiments conducted with LLaMA-2, LLaMA-3, and Qwen on math, logic, and commonsense reasoning tasks (e.g., GSM8k, MMLU, Causal Judgement) obtain consistent improvement, demonstrating that the instance-adaptive zero-shot CoT prompting performs better than other task-level methods with some curated prompts or sophisticated procedures, showing the significance of our findings in the zero-shot CoT reasoning mechanism.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Scalable Precise computation of Shannon Entropy

arXiv

引用

arXiv 2025年

作者： Lai, Yong Tong, Haolong Xu, Zhenghang Yin, Minghao College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun130012 China School of Computer Science and Information Technology Northeast Normal University Changchun130017 China

Quantitative information flow analyses (QIF) are a class of techniques for measuring the amount of confidential information leaked by a program to its public outputs. Shannon entropy is an important method to quantify the amount of leakage in QIF. This paper focuses on the programs modeled in Boolean constraints and optimizes the two stages of the Shannon entropy computation to implement a scalable precise tool PSE. In the first stage, we design a knowledge compilation language called ADD[∧] that combines Algebraic Decision Diagrams and conjunctive decomposition. ADD[∧] avoids enumerating possible outputs of a program and supports tractable entropy computation. In the second stage, we optimize the model counting queries that are used to compute the probabilities of outputs. We compare PSE with the state-of-the-art probably approximately correct tool EntropyEstimation, which was shown to significantly outperform the existing precise tools. The experimental results demonstrate that PSE solved 55 more benchmarks compared to EntropyEstimation in a total of 441. For 98% of the benchmarks that both PSE and EntropyEstimation solved, PSE is at least 10× as efficient as EntropyEstimation. Copyright © 2025, The Authors. All rights reserved.

关键词： Information leakage

来源：评论

学校读者我要写书评

暂无评论

Sfmfold: A Multi-Modal Contrast Learning Model for Rna Secondary Structure Prediction

SSRN

引用

SSRN 2025年

作者： Li, Ang Liu, Yuanning Zhang, Zhaoyang Li, Shuwang Dong, Hao Lv, Meng 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 College of Software Jilin University Changchun130012 China College of Information Engineering Chang’an University Xi’an710064 China

The secondary structure of RNA can regulate the interaction between RNA and protein and perform various biological tasks through specific folding shapes, which plays an important role in revealing biomolecular mechanisms and developing new vaccines and therapeutic drugs. However, existing RNA secondary structure prediction methods based on thermodynamics and traditional neural network models usually lack the ability to model long-distance dependencies of RNA molecules and cannot handle complex non-nested structures in RNA molecules. In this paper, we propose a multi-modal contrastive learning method SFMFold based on state space model, which captures long-distance interactions in RNA sequences through RNA sequence representation learning part, and models the structure of RNA molecules through RNA structure representation learning part. Finally, the features of the two modalities are aligned and deeply fused to obtain the final RNA molecule prediction map. We test SFMFold on several datasets, and the experiments show that our proposed model shows excellent performance in cross-family prediction and long sequence prediction tasks. In addition, SFMFold can also effectively predict non-nested structures such as pseudoknot with better accuracy than the SOTA methods. © 2025, The Authors. All rights reserved.

关键词： Prediction models

来源：评论

学校读者我要写书评

暂无评论

Aspect Based Fine-Grained Sentiment Analysis for Public Policy Opinion Mining 21st

Aspect Based Fine-Grained Sentiment Analysis for Public Poli...

引用

21st International Symposium on knowledge and Systems Sciences, KSS 2022

作者： Zhao, Yueming Li, Ying Liu, Yijun Li, Qianqian College of Computer Science and Technology Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China Institutes of Science and Development Chinese Academy of Sciences Beijing100190 China School of Public Policy and Management University of Chinese Academy of Sciences Beijing100049 China

ISBN: (纸本)9789811936098

Fine-grained mining has substantial practical significance for understanding public opinion toward public policies and optimizing relevant decision-making processes. In this study, an aspect-based sentiment analysis model integrated with both a sentiment lexicon for the policy domain and mutual information (MI) is established from the perspective of attitudinal orientations toward several elements of public policies, including subjects, objects, and tools to analyze comments. First, terms related to the aspects of comments on different policy elements are extracted using the association rules in conjunction with the word2vec algorithm. In addition, the contextual neighbor principle is employed to extract terms that express evaluative opinions and to extricate aspect-based two-tuples from comments. Subsequently, the sentiment lexicon for the policy domain is expanded using the sentiment orientation pointwise mutual information (SO-PMI) algorithm. Four machine learning models (i.e., the support vector machine, logistic regression, naive Bayes, and k-nearest neighbors models) and two deep learning models (i.e., the convolutional neural network (CNN) and long short-term memory models) are compared in terms of their classification performance based on 87,304 comments on public policies crawled from the Weibo platform. The results show that the CNN model integrated with the domain-specific sentiment lexicon and mutual information is effective at facilitating policy element-oriented fine-grained sentiment analysis of public opinion toward policies and therefore has practical decision-making value for the government to better understand the policy demands of the public. © 2022, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Public policy

来源：评论

学校读者我要写书评

暂无评论

IoT Device Identification via A Bio-Inspired Feature Selection Approach

IoT Device Identification via A Bio-Inspired Feature Selecti...

引用

IEEE International Conference on Communications (ICC)

作者： Boxiong Wang Hui Kang Geng Sun Jiahui Li College of Software Jilin University Changchun China College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun China

The rapid development of the Internet-of-Things (IoT) also brings security and other problems. Device identification is a crucial tool for IoT security issues, which can detect and prevent cyber-attacks. Feature selection is an effective data preprocessing technique in IoT device identification, which can improve the performance of classification and reduce computational complexity. In this paper, we propose a novel wrapper feature selection approach based on the improved binary honey badger algorithm (IBHBA) to select features in IoT traffic. Four improved factors are employed in IBHBA to expand the search scope, balance the exploration and exploitation phases, and enhance the search capability. Moreover, a binary mechanism is adopted to make the algorithm more suitable for feature selection in IoT device identification. The experimental results on several real IoT traffic datasets denote that IBHBA outperforms some classical and latest comparison algorithms in the feature selection of IoT device identification.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：