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

arXiv 2023年

作者： Wang, Yilin Cao, Nan Zhang, Teng Shi, Xuanhua Jin, Hai National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology China

Optimal margin Distribution Machine (ODM) is a newly proposed statistical learning framework rooting in the latest margin theory, which demonstrates better generalization performance than the traditional large margin based counterparts. However, it suffers from the ubiquitous scalability problem regarding both computation time and memory storage as other kernel methods. This paper proposes a scalable ODM, which can achieve nearly ten times speedup compared to the original ODM training method. For nonlinear kernels, we put forward a novel distribution-aware partition method to make the local ODM trained on each partition be close and converge fast to the global one. When linear kernel is applied, we extend a communication efficient SVRG method to accelerate the training further. Extensive empirical studies validate that our proposed method is highly computational efficient and almost never worsen the generalization. Copyright © 2023, The Authors. All rights reserved.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

On Pipelined GCN with Communication-Efficient Sampling and Inclusion-Aware Caching

On Pipelined GCN with Communication-Efficient Sampling and I...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： Shulin Wang Qiang Yu Xiong Wang Yuqing Li Hai Jin National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China School of Cyber Science and Engineering Wuhan University Wuhan China

ISBN: (数字)9798350383508

ISBN: (纸本)9798350383515

Graph convolutional network (GCN) has achieved enormous success in learning structural information from unstructured data. As graphs become increasingly large, distributed training for GCNs is severely prolonged by frequent cross-worker communications. Existing efforts to improve the training efficiency often come at the expense of GCN performance, while the communication overhead persists. In this paper, we propose PSC-GCN, a holistic pipelined framework for distributed GCN training with communication-efficient sampling and inclusion-aware caching, to address the communication bottleneck while ensuring satisfactory model performance. Specifically, we devise an asynchronous pre-fetching scheme to retrieve stale statistics (features, embedding, gradient) of boundary nodes in advance, such that the embedding aggregation and model update are pipelined with statistics transmission. To alleviate communication volume and staleness effect, we introduce a variance-reduction based sampling policy, which prioritizes inner nodes over boundary ones for reducing the access frequency to remote neighbors, thus mitigating cross-worker statistics exchange. Complementing graph sampling, a feature caching module is co-designed to buffer hot nodes with high inclusion probability, ensuring that frequently sampled nodes will be available in local memory. Extensive evaluations on real-world datasets show the superiority of PSC-GCN over state-of-the-art methods, where we can reduce training time by 72%-80% without sacrificing model accuracy.

关键词： Training Estimation error Accuracy Graph convolutional networks Computational modeling Probability Benchmark testing

来源：评论

学校读者我要写书评

暂无评论

Fast Parallel Recovery for Transactional Stream Processing on Multicores

Fast Parallel Recovery for Transactional Stream Processing o...

引用

International Conference on data engineering

作者： Jianjun Zhao Haikun Liu Shuhao Zhang Zhuohui Duan Xiaofei Liao Hai Jin Yu Zhang National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China School of Computer Science and Engineering Nanyang Technological University Singapore

ISBN: (数字)9798350317152

ISBN: (纸本)9798350317169

Transactional stream processing engines (TSPEs) have gained increasing attention due to their capability of processing real-time stream applications with transactional semantics. However, TSPEs remain susceptible to system failures and power outages. Existing TSPEs mainly focus on performance improvement, but still face a significant challenge to guarantee fault tolerance while offering high-performance services. We revisit commonly-used fault tolerance approaches in stream processing and database systems, and find that these approaches do not work well on TSPEs due to complex data dependencies. In this paper, we propose a novel TSPE called MorphStreamR to achieve fast failure recovery while guaranteeing low performance overhead at runtime. The key idea of MorphStreamR is to record intermediate results of resolved dependencies at runtime, and thus eliminate data dependencies to improve task parallelism during failure recovery. MorphStreamR further mitigates the runtime overhead by selectively tracking data dependencies and incorporating workload-aware log commitment. Experimental results show that MorphStreamR can significantly reduce the recovery time by up to 3.1 x while experiencing much less performance slowdown at runtime, compared with other applicable fault tolerance approaches.

关键词： Fault tolerance Runtime Fault tolerant systems Semantics Parallel processing Real-time systems Power system reliability

来源：评论

学校读者我要写书评

暂无评论

Learning Pareto Set for Multi-Objective Continuous Robot Control

arXiv

引用

arXiv 2024年

作者： Shu, Tianye Shang, Ke Gong, Cheng Nan, Yang Ishibuchi, Hisao Department of Computer Science and Engineering Southern University of Science and Technology China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Department of Computer Science City University of Hong Kong Hong Kong

