27 papers · ranked by Valyu relevance
Authors not listed
— In this paper, we present a detailed convergence analysis of a recently developed approximate Newton-type fully distributed optimization method for smooth, strongly convex local loss functions, called Network-GIANT (adapted from the Federated learning algorithm GIANT possessing mixed linear-quadratic convergence…
Jiaxu Liu, Song Chen, Shengze Cai, Chao Xu + 1 more
— In this paper, we investigate a distributed aggregative optimization problem in a network, where each agent has its own local cost function which depends not only on the local state variable but also on an aggregated function of state variables from all agents. To accelerate the optimization process, we combine heavy…
Artin Spiridonoff, Alex Olshevsky, Ioannis Ch. Paschalidis
We consider the standard model of distributed optimization of a sum of functions $F(z)=\sum_{i=1}^{n}f_{i}(z)$, where node i in a network holds the function fi(z). We allow for a harsh network model characterized by asynchronous updates, message delays, unpredictable message losses, and directed communication among…
Jinming Xu, Shanying Zhu, Yeng Chai Soh, Lihua Xie
—We consider distributed optimization problems in which a group of agents are to collaboratively seek the global optimum through peer-to-peer communication networks. The problem arises in various application areas, such as resource allocation, sensor fusion and distributed learning. We propose a general efficient…
Feilong Guo, Xinrui Chen, Mengyao Yue, Haijun Jiang + 2 more
'António Lopes'] This study aims to unravel the resource allocation problem (RAP) by using a consensus-based distributed optimization algorithm under dynamic event-triggered (DET) strategies. Firstly, based on the multi-agent consensus approach, a novel one-to-all DET strategy is presented to solve the RAP. Secondly…
Rasul Tutunov, Haitham Bou Ammar, Ali Jadbabaie
In this paper, we propose a distributed Newton method for consensus optimization. Our approach outperforms state-of-the-art methods, including ADMM. The key idea is to exploit the sparsity of the dual Hessian and recast the computation of the Newton step as one of efficiently solving symmetric diagonally dominant…
Xu Du, Shuting Wu, Karl H. Johansson, Apostolos I. Rikos
Non-smooth and non-convex optimization problems are pervasive in machine learning, control, and signal processing, due to the need for sparse solutions and the inherently non-convex nature of many objective functions. In this paper, we study non-smooth and non-convex distributed optimization problems. We propose a…
Ola Shorinwa, Trevor Halsted, Javier Yu, Mac Schwager
—Although the field of distributed optimization is well-developed, relevant literature focused on the application of distributed optimization to multi-robot problems is limited. This survey constitutes the second part of a two-part series on distributed optimization applied to multi-robot problems. In this paper, we…
Kalwar, Durgesh, Baranwal, Mayank + 2 more
In today's data-sensitive landscape, distributed learning emerges as a vital tool, not only fortifying privacy measures but also streamlining computational operations. This becomes especially crucial within fully decentralized infrastructures where local processing is imperative due to the absence of centralized…
Zihao Ren, Lei Wang, Zhengguang Wu, Guodong Shi
In this paper, the distributed strongly convex optimization problem is studied with spatio-temporal compressed communication and equality constraints. For the case where each agent holds an distributed local equality constraint, a distributed saddle-point algorithm is proposed by employing distributed filters to derive…
Shuo Wang, Yongcai Wang, Deying Li, Qianchuan Zhao + 1 more
For a network of robots working in a specific environment, relative localization among robots is the basis for accomplishing various upper-level tasks. To avoid the latency and fragility of long-range or multi-hop communication, distributed relative localization algorithms, in which robots take local measurements and…
Dinesh Krishnamoorthy
This paper proposes a general-purpose multi-agent Bayesian optimization (MABO) where agents are connected via shared variables or constraints, and each agent’s local cost is unknown. The proposed approach is general-purpose in the sense that it can be used with a broad class of decomposition methods, whereby we augment…
Meifeng Shi, Feipeng Liang, Yuan Chen, Ying He + 1 more
As an important incomplete algorithm for solving Distributed Constraint Optimization Problems (DCOPs), local search algorithms exhibit the advantages of flexibility, high efficiency and high fault tolerance. However, the significant historical values of agents that affect the local cost and global cost are never taken…
J Kyle Medley, Shaik Asifullah, Joseph Hellerstein, Herbert M Sauro
Mechanistic kinetic models of biological pathways are an important tool for understanding biological systems. Constructing kinetic models requires fitting the parameters to experimental data. However, parameter fitting on these models is a non–convex, non–linear optimization problem. Many algorithms have been proposed…
Matheus Sant’Ana Lima, Seyedali Mirjalili
Distributed Systems architectures are becoming the standard computational model for processing and transportation of information, especially for Cloud Computing environments. The increase in demand for application processing and data management from enterprise and end-user workloads continues to move from a single-node…
Bishal Thapaliya, Riyasat Ohib, Eloy Geenjar, Jingyu Liu + 2 more
Recent advancements in neuroimaging have led to greater data sharing among the scientific community. However, institutions frequently maintain control over their data, citing concerns related to research culture, privacy, and accountability. This creates a demand for innovative tools capable of analyzing amalgamated…
Swier Garst, Julian Dekker, Marcel Reinders
Federated learning is an upcoming machine learning paradigm which allows data from multiple sources to be used for training of classifiers without the data leaving the source it originally resides. This can be highly valuable for use cases such as medical research, where gathering data at a central location can be…
Haotian Li
Machine learning and deep learning are novel and trending approaches to solving real-world scientific problems. Graph machine learning is dedicated to performing learning methods, such as graph neural networks, on non-Euclidean data such as graphs. Molecules, with their natural graph structures, could be analyzed by…
Authors not listed
Machine olfaction—the artificial replication of the sense of smell—faces significant challenges due to the absence of large, standardized training datasets. Unlike vision, language, and audio models, which benefit from extensive corpora such as ImageNet, GLUE, and AudioSet, olfaction lacks scaled equivalents and…
Máté Mohácsi, Márk Patrik Török, Sára Sáray, Luca Tar + 1 more
Finding optimal parameters for detailed neuronal models is a ubiquitous challenge in neuroscientific research. Recently, manual model tuning has been replaced by automated parameter search using a variety of different tools and methods. However, using most of these software tools and choosing the most appropriate…
Noah Lewis, Harshvardhan Gazula, Sergey M. Plis, Vince D. Calhoun
In this age of big data, large data stores allow researchers to compose robust models that are accurate and informative. In many cases, the data are stored in separate locations requiring data transfer between local sites, which can cause various practical hurdles, such as privacy concerns or heavy network load. This…
Authors not listed
Experimental design plays an important role in efficiently acquiring informative data for system characterization and deriving robust conclusions under resource limitations. Recent advancements in high-throughput experimentation coupled with machine learning have notably improved experimental procedures. While Bayesian…
Akhil Shajan, Madushanka Manathunga, Andreas Goetz, Kenneth Merz
Based on a series of energy minimizations with starting structures obtained from the Baker test set of 30 organic molecules, a comparison is made between various open- source geometry optimization codes that are interfaced with the open-source QUantum Interaction Computational Kernel (QUICK) program for gradient and…
AKHIL SHAJAN, Madushanka Manathunga, Andreas Goetz, Kenneth Merz
Based on a series of energy minimizations with starting structures obtained from the Baker test set of 30 organic molecules, a comparison is made between various open-source geometry optimization codes that are interfaced with the open-source QUantum Interaction Computational Kernel (QUICK) program for gradient and…
Authors not listed
Solving optimization problems, especially for nonlinear and constrained systems, is a challenge. Decades of specialized algorithms have been developed for general and special cases of root finding, minimization (including constraints), for parameter estimation, and mapping connected spaces. These approaches typically…
Riley Hickman, Priyansh Parakh, Austin Cheng, Qianxiang Ai + 3 more
Experiment planning algorithms are a required component of autonomous platforms for scientific discovery. Selecting a suitable optimization algorithm for a novel application is an important yet difficult choice a researcher has to make based on past empirical performance on similar tasks. To facilitate the evaluation…
Sterling Baird, Jason R. Hall, Taylor D. Sparks
Would you rather search for a line inside a cube or a point inside a square? This type of solution degeneracy often exists in physics-based simulations and wet-lab experiments, but constraining these degeneracies is often unsupported or difficult to implement in many optimization packages, requiring additional time and…