Paper uses averaging from many particle filters to approximate posterior predictive distributions.
problem Approximating posterior predictive distributions efficiently and accurately.
method Particle swarm filter algorithm that averages many particle filter approximations.
result Law of large numbers and central limit theorem support the method's effectiveness.
The paper learns particle swarming models from data using Gaussian processes.
problem Understanding the link between individual interaction rules and swarming behavior.
method Proposes a learning approach using Gaussian processes to model latent radial interaction functions and scalar parameters in non-collective friction forces.
result Establishes that a coercivity condition is sufficient for recoverability and provides a finite-sample analysis showing optimal convergence rates.
The paper connects PSO and CBO methods using stochastic modeling and mean-field limits.
problem Global optimization problems with particle swarm optimization and consensus based optimization.
method Stochastic differential equations and mean-field approximation to derive macroscopic hydrodynamic equations.
result Derives mean-field approximation for PSO and links it to CBO methods.
New algorithm uses PSO to optimize DNN training parameters in distributed systems.
problem Reducing synchronization frequency in DNN training leads to poor convergence.
method Integrates PSO into distributed training to automatically compute new parameters.
result Proposed algorithm outperforms synchronous methods in distributed DNN training.
As one of Bayesian analysis tools, Hidden Markov Model (HMM) has been used to in extensive applications. Most HMMs are solved by Baum-Welch algorithm (BWHMM) to predict the model parameters, which is difficult to find global optimal solutions. This paper proposes an optimized Hidden Markov Model with Particle Swarm Opt…
A new optimizer, MVO, improves nonlinear regression performance.
problem Finding optimal coefficients in nonlinear regression models.
method Multi-Verse Optimizer (MVO) compared to Particle Swarm Optimizer (PSO).
result MVO statistically outperforms PSO in 10 nonlinear regression problems.
AdaSwarm optimizes deep learning models with swarm intelligence, outperforming Adam.
problem Optimization challenges in deep learning models.
method AdaSwarm uses EMPSO to approximate gradients for optimization.
result AdaSwarm outperforms Adam and handles various loss functions.
PSO optimizes model parameters in nonstandard distributions.
problem Estimating model parameters in nonstandard distributions using existing algorithms.
method Particle Swarm Optimization (PSO) as an alternative optimization routine.
result PSO produces more optimal or convergent results than existing algorithms.
Empirical comparison of 18 hyperparameter tuning algorithms for SVM.
problem Tuning hyperparameters C and γ for SVM with RBF kernel. method Compared 18 search algorithms on 115 real-life data sets.
result Trees of Parzen estimators and particle swarm optimization perform similarly to grid search.
Metaheuristics optimize portfolios with pre-assignment and margin trading for better risk-adjusted returns.
problem Maximizing returns while minimizing risk in portfolio optimization.
method Incorporates pre-assignment constraints and margin trading strategies using Genetic Algorithms and Particle Swarm Optimization.
result Metaheuristic-based portfolio optimization yields superior risk-adjusted returns compared to traditional methods.
Swarm intelligence is the collective behavior emerging in systems with locally interacting components. Because of their self-organization capabilities, swarm-based systems show essential properties for handling real-world problems such as robustness, scalability, and flexibility. Yet, we do not know why swarm-based alg…
Metaheuristics improve yield curve estimation for Costa Rica.
problem Estimating the yield curve for Costa Rica using historical data.
method Used Nelson-Siegel and Svensson models with four metaheuristics (Ant colony, Genetic, Particle Swarm, Simulated Annealing) for optimization.
result Metaheuristics achieved better results than classical methods, especially Particle Swarm and Simulated Annealing.
Optimal income crossover found using particle swarm optimization.
problem Determining the crossover point between two income distributions.
method Particle swarm optimization for finding crossover income, temperature, and Pareto index.
result Optimization method finds boundaries of two income distributions.
A new time-series clustering method using slope-based similarity and PSO.
problem Clustering time-series data efficiently and accurately.
method Developed a novel slope-based similarity measure combined with Particle Swarm Optimization (PSO) for clustering.
result The proposed similarity measure outperforms existing measures in clustering time-series data.
mFI-PSO generates effective adversarial images for DNNs.
problem Vulnerability of DNNs to small perturbations in images.
method Uses mFI for pixel selection and PSO for objective functions.
result mFI-PSO effectively designs flexible adversarial images.
Gradient Descent (GD) approximators often fail in the solution space with multiple scales of convexities, i.e., in subspace learning and neural network scenarios. To handle that, one solution is to run GD multiple times from different randomized initial states and select the best solution over all experiments. However,…
AdversarialPSO uses fewer queries to create high-success-rate adversarial examples.
problem Creating imperceptible adversarial examples with high success rates in black-box settings.
method AdversarialPSO, a black-box attack using Particle Swarm Optimization.
result Achieved high success rates (99.6% on CIFAR-10, 96.3% on MNIST, 82.0% on Imagenet) with fewer queries.
Optimizes trading portfolios considering risk and profit.
problem Balancing risk and profit in trading portfolios.
method Risk-Aware Trading Swarm (RATS) algorithm.
result RATS improves portfolio performance and risk management.
Study defines and optimizes bank reliability using LR and PSO.
problem Lack of reliability concept in financial services.
method Logistic Regression (LR) for initial estimation, Particle Swarm Optimization (PSO) for optimization.
result Optimal financial ratios maximize bank reliability.
Method for explaining machine learning survival models using counterfactuals.
problem Tackles the challenge of explaining survival models in machine learning.
method Introduces a condition based on the difference of mean times to event for counterfactual explanation. Reduces the problem to a convex optimization problem for Cox models and applies Particle Swarm Optimization for other models.
result Demonstrates the effectiveness of the proposed method through numerical experiments.
Supervised classification is the most active and emerging research trends in today's scenario. In this view, Artificial Neural Network (ANN) techniques have been widely employed and growing interest to the researchers day by day. ANN training aims to find the proper setting of parameters such as weights (W) …
PSO improves G-optimal designs for up to 5 factors, reducing computation time.
problem Computing highly G-optimal designs for response surface models is computationally expensive. method Extended Particle Swarm Optimization (PSO) for optimal design problems.
result PSO generates improved G-optimal designs for up to 5 factors with comparable computational cost. This paper improves combine harvester performance using ANN-PSO hybrid model.
problem Improving performance of combine harvesters to minimize waste and reduce maintenance.
method Proposes a hybrid machine learning model combining artificial neural networks and particle swarm optimization.
result Demonstrates higher accuracy and stability in predicting optimal performance of combine harvesters.
Numerical optimization is an important tool in the field of computational physics in general and in nano-optics in specific. It has attracted attention with the increase in complexity of structures that can be realized with nowadays nano-fabrication technologies for which a rational design is no longer feasible. Also, …
This paper proposes the use of an optimization algorithm, namely PSO to decide the initial centroids in K-means, to eventually get better accuracy. The vectorized notation of the optimal centroids can be thought of as entities in an optimization space, where the accuracy of K-means over a random subset of the data coul…
Novel LSTM network predicts pulsar timing residuals with few-shot data.
problem Predicting pulsar timing residuals with limited data.
method Long Short-Term Memory (LSTM) network optimized with model-agnostic meta-learning and particle swarm optimization.
result Robust generalization and accurate predictions across high-frequency test domains with minimal data.
ARS visualization improves t-SNE dynamics with tunable attraction and repulsion.
problem Improve data visualization techniques for complex data sets.
method ARS framework based on t-SNE dynamics with normalized interactions and tunable kernels.
result ARS visualization provides better control over cluster tightness and spacing.
Derives a fluid model for fish swarming in arbitrary dimensions.
problem Modeling fish swarming behavior in various dimensions.
method Develops a novel n-dimensional model using bundle geometry and variational formulation. result Derives the self-organized hydrodynamic model from the interacting particle system.
Optimizes bus schedules to improve on-time performance.
problem Improving on-time performance of public transit systems.
method Formulated as a single-objective optimization task, solved using greedy algorithm, GA, and PSO.
result Enhanced bus timetables leading to better on-time performance.
PSO optimizes hyperparameters for edge ML models in FL.
problem Efficient local training and inference at edge devices.
method Particle Swarm Optimization (PSO) for hyperparameter tuning.
result PSO reduces the number of communication rounds by 2 orders of magnitude.
We apply numerical methods in combination with finite-difference-time-domain (FDTD) simulations to optimize transmission properties of plasmonic mirror color filters using a multi-objective figure of merit over a five-dimensional parameter space by utilizing novel multi-fidelity Gaussian processes approach. We compare …
Addressing the issue of SVMs parameters optimization, this study proposes an efficient memetic algorithm based on Particle Swarm Optimization algorithm (PSO) and Pattern Search (PS). In the proposed memetic algorithm, PSO is responsible for exploration of the search space and the detection of the potential regions with…
Transformers approximate mean-field dynamics of indistinguishable particles.
problem Approximating the dynamics of indistinguishable particles in complex systems.
method Using transformers to model the mean-field dynamics of interacting particle systems.
result Theoretical bounds on the distance between true and transformer-obtained mean-field dynamics.
We study a distributed framework for stochastic optimization which is inspired by models of collective motion found in nature (e.g., swarming) with mild communication requirements. Specifically, we analyze a scheme in which each one of N>1 independent threads, implements in a distributed and unsynchronized fashion,…
Paper proposes a federated learning framework for UAV swarms, optimizing convergence rate and energy consumption.
problem Challenges of centralized ML in UAV swarms due to limited connections and large data volumes.
method Distributed federated learning within UAV swarm, joint power allocation and scheduling design.
result Joint design strategy reduces communication rounds by up to 35%.
Predicting firm's failure is one of the most interesting subjects for investors and decision makers. In this paper, a bankruptcy prediction model is proposed based on Artificial Neural networks (ANN). Taking into consideration that the choice of variables to discriminate between bankrupt and non-bankrupt firms influenc…
Inferring the laws of interaction between particles and agents in complex dynamical systems from observational data is a fundamental challenge in a wide variety of disciplines. We propose a non-parametric statistical learning approach to estimate the governing laws of distance-based interactions, with no reference or a…
Software development effort estimation is considered a fundamental task for software development life cycle as well as for managing project cost, time and quality. Therefore, accurate estimation is a substantial factor in projects success and reducing the risks. In recent years, software effort estimation has received …
DBS uses swarm intelligence to cluster data without needing a global objective function.
problem Clustering high-dimensional data with unknown natural clusters.
method Databionic swarm (DBS) system that self-organizes and adapts to data structures.
result DBS outperforms traditional clustering methods in scenarios with no prior knowledge.
Method identifies IPS governing equations from particle data efficiently.
problem Identify governing equations of interacting particle systems efficiently.
method Combines mean-field theory and WSINDy for large N and M. result Converges with rate O(N−1/2) for N≥100. We obtain the conditions for the emergence of the swarm intelligence effect in an interactive game of restless multi-armed bandit (rMAB). A player competes with multiple agents. Each bandit has a payoff that changes with a probability pc per round. The agents and player choose one of three options: (1) Exploit (a …
Proposes a new framework for predicting stock market movements using sparse neural architectures.
problem Challenging problem of predicting stock market movements using technical indicators.
method Multi-criteria optimization approach to evolve sparse neural architectures.
result Evolved parsimonious networks with better generalization capabilities.
Study examines CSO algorithm for 3D swarming and tracking multiple targets.
problem Simulating and tracking multiple targets in 3D space.
method Cyclic Stochastic Optimization (CSO) algorithm implemented by mobile sensing agents.
result CSO algorithm converges in 3D space, minimizing uncertainty in targets' state estimates.
Inverse design is an outstanding challenge in disordered systems with multiple length scales such as polymers, particularly when designing polymers with desired phase behavior. We demonstrate high-accuracy tuning of poly(2-oxazoline) cloud point via machine learning. With a design space of four repeating units and a ra…
Despite recent innovations in network architectures and loss functions, training RNNs to learn long-term dependencies remains difficult due to challenges with gradient-based optimisation methods. Inspired by the success of Deep Neuroevolution in reinforcement learning (Such et al. 2017), we explore the use of gradient-…
Enhances inverse design optimization with machine learning and reduced fidelity simulations.
problem Limited compute resources in inverse design optimization.
method Synergy of multi-fidelity simulations, machine learning, and search space reduction.
result Significant computational resource savings and improved optimization performance.
Hybrid models improve groundwater level prediction and uncertainty analysis.
problem Predicting and analyzing uncertainty of monthly groundwater levels.
method Six evolutionary optimization algorithms (GOA, CSO, WA, GA, KA, PSO) hybridized with ANFIS, ANN, and SVM.
result ANFIS-GOA outperformed other models in predicting groundwater levels.
Multi-step-ahead time series prediction is one of the most challenging research topics in the field of time series modeling and prediction, and is continually under research. Recently, the multiple-input several multiple-outputs (MISMO) modeling strategy has been proposed as a promising alternative for multi-step-ahead…