Einloggen

Thematische Bibliographien / Distributed optimization and learning / Zeitschriftenartikel

Um die anderen Arten von Veröffentlichungen zu diesem Thema anzuzeigen, folgen Sie diesem Link: Distributed optimization and learning.

Zeitschriftenartikel zum Thema „Distributed optimization and learning“

Autor: Grafiati

Veröffentlicht am 15. Februar 2025

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit Top-50 Zeitschriftenartikel für die Forschung zum Thema "Distributed optimization and learning" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Sehen Sie die Zeitschriftenartikel für verschiedene Spezialgebieten durch und erstellen Sie Ihre Bibliographie auf korrekte Weise.

1

Kamalesh, Kamalesh, und Dr Gobi Natesan. „Machine Learning-Driven Analysis of Distributed Computing Systems: Exploring Optimization and Efficiency“. International Journal of Research Publication and Reviews 5, Nr. 3 (09.03.2024): 3979–83. http://dx.doi.org/10.55248/gengpi.5.0324.0786.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

2

Mertikopoulos, Panayotis, E. Veronica Belmega, Romain Negrel und Luca Sanguinetti. „Distributed Stochastic Optimization via Matrix Exponential Learning“. IEEE Transactions on Signal Processing 65, Nr. 9 (01.05.2017): 2277–90. http://dx.doi.org/10.1109/tsp.2017.2656847.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

3

Gratton, Cristiano, Naveen K. D. Venkategowda, Reza Arablouei und Stefan Werner. „Privacy-Preserved Distributed Learning With Zeroth-Order Optimization“. IEEE Transactions on Information Forensics and Security 17 (2022): 265–79. http://dx.doi.org/10.1109/tifs.2021.3139267.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

4

Blot, Michael, David Picard, Nicolas Thome und Matthieu Cord. „Distributed optimization for deep learning with gossip exchange“. Neurocomputing 330 (Februar 2019): 287–96. http://dx.doi.org/10.1016/j.neucom.2018.11.002.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

5

Young, M. Todd, Jacob D. Hinkle, Ramakrishnan Kannan und Arvind Ramanathan. „Distributed Bayesian optimization of deep reinforcement learning algorithms“. Journal of Parallel and Distributed Computing 139 (Mai 2020): 43–52. http://dx.doi.org/10.1016/j.jpdc.2019.07.008.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

6

Nedic, Angelia. „Distributed Gradient Methods for Convex Machine Learning Problems in Networks: Distributed Optimization“. IEEE Signal Processing Magazine 37, Nr. 3 (Mai 2020): 92–101. http://dx.doi.org/10.1109/msp.2020.2975210.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

7

Lin, I.-Cheng. „Learning and Optimization over Robust Networked Systems“. ACM SIGMETRICS Performance Evaluation Review 52, Nr. 3 (09.01.2025): 23–26. https://doi.org/10.1145/3712170.3712179.

Der volle Inhalt der Quelle

Annotation:

Research Summary: 1 Introduction Networked systems are ubiquitous in our daily lives, playing a critical role across a wide range of scientific fields, including communication, machine learning, optimization, control, biology, economics, and social sciences. In machine learning and optimization, distributed learning and distributed optimization exploit the structure of such networked systems, which enables training models across multiple users [1] and solving complex problems by partitioning tasks among interconnected agents [2]. This significantly enhances both scalability and efficiency of the learning/optimization task. In control systems, for example, networked architectures synchronize the operations of different parts of the system like sensors, controllers etc. across distributed environments, ensuring the overall system's stability and performance [3]. In economics, networked systems were utilized to capture the interdependencies between different part of the economic system, allowing further insights of market dynamics [4]. In the social sciences, specifically social networks, study the propagation of idea, behaviors and opinions, offering a deeper understanding of societal structures and its dynamics [5].

APA, Harvard, Vancouver, ISO und andere Zitierweisen

8

Gao, Hongchang. „Distributed Stochastic Nested Optimization for Emerging Machine Learning Models: Algorithm and Theory“. Proceedings of the AAAI Conference on Artificial Intelligence 37, Nr. 13 (26.06.2023): 15437. http://dx.doi.org/10.1609/aaai.v37i13.26804.

Der volle Inhalt der Quelle

Annotation:

Traditional machine learning models can be formulated as the expected risk minimization (ERM) problem: minw∈Rd Eξ [l(w; ξ)], where w ∈ Rd denotes the model parameter, ξ represents training samples, l(·) is the loss function. Numerous optimization algorithms, such as stochastic gradient descent (SGD), have been developed to solve the ERM problem. However, a wide range of emerging machine learning models are beyond this class of optimization problems, such as model-agnostic meta-learning (Finn, Abbeel, and Levine 2017). Of particular interest of my research is the stochastic nested optimization (SNO) problem, whose objective function has a nested structure. Specifically, I have been focusing on two instances of this kind of problem: stochastic compositional optimization (SCO) problems, which cover meta-learning, area-under-the-precision recall-curve optimization, contrastive self-supervised learning, etc., and stochastic bilevel optimization (SBO) problems, which can be applied to meta-learning, hyperparameter optimization, neural network architecture search, etc. With the emergence of large-scale distributed data, such as the user data generated on mobile devices or intelligent hardware, it is imperative to develop distributed optimization algorithms for SNO (Distributed SNO). A significant challenge for optimizing distributed SNO problems lies in that the stochastic (hyper-)gradient is a biased estimation of the full gradient. Thus, existing distributed optimization algorithms when applied to them suffer from slow convergence rates. In this talk, I will discuss my recent works about distributed SCO (Gao and Huang 2021; Gao, Li, and Huang 2022) and distributed SBO (Gao, Gu, and Thai 2022; Gao 2022) under both centralized and decentralized settings, including algorithmic details about reducing the bias of stochastic gradient, theoretical convergence rate, and practical machine learning applications, and then highlight challenges for future research.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

