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

arXiv 2023年

作者： Ouyang, Jihong Yang, Zhiyao Liang, Silong Wang, Bing Wang, Yimeng Li, Ximing College of Computer Science and Technology Jilin University China Key Laboratory of Symbolic Computation and Knowledge Engineering of MOE Jilin University China

Aspect-based sentiment analysis (ABSA), a fine-grained sentiment classification task, has received much attention recently. Many works investigate sentiment information through opinion words, such as "good" and "bad". However, implicit sentiment data widely exists in the ABSA dataset, whose sentiment polarity is hard to determine due to the lack of distinct opinion words. To deal with implicit sentiment, this paper proposes an ABSA method that integrates explicit sentiment augmentations (ABSA-ESA) to add more sentiment clues. We propose an ABSA-specific explicit sentiment generation method to create such augmentations. Specifically, we post-train T5 by rule-based data and employ three strategies to constrain the sentiment polarity and aspect term of the generated augmentations. We employ Syntax Distance Weighting and Unlikelihood Contrastive Regularization in the training procedure to guide the model to generate the explicit opinion words with the same polarity as the input sentence. Meanwhile, we utilize the Constrained Beam Search to ensure the augmentations are aspect-related. We test ABSA-ESA on two ABSA benchmarks. The results show that ABSA-ESA outperforms the SOTA baselines on implicit and explicit sentiment accuracy. Copyright © 2023, The Authors. All rights reserved.

关键词： Sentiment analysis

来源：评论

学校读者我要写书评

暂无评论

Structure-Based Uncertainty Estimation for Source-Free Active Domain Adaptation

引用

IET Computer Vision 2025年第1期19卷

作者： Ouyang, Jihong Zhang, Zhengjie Meng, Qingyi Chi, Jinjin 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

Active domain adaptation (active DA) provides an effective solution by selectively labelling a limited number of target samples to significantly enhance adaptation performance. However, existing active DA methods often struggle in real-world scenarios where, due to data privacy concerns, only a pre-trained source model is available, rather than the source samples. To address this issue, we propose a novel method called the structure-based uncertainty estimation model (SUEM) for source-free active domain adaptation (SFADA). To be specific, we introduce an innovative active sample selection strategy that combines both uncertainty and diversity sampling to identify the most informative samples. We assess the uncertainty in target samples using structure-wise probabilities and implement a diversity selection method to minimise redundancy. For the selected samples, we not only apply standard-supervised loss but also conduct interpolation consistency training to further explore the structural information of the target domain. Extensive experiments across four widely used datasets demonstrate that our method is comparable to or outperforms current UDA and active DA methods. © 2025 The Author(s). IET Computer Vision published by John Wiley & Sons Ltd on behalf of The Institution of engineering and Technology.

关键词： computer vision convolutional neural nets image classification

来源：评论

学校读者我要写书评

暂无评论

Improving Local Search for Pseudo Boolean Optimization by Fragile Scoring Function and Deep Optimization 29

Improving Local Search for Pseudo Boolean Optimization by Fr...

引用

29th International Conference on Principles and Practice of Constraint Programming, CP 2023

作者： Zhou, Wenbo Zhao, Yujiao Wang, Yiyuan Cai, Shaowei Wang, Shimao Wang, Xinyu Yin, Minghao School of Information Science and Technology Northeast Normal University Changchun China Key Laboratory of Applied Statistics of MOE Northeast Normal University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering of MOE Jilin University Changchun China State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China

ISBN: (纸本)9783959773003

Pseudo-Boolean optimization (PBO) is usually used to model combinatorial optimization problems, especially for some real-world applications. Despite its significant importance in both theory and applications, there are few works on using local search to solve PBO. This paper develops a novel local search framework for PBO, which has three main ideas. First, we design a two-level selection strategy to evaluate all candidate variables. Second, we propose a novel deep optimization strategy to disturb some search spaces. Third, a sampling flipping method is applied to help the algorithm jump out of local optimum. Experimental results show that the proposed algorithms outperform three state-of-the-art PBO algorithms on most instances. © Wenbo Zhou, Yujiao Zhao, Yiyuan Wang, Shaowei Cai, Shimao Wang, Xinyu Wang, and Minghao Yin.

关键词： Combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

Stochastic Adversarial Networks for Multi-Domain Text Classification

arXiv

引用

arXiv 2024年

作者： Wang, Xu Wu, Yuan School of Artificial Intelligence Jilin University China Key Laboratory of Symbolic Computation and Knowledge Engineering Jilin University China

Adversarial training has been instrumental in advancing multi-domain text classification (MDTC). Traditionally, MDTC methods employ a shared-private paradigm, with a shared feature extractor for domain-invariant knowledge and individual private feature extractors for domain-specific knowledge. Despite achieving state-of-the-art results, these methods grapple with the escalating model parameters due to the continuous addition of new domains. To address this challenge, we introduce the Stochastic Adversarial Network (SAN), which innovatively models the parameters of the domain-specific feature extractor as a multivariate Gaussian distribution, as opposed to a traditional weight vector. This design allows for the generation of numerous domain-specific feature extractors without a substantial increase in model parameters, maintaining the model’s size on par with that of a single domain-specific extractor. Furthermore, our approach integrates domain label smoothing and robust pseudo-label regularization to fortify the stability of adversarial training and to refine feature discriminability, respectively. The performance of our SAN, evaluated on two leading MDTC benchmarks, demonstrates its competitive edge against the current state-of-the-art methodologies. The code is available at https://***/wangxu0820/SAN. Copyright © 2024, The Authors. All rights reserved.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

