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

SSRN 2022年

作者： Hou, Guangzhe Qin, Guihe Sun, Minghui Liang, Yanhua Yan, Jie Zhang, Zhonghan Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University 2699 Chaoyang District Changchun Jilin130012 China

Introduction: Point clouds obtained from capture devices or 3D reconstruction techniques are often noisy and interfere with downstream ***: The paper aims to recover the underlying surface of noisy point ***: We design a novel model, NoiseTrans, which uses transformer encoder architecture for point cloud denoising. Specifically, we obtain structural similarity of point-based point clouds with the assistance of the transformer's core self-attention mechanism. By expressing the noisy point cloud as a set of unordered vectors, we convert point clouds into point embeddings and employ Transformer to generate clean point clouds. To make the Transformer preserve details when sensing the point cloud, we design the Local Point Attention to prevent the point cloud from being over-smooth. In addition, we also propose sparse encoding, which enables the Transformer to better perceive the structural relationships of the point cloud and improve the denoising ***: Experiments show that our model outperforms state-of-the-art methods in various datasets and noise environments. © 2022, The Authors. All rights reserved.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

RFR-WWANet: Weighted Window Attention-Based Recovery Feature Resolution Network for Unsupervised Image Registration

arXiv

引用

arXiv 2023年

作者： Ma, Mingrui Wang, Tao Wang, Weijie Song, Lei Liu, Guixia College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Changchun China Department of Information Engineering and Computer Science University of Trento Trento Italy

The Swin transformer has recently attracted attention in medical image analysis due to its computational efficiency and long-range modeling capability. Owing to these properties, the Swin Transformer is suitable for establishing more distant relationships between corresponding voxels in different positions in complex abdominal image registration tasks. However, the registration models based on transformers combine multiple voxels into a single semantic token. This merging process limits the transformers to model and generate coarse-grained spatial information. To address this issue, we propose Recovery Feature Resolution Network (RFRNet), which allows the transformer to contribute fine-grained spatial information and rich semantic correspondences to higher resolution levels. Furthermore, shifted window partitioning operations are inflexible, indicating that they cannot perceive the semantic information over uncertain distances and automatically bridge the global connections between windows. Therefore, we present a Weighted Window Attention (WWA) to build global interactions between windows automatically. It is implemented after the regular and cyclic shift window partitioning operations within the Swin transformer block. The proposed unsupervised deformable image registration model, named RFR-WWANet, detects the long-range correlations, and facilitates meaningful semantic relevance of anatomical structures. Qualitative and quantitative results show that RFR-WWANet achieves significant improvements over the current state-of-the-art methods. Ablation experiments demonstrate the effectiveness of the RFRNet and WWA designs. Our code is available at https://***/MingR-Ma/RFR-WWANet. Copyright © 2023, The Authors. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Hybrid Parameter Update: Alleviating Imbalance Impacts for Distributed Deep Learning

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

引用

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

来源：评论

学校读者我要写书评

暂无评论

When Federated Recommendation Meets Cold-Start Problem: Separating Item Attributes and User Interactions 24

When Federated Recommendation Meets Cold-Start Problem: Sepa...

引用

33rd ACM Web Conference, WWW 2024

作者： Zhang, Chunxu Long, Guodong Zhou, Tianyi Zhang, Zijian Yan, Peng Yang, Bo College of Computer Science and Technology Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China Australian Artificial Intelligence Institute FEIT University of Technology Sydney Sydney Australia Computer Science and Umiacs University of Maryland MD United States College of Computer Science and Technology Jilin University City University of Hong Kong Hong Kong City University of Hong Kong Hong Kong

ISBN: (纸本)9798400701719

Federated recommendation system usually trains a global model on the server without direct access to users' private data on their own devices. However, this separation of the recommendation model and users' private data poses a challenge in providing quality service, particularly when it comes to new items, namely cold-start recommendations in federated settings. This paper introduces a novel method called Item-aligned Federated Aggregation (IFedRec) to address this challenge. It is the first research work in federated recommendation to specifically study the cold-start scenario. The proposed method learns two sets of item representations by leveraging item attributes and interaction records simultaneously. Additionally, an item representation alignment mechanism is designed to align two item representations and learn the meta attribute network at the server within a federated learning framework. Experiments on four benchmark datasets demonstrate IFedRec's superior performance for cold-start scenarios. Furthermore, we also verify IFedRec owns good robustness when the system faces limited client participation and noise injection, which brings promising practical application potential in privacy-protection enhanced federated recommendation systems. The implementation code is available © 2024 ACM.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

Injecting Revenue-awareness into Cold-start Recommendation: The Case of Online Insurance

