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

The Discrete Approximation Problem for a Special Case of Hermite-Type Polynomial Interpolation

Journal of Systems Science & Complexity 2022年第5期35卷 2004-2015页

作者： GONG Yihe JIANG Xue ZHANG Shugong College of Science Northeast Electric Power UniversityJilin 132000China School of Mathematics and Systematic Sciences Shenyang Normal UniversityShenyang 110034China Institute of Mathematics Key Lab.of Symbolic Computation and Knowledge Engineering(Ministry of Education)Jilin UniversityChangchun 130012China

Every univariate Hermite interpolation problem can be written as a pointwise limit of Lagrange ***,this property is not preserved for the multivariate *** this paper,the authors first generalize the result of *** an application,the authors consider the discrete approximation problem for a special case when the interpolation condition contains all partial derivatives of order less than n and one nth order differential *** addition,for the case of n≥3,the authors use the concept of Cartesian tensors to give a sufficient condition to find a sequence of discrete points,such that the Lagrange interpolation problems at these points converge to the given Hermite-type interpolant.

关键词： Discrete approximation problem Hermite interpolation Lagrange interpolation

来源：评论

学校读者我要写书评

暂无评论

Migration: An Efficient Explorer Operator to Guide Swarm Evolution 1

Migration: An Efficient Explorer Operator to Guide Swarm Evo...

引用

1st IEEE International Conference on Medical Artificial Intelligence, MedAI 2023

作者： Han, Xiaosong Zhou, Chengyang Liang, Yanchun Guan, Renchu College of Computer Science and Technology Jilin University Key Laboratory for Symbol Computation and Knowledge Engineering National Education Ministry Changchun China College of Computer Science and Technology Zhuhai Laboratory of Key Laboratory for Symbol Computation and Knowledge Engineering Ministry of Education Jilin University Zhuhai College of Science and Technology Key Laboratory for Symbol Computation and Knowledge Engineering National Education Ministry Zhuhai China

ISBN: (纸本)9798350358780

Particle Swarm Optimization with Migration (MPSO) is proposed to solve the issue that PSO will encounter unbearable time cost problems when dealing with High-dimension, Expensive and Black-box objective function tasks. The Migration operator is inspired by the migration of Salmon. Salmon will start a dangerous journey from the ocean to the home rivers for reproduction. The process of the entire behavior is similar to the reduction and recovery of dimension. Therefore, we design the Migration operator where a pretrained Wasserstein Autoencoders (WAE) is applied to simulate the migration behavior to accelerate the process of evolution in PSO, and we use Least-Squares Regression in lower space to produce better generation. In comparison with famous baseline methods in some benchmark functions, MPSO converges faster and more accurately, which shows the great potential of migration operations. © 2023 IEEE.

关键词： Particle swarm optimization (PSO)

来源：评论

学校读者我要写书评

暂无评论

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

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

引用

29th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2023

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

ISBN: (纸本)9798350330717

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

关键词：

来源：评论

学校读者我要写书评

暂无评论

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 120, and NW-UCLA datasets. © 1994-2012 IEEE.

关键词： Digital arithmetic

来源：评论

学校读者我要写书评

暂无评论

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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. © 1968-2012 IEEE.

关键词： Combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

Dual-level Mixup for Graph Few-shot Learning with Fewer Tasks 25

Dual-level Mixup for Graph Few-shot Learning with Fewer Task...

引用

34th ACM Web Conference, WWW 2025

作者： Liu, Yonghao Li, Mengyu Giunchiglia, Fausto Huang, Lan Li, Ximing Feng, Xiaoyue Guan, Renchu College of Computer Science and Technology Jilin University Changchun China Department of Information Engineering and Computer Science University of Trento Trento Italy Key Laboratory of Symbolic Computation and Knowledge Engineering of the Ministry of Education China

ISBN: (纸本)9798400712746