9

Choi, Dojin, Jiwon Wee, Sangho Song, Hyeonbyeong Lee, Jongtae Lim, Kyoungsoo Bok und Jaesoo Yoo. „k-NN Query Optimization for High-Dimensional Index Using Machine Learning“. Electronics 12, Nr. 11 (24.05.2023): 2375. http://dx.doi.org/10.3390/electronics12112375.

Der volle Inhalt der Quelle

Annotation:

In this study, we propose three k-nearest neighbor (k-NN) optimization techniques for a distributed, in-memory-based, high-dimensional indexing method to speed up content-based image retrieval. The proposed techniques perform distributed, in-memory, high-dimensional indexing-based k-NN query optimization: a density-based optimization technique that performs k-NN optimization using data distribution; a cost-based optimization technique using query processing cost statistics; and a learning-based optimization technique using a deep learning model, based on query logs. The proposed techniques were implemented on Spark, which supports a master/slave model for large-scale distributed processing. We showed the superiority and validity of the proposed techniques through various performance evaluations, based on high-dimensional data.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

10

Yang, Peng, und Ping Li. „Distributed Primal-Dual Optimization for Online Multi-Task Learning“. Proceedings of the AAAI Conference on Artificial Intelligence 34, Nr. 04 (03.04.2020): 6631–38. http://dx.doi.org/10.1609/aaai.v34i04.6139.

Der volle Inhalt der Quelle

Annotation:

Conventional online multi-task learning algorithms suffer from two critical limitations: 1) Heavy communication caused by delivering high velocity of sequential data to a central machine; 2) Expensive runtime complexity for building task relatedness. To address these issues, in this paper we consider a setting where multiple tasks are geographically located in different places, where one task can synchronize data with others to leverage knowledge of related tasks. Specifically, we propose an adaptive primal-dual algorithm, which not only captures task-specific noise in adversarial learning but also carries out a projection-free update with runtime efficiency. Moreover, our model is well-suited to decentralized periodic-connected tasks as it allows the energy-starved or bandwidth-constraint tasks to postpone the update. Theoretical results demonstrate the convergence guarantee of our distributed algorithm with an optimal regret. Empirical results confirm that the proposed model is highly effective on various real-world datasets.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

11

Shokoohi, Maryam, Mohsen Afsharchi und Hamed Shah-Hoseini. „Dynamic distributed constraint optimization using multi-agent reinforcement learning“. Soft Computing 26, Nr. 8 (16.03.2022): 3601–29. http://dx.doi.org/10.1007/s00500-022-06820-7.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

12

Lee, Jaehwan, Hyeonseong Choi, Hyeonwoo Jeong, Baekhyeon Noh und Ji Sun Shin. „Communication Optimization Schemes for Accelerating Distributed Deep Learning Systems“. Applied Sciences 10, Nr. 24 (10.12.2020): 8846. http://dx.doi.org/10.3390/app10248846.

Der volle Inhalt der Quelle

Annotation:

In a distributed deep learning system, a parameter server and workers must communicate to exchange gradients and parameters, and the communication cost increases as the number of workers increases. This paper presents a communication data optimization scheme to mitigate the decrease in throughput due to communication performance bottlenecks in distributed deep learning. To optimize communication, we propose two methods. The first is a layer dropping scheme to reduce communication data. The layer dropping scheme we propose compares the representative values of each hidden layer with a threshold value. Furthermore, to guarantee the training accuracy, we store the gradients that are not transmitted to the parameter server in the worker’s local cache. When the value of gradients stored in the worker’s local cache is greater than the threshold, the gradients stored in the worker’s local cache are transmitted to the parameter server. The second is an efficient threshold selection method. Our threshold selection method computes the threshold by replacing the gradients with the L1 norm of each hidden layer. Our data optimization scheme reduces the communication time by about 81% and the total training time by about 70% in a 56 Gbit network environment.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

13

Pugh, Jim, und Alcherio Martinoli. „Distributed scalable multi-robot learning using particle swarm optimization“. Swarm Intelligence 3, Nr. 3 (27.05.2009): 203–22. http://dx.doi.org/10.1007/s11721-009-0030-z.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

14

Kazhmaganbetova, Zarina, Shnar Imangaliyev und Altynbek Sharipbay. „Machine Learning for the Communication Optimization in Distributed Systems“. International Journal of Engineering & Technology 7, Nr. 4.1 (12.09.2018): 47. http://dx.doi.org/10.14419/ijet.v7i4.1.19491.

Der volle Inhalt der Quelle

Annotation:

