Runge Kutta Optimization(RUN)is a widely utilized metaheuristic ***,it suffers from these issues:the imbalance between exploration and exploitation and the tendency to fall into local optima when it solves real-world ...
详细信息
Runge Kutta Optimization(RUN)is a widely utilized metaheuristic ***,it suffers from these issues:the imbalance between exploration and exploitation and the tendency to fall into local optima when it solves real-world opti-mization *** address these challenges,this study aims to endow each individual in the population with a certain level of intelligence,allowing them to make autonomous decisions about their next optimization *** incorporating Reinforcement Learning(RL)and the Composite Mutation Strategy(CMS),each individual in the population goes through additional self-improvement steps after completing the original algorithmic phases,referred to as *** is,each individual in the RUN population is trained intelligently using RL to independently choose three different differentiation strategies in CMS when solving different *** validate the competitiveness of RLRUN,comprehensive empirical tests were conducted using the IEEE CEC 2017 benchmark *** comparative experiments with 13 conventional algorithms and 10 advanced algorithms were *** experimental results demonstrated that RLRUN excels in convergence accuracy and speed,surpassing even some champion ***,this study introduced a binary version of RLRUN,named bRLRUN,which was employed for the feature selection *** 24 high-dimensional datasets encompassing UCI datasets and SBCB machine learning library microarray datasets,bRLRUN occupies the top position in classification accuracy and the number of selected feature subsets compared to some *** conclusion,the proposed algorithm demonstrated that it exhibits a strong competitive advantage in high-dimensional feature selection for complex datasets.
Blockchain and the InterPlanetary File System (IPFS) are two decentralized technologies poised to revolutionize data storage, management, and sharing. Blockchain is a distributed ledger technology offering secure, tra...
详细信息
1 Introduction Graphical User Interface(GUI)widgets classification entails classifying widgets into their appropriate domain-specific types(e.g.,CheckBox and EditText)[1,2].The widgets classification is essential as i...
详细信息
1 Introduction Graphical User Interface(GUI)widgets classification entails classifying widgets into their appropriate domain-specific types(e.g.,CheckBox and EditText)[1,2].The widgets classification is essential as it supports several software engineering tasks,such as GUI design and testing[1,3].The ability to obtain better widget classification performance has become one of the keys to the success of these *** in recent years have proposed many techniques for improving widget classification performance[1,2,4].For example,Moran et al.[1]proposed a deep learning technique to classify GUI widgets into their domain-specific *** authors used the deep learning algorithm,a Convolutional Neural Network(CNN)architecture,to classify the GUI *** et al.[2]proposed combining text-based and non-text-based models to improve the overall performance of GUI widget detection while classifying the widgets with the ResNet50 model.
A dynamic video summarization system detects key parts of the input video to generate its compact representation. The summaries can be used for efficient management of video data. This paper proposes an approach, Vide...
详细信息
Internet of Things (IoT) connects billions of devices and tiny sensors enabled with Low-Power and Lossy Networks (LLNs) to provide real time data transfer. These LLNs work as s backbone of complete IoT ecosystem which...
详细信息
Trained Artificial Intelligence (AI) models are challenging to install on edge devices as they are low in memory and computational power. Pruned AI (PAI) models are therefore needed with minimal degradation in perform...
详细信息
In Weighted Model Counting(WMC),we assign weights to literals and compute the sum of the weights of the models of a given propositional formula where the weight of an assignment is the product of the weights of its **...
详细信息
In Weighted Model Counting(WMC),we assign weights to literals and compute the sum of the weights of the models of a given propositional formula where the weight of an assignment is the product of the weights of its *** current WMC solvers work on Conjunctive Normal Form(CNF)***,CNF is not a natural representation for human-being in many *** by the stronger expressive power of Pseudo-Boolean(PB)formulas than CNF,we propose to perform WMC on PB *** on a recent dynamic programming algorithm framework called ADDMC for WMC,we implement a weighted PB counting tool *** compare PBCounter with the state-of-the-art weighted model counters SharpSAT-TD,ExactMC,D4,and ADDMC,where the latter tools work on CNF with encoding methods that convert PB constraints into a CNF *** experiments on three domains of benchmarks show that PBCounter is superior to the model counters on CNF formulas.
—Neural networks (NNs) have been driving machine learning progress in recent years, but their larger models present challenges in resource-limited environments. Weight pruning reduces the computational demand, often ...
详细信息
—Neural networks (NNs) have been driving machine learning progress in recent years, but their larger models present challenges in resource-limited environments. Weight pruning reduces the computational demand, often with performance degradation and long training procedures. This work introduces distilled gradual pruning with pruned fine-tuning (DG2PF), a comprehensive algorithm that iteratively prunes pretrained NNs using knowledge distillation. We employ a magnitude-based unstructured pruning function that selectively removes a specified proportion of unimportant weights from the network. This function also leads to an efficient compression of the model size while minimizing classification accuracy loss. Additionally, we introduce a simulated pruning strategy with the same effects of weight recovery but while maintaining stable convergence. Furthermore, we propose a multistep self-knowledge distillation strategy to effectively transfer the knowledge of the full, unpruned network to the pruned counterpart. We validate the performance of our algorithm through extensive experimentation on diverse benchmark datasets, including CIFAR-10 and ImageNet, as well as a set of model architectures. The results highlight how our algorithm prunes and optimizes pretrained NNs without substantially degrading their classification accuracy while delivering significantly faster and more compact models. Impact Statement—In recent times, NNs have demonstrated remarkable outcomes in various tasks. Some of the most advanced possess billions of trainable parameters, making their training and inference both energy intensive and costly. As a result, the focus on pruning is growing in response to the escalating demand for NNs. However, most current pruning techniques involve training a model from scratch or with a lengthy training process leading to a significant increase in carbon footprint, and some experience a notable drop in performance. In this article, we introduce DG2PF. This unstruct
Wireless sensor network (WSN) applications are added day by day owing to numerous global uses (by the military, for monitoring the atmosphere, in disaster relief, and so on). Here, trust management is a main challenge...
详细信息
Climate change poses significant challenges worldwide, with urban areas particularly susceptible to its impacts. Understanding local climate trends is essential for informed decision-making and proactive measures towa...
详细信息
暂无评论