For a control problem with multiple conflicting objectives, there exists a set of Pareto-optimal policies called the Pareto set instead of a single optimal policy. When a multi-objective control problem is continuous and complex, traditional multiobjective reinforcement learning (MORL) algorithms search for many Pareto-optimal deep policies to approximate the Pareto set, which is quite resource-consuming. In this paper, we propose a simple and resource-efficient MORL algorithm that learns a continuous representation of the Pareto set in a high-dimensional policy parameter space using a single hypernet. The learned hypernet can directly generate various well-trained policy networks for different user preferences. We compare our method with two state-of-the-art MORL algorithms on seven multi-objective continuous robot control problems. Experimental results show that our method achieves the best overall performance with the least training parameters. An interesting observation is that the Pareto set is well approximated by a curved line or surface in a highdimensional parameter space. This observation will provide insight for researchers to design new MORL algorithms. © 2024, CC BY.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Efficient Heuristic Algorithm for Precedence-Constrained Multi-Robot Task Assignment

Efficient Heuristic Algorithm for Precedence-Constrained Mul...

引用

第43届中国控制会议

作者： Xiaoshan Bai Baode Li Fuqiang Liu Li Qiu Guangzhong Cao College of Mechanical and Control Engineering Shenzhen University Guangdong Key Laboratory of Electromagnetic Control and Intelligent Robots Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen University College of Mechanical and Vehicle Engineering Chongqing University

ISBN: (数字)9789887581581

ISBN: (纸本)9798350366907

Due to the widespread application of multi-robot systems, the efficient task assignment for a team of robots has become particularly critical for performing complex tasks. This paper studies the task assignment problem for multiple robots to visit a group of target locations with precedence constraints, which determine the order/sequence in which certain target locations need to be visited before others. A marginal-cost-based heuristic algorithm is developed to minimize the time for the robots to visit the last target location. The algorithm first uses a timestamp strategy to update the anticipated visiting time of each assigned target and the corresponding earliest time that each successor target can be visited under the precedence constraints. Then, it utilizes the topological sorting technique and the marginal-cost-based mechanism to insert the feasible target that induces the minimum marginal cost into the robots' current routes. Numerical simulations demonstrate the effectiveness of the proposed algorithm compared with the popular greedy algorithm and the existing simple iterative auction algorithm.

关键词： Multi-robot task assignment Precedence constraints Heuristic algorithm Marginal cost

来源：评论

学校读者我要写书评

暂无评论

Circular Decomposition and Cross-Modal Recombination for Multimodal Sentiment Analysis

Circular Decomposition and Cross-Modal Recombination for Mul...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Haijian Liang Weicheng Xie Xilin He Siyang Song Linlin Shen School of Computer Science & Software Engineering Computer Vision Institue Shenzhen University Guangdong Key Laboratory of Intelligent Information Processing Shenzhen University School of Computing and Mathematical Sciences University of Leicester National Engineering Laboratory for Big Data System Computing Technology Shenzhen University

Multimodal Sentiment Analysis is a burgeoning research area, leveraging various modalities to predict the sentiment score. Nevertheless, previous studies have disregarded the impact of noise interference on specific modal sentiments during video recording, thereby compromising the accuracy of sentiment prediction. In this paper, we propose the Guided Circular Decomposition and Cross-Modal Recombination (GCD-CMR) model, which aims to eliminate contaminated sentiment features in a fine-grained way. To achieve this, we utilize tailored global information specific to each modality to guide the circular decomposing process in the GCD module, to produce a set of sentiment prototypes. Subsequently, in the CMR module, we align cross-modal sentiment prototypes and remove the contaminated prototypes for recombination. Experimental results on two publicly available datasets demonstrate that our model surpasses state-of-the-art models, confirming the effectiveness of our proposed method. We release the code at: https://***/nianhua20/GCD-CMR.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A hybrid modeling approach incorporating physical modeling and deep learning for multiphase flow simulation 84

A hybrid modeling approach incorporating physical modeling a...

引用

84th EAGE Annual Conference and Exhibition

作者： Wang, Y. Zhang, J. Du, S. Yan, B. Song, H. Wang, J. Xie, C. China Texas A&M University United States University of Science and Technology Beijing China National & Local Joint Engineering Laboratory for Big-Data Analysis and Computing Technology King Abdullah University of Science and Technology Saudi Arabia Computer Network Information Center Chinese Academy of Sciences China

ISBN: (纸本)9781713884156

Multiphase flows are of great importance for the sustainable utilization of geological resources and ecological protection. Numerical simulation, as a general and powerful approach for multiphase flow modeling, faces great computational challenge for large scale and heterogeneous problems. This study explores the possibility of a hybrid modeling architecture for nonlinear multiphase flow, which integrates physical modeling and deep learning approaches. By breaking down the coupled system into pressure and saturation equations, we construct novel solvers using a physics-guided U-net and Fourier Neural Operator instead of the traditional time-consuming implicit pressure solver. The coupling of our carefully designed solver for pressure and explicit solver for saturation provides a new perspective for modeling large scale complex multiphase flows. Our results demonstrate that this hybrid modeling architecture exhibits superior predictive performance for pressure and saturation, with relative error about 0.2% and 0.6%, respectively. More importantly, our hybrid solver can improve computational efficiency by several orders of magnitude compared to traditional numerical simulation workflows. Our work showcases that the proposed hybrid modeling approach incorporating physical modeling and deep learning is promising to provide a more flexible and powerful alternative for multiphase flow modeling in geological formations. © 2023 84th EAGE Annual Conference and Exhibition. All rights reserved.

