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

Improving Generalization of Neural Vehicle Routing Problem Solvers Through the Lens of Model Architecture

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Xiao, Yubin Wang, Di Wu, Xuan Wu, Yuesong Li, Boyang Du, Wei Wang, Liupu Zhou, You Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education College of Computer Science and Technology Jilin University Changchun130012 China Joint NTU-UBC Research Centre of Excellence in Active Living for the Elderly Nanyang Technological University 639956 Singapore WeBank-NTU Joint Research Institute on Fintech Nanyang Technological University 639956 Singapore College of Computing and Data Science Nanyang Technological University 639956 Singapore

Neural models produce promising results when solving Vehicle Routing Problems (VRPs), but may often fall short in generalization. Recent attempts to enhance model generalization often incur unnecessarily large training cost or cannot be directly applied to other models solving different VRP variants. To address these issues, we take a novel perspective on model architecture in this study. Specifically, we propose a plug-and-play Entropy-based Scaling Factor (ESF) and a Distribution-Specific (DS) decoder to enhance the size and distribution generalization, respectively. ESF adjusts the attention weight pattern of the model towards familiar ones discovered during training when solving VRPs of varying sizes. The DS decoder explicitly models VRPs of multiple training distribution patterns through multiple auxiliary light decoders, expanding the model representation space to encompass a broader range of distributional scenarios. We conduct extensive experiments on both synthetic and widely recognized real-world benchmarking datasets and compare the performance with seven baseline models. The results demonstrate the effectiveness of using ESF and DS decoder to obtain a more generalizable model and showcase their applicability to solve different VRP variants, i.e., travelling salesman problem and capacitated VRP. Notably, our proposed generic components require minimal computational resources, and can be effortlessly integrated into conventional generalization strategies to further elevate model generalization. Copyright © 2024, The Authors. All rights reserved.

关键词： Combinatorial optimization

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

学校读者我要写书评

暂无评论

arXiv 2023年

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

Federated recommendation systems 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 available1 Copyright © 2023, The Authors. All rights reserved.

关键词： Recommender systems

Talking Head Generation for Media Interaction System with Feature Disentanglement

学校读者我要写书评

暂无评论

Talking Head Generation for Media Interaction System with Fe...

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Lei Zhang Qingyang Chen Zhilei Liu College of Intelligence and Computing School of New Media and Communication Tianjin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun P.R. China State Key Laboratory for Novel Software Technology Nanjing University P.R. China School of New Media and Communication Tianjin University Tianjin China College of Intelligence and Computing Tianjin University Tianjin China

The task of talking head generation for the media interaction system is to take images and audio clips of the target face as input, and generate a realistic video of the target synchronized with the audio. Most of the existing works directly take all the information in the image as input, which causes the problem of feature information redundancy. At the same time, in the stage of feature fusion, the image and audio information is directly spliced, and the relationship between the two modal information is ignored. To solve the problems, we initially implement the disentanglement of image by introducing a loss function to separate the image into identity features and content-related features. Besides, we introduce a multi-head selfattention mechanism to learn the relationship between the two modal information of image and audio, and implement the full fusion of multi-modal information. In addition, we validate the effectiveness of our model through extensive quantitative and qualitative analysis of two datasets. Extensive experiments show the superiority of the proposed model in all aspects.

关键词： Analytical models Redundancy Media Synchronization Task analysis Faces

Lightweight Deep Learning for Resource-Constrained Environments: A Survey

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Liu, Hou-I Galindo, Marco Xie, Hongxia Wong, Lai-Kuan Shuai, Hong-Han Li, Yung-Yui Cheng, Wen-Huang Department of Electronics and Electrical Engineering National Yang Ming Chiao Tung University Hsinchu300 Taiwan College of Computer Science and Technology Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun130000 China Faculty of Computing and Informatics Multimedia University Cyberjaya63100 Malaysia Hon Hai Research Institute Taipei114 Taiwan Department of Computer Science and Information Engineering National Taiwan University Taipei106 Taiwan

Over the past decade, the dominance of deep learning has prevailed across various domains of artificial intelligence, including natural language processing, computer vision, and biomedical signal processing. While there have been remarkable improvements in model accuracy, deploying these models on lightweight devices, such as mobile phones and microcontrollers, is constrained by limited resources. In this survey, we provide comprehensive design guidance tailored for these devices, detailing the meticulous design of lightweight models, compression methods, and hardware acceleration strategies. The principal goal of this work is to explore methods and concepts for getting around hardware constraints without compromising the model's accuracy. Additionally, we explore two notable paths for lightweight deep learning in the future: deployment techniques for TinyML and Large Language Models. Although these paths undoubtedly have potential, they also present significant challenges, encouraging research into unexplored areas. Copyright © 2024, The Authors. All rights reserved.

