Domain-as-Particle with PSO Methods for Neural-Network Feature Weighting

We present a framework that integrates Particle Swarm Optimization (PSO), machine learning, K-Fold crossvalidation, and surrogate modeling to identify optimal weight vectors for feature scaling in neural network training.In our approach, the n-dimensional weight space is partitioned into nonoverlapping subdomains, each corresponding to a PSO particle.Particle movement is guided by a characteristic vector, which is determined by the best-performing candidates in each subdomain and by information exchanged with neighboring regions.To reduce evaluation costs, a surrogate model-trained on a uniformly sampled subset of candidates-pre-filters particles before full K-Fold validation.The top candidates then undergo comprehensive validation, updating the characteristic vectors for subsequent iterations.This domain-as-particle PSO framework enables efficient weight discovery, significantly reducing computational overhead while maintaining robust performance.The effectiveness of this approach is demonstrated on real-world datasets.

Authors

Institutions

Publication Details

Journal
Annals of Computer Science and Information Systems
Published
2025-10-15
DOI
https://doi.org/10.15439/2025f1427
Primary Topic
Metaheuristic Optimization Algorithms Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Domain-as-Particle with PSO Methods for Neural-Network Feature Weighting

Paolo Mercorelli, Fabio Berberi
Annals of Computer Science and Information Systems
Metaheuristic Optimization Algorithms Research
article

Domain-as-Particle with PSO Methods for Neural-Network Feature Weighting

Paolo Mercorelli, Fabio Berberi
article en

Abstract

We present a framework that integrates Particle Swarm Optimization (PSO), machine learning, K-Fold crossvalidation, and surrogate modeling to identify optimal weight vectors for feature scaling in neural network training.In our approach, the n-dimensional weight space is partitioned into nonoverlapping subdomains, each corresponding to a PSO particle.Particle movement is guided by a characteristic vector, which is determined by the best-performing candidates in each subdomain and by information exchanged with neighboring regions.To reduce evaluation costs, a surrogate model-trained on a uniformly sampled subset of candidates-pre-filters particles before full K-Fold validation.The top candidates then undergo comprehensive validation, updating the characteristic vectors for subsequent iterations.This domain-as-particle PSO framework enables efficient weight discovery, significantly reducing computational overhead while maintaining robust performance.The effectiveness of this approach is demonstrated on real-world datasets.

Annals of Computer Science and Information SystemsVol. 45
Leuphana University of Lüneburg (DE)
Openalex Percentile: Top 53%
Metaheuristic Optimization Algorithms Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Domain-as-Particle with PSO Methods for Neural-Network Feature Weighting — Paolo Mercorelli, Fabio Berberi · Annals of Computer Science and Information Systems (2025) | TGRS Research Map | TGRS