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

41.t International Conference on Machine Learning, ICML 2024

作者： Li, Changchun Dai, Yuanchao Feng, Lei Li, Ximing Wang, Bing Ouyang, Jihong College of Computer Science and Technology Jilin University China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University China Information Systems Technology and Design Pillar Singapore University of Technology and Design Singapore

Positive and Unlabeled (PU) learning refers to a special case of binary classification, and technically, it aims to induce a binary classifier from a few labeled positive training instances and loads of unlabeled instances. In this paper, we derive a theorem indicating that the probability boundary of the asymmetric disambiguation-free expected risk of PU learning is controlled by its asymmetric penalty, and we further empirically evaluated this theorem. Inspired by the theorem and its empirical evaluations, we propose an easy-to-implement two-stage PU learning method, namely Positive and Unlabeled Learning with Controlled Probability Boundary Fence (PUL-CPBF). In the first stage, we train a set of weak binary classifiers concerning different probability boundaries by minimizing the asymmetric disambiguation-free empirical risks with specific asymmetric penalty values. We can interpret these induced weak binary classifiers as a probability boundary fence. For each unlabeled instance, we can use the predictions to locate its class posterior probability and generate a stochastic label. In the second stage, we train a strong binary classifier over labeled positive training instances and all unlabeled instances with stochastic labels in a self-training manner. Extensive empirical results demonstrate that PUL-CPBF can achieve competitive performance compared with the existing PU learning baselines. Copyright 2024 by the author(s)

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Learning Stable Task-Level Manifold for Few-Shot Learning

Learning Stable Task-Level Manifold for Few-Shot Learning

引用

2023 International Conference on Digital Image Computing: Techniques and Applications, DICTA 2023

作者： Yu, Siyi Luo, Wei Li, Gang Yang, Bo Jilin University College of Computer Science and Technology China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education China Deakin University School of Information Technology Geelong Australia

ISBN: (纸本)9798350382204

Few-shot learning (FSL) aims to learn to new concepts based on very limited data. One of the main challenges in FSL is the use of pretrained embeddings whose dimension is too high for the small sample size. While the large dimensionality helps capture diverse features in the training example, not all the features are relevant to the task at hand. Such task-irrelevant features from pre-trained embeddings can negatively impact the performance of the FSL model. To address this challenge, we propose a simple yet effective way to learn task-level manifolds that explicitly eliminate the negative effect of nuisance features. One key novelty of our approach is to address class imbalance in the training data by injecting supervised information through key virtual samples, which we named Manifold Support Points. Empirically, we demonstrate that the stability of the learnt task-level manifolds and their effectiveness in challenging tasks in FSL. Our approach shows competitive performance on several benchmark datasets, including tieredImageNet and CUB. © 2023 IEEE.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

Spatiotemporal Transformer for Data Inference and Long Prediction in Sparse Mobile CrowdSensing 42

Spatiotemporal Transformer for Data Inference and Long Predi...

引用

42nd IEEE International Conference on Computer Communications, INFOCOM 2023

作者： Wang, En Liu, Weiting Liu, Wenbin Xiang, Chaocan Yang, Bo Yang, Yongjian Jilin University College of Computer Science and Technology China Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education China Chongqing University College of Computer Science China

ISBN: (纸本)9798350334142

Mobile CrowdSensing (MCS) is a data sensing paradigm that recruits users carrying mobile terminals to collect data. As its variant, Sparse MCS has been further proposed for large-scale and fine-grained sensing task with the advantage of collecting only a few data to infer unsensed data. However, in many real-world scenarios, such as early prevention of epidemic, people are interested in not only the data at the current, but also in the future or even long-term future, and the latter may be more important. Long-term prediction not only reduces sensing cost, but also identifies trends or other characteristics of the data. In this paper, we propose a spatiotemporal model based on Transformer to infer and predict the data with sparse sensed data by utilizing spatiotemporal relationships. We design a spatiotemporal feature embedding to embed the prior spatiotemporal information of sensing map into the model to guide model learning. Moreover, we also design a novel multi-head spatiotemporal attention mechanism to dynamically capture spatiotemporal relationships among data. Extensive experiments have been conducted on three types of typical urban sensing tasks, which verify the effectiveness of our proposed algorithms in improving the inference and long-term prediction accuracy with the sparse sensed data. © 2023 IEEE.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

A Driving Area Detection Algorithm Based on Swin Transformer 5

A Driving Area Detection Algorithm Based on Swin Transformer

引用

5th International Conference on Frontiers Technology of Information and Computer, ICFTIC 2023

