Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,932 papers · 148 categories

Trend · papers per month

7.6%15.2%22.9%30.5% · Jun 202019922001200920172026
48 results for Swarm Optimization

Modified swarm optimizers improve GD initialization for EEG spatial filtering.

problem Gradient Descent fails in complex, multi-scale convexity scenarios.
method Modified Swarm-based Optimizers (ICA and PSO) applied to GD initialization.
result The modified optimizers outperform baseline optimizers in EEG classification and loss function fitness.

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>1N > 1 independent threads, implements in a distributed and unsynchronized fashion,…

2018-06-11abs ↗pdf ↗

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%.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

PSO improves GG-optimal designs for up to 5 factors, reducing computation time.

problem Computing highly GG-optimal designs for response surface models is computationally expensive.
method Extended Particle Swarm Optimization (PSO) for optimal design problems.
result PSO generates improved GG-optimal designs for up to 5 factors with comparable computational cost.

Recently, deep reinforcement learning (RL) methods have been applied successfully to multi-agent scenarios. Typically, these methods rely on a concatenation of agent states to represent the information content required for decentralized decision making. However, concatenation scales poorly to swarm systems with a large…

2018-07-17abs ↗pdf ↗

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.

Inverse reinforcement learning (IRL) has become a useful tool for learning behavioral models from demonstration data. However, IRL remains mostly unexplored for multi-agent systems. In this paper, we show how the principle of IRL can be extended to homogeneous large-scale problems, inspired by the collective swarming b…

2016-02-17abs ↗pdf ↗

Hybrid ANN model predicts firm bankruptcy with improved PSO and SA.

problem Predicting firm failure for investors and decision makers.
method Hybrid ANN model using improved PSO and SA for variable selection and optimization.
result The hybrid model outperforms in convergence and accuracy compared to traditional methods.

New neural network learns set-equivariant functions efficiently.

problem Efficiently implementing and learning set-equivariant functions.
method Gated recurrent network applied iteratively to all entities and syncs with population progression.
result SWARM mappings achieve state-of-the-art performance in various applications.

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.

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…

2019-04-19abs ↗pdf ↗

PolySwarm uses a swarm of LLMs to predict and arbitrage prediction markets.

problem Real-time prediction market trading and latency arbitrage inefficiencies.
method PolySwarm employs a swarm of 50 diverse LLMs, Bayesian combination, and risk-controlled execution.
result Swarm aggregation outperforms single-model baselines in prediction tasks.

Extends FC-RAG to anytime-valid sequential coverage for language model swarms.

problem Maintain distribution-free coverage for a swarm of weak language models over time.
method Introduces Anytime-FC-RAG, a sequential extension with a summable calibration-deviation budget.
result Achieves time-uniform alarm validity and safety under predictable adaptive control.

A new method uses PSO to optimize sentence weights for user-oriented document summaries.

problem Handling information overload in documents through efficient summarization.
method Particle Swarm Optimization (PSO) to identify and weight sentence features.
result Improved accuracy in summarization compared to previous methods.

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.

A new method for steering large agent populations efficiently.

problem Controlling the configuration of a swarm of identical, interacting cooperative agents.
method Mean-Field Schrodinger Bridges with Gaussian Mixture Models.
result A highly efficient parameterization to approximate optimal solutions of the MFSB problem in closed form.