The objective of the work that is presented in this paper was the problem of the communication optimization and detection of the issues of computing resources performance degradation [1, 2] with the usage of machine learning techniques. Computer networks transmit payload data and the meta-data from numerous sources towards vast number of destinations, especially in multi-tenant environments [3, 4]. Meta data describes the payload data and could be analyzed for anomalies detection in the communication patterns. Communication patterns depend on the payload itself and technical protocol used. The technical patterns are the research target as their analysis could spotlight the vulnerable behavior, for example: unusual traffic, extra load transported and etc.There was a big data used to train model with a supervised machine learning. Dataset was collected from the network interfaces of the distributed application infrastructure. Machine Learning tools had been retained from the cloud services provider – Amazon Web Services. The stochastic gradient descent technique was utilized for the model training, so that it could represent the communication patterns in the system. The learning target parameter was a packet length, the regression was performed to understand the relationship between packet meta-data (timestamp, protocol, the source server) and its length. The root mean square error calculation was applied to evaluate the learning efficiency. After model was prepared using training dataset, the model was tested with the test dataset and then applied on the target dataset (dataset for prediction) to check whether it was capable to detect anomalies.The experimental part showed the applicability of machine learning for the communication optimization in the distributed application environment. By means of the trained artificial intelligence model, it was possible to predict target parameters of traffic and computing resources usage with purpose to avoid service degradation. Additionally, one could reveal anomalies in the transferred traffic between application components. The application of techniques is envisioned in information security field and in the field of efficient network resources planning.Further research could be in application machine learning techniques for more complicated distributed environments and enlarging the number of protocols to prepare communication patterns.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

15

Medyakov, D., G. Molodtsov, A. Beznosikov und A. Gasnikov. „Optimal Data Splitting in Distributed Optimization for Machine Learning“. Doklady Mathematics 108, S2 (Dezember 2023): S465—S475. http://dx.doi.org/10.1134/s1064562423701600.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

16

Yang, Dezhi, Xintong He, Jun Wang, Guoxian Yu, Carlotta Domeniconi und Jinglin Zhang. „Federated Causality Learning with Explainable Adaptive Optimization“. Proceedings of the AAAI Conference on Artificial Intelligence 38, Nr. 15 (24.03.2024): 16308–15. http://dx.doi.org/10.1609/aaai.v38i15.29566.

Der volle Inhalt der Quelle

Annotation:

Discovering the causality from observational data is a crucial task in various scientific domains. With increasing awareness of privacy, data are not allowed to be exposed, and it is very hard to learn causal graphs from dispersed data, since these data may have different distributions. In this paper, we propose a federated causal discovery strategy (FedCausal) to learn the unified global causal graph from decentralized heterogeneous data. We design a global optimization formula to naturally aggregate the causal graphs from client data and constrain the acyclicity of the global graph without exposing local data. Unlike other federated causal learning algorithms, FedCausal unifies the local and global optimizations into a complete directed acyclic graph (DAG) learning process with a flexible optimization objective. We prove that this optimization objective has a high interpretability and can adaptively handle homogeneous and heterogeneous data. Experimental results on synthetic and real datasets show that FedCausal can effectively deal with non-independently and identically distributed (non-iid) data and has a superior performance.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

17

Mar’i, Farhanna, und Ahmad Afif Supianto. „A conceptual approach of optimization in federated learning“. Indonesian Journal of Electrical Engineering and Computer Science 37, Nr. 1 (01.01.2025): 288. http://dx.doi.org/10.11591/ijeecs.v37.i1.pp288-299.

Der volle Inhalt der Quelle

Annotation:

Federated learning (FL) is an emerging approach to distributed learning from decentralized data, designed with privacy concerns in mind. FL has been successfully applied in several fields, such as the internet of things (IoT), human activity recognition (HAR), and natural language processing (NLP), showing remarkable results. However, the development of FL in real-world applications still faces several challenges. Recent optimizations of FL have been made to address these issues and enhance the FL settings. In this paper, we categorize the optimization of FL into five main challenges: Communication Efficiency, Heterogeneity, Privacy and Security, Scalability, and Convergence Rate. We provide an overview of various optimization frameworks for FL proposed in previous research, illustrated with concrete examples and applications based on these five optimization goals. Additionally, we propose two optional integrated conceptual frameworks (CFs) for optimizing FL by combining several optimization methods to achieve the best implementation of FL that addresses the five challenges.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

18

Shi, Junjie, Jiang Bian, Jakob Richter, Kuan-Hsun Chen, Jörg Rahnenführer, Haoyi Xiong und Jian-Jia Chen. „MODES: model-based optimization on distributed embedded systems“. Machine Learning 110, Nr. 6 (Juni 2021): 1527–47. http://dx.doi.org/10.1007/s10994-021-06014-6.

Der volle Inhalt der Quelle

Annotation:

AbstractThe predictive performance of a machine learning model highly depends on the corresponding hyper-parameter setting. Hence, hyper-parameter tuning is often indispensable. Normally such tuning requires the dedicated machine learning model to be trained and evaluated on centralized data to obtain a performance estimate. However, in a distributed machine learning scenario, it is not always possible to collect all the data from all nodes due to privacy concerns or storage limitations. Moreover, if data has to be transferred through low bandwidth connections it reduces the time available for tuning. Model-Based Optimization (MBO) is one state-of-the-art method for tuning hyper-parameters but the application on distributed machine learning models or federated learning lacks research. This work proposes a framework $$\textit{MODES}$$ MODES that allows to deploy MBO on resource-constrained distributed embedded systems. Each node trains an individual model based on its local data. The goal is to optimize the combined prediction accuracy. The presented framework offers two optimization modes: (1) $$\textit{MODES}$$ MODES -B considers the whole ensemble as a single black box and optimizes the hyper-parameters of each individual model jointly, and (2) $$\textit{MODES}$$ MODES -I considers all models as clones of the same black box which allows it to efficiently parallelize the optimization in a distributed setting. We evaluate $$\textit{MODES}$$ MODES by conducting experiments on the optimization for the hyper-parameters of a random forest and a multi-layer perceptron. The experimental results demonstrate that, with an improvement in terms of mean accuracy ($$\textit{MODES}$$ MODES -B), run-time efficiency ($$\textit{MODES}$$ MODES -I), and statistical stability for both modes, $$\textit{MODES}$$ MODES outperforms the baseline, i.e., carry out tuning with MBO on each node individually with its local sub-data set.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