Injecting Revenue-awareness into Cold-start Recommendation: ...

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Yu Li Yi Zhang Helen He Chang Qiang Li College of Computer Science and Technology Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University WeSure Inc. Ping An Technology Shenzhen Co. Ltd

In online insurance, one of the central challenges is the cold-starting of new insurance products, which means there are no previous samples to refer to. Previous studies have mainly focused on improving the prediction accuracy of new items, but they have failed to consider the revenue generated by existing items. As a result, the total revenue may suffer a loss even if new items get conversions. To address this issue, in this paper we propose RACRec, a Revenue-Aware Cold-start Recommendation framework for online insurance. Unlike previous works, RACRec uses a revenue-based objective function to ensure profitability when cold-starting new items. With this dedicated objective, RACRec orchestrates the cold-start and warm-start model by predicting their expected revenue from each user, thereby preserving the total profit. In order to accurately predict revenue, a double-ranking scheme is designed for the warm-start model to mitigate position bias, while an item embedding alignment algorithm is proposed for the cold-start model to learn the revenue of new items from similar old items. Furthermore, a reinforced orchestrate update scheme is designed to eliminate the impact of sparse conversions and continuously update revenue estimation. Extensive offline and online experiments have been conducted to validate the effectiveness of RACRec.

关键词：

来源：评论

学校读者我要写书评

暂无评论

WGAN-GP_Glu: A semi-supervised model based on double generator-Wasserstein GAN with gradient penalty algorithm for glutarylation site identification

引用

Computers in Biology and Medicine 2025年 184卷 109328-109328页

作者： Ning, Qiao Qi, Zedong Information Science and Technology Dalian Maritime University Liaoning Dalian China The School of Artificial Intelligence and Computer Science Jiangnan University Wuxi China Neusoft Education Technology Group Dalian China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China

As an important post-translational modification, glutarylation plays a crucial role in a variety of cellular functions. Recently, diverse computational methods for glutarylation site identification have been proposed. However, the class imbalance problem due to data noise and uncertainty of non-glutarylation sites remains a great challenge. In this article, we propose a novel semi-supervised learning algorithm, called WGAN-GP_Glu, for identifying reliable non-glutarylation lysine sites from those without glutarylation annotation. WGAN-GP_Glu method is a multi-module framework algorithm, which mainly includes a reliable negative sample selection module, a deep feature extraction module, and a glutarylation site prediction module. In reliable negative sample selection module, we design an improved method of Wasserstein GAN with Gradient Penalty (WGAN-GP), named ReliableWGAN-GP, including three parts, two generators G1, G2 and a discriminator D, which can select reliable non-glutarylation samples from a great number of unlabeled samples. Generator G1 is utilized to generate noise data from unlabeled samples. For generator G2, both the positive sample and the noise data are used as inputs to improve the discriminant capability of discriminator D. Then, convolutional neural network and bidirectional long short-term memory network combined with attention mechanism are utilized to extract deep features for glutarylation samples and reliable non-glutarylation samples. Finally, a glutarylation site prediction module based on the three-layer fully connected layer is designed to make class predictions for samples. The sensitivity, specificity, accuracy and Matthew correlation coefficient of WGAN-GP_Glu on the independent test data set reach 90.58 %, 95.82 %, 94.44 % and 0.8645, respectively, which surpassed the existing methods for glutarylation sites prediction. Therefore, WGAN-GP_Glu can serve as a powerful tool in identifying glutarylation sites and the ReliableWGAN-GP algo

关键词： Gallium nitride

来源：评论

学校读者我要写书评

暂无评论

3DSEAVNet: 3D-Squeeze-and-Excitation Networks for Audio-Visual Saliency Prediction

3DSEAVNet: 3D-Squeeze-and-Excitation Networks for Audio-Visu...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Silong Liang Chunxiao Li Naying Cui Minghui Sun Hao Xue College of Software Engineering JiLin University Changchun 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

Video saliency prediction is an important task in the field of computer vision. Most of the existing video saliency prediction methods only focus on image information, and the audio information is often ignored. This leads to an incomplete perception mode, which makes it difficult to achieve optimal performance. SENet is an excellent attention mechanism-based network. It significantly enhances the performance of 2D convolutional networks. However, whether the 3D convolutional network can be applied to this attention mechanism network remains to be studied. In order to solve the above problems, we propose a saliency prediction network for audio-visual fusion to extract and predict various information in videos. At the same time, we improve the traditional SENet to make it applicable in 3D convolutional neural networks and discuss its role. Compared with the state-of-the-art methods, our model has strong competitiveness in multiple data sets.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Multi-site MRI classification using Weighted federated learning based on Mixture of Experts domain adaptation