Hybrid Parameter Update: Alleviating Imbalance Impacts for Distributed Deep Learning 24

Hybrid Parameter Update: Alleviating Imbalance Impacts for D...

引用

24th IEEE International Conference on High Performance Computing and Communications, 8th IEEE International Conference on Data Science and Systems, 20th IEEE International Conference on Smart City and 8th IEEE International Conference on Dependability in Sensor, Cloud and Big Data Systems and Application, HPCC/DSS/SmartCity/DependSys 2022

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

ISBN: (纸本)9798350319934

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. © 2022 IEEE.

关键词： Large dataset

来源：评论

学校读者我要写书评

暂无评论

In-context decision transformer: reinforcement learning via hierarchical chain-of-thought 24

In-context decision transformer: reinforcement learning via ...

引用

Proceedings of the 41st International Conference on Machine Learning

作者： Sili Huang Jifeng Hu Hechang Chen Lichao Sun Bo Yang School of Artificial Intelligence and Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University China School of Artificial Intelligence Jilin University China Lehigh University Bethlehem Pennsylvania Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University China

In-context learning is a promising approach for offline reinforcement learning (RL) to handle online tasks, which can be achieved by providing task prompts. Recent works demonstrated that in-context RL could emerge with self-improvement in a trial-and-error manner when treating RL tasks as an across-episodic sequential prediction problem. Despite the self-improvement not requiring gradient updates, current works still suffer from high computational costs when the across-episodic sequence increases with task horizons. To this end, we propose an In-context Decision Transformer (IDT) to achieve self-improvement in a high-level trial-and-error manner. Specifically, IDT is inspired by the efficient hierarchical structure of human decision-making and thus reconstructs the sequence to consist of high-level decisions instead of low-level actions that interact with environments. As one high-level decision can guide multi-step low-level actions, IDT naturally avoids excessively long sequences and solves online tasks more efficiently. Experimental results show that IDT achieves state-of-the-art in long-horizon tasks over current in-context RL methods. In particular, the online evaluation time of our IDT is 36× times faster than baselines in the D4RL benchmark and 27× times faster in the Grid World benchmark.

关键词：

来源：评论

学校读者我要写书评

暂无评论

SMRI: A New Method for siRNA Design for COVID-19 Therapy

引用

Journal of Computer Science & Technology 2022年第4期37卷 991-1002页

作者： Meng-Xin Chen Xiao-Dong Zhu Hao Zhang Zhen Liu Yuan-Ning Liu College of Software Jilin UniversityChangchun 130012China Key Laboratory of Symbolic Computation and Knowledge Engineering of the Ministry of Education Jilin UniversityChangchun 130012China College of Computer Science and Technology Jilin UniversityChangchun 130012China Graduate School of Engineering Nagasaki Institute of Applied ScienceNagasaki 851-0193Japan

First discovered in Wuhan, China, SARS-CoV-2 is a highly pathogenic novel coronavirus, which rapidly spreads globally and becomes a pandemic with no vaccine and limited distinctive clinical drugs available till March 13th, 2020. Ribonucleic Acid interference (RNAi) technology, a gene-silencing technology that targets mRNA, can cause damage to RNA viruses effectively. Here, we report a new efficient small interfering RNA (siRNA) design method named Simple Multiple Rules Intelligent Method (SMRI) to propose a new solution of the treatment of COVID-19. To be specific, this study proposes a new model named Base Preference and Thermodynamic Characteristic model (BPTC model) indicating the siRNA silencing efficiency and a new index named siRNA Extended Rules index (SER index) based on the BPTC model to screen high-efficiency siRNAs and filter out the siRNAs that are difficult to take effect or synthesize as a part of the SMRI method, which is more robust and efficient than the traditional statistical indicators under the same circumstances. Besides, to silence the spike protein of SARS-CoV-2 to invade cells, this study further puts forward the SMRI method to search candidate high-efficiency siRNAs on SARS-CoV-2's S gene. This study is one of the early studies applying RNAi therapy to the COVID-19 treatment. According to the analysis, the average value of predicted interference efficiency of the candidate siRNAs designed by the SMRI method is comparable to that of the mainstream siRNA design algorithms. Moreover, the SMRI method ensures that the designed siRNAs have more than three base mismatches with human genes, thus avoiding silencing normal human genes. This is not considered by other mainstream methods, thereby the five candidate high-efficiency siRNAs which are easy to take effect or synthesize and much safer for human body are obtained by our SMRI method, which provide a new safer, small dosage and long efficacy solution for the treatment of COVID-19.