19

Zhang, Chongjie, und Victor Lesser. „Coordinated Multi-Agent Reinforcement Learning in Networked Distributed POMDPs“. Proceedings of the AAAI Conference on Artificial Intelligence 25, Nr. 1 (04.08.2011): 764–70. http://dx.doi.org/10.1609/aaai.v25i1.7886.

Der volle Inhalt der Quelle

Annotation:

In many multi-agent applications such as distributed sensor nets, a network of agents act collaboratively under uncertainty and local interactions. Networked Distributed POMDP (ND-POMDP) provides a framework to model such cooperative multi-agent decision making. Existing work on ND-POMDPs has focused on offline techniques that require accurate models, which are usually costly to obtain in practice. This paper presents a model-free, scalable learning approach that synthesizes multi-agent reinforcement learning (MARL) and distributed constraint optimization (DCOP). By exploiting structured interaction in ND-POMDPs, our approach distributes the learning of the joint policy and employs DCOP techniques to coordinate distributed learning to ensure the global learning performance. Our approach can learn a globally optimal policy for ND-POMDPs with a property called groupwise observability. Experimental results show that, with communication during learning and execution, our approach significantly outperforms the nearly-optimal non-communication policies computed offline.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

20

Veerappa, Praveena Mydolalu, und Ajeet Annarao Chikkamannur. „Prime Learning – Ant Colony Optimization Technique for Query Optimization in Distributed Database System“. International Journal of Engineering Trends and Technology 70, Nr. 8 (31.08.2022): 158–65. http://dx.doi.org/10.14445/22315381/ijett-v70i8p216.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

21

Zhang, Xin, und Ahmed Eldawy. „Spatial Query Optimization With Learning“. Proceedings of the VLDB Endowment 17, Nr. 12 (August 2024): 4245–48. http://dx.doi.org/10.14778/3685800.3685846.

Der volle Inhalt der Quelle

Annotation:

Query optimization is a key component in database management systems (DBMS) and distributed data processing platforms. Recent research in the database community incorporated techniques from artificial intelligence to enhance query optimization. Various learning models have been extended and applied to the query optimization tasks, including query execution plan, query rewriting, and cost estimation. The tasks involved in query optimization differ based on the type of data being processed, such as relational data or spatial geometries. This tutorial reviews recent learning-based approaches for spatial query optimization tasks. We go over methods designed specifically for spatial data, as well as solutions proposed for high-dimensional data. Additionally, we present learning-based spatial indexing and spatial partitioning methods, which are also vital components in spatial data processing. We also identify several open research problems in these fields.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

22

Xian, Wenhan, Feihu Huang und Heng Huang. „Communication-Efficient Frank-Wolfe Algorithm for Nonconvex Decentralized Distributed Learning“. Proceedings of the AAAI Conference on Artificial Intelligence 35, Nr. 12 (18.05.2021): 10405–13. http://dx.doi.org/10.1609/aaai.v35i12.17246.

Der volle Inhalt der Quelle

Annotation:

Recently decentralized optimization attracts much attention in machine learning because it is more communication-efficient than the centralized fashion. Quantization is a promising method to reduce the communication cost via cutting down the budget of each single communication using the gradient compression. To further improve the communication efficiency, more recently, some quantized decentralized algorithms have been studied. However, the quantized decentralized algorithm for nonconvex constrained machine learning problems is still limited. Frank-Wolfe (a.k.a., conditional gradient or projection-free) method is very efficient to solve many constrained optimization tasks, such as low-rank or sparsity-constrained models training. In this paper, to fill the gap of decentralized quantized constrained optimization, we propose a novel communication-efficient Decentralized Quantized Stochastic Frank-Wolfe (DQSFW) algorithm for non-convex constrained learning models. We first design a new counterexample to show that the vanilla decentralized quantized stochastic Frank-Wolfe algorithm usually diverges. Thus, we propose DQSFW algorithm with the gradient tracking technique to guarantee the method will converge to the stationary point of non-convex optimization safely. In our theoretical analysis, we prove that to achieve the stationary point our DQSFW algorithm achieves the same gradient complexity as the standard stochastic Frank-Wolfe and centralized Frank-Wolfe algorithms, but has much less communication cost. Experiments on matrix completion and model compression applications demonstrate the efficiency of our new algorithm.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

23

Alistarh, Dan. „Distributed Computing Column 85 Elastic Consistency“. ACM SIGACT News 53, Nr. 2 (10.06.2022): 63. http://dx.doi.org/10.1145/3544979.3544990.

Der volle Inhalt der Quelle

Annotation:

Overview. In this column, we attempt to cover a new and exciting area in distributed computing, that is, distributed and parallel machine learning. Together with my students Giorgi Nadiradze and Ilia Markov, I share an expository version of a recent conference paper [30] which attempts to provide a "consistency condition" for optimization problems which appear in distributed computing and machine learning applications.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

24

Qin, Yude, Ji Ke, Biao Wang und Gennady Fedorovich Filaretov. „Energy optimization for regional buildings based on distributed reinforcement learning“. Sustainable Cities and Society 78 (März 2022): 103625. http://dx.doi.org/10.1016/j.scs.2021.103625.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

25

Yu, Javier, Joseph A. Vincent und Mac Schwager. „DiNNO: Distributed Neural Network Optimization for Multi-Robot Collaborative Learning“. IEEE Robotics and Automation Letters 7, Nr. 2 (April 2022): 1896–903. http://dx.doi.org/10.1109/lra.2022.3142402.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

26

Chen, Jianshu, und Ali H. Sayed. „Diffusion Adaptation Strategies for Distributed Optimization and Learning Over Networks“. IEEE Transactions on Signal Processing 60, Nr. 8 (August 2012): 4289–305. http://dx.doi.org/10.1109/tsp.2012.2198470.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

27

Lee, Hoon, Sang Hyun Lee und Tony Q. S. Quek. „Deep Learning for Distributed Optimization: Applications to Wireless Resource Management“. IEEE Journal on Selected Areas in Communications 37, Nr. 10 (Oktober 2019): 2251–66. http://dx.doi.org/10.1109/jsac.2019.2933890.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

28

Wen, Jing. „Distributed reinforcement learning-based optimization of resource scheduling for telematics“. Computers and Electrical Engineering 118 (September 2024): 109464. http://dx.doi.org/10.1016/j.compeleceng.2024.109464.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

29

Zhang, Zhaojuan, Wanliang Wang und Gaofeng Pan. „A Distributed Quantum-Behaved Particle Swarm Optimization Using Opposition-Based Learning on Spark for Large-Scale Optimization Problem“. Mathematics 8, Nr. 11 (23.10.2020): 1860. http://dx.doi.org/10.3390/math8111860.

Der volle Inhalt der Quelle

Annotation:

In the era of big data, the size and complexity of the data are increasing especially for those stored in remote locations, and whose difficulty is further increased by the ongoing rapid accumulation of data scale. Real-world optimization problems present new challenges to traditional intelligent optimization algorithms since the traditional serial optimization algorithm has a high computational cost or even cannot deal with it when faced with large-scale distributed data. Responding to these challenges, a distributed cooperative evolutionary algorithm framework using Spark (SDCEA) is first proposed. The SDCEA can be applied to address the challenge due to insufficient computing resources. Second, a distributed quantum-behaved particle swarm optimization algorithm (SDQPSO) based on the SDCEA is proposed, where the opposition-based learning scheme is incorporated to initialize the population, and a parallel search is conducted on distributed spaces. Finally, the performance of the proposed SDQPSO is tested. In comparison with SPSO, SCLPSO, and SALCPSO, SDQPSO can not only improve the search efficiency but also search for a better optimum with almost the same computational cost for the large-scale distributed optimization problem. In conclusion, the proposed SDQPSO based on the SDCEA framework has high scalability, which can be applied to solve the large-scale optimization problem.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

30

Gunuganti, Anvesh. „Federated Learning“. Journal of Artificial Intelligence & Cloud Computing 1, Nr. 2 (30.06.2022): 1–6. http://dx.doi.org/10.47363/jaicc/2022(1)360.

Der volle Inhalt der Quelle

Annotation:

Federated Learning (FL) serves as one of the groundbreaking approaches in the present society, particularly in smart mobile applications, for designing a distributed environment for clients' model training without compromising data ownership. This paper narrows down the focus to how FL emerged, how it fits in distributed systems, and its usefulness in different fields. Research findings derived from thematic analysis include FL's contribution to improving the functionality of mobile applications and managing data privacy issues. Recommendations for the actual FL application underline such aspects as data management and protection. Optimization, privacy, and novelty areas of FL are the areas for further study in the field, as per the conclusion of the study.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

31

Xu, Wencai. „Efficient Distributed Image Recognition Algorithm of Deep Learning Framework TensorFlow“. Journal of Physics: Conference Series 2066, Nr. 1 (01.11.2021): 012070. http://dx.doi.org/10.1088/1742-6596/2066/1/012070.

Der volle Inhalt der Quelle

Annotation:

Abstract Deep learning requires training on massive data to get the ability to deal with unfamiliar data in the future, but it is not as easy to get a good model from training on massive data. Because of the requirements of deep learning tasks, a deep learning framework has also emerged. This article mainly studies the efficient distributed image recognition algorithm of the deep learning framework TensorFlow. This paper studies the deep learning framework TensorFlow itself and the related theoretical knowledge of its parallel execution, which lays a theoretical foundation for the design and implementation of the TensorFlow distributed parallel optimization algorithm. This paper designs and implements a more efficient TensorFlow distributed parallel algorithm, and designs and implements different optimization algorithms from TensorFlow data parallelism and model parallelism. Through multiple sets of comparative experiments, this paper verifies the effectiveness of the two optimization algorithms implemented in this paper for improving the speed of TensorFlow distributed parallel iteration. The results of research experiments show that the 12 sets of experiments finally achieved a stable model accuracy rate, and the accuracy rate of each set of experiments is above 97%. It can be seen that the distributed algorithm of using a suitable deep learning framework TensorFlow can be implemented in the goal of effectively reducing model training time without reducing the accuracy of the final model.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