关键词： Computer hardware

Aerial Reliable Collaborative Communications for Terrestrial Mobile Users via Evolutionary Multi-Objective Deep Reinforcement Learning

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Sun, Geng Xiao, Jian Li, Jiahui Wang, Jiacheng Kang, Jiawen Niyato, Dusit Mao, Shiwen 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 affiliated with the College of Computing and Data Science Nanyang Technological University Singapore639798 Singapore School of Computer Science and Engineering Nanyang Technological University Singapore639798 Singapore School of Automation Guangdong University of Technology Guangzhou510641 China Department of Electrical and Computer Engineering Auburn University AuburnAL36849-5201 United States

Unmanned aerial vehicles (UAVs) have emerged as the potential aerial base stations (BSs) to improve terrestrial communications. However, the limited onboard energy and antenna power of a UAV restrict its communication range and transmission capability. To address these limitations, this work employs collaborative beamforming through a UAV-enabled virtual antenna array to improve transmission performance from the UAV to terrestrial mobile users, under interference from non-associated BSs and dynamic channel conditions. Specifically, we introduce a memory-based random walk model to more accurately depict the mobility patterns of terrestrial mobile users. Following this, we formulate a multi-objective optimization problem (MOP) focused on maximizing the transmission rate while minimizing the flight energy consumption of the UAV swarm. Given the NP-hard nature of the formulated MOP and the highly dynamic environment, we transform this problem into a multi-objective Markov decision process and propose an improved evolutionary multi-objective reinforcement learning algorithm. Specifically, this algorithm introduces an evolutionary learning approach to obtain the approximate Pareto set for the formulated MOP. Moreover, the algorithm incorporates a long short-term memory network and hyper-sphere-based task selection method to discern the movement patterns of terrestrial mobile users and improve the diversity of the obtained Pareto set. Simulation results demonstrate that the proposed method effectively generates a diverse range of non-dominated policies and outperforms existing methods. Additional simulations demonstrate the scalability and robustness of the proposed CB-based method under different system parameters and various unexpected circumstances. © 2025, CC0.

关键词： Unmanned aerial vehicles (UAV)

Practical two-party privacy-preserving neural network based on secret sharing

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Ge, Zhengqiang Zhou, Zhipeng Guo, Dong Li, Qiang College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation Knowledge Engineering of Ministry of Education Jilin University Changchun China

Neural networks, with the capability to provide efficient predictive models, have been widely used in medical, financial, and other fields, bringing great convenience to our lives. However, the high accuracy of the model requires a large amount of data from multiple parties, raising public concerns about privacy. Privacy-preserving neural network based on multi-party computation is one of the current methods used to provide model training and inference under the premise of solving data privacy. In this study, we propose a new two-party privacy-preserving neural network training and inference framework in which privacy data is distributed to two non-colluding servers. We construct a preprocessing protocol for mask generation, support and realize secret sharing comparison on 2PC, and propose a new method to further reduce the communication rounds. Based on the comparison protocol, we construct building blocks such as division and exponential, and realize the process of training and inference that no longer needs to convert between different types of secret sharings and is entirely based on arithmetic secret sharing. Compared with the previous works, our work obtains higher accuracy, which is very close to that of plaintext training. While the accuracy has been improved, the runtime is reduced, considering the online phase, our work is 5× faster than SecureML, 4.32-5.75× faster than SecureNN, and is very close to the current optimal 3PC implementation, FALCON. For secure inference, as far as known knowledge is concerned, we should be the current optimal 2PC implementation, which is 4-358× faster than other works. © 2021, CC BY.

关键词： Neural networks

SSBM: A Signed Stochastic Block Model for Multiple Structure Discovery in Large-Scale Exploratory Signed Networks

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Li, Yang Yang, Bo Zhao, Xuehua Yang, Zhejian Chen, Hechang Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Changchun130012 China College of Computer Science and Technology Jilin University Changchun130012 China Aviation University of Air Force Changchun130062 China School of Digital Media Shenzhen Institute of Information Technology Shenzhen518055 China School of Artificial Intelligence Jilin University Changchun130012 China