作者： Liu, Shuang Li, Ying Jilin University College of Computer Science and Technology Jilin Changchun130012 China Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin Changchun130012 China

ISBN: (纸本)9798350309034

The detection of drivable areas holds immense significance within the perception system of autonomous vehicles. This capability enables intelligent vehicles to gain a comprehensive understanding of the current road conditions and effectively identify safe areas suitable for safe navigation. Convolutional Neural Networks (CNNs) have achieved significant progress in the application of drivable areas detection, particularly in semantic segmentation. However, most existing CNN-based methods for drivable area detection only consider information within a local neighborhood, thus failing to effectively capture long-range dependencies. To tackle this concern, we propose a novel U-shaped network based on the Swin Transformer. The Swin Transformer block was employed as the fundamental element of both the encoder and decoder. Additionally, an upsampling layer was introduced in the decoder to effectively restore the resolution of the feature map. We evaluate our approach on the Cityscapes dataset, a publicly available benchmark for autonomous driving. Experimental results verify the exceptional performance of our proposed method, achieving an impressive mean Intersection over Union (mIoU) score of 91.61.. Our method outperforms existing state-of-the-art techniques in road segmentation detection, further demonstrating its superiority. © 2023 IEEE.

关键词： CNNS Driving Area Detection Semantic segmentation Swin Transformer

来源：评论

学校读者我要写书评

暂无评论

An Area Optimization Approach for Large-Scale RM-TB Dual Logic Circuits Based on a Multitasking Optimization Algorithm

引用

IEEE Transactions on Computers 2025年

作者： Wu, Xiaoqian Wang, Peng Li, Shaoquan Liu, Huaxiao Liu, Lei Jilin University College of Computer Science and Technology Changchun China Key Laboratory of Symbolic Computation China Knowledge Engineering of Ministry of Education China

Logic synthesis is a crucial step in integrated circuit design, and area optimization is an indispensable part of this process. However, the area optimization problem for large-scale Fixed Polarity Reed-Muller (FPRM) circuits is an NP-hard problem. To address this problem, we divide Boolean circuits into small-scale circuits based on the idea of divide-and-conquer using the proposed grouping decomposition mechanism. Each small-scale Boolean circuit is transformed into an FPRM circuit by a polarity transformation algorithm. To ensure the circuit’s functionality remains unaffected, we integrate FPRM circuits into an FPRM and Boolean (RM-TB) dual logic circuit based on the proposed gate-level integration. However, the area optimization problem of RM-TB dual logic circuits is a multi-task, high-dimensional, and multi-extremal combinatorial optimization problem. Therefore, we propose a Multipopulation Multitasking Optimization Algorithm (MMuOA) that integrates self-evolution with a multitasking equilibrium optimizer and cross-task evolution through knowledge sharing and transfer. This forms a dynamic optimization framework for simultaneously searching for the optimal polarity corresponding to the minimal area of RM-TB dual logic circuits. Moreover, we propose an Area Optimization Approach (AOA) for an RM-TB dual logic circuit with the minimum area using the MMuOA. Experimental results based on the Microelectronics Center of North Carolina (MCNC) Benchmark test circuits demonstrate the effectiveness and superiority of the AOA compared to the state-of-the-art area optimization approach. © 1.68-201. IEEE.

关键词： Combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

Decision Mamba: Reinforcement Learning via Hybrid Selective Sequence Modeling 38

Decision Mamba: Reinforcement Learning via Hybrid Selective ...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

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

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. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An image segmentation fusion algorithm based on density peak clustering and Markov random field

引用

Multimedia Tools and Applications 2024年第37期83卷 85331-85355页

作者： Feng, Yuncong Liu, Wanru Zhang, Xiaoli Zhu, Xiaoyan College of Computer Science and Engineering Changchun University of Technology Jilin Changchun130012 China Artificial Intelligence Research Institute Changchun University of Technology Jilin Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Jilin Changchun130012 China College of Computer Science and Technology Jilin University Jilin Changchun130012 China

Image segmentation is a crucial task in the field of computer vision. Markov random fields (MRF) based image segmentation method can effectively capture intricate relationships among pixels. However, MRF typically requires an initial labeling field, and the number of classifications needs to be manually selected. To tackle these issues, we propose a novel medical image segmentation algorithm based on density peak clustering (DPC) and Markov random fields. Firstly, we improve DPC to make it applicable to grayscale images, named GIDPC. In the GIDPC method, local gray density and gray bias are defined to enable the automatic determination of the number of classifications. Then, GIDPC and MRF are combined to achieve image segmentation. Furthermore, a segmentation fusion method is employed to enhance the accuracy of image segmentation. We conduct comparison experiments on the whole brain atlas image library. Our proposed algorithm achieves high average values in uniformity measure, accuracy, precision and sensitivity, respectively. Experimental results demonstrate that the proposed algorithm outperforms other image segmentation methods. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2024.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