32

Fattahi, Salar, Nikolai Matni und Somayeh Sojoudi. „Efficient Learning of Distributed Linear-Quadratic Control Policies“. SIAM Journal on Control and Optimization 58, Nr. 5 (Januar 2020): 2927–51. http://dx.doi.org/10.1137/19m1291108.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

33

Wang, Yibo, Yuanyu Wan, Shimao Zhang und Lijun Zhang. „Distributed Projection-Free Online Learning for Smooth and Convex Losses“. Proceedings of the AAAI Conference on Artificial Intelligence 37, Nr. 8 (26.06.2023): 10226–34. http://dx.doi.org/10.1609/aaai.v37i8.26218.

Der volle Inhalt der Quelle

Annotation:

We investigate the problem of distributed online convex optimization with complicated constraints, in which the projection operation could be the computational bottleneck. To avoid projections, distributed online projection-free methods have been proposed and attain an O(T^{3/4}) regret bound for general convex losses. However, they cannot utilize the smoothness condition, which has been exploited in the centralized setting to improve the regret. In this paper, we propose a new distributed online projection-free method with a tighter regret bound of O(T^{2/3}) for smooth and convex losses. Specifically, we first provide a distributed extension of Follow-the-Perturbed-Leader so that the smoothness can be utilized in the distributed setting. Then, we reduce the computational cost via sampling and blocking techniques. In this way, our method only needs to solve one linear optimization per round on average. Finally, we conduct experiments on benchmark datasets to verify the effectiveness of our proposed method.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

34

Wang, Shikai, Haotian Zheng, Xin Wen und Shang Fu. „DISTRIBUTED HIGH-PERFORMANCE COMPUTING METHODS FOR ACCELERATING DEEP LEARNING TRAINING“. Journal of Knowledge Learning and Science Technology ISSN: 2959-6386 (online) 3, Nr. 3 (25.09.2024): 108–26. http://dx.doi.org/10.60087/jklst.v3.n4.p22.

Der volle Inhalt der Quelle

Annotation:

This paper comprehensively analyzes distributed high-performance computing methods for accelerating deep learning training. We explore the evolution of distributed computing architectures, including data parallelism, model parallelism, and pipeline parallelism, and their hybrid implementations. The study delves into optimization techniques crucial for large-scale training, such as distributed optimization algorithms, gradient compression, and adaptive learning rate methods. We investigate communication-efficient algorithms, including Ring All Reduce variants and decentralized training approaches, which address the scalability challenges in distributed systems. The research examines hardware acceleration and specialized systems, focusing on GPU clusters, custom AI accelerators, high-performance interconnects, and distributed storage systems optimized for deep learning workloads. Finally, we discuss this field's challenges and future directions, including scalability-efficiency trade-offs, fault tolerance, energy efficiency in large-scale training, and emerging trends like federated learning and neuromorphic computing. Our findings highlight the synergy between advanced algorithms, specialized hardware, and optimized system designs in pushing the boundaries of large-scale deep learning, paving the way for future breakthroughs in artificial intelligence.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

35

Wang, Shikai, Haotian Zheng, Xin Wen und Shang Fu. „DISTRIBUTED HIGH-PERFORMANCE COMPUTING METHODS FOR ACCELERATING DEEP LEARNING TRAINING“. Journal of Knowledge Learning and Science Technology ISSN: 2959-6386 (online) 3, Nr. 3 (25.09.2024): 108–26. http://dx.doi.org/10.60087/jklst.v3.n3.p108-126.

Der volle Inhalt der Quelle

Annotation:

This paper comprehensively analyzes distributed high-performance computing methods for accelerating deep learning training. We explore the evolution of distributed computing architectures, including data parallelism, model parallelism, and pipeline parallelism, and their hybrid implementations. The study delves into optimization techniques crucial for large-scale training, such as distributed optimization algorithms, gradient compression, and adaptive learning rate methods. We investigate communication-efficient algorithms, including Ring All Reduce variants and decentralized training approaches, which address the scalability challenges in distributed systems. The research examines hardware acceleration and specialized systems, focusing on GPU clusters, custom AI accelerators, high-performance interconnects, and distributed storage systems optimized for deep learning workloads. Finally, we discuss this field's challenges and future directions, including scalability-efficiency trade-offs, fault tolerance, energy efficiency in large-scale training, and emerging trends like federated learning and neuromorphic computing. Our findings highlight the synergy between advanced algorithms, specialized hardware, and optimized system designs in pushing the boundaries of large-scale deep learning, paving the way for future breakthroughs in artificial intelligence.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

36

Deng, Yanchen, Shufeng Kong und Bo An. „Pretrained Cost Model for Distributed Constraint Optimization Problems“. Proceedings of the AAAI Conference on Artificial Intelligence 36, Nr. 9 (28.06.2022): 9331–40. http://dx.doi.org/10.1609/aaai.v36i9.21164.

Der volle Inhalt der Quelle

Annotation:

Distributed Constraint Optimization Problems (DCOPs) are an important subclass of combinatorial optimization problems, where information and controls are distributed among multiple autonomous agents. Previously, Machine Learning (ML) has been largely applied to solve combinatorial optimization problems by learning effective heuristics. However, existing ML-based heuristic methods are often not generalizable to different search algorithms. Most importantly, these methods usually require full knowledge about the problems to be solved, which are not suitable for distributed settings where centralization is not realistic due to geographical limitations or privacy concerns. To address the generality issue, we propose a novel directed acyclic graph representation schema for DCOPs and leverage the Graph Attention Networks (GATs) to embed graph representations. Our model, GAT-PCM, is then pretrained with optimally labelled data in an offline manner, so as to construct effective heuristics to boost a broad range of DCOP algorithms where evaluating the quality of a partial assignment is critical, such as local search or backtracking search. Furthermore, to enable decentralized model inference, we propose a distributed embedding schema of GAT-PCM where each agent exchanges only embedded vectors, and show its soundness and complexity. Finally, we demonstrate the effectiveness of our model by combining it with a local search or a backtracking search algorithm. Extensive empirical evaluations indicate that the GAT-PCM-boosted algorithms significantly outperform the state-of-the-art methods in various benchmarks.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

37

Taheri, Seyed Iman, Mohammadreza Davoodi und Mohd Hasan Ali. „A Simulated-Annealing-Quasi-Oppositional-Teaching-Learning-Based Optimization Algorithm for Distributed Generation Allocation“. Computation 11, Nr. 11 (02.11.2023): 214. http://dx.doi.org/10.3390/computation11110214.

Der volle Inhalt der Quelle

Annotation:

Conventional evolutionary optimization techniques often struggle with finding global optima, getting stuck in local optima instead, and can be sensitive to initial conditions and parameter settings. Efficient Distributed Generation (DG) allocation in distribution systems hinges on streamlined optimization algorithms that handle complex energy operations, support real-time decisions, adapt to dynamics, and improve system performance, considering cost and power quality. This paper proposes the Simulated-Annealing-Quasi-Oppositional-Teaching-Learning-Based Optimization Algorithm to efficiently allocate DGs within a distribution test system. The study focuses on wind turbines, photovoltaic units, and fuel cells as prominent DG due to their growing usage trends. The optimization goals include minimizing voltage losses, reducing costs, and mitigating greenhouse gas emissions in the distribution system. The proposed algorithm is implemented and evaluated on the IEEE 70-bus test system, with a comparative analysis conducted against other evolutionary methods such as Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Honey Bee Mating Optimization (HBMO), and Teaching-Learning-Based Optimization (TLBO) algorithms. Results indicate that the proposed algorithm is effective in allocating the DGs. Statistical testing confirms significant results (probability < 0.1), indicating superior optimization capabilities for this specific problem. Crucially, the proposed algorithm excels in both accuracy and computational speed compared to other methods studied.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

38

Dai, Wei, Wei Wang, Zhongtian Mao, Ruwen Jiang, Fudong Nian und Teng Li. „Distributed Policy Evaluation with Fractional Order Dynamics in Multiagent Reinforcement Learning“. Security and Communication Networks 2021 (03.09.2021): 1–7. http://dx.doi.org/10.1155/2021/1020466.

Der volle Inhalt der Quelle

Annotation:

The main objective of multiagent reinforcement learning is to achieve a global optimal policy. It is difficult to evaluate the value function with high-dimensional state space. Therefore, we transfer the problem of multiagent reinforcement learning into a distributed optimization problem with constraint terms. In this problem, all agents share the space of states and actions, but each agent only obtains its own local reward. Then, we propose a distributed optimization with fractional order dynamics to solve this problem. Moreover, we prove the convergence of the proposed algorithm and illustrate its effectiveness with a numerical example.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

39

Li, Xinhang, Yiying Yang, Qinwen Wang, Zheng Yuan, Chen Xu, Lei Li und Lin Zhang. „A distributed multi-vehicle pursuit scheme: generative multi-adversarial reinforcement learning“. Intelligence & Robotics 3, Nr. 3 (13.09.2023): 436–52. http://dx.doi.org/10.20517/ir.2023.25.

Der volle Inhalt der Quelle

Annotation:

Multi-vehicle pursuit (MVP) is one of the most challenging problems for intelligent traffic management systems due to multi-source heterogeneous data and its mission nature. While many reinforcement learning (RL) algorithms have shown promising abilities for MVP in structured grid-pattern roads, their lack of dynamic and effective traffic awareness limits pursuing efficiency. The sparse reward of pursuing tasks still hinders the optimization of these RL algorithms. Therefore, this paper proposes a distributed generative multi-adversarial RL for MVP (DGMARL-MVP) in urban traffic scenes. In DGMARL-MVP, a generative multi-adversarial network is designed to improve the Bellman equation by generating the potential dense reward, thereby properly guiding strategy optimization of distributed multi-agent RL. Moreover, a graph neural network-based intersecting cognition is proposed to extract integrated features of traffic situations and relationships among agents from multi-source heterogeneous data. These integrated and comprehensive traffic features are used to assist RL decision-making and improve pursuing efficiency. Extensive experimental results show that the DGMARL-MVP can reduce the pursuit time by 5.47% compared with proximal policy optimization and improve the pursuing average success rate up to 85.67%. Codes are open-sourced in Github.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

40

Agrawal, Shaashwat, Sagnik Sarkar, Mamoun Alazab, Praveen Kumar Reddy Maddikunta, Thippa Reddy Gadekallu und Quoc-Viet Pham. „Genetic CFL: Hyperparameter Optimization in Clustered Federated Learning“. Computational Intelligence and Neuroscience 2021 (18.11.2021): 1–10. http://dx.doi.org/10.1155/2021/7156420.