Graph neural networks have been demonstrated as a powerful paradigm for effectively learning graph-structured data on the web and mining content from it. Current leading graph models require a large number of labeled samples for training, which unavoidably leads to overfitting in few-shot scenarios. Recent research has sought to alleviate this issue by simultaneously leveraging graph learning and meta-learning paradigms. However, these graph meta-learning models assume the availability of numerous meta-training tasks to learn transferable meta-knowledge. Such assumption may not be feasible in the real world due to the difficulty of constructing tasks and the substantial costs involved. Therefore, we propose a SiMple yet effectIve approach for graph few-shot Learning with fEwer tasks, named SMILE. We introduce a dual-level mixup strategy, encompassing both within-task and across-task mixup, to simultaneously enrich the available nodes and tasks in meta-learning. Moreover, we explicitly leverage the prior information provided by the node degrees in the graph to encode expressive node representations. Theoretically, we demonstrate that SMILE can enhance the model generalization ability. Empirically, SMILE consistently outperforms other competitive models by a large margin across all evaluated datasets with in-domain and cross-domain settings. Our anonymous code can be found here. © 2025 Copyright held by the owner/author(s).

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

ADAPTIVE DEPTH GRAPH ATTENTION NETWORKS

arXiv

引用

arXiv 2023年

作者： Zhou, Jingbo Du, Yixuan Zhang, Ruqiong Zhang, Rui Key Laboratory of Symbolic Computation and Knowledge Engineering of MOE Jilin University China

As one of the most popular GNN architectures, the graph attention networks (GAT) is considered the most advanced learning architecture for graph representation and has been widely used in various graph mining tasks with impressive results. However, since GAT was proposed, none of the existing studies have provided systematic insight into the relationship between the performance of GAT and the number of layers, which is a critical issue in guiding model performance improvement. In this paper, we perform a systematic experimental evaluation and based on the experimental results, we find two important facts: (1) the main factor limiting the accuracy of the GAT model as the number of layers increases is the oversquashing phenomenon;(2) among the previous improvements applied to the GNN model, only the residual connection can significantly improve the GAT model performance. We combine these two important findings to provide a theoretical explanation that it is the residual connection that mitigates the loss of original feature information due to oversquashing and thus improves the deep GAT model performance. This provides empirical insights and guidelines for researchers to design the GAT variant model with appropriate depth and well performance. To demonstrate the effectiveness of our proposed guidelines, we propose a GAT variant model-ADGAT that adaptively selects the number of layers based on the sparsity of the graph, and experimentally demonstrate that the effectiveness of our model is significantly improved over the original GAT. Copyright © 2023, The Authors. All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

2.5D ASF-UNet: Adjacent Slice Spatial Feature Fusion Model for WMH Segmentation from 3D MR Brain Image

2.5D ASF-UNet: Adjacent Slice Spatial Feature Fusion Model f...

引用

2024 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2024

作者： Huang, Lan Sun, Yinglu Zhao, Ziqi Guo, Chunjie Wang, Yan College of Computer Science and Technology Jilin University Key Laboratory of Symbol Computation and Knowledge Engineering Ministry of Education Changchun China The First Hospital of Jilin University Department of Radiology Changchun China

ISBN: (纸本)9798350386226

Segmenting brain white matter hyperintensities (WMH) from 3D Magnetic Resonance (MR) images is crucial for the diagnosis, treatment, and prognosis of Multiple Sclerosis (MS). Unlike common 2D images, this task is more challenging and time-consuming. Classical deep learning methods for 3D image segmentation face two main challenges: 1) Pure 3D networks have more parameters and are prone to overfitting. 2) When using 2D networks to segment slices of 3D images, the lack of 3D structural information results in suboptimal segmentation after reconstruction. To address these difficulties, we propose the 2.5D ASF-UNet, which employs the 2.5D workflow and uses adjacent slices as the input for 2D segmentation network ASF-UNet. In ASF-UNet, separate down-sampling paths are used for the adjacent slices, and the Local Spatial Attention Module (LSAM) is designed to more effectively integrate 3D spatial information into the 2D network. Additionally, the Conv-Spectral-Block (CSB) is designed to extract and integrate local and global features. It allows the model to capture global spatial structures while preserving detailed information. Experimental results on MICCAI MSSEG 2016 and Local MS datasets show that 2.5D ASF-UNet achieve better segmentation performance than other deep learning methods. © 2024 IEEE.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：