Signed network structure discovery has received extensive attention and has become a research focus in the field of network science. However, most of the existing studies are focused on the networks with a single structure, e.g., community or bipartite, while ignoring multiple structures, e.g., the coexistence of community and bipartite structures. Furthermore, existing studies were faced with challenge regarding large-scale signed networks due to their high time complexity, especially when determining the number of clusters in the observed network without any prior knowledge. In view of this, we propose a mathematically principled method for signed network multiple structure discovery named the Signed Stochastic Block Model (SSBM). The SSBM can capture the multiple structures contained in signed networks, e.g., community, bipartite, and coexistence of them, by adopting a probabilistic model. Moreover, by integrating the minimum message length (MML) criterion and component-wise EM (CEM) algorithm, a scalable learning algorithm that has the ability of model selection is proposed to handle large-scale signed networks. By comparing state-of-the-art methods on synthetic and realworld signed networks, extensive experimental results demonstrate the effectiveness and efficiency of SSBM in discovering large-scale exploratory signed networks with multiple structures. Copyright © 2023, The Authors. All rights reserved.

关键词： Stochastic models

A Task Processing Efficiency Improvement Scheme Based on Cloud-Edge Architecture in Dense Computing Environments

学校读者我要写书评

暂无评论

SSRN

SSRN 2022年

作者： Feng, Jiahui Qi, Jingze Liu, Yuanning Liu, Zhen 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 Graduate School of Engineering Nagasaki Institute of Applied Science 536 Aba-machi Nagasaki851-0193 Japan

As cloud-edge architecture combines low latency and high-performance computing, it has a wider range of application scenarios. Considering that, how to reasonably allocate tasks to the edge cloud or the central cloud and how to select appropriate virtual machines (VMs) for tasks are two key aspects affecting the efficiency of cloud-edge architecture. For the former, the ARDT algorithm is proposed, which dynamically adjusts the optimal threshold by predicting the number of real-time edge-end devices. For the latter, we design the DBMR algorithm based on the Max-Fit algorithm, in which we propose a structure of blocking to reduce the time complexity of the original algorithm from O(n2) to O(n(n-m)). Experimental results show that the ARDT-DBMR algorithm optimizes the average processing time and task failure rate by 30%-40% compared with the baseline algorithms and other advanced algorithms and significantly improves the problem of abnormal fluctuations in VM utilization in dense computing environments. © 2022, The Authors. All rights reserved.

关键词： Virtual machine

Joint Optimization of UAV-Carried IRS for Urban Low Altitude mmWave Communications with Deep Reinforcement Learning

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Xie, Wenwen Sun, Geng Liu, Bei Li, Jiahui Wang, Jiacheng Du, Hongyang Niyato, Dusit Kim, Dong In The 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 The College of Computing and Data Science Nanyang Technological University Singapore639798 Singapore The College of Computing and Data Science Nanyang Technological University Singapore The Department of Electrical and Electronic Engineering The University of Hong Kong 999077 Hong Kong The Department of Electrical and Computer Engineering Sungkyunkwan University Suwon16419 Korea Republic of

Emerging technologies in sixth generation (6G) of wireless communications, such as terahertz communication and ultra-massive multiple-input multiple-output, present promising prospects. Despite the high data rate potential of millimeter wave communications, millimeter wave (mmWave) communications in urban low altitude economy (LAE) environments are constrained by challenges such as signal attenuation and multipath interference. Specially, in urban environments, mmWave communication experiences significant attenuation due to buildings, owing to its short wavelength, which necessitates developing innovative approaches to improve the robustness of such communications in LAE networking. In this paper, we explore the use of an unmanned aerial vehicle (UAV)-carried intelligent reflecting surface (IRS) to support low altitude mmWave communication. Specifically, we consider a typical urban low altitude communication scenario where a UAV-carried IRS establishes a line-of-sight (LoS) channel between the mobile users and a source user (SU) despite the presence of obstacles. Subsequently, we formulate an optimization problem aimed at maximizing the transmission rates and minimizing the energy consumption of the UAV by jointly optimizing phase shifts of the IRS and UAV trajectory. Given the non-convex nature of the problem and its high dynamics, we propose a deep reinforcement learning-based approach incorporating neural episodic control, long short-term memory, and an IRS phase shift control method to enhance the stability and accelerate the convergence. Simulation results show that the proposed algorithm effectively resolves the problem and surpasses other benchmark algorithms in various performances. Copyright © 2025, The Authors. All rights reserved.

关键词： Deep reinforcement learning