关键词： Multiphase flow

来源：评论

学校读者我要写书评

暂无评论

Improving multi-view document clustering: leveraging multi-structure processor and hybrid ensemble clustering module 30

Improving multi-view document clustering: leveraging multi-s...

引用

Joint 30th International Conference on Computational Linguistics and 14th International Conference on Language Resources and Evaluation, LREC-COLING 2024

作者： Bai, Ruina Bai, Qi Huang, Ruizhang Chen, Yanping Qin, Yongbin Text Computing & Cognitive Intelligence Engineering Research Center National Education Ministry College of Computer Science and Technology Guizhou University Guiyang550025 China State Key Laboratory of Public Big Data Guizhou University Guiyang550025 China School of Mathematical Sciences Zhejiang University Hangzhou310058 China

ISBN: (纸本)9782493814104

We introduce a multi-view document clustering model called DMsECN (Deep Multi-structure Ensemble Clustering Network), comprising a multi-structure processor and a hybrid ensemble clustering module. Unlike existing models, DMsECN distinguishes itself by creating a consensus structure from multiple clustering structures. The multi-structure processor comprises two stages, each contributing to the extraction of clustering structures that preserve both consistency and complementarity across multiple views. Representation learning extracts both view and view-fused representations from multi-views through the use of contrastive learning. Subsequently, multi-structure learning employs distinct view clustering guidance to generate the corresponding clustering structures. The hybrid ensemble clustering module merges two ensemble methods to amalgamate multiple structures, producing a consensus structure that guarantees both the separability and compactness of clusters within the clustering results. The attention-based ensemble primarily concentrates on learning the contribution weights of diverse clustering structures, while the similarity-based ensemble employs cluster assignment similarity and cluster classification dissimilarity to guide the refinement of the consensus structure. Experimental results demonstrate that DMsECN outperforms other models, achieving new state-of-the-art results on four multi-view document clustering datasets. © 2024 ELRA Language Resource Association: CC BY-NC 4.0.

关键词： Structure (composition)

来源：评论

学校读者我要写书评

暂无评论

Adaptive Evolutionary Reinforcement Learning Algorithm with Early Termination Strategy 24

Adaptive Evolutionary Reinforcement Learning Algorithm with ...

引用

Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent systems

作者： Xiaoqiang Wu Qingling Zhu Qiuzhen Lin Weineng Chen Jianqiang Li College of Computer Science and Software Engineering Shenzhen University Shenzhen China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China School of Computer Science and Engineering South China University of Technology Guangzhou China

ISBN: (纸本)9798400704864

Evolutionary reinforcement learning algorithms (ERLs), which combine evolutionary algorithms (EAs) with reinforcement learning (RL), have demonstrated significant success in enhancing RL performance. However, most ERLs rely heavily on Gaussian mutation operators to generate new individuals. When the standard deviation is too large or small, this approach will result in the production of poor or highly similar offspring. Such outcomes can be detrimental to the learning process of the RL agent, as too many poor or similar experiences are generated by these individuals. In order to alleviate these issues, this paper proposes an Adaptive Evolutionary Reinforcement Learning (AERL) method that adaptively adjusts both the standard deviation and the evaluation process. By tracking the performance of new individuals, AERL maintains the mutation strength within a suitable range without the need for additional gradient computations. Moreover, the proposed AERL approach early terminates unnecessary evaluations and discards experiences arising from poor individuals, thereby resulting in enhanced learning efficiency. Empirical assessments conducted on a variety of continuous control problems demonstrate the effectiveness of the AERL method.

关键词： evolutionary algorithm evolutionary reinforcement learning reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Improving QoS of Workloads with CPU Pinning: A Deep Reinforcement Learning Approach

Improving QoS of Workloads with CPU Pinning: A Deep Reinforc...

引用

International Workshop on Quality of Service

作者： Xi Tao Weipeng Cao Yinghui Pan Ye Liu Zhong Ming Guangdong Laboratory of Artificial Intelligence and Digital Economy (Shenzhen) Shenzhen China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China College of Computer Science and Software Engineering Shenzhen University Shenzhen China

ISBN: (数字)9798350350128

ISBN: (纸本)9798350350135

In cloud computing, tenants tend to select predefined flavors with substantial resources that go beyond their needs, in order to avoid resource starvation. As a result, cloud service providers experience a high allocation ratio with a low utilization ratio of resources. To improve the resource utilization, cloud service providers offer lower-priced resources by building an overcommitted environment to reuse resources. However, the colocation interference of workloads in the overcommitted environment may cause performance anomalies and degrade quality of service (QoS). In this paper, we propose a real-time mechanism to pin a group of workloads to a certain subset of CPUs to increase resource utilization and minimize interference. To be specific, we leverage deep reinforcement learning (DRL) to automatically adjust the CPU pinning configuration in the overcommitted environment according to the performance of workloads.

关键词： Cloud computing Computational modeling Buildings Quality of service Interference Deep reinforcement learning Real-time systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：