Multi-site MRI classification using Weighted federated learn...

引用

2022 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2022

作者： Bai, Tian Zhang, Yingfang Wang, Yuzhao Qin, Yanguo Zhang, Fa Jilin University College of Computer Science and Technology Changchun China Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Changchun China The Second Hospital of Jilin University The Department of Orthopaedics Changchun China Beijing Institute of Technology School of Medical Technology Beijing China

ISBN: (纸本)9781665468190

Deep learning often requires large amounts of data from different institutions. Federated learning, as a distributed training framework, enables multiple participants to collaboratively train models without collecting data together and hence protecting data privacy, but the datasets from different institutions usually bring the problem of domain shift, which affects the performance of the model. When addressing domain shift, previous works often use a single global model to share parameters. Therefore, we propose a novel method to train multiple public models with different structures under the federated framework to improve the reliability and robustness of the public models. And each participant keeps its own domain-tuned private model, the private model does not share parameters with other participants. We use Mixture of Experts (MoE) domain adaptation to dynamically combine different public models and private model, which utilizes the similarity between different datasets to update the parameters of the public models. We apply the proposed method to the multi-site Magnetic resonance imaging (MRI) end-to-end classification, and the experiments demonstrate its effectiveness. © 2022 IEEE.

关键词： Magnetic resonance imaging

来源：评论

学校读者我要写书评

暂无评论

DISLOCATIONS WITH CORNERS IN AN ELASTIC BODY WITH APPLICATIONS TO FAULT DETECTION

arXiv

引用

arXiv 2023年

作者： Diao, Huaian Liu, Hongyu Meng, Qingle School of Mathematics Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Jilin Changchun China Department of Mathematics City University of Hong Kong Kowloon Tong Hong Kong

This paper focuses on an elastic dislocation problem that is motivated by applications in the geophysical and seismological communities. In our model, the displacement satisfies the Lamé system in a bounded domain with a mixed homogeneous boundary condition. We also allow the occurrence of discontinuities in both the displacement and traction fields on the fault curve/surface. By the variational approach, we first prove the well-posedness of the direct dislocation problem in a rather general setting with the Lamé parameters being real-valued L∞ functions and satisfy the strong convexity condition. Next, by considering that the Lamé parameters are constant and the fault curve/surface possesses certain corner singularities, we establish a local characterization of the jump vectors at the corner points over the dislocation curve/surface. In our study, the dislocation is geometrically rather general and may be open or closed. We establish the unique results for the inverse problem of determining the dislocation curve/surface and the jump vectors for both cases. © 2023, CC BY.

关键词： Inverse problems

来源：评论

学校读者我要写书评

暂无评论

ExplSched: Maximizing Deep Learning Cluster Efficiency for Exploratory Jobs

ExplSched: Maximizing Deep Learning Cluster Efficiency for E...

引用

IEEE International Conference on Cluster Computing

作者： Hongliang Li Hairui Zhao Zhewen Xu Xiang Li Haixiao Xu 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 High Performance Computing Center Jilin University China

Resource management for Deep Learning (DL) clusters is essential for system efficiency and model training quality. Existing schedulers provided by DL frameworks are mostly adaptations from traditional HPC clusters and usually work on jobs’ makespan, assuming that DL training jobs finish completely. Unfortunately, it is reported that a fair amount of training jobs are exploratory jobs and often finish unsuccessfully (over 30%) in production clusters. This is due to the distinct characteristic of Deep Neural Network (DNN) training that it is an exploratory process of frequent user interventions, such as adjusting model structures, tuning hyperparameters, and exploring feature validity. Existing DL cluster schedulers using offline algorithms are not suitable for exploratory jobs when unexpected early terminations can cause noticeable resource waste. Moreover, DL training jobs are iterative and usually yield diminishing returns as they progress. Equally allocating resource among training iterations is not efficient, especially when dealing with exploratory jobs where it can worsen the degradation of system efficiency. The fundamental goal of a DL training job is to gain model quality improvement, usually indicated by the loss reduction (job profit) of a DNN model. This paper introduces a novel scheduling problem for exploratory jobs that seeks to maximize the overall training profit of a DL cluster. We propose ExplSched, an online scheduling solution based on the primal-dual framework, resulting in a competitive ratio of 2α that belongs to O(ln n). It uses a resource price function that emphasizes the importance of job profit to resource consumption ratio to make quick resource allocation decisions. Experimental results show that ExplSched achieved an average system utility improvement of 87.28% compared with other related work.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：