关键词： COVID-19 SARS-CoV-2 RibonucleicAcid interference

来源：评论

学校读者我要写书评

暂无评论

Semi-supervised Multi-label Learning with Balanced Binary Angular Margin Loss 38

Semi-supervised Multi-label Learning with Balanced Binary An...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Li, Ximing Liang, Silong Li, Changchun Wang, Pengfei Gu, Fangming College of Computer Science and Technology Jilin University China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University China Computer Network Information Center Chinese Academy of Sciences China University of Chinese Academy of Sciences Chinese Academy of Sciences China

Semi-supervised multi-label learning (SSMLL) refers to inducing classifiers using a small number of samples with multiple labels and many unlabeled samples. The prevalent solution of SSMLL involves forming pseudo-labels for unlabeled samples and inducing classifiers using both labeled and pseudo-labeled samples in a self-training manner. Unfortunately, with the commonly used binary type of loss and negative sampling, we have empirically found that learning with labeled and pseudo-labeled samples can result in the variance bias problem between the feature distributions of positive and negative samples for each label. To alleviate this problem, we aim to balance the variance bias between positive and negative samples from the perspective of the feature angle distribution for each label. Specifically, we extend the traditional binary angular margin loss to a balanced extension with feature angle distribution transformations under the Gaussian assumption, where the distributions are iteratively updated during classifier training. We also suggest an efficient prototype-based negative sampling method to maintain high-quality negative samples for each label. With this insight, we propose a novel SSMLL method, namely Semi-Supervised Multi-Label Learning with Balanced Binary Angular Margin loss (S2ML2-BBAM). To evaluate the effectiveness of S2ML2-BBAM, we compare it with existing competitors on benchmark datasets. The experimental results validate that S2ML2-BBAM can achieve very competitive performance. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Decision mamba: reinforcement learning via hybrid selective sequence modeling 24

Decision mamba: reinforcement learning via hybrid selective ...

引用

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

作者： Sili Huang Jifeng Hu Zhejian Yang Liwei Yang Tao Luo Hechang Chen Lichao Sun Bo Yang Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education and School of Artificial Intelligence Jilin University China School of Artificial Intelligence Jilin University China Institute of High Performance Computing Agency for Science Technology and Research Singapore Lehigh University Bethlehem Pennsylvania Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education

ISBN: (纸本)9798331314385

Recent works have shown the remarkable superiority of transformer models in reinforcement learning (RL), where the decision-making problem is formulated as sequential generation. Transformer-based agents could emerge with self-improvement in online environments by providing task contexts, such as multiple trajectories, called in-context RL. However, due to the quadratic computation complexity of attention in transformers, current in-context RL methods suffer from huge computational costs as the task horizon increases. In contrast, the Mamba model is renowned for its efficient ability to process long-term dependencies, which provides an opportunity for in-context RL to solve tasks that require long-term memory. To this end, we first implement Decision Mamba (DM) by replacing the backbone of Decision Transformer (DT). Then, we propose a Decision Mamba-Hybrid (DM-H) with the merits of transformers and Mamba in high-quality prediction and long-term memory. Specifically, DM-H first generates high-value sub-goals from long-term memory through the Mamba model. Then, we use sub-goals to prompt the transformer, establishing high-quality predictions. Experimental results demonstrate that DM-H achieves state-of-the-art in long and short-term tasks, such as D4RL, Grid World, and Tmaze benchmarks. Regarding efficiency, the online testing of DM-H in the long-term task is 28× times faster than the transformer-based baselines.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Measuring drug similarity using drug–drug interactions

引用

Quantitative Biology 2024年第2期12卷 164-172页

作者： Ji Lv Guixia Liu Yuan Ju Houhou Huang Ying Sun College of Computer Science and Technology Jilin UniversityChangchunChina Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin UniversityChangchunChina Sichuan University Library Sichuan UniversityChengduChina College of Chemistry Jilin UniversityChangchunChina Department of Respiratory Medicine The First Hospital of Jilin UniversityChangchunChina

Combination therapy is a promising approach to address the challenge of antimicrobial resistance,and computational models have been proposed for predicting drug–drug *** existing models rely on drug similarity measures based on characteristics such as chemical structure and the mechanism of *** this study,we focus on the network structure itself and propose a drug similarity measure based on drug–drug interaction *** explore the potential applications of this measure by combining it with unsupervised learning and semi-supervised learning *** unsupervised learning,drugs can be grouped based on their interactions,leading to almost monochromatic group–group *** addition,drugs within the same group tend to have similar mechanisms of action(MoA).In semi-supervised learning,the similarity measure can be utilized to construct affinity matrices,enabling the prediction of unknown drug–drug *** method exceeds existing approaches in terms of ***,our experiments demonstrate the effectiveness and practicability of the proposed similarity *** the one hand,when combined with clustering algorithms,it can be used for functional annotation of compounds with unknown *** the other hand,when combined with semi-supervised graph learning,it enables the prediction of unknown drug–drug interactions.

关键词： drug similarity drug–drug interactions drug combinations synergy effect clustering semi-supervised learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：