Der volle Inhalt der Quelle

Annotation:

Federated learning (FL) is a distributed model for deep learning that integrates client-server architecture, edge computing, and real-time intelligence. FL has the capability of revolutionizing machine learning (ML) but lacks in the practicality of implementation due to technological limitations, communication overhead, non-IID (independent and identically distributed) data, and privacy concerns. Training a ML model over heterogeneous non-IID data highly degrades the convergence rate and performance. The existing traditional and clustered FL algorithms exhibit two main limitations, including inefficient client training and static hyperparameter utilization. To overcome these limitations, we propose a novel hybrid algorithm, namely, genetic clustered FL (Genetic CFL), that clusters edge devices based on the training hyperparameters and genetically modifies the parameters clusterwise. Then, we introduce an algorithm that drastically increases the individual cluster accuracy by integrating the density-based clustering and genetic hyperparameter optimization. The results are bench-marked using MNIST handwritten digit dataset and the CIFAR-10 dataset. The proposed genetic CFL shows significant improvements and works well with realistic cases of non-IID and ambiguous data. An accuracy of 99.79% is observed in the MNIST dataset and 76.88% in CIFAR-10 dataset with only 10 training rounds.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

41

Mantri, Arjun. „Advanced ML (Machine Learning) Techniques for Optimizing ETL Workflows with Apache Spark and Snowflake“. Journal of Artificial Intelligence & Cloud Computing 2, Nr. 3 (30.09.2023): 1–6. http://dx.doi.org/10.47363/jaicc/2023(2)339.

Der volle Inhalt der Quelle

Annotation:

The optimization of ETL (Extract, Transform, Load) pipelines using Apache Spark and Snowflake. Apache Spark is a powerful open-source distributed data processing platform, while Snowflake is a cloud-native data warehousing solution. It discusses the challenges and solutions in tuning Spark configurations using machine learning techniques and optimizing Snowflake's architecture for cost efficiency and performance. Experimental results demonstrate significant performance gains and cost savings through these optimizations.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

42

JAMIAN, Jasrul Jamani, Hazlie MOKHLIS, Mohd Wazir MUSTAFA, Mohd Noor ABDULLAH und Muhammad Ariff BAHARUDIN. „Comparative learning global particle swarm optimization for optimal distributed generations' output“. TURKISH JOURNAL OF ELECTRICAL ENGINEERING & COMPUTER SCIENCES 22 (2014): 1323–37. http://dx.doi.org/10.3906/elk-1212-173.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

43

Zhang, Jilin, Hangdi Tu, Yongjian Ren, Jian Wan, Li Zhou, Mingwei Li, Jue Wang, Lifeng Yu, Chang Zhao und Lei Zhang. „A Parameter Communication Optimization Strategy for Distributed Machine Learning in Sensors“. Sensors 17, Nr. 10 (21.09.2017): 2172. http://dx.doi.org/10.3390/s17102172.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

44

Ikebou, Shigeya, Fei Qian und Hironori Hirata. „A Parallel Distributed Learning Automaton Computing Model for Function Optimization Problems“. IEEJ Transactions on Electronics, Information and Systems 121, Nr. 2 (2001): 476–77. http://dx.doi.org/10.1541/ieejeiss1987.121.2_476.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

45

Mai, Tianle, Haipeng Yao, Ni Zhang, Wenji He, Dong Guo und Mohsen Guizani. „Transfer Reinforcement Learning Aided Distributed Network Slicing Optimization in Industrial IoT“. IEEE Transactions on Industrial Informatics 18, Nr. 6 (Juni 2022): 4308–16. http://dx.doi.org/10.1109/tii.2021.3132136.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

46

He, Haibo, und He Jiang. „Deep Learning Based Energy Efficiency Optimization for Distributed Cooperative Spectrum Sensing“. IEEE Wireless Communications 26, Nr. 3 (Juni 2019): 32–39. http://dx.doi.org/10.1109/mwc.2019.1800397.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

47

Raju, Leo, Sibi Sankar und R. S. Milton. „Distributed Optimization of Solar Micro-grid Using Multi Agent Reinforcement Learning“. Procedia Computer Science 46 (2015): 231–39. http://dx.doi.org/10.1016/j.procs.2015.02.016.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

48

Simon, Dan, Arpit Shah und Carré Scheidegger. „Distributed learning with biogeography-based optimization: Markov modeling and robot control“. Swarm and Evolutionary Computation 10 (Juni 2013): 12–24. http://dx.doi.org/10.1016/j.swevo.2012.12.003.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

49

Yuan, Kun, Bicheng Ying, Xiaochuan Zhao und Ali H. Sayed. „Exact Diffusion for Distributed Optimization and Learning—Part II: Convergence Analysis“. IEEE Transactions on Signal Processing 67, Nr. 3 (01.02.2019): 724–39. http://dx.doi.org/10.1109/tsp.2018.2875883.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

50

Yuan, Kun, Bicheng Ying, Xiaochuan Zhao und Ali H. Sayed. „Exact Diffusion for Distributed Optimization and Learning—Part I: Algorithm Development“. IEEE Transactions on Signal Processing 67, Nr. 3 (01.02.2019): 708–23. http://dx.doi.org/10.1109/tsp.2018.2875898.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!