FlexPDA:A Flexible Programming Framework for Deep Learning Accelerators

引用

Journal of Computer Science & Technology 2022年第5期37卷 1200-1220页

作者： Lei Liu Xiu Ma Hua-xiao Liu Guang-li Li Lei Liu College of Computer Science and Technology Jilin UniversityChangchunChina Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin UniversityChangchunChina State Key Laboratory of Computer Architecture Institute of Computing TechnologyChinese Academy of SciencesBeijingChina University of Chinese Academy of Sciences BeijingChina

There are a wide variety of intelligence accelerators with promising performance and energy efficiency,deployed in a broad range of applications such as computer vision and speech ***,programming productivity hinders the deployment of deep learning *** low-level library invoked in the high-level deep learning framework which supports the end-to-end execution with a given model,is designed to reduce the programming burden on the intelligence ***,it is inflexible for developers to build a network model for every deep learning application,which probably brings unnecessary repetitive *** this paper,a flexible and efficient programming framework for deep learning accelerators,FlexPDA,is proposed,which provides more optimization opportunities than the low-level library and realizes quick transplantation of applications to intelligence accelerators for fast *** evaluate FlexPDA by using 1. representative operators selected from deep learning algorithms and an end-to-end *** experimental results validate the effectiveness of FlexPDA,which achieves an end-to-end performance improvement of 1.620x over the low-level library.

关键词： deep learning accelerator programming framework domain-specific language

来源：评论

学校读者我要写书评

暂无评论

Dual Space Representation Learning for Skeleton-based Action Recognition

引用

IEEE Signal Processing Letters 2025年 32卷 2104-2108页

作者： Yang, Yuheng Chen, Haipeng Liu, Zhenguang Hu, Sihao Jiao, Yingying Jilin University College of Computer Science and Technology Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Changchun130012 China Zhejiang University School of Cyber Science and Technology Hangzhou310007 China Georgia Institute of Technology College of Computing GA United States

Skeleton-based action recognition is crucial for machine intelligence. Current methods generally learn from 3D articulated motion sequences in the straightforward Euclidean space. Yet, the vanilla Euclidean space may not be the optimal choice for modeling the intricate correlations among human body joints. This challenge arises from the non-Euclidean nature of human anatomy, where joint correlations often vary non-linearly during movement. To address this, we propose a dual space representation learning method. Specifically, we represent the motion sequences in Hyperbolic space, leveraging its intrinsic properties to capture the non-Euclidean latent anatomy of human motions. We then incorporate the motion features from both Hyperbolic and Euclidean spaces, allowing us to precisely model the non-linear joint correlations while effectively sketching human poses. The proposed method empirically achieves state-of-the-art performance on the NTU RGB+D 60, NTURGB+D 1.0, and NW-UCLA datasets. © 1.94-201. IEEE.

关键词： Digital arithmetic

来源：评论

学校读者我要写书评

暂无评论

A novel graph oversampling framework for node classification in class-imbalanced graphs

引用

Science China(Information Sciences) 2024年第6期67卷 214-229页

作者： Riting XIA Chunxu ZHANG Yan ZHANG Xueyan LIU Bo YANG Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University College of Artificial Intelligence Jilin University College of Computer Science and Technology Jilin University College of Communication Engineering Jilin University

Graph neural network(GNN) is a promising method to analyze graphs. Most existing GNNs adopt the class-balanced assumption, which cannot deal with class-imbalanced graphs well. The oversampling technique is effective in alleviating class-imbalanced problems. However, most graph oversampling methods generate synthetic minority nodes and their edges after applying GNNs. They ignore the problem that the representations of the original and synthetic minority nodes are dominated by majority nodes caused by aggregating neighbor information through GNN before oversampling. In this paper, we propose a novel graph oversampling framework, termed distribution alignment-based oversampling for node classification in classimbalanced graphs(named Graph-DAO). Our framework generates synthetic minority nodes before GNN to avoid the dominance of majority nodes caused by message passing in GNNs. Additionally, we introduce a distribution alignment method based on the sum-product network to learn more information about minority nodes. To our best knowledge, it is the first to use the sum-product network to solve the class-imbalanced problem in node classification. A large number of experiments on four real datasets show that our method achieves the optimal results on the node classification task for class-imbalanced graphs.

关键词： graph neural network class-imbalanced graphs sum-product network oversampling node classification

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：