Divergence-guided Particle Swarm Optimization

preprint OA: closed
Full text JSON View at publisher
Full text 13,168 characters · extracted from preprint-html · click to expand
Divergence-guided Particle Swarm Optimization | Research Square window.SnipcartSettings = { analytics: { enabled: false } }; (function() { var accessVector = localStorage.getItem('access_vector') || ''; window.dataLayer = window.dataLayer || []; if (accessVector) { window.dataLayer.push({ user: { profile: { profileInfo: { snid: accessVector } } } }); } })(); (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start':new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0],j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src='https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f);})(window,document,'script','dataLayer','GTM-K279D39R'); Browse Preprints In Review Journals COVID-19 Preprints AJE Video Bytes Research Tools Research Promotion AJE Professional Editing AJE Rubriq About Preprint Platform In Review Editorial Policies Our Team Advisory Board Help Center Sign In Submit a Preprint Cite Share Download PDF Research Article Divergence-guided Particle Swarm Optimization Kleyton da Costa, Bernardo Modenesi, Ivan F.M. Menezes, Helio Vieira Lopes This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-9431774/v1 This work is licensed under a CC BY 4.0 License Status: Under Review Version 1 posted 10 You are reading this latest preprint version Abstract Particle Swarm Optimization (PSO) is susceptible to premature convergence when the swarm collapses around the global best, particularly on multimodal landscapes in higher dimensions. We propose Divergence-guided PSO (DPSO), which augments the velocity update with a modulation term that repels particles whose personal bests have converged near the global best. The repulsion is gated by a Gaussian similarity kernel, which we prove is equivalent to an exponentially decaying function of the KL divergence between Gaussian-embedded personal and global bests, connecting the mechanism to the family of f-divergences and providing a principled basis for kernel design. Experiments on 36 benchmark functions (15 unimodal, 21 multimodal) across dimensions D ∈ {10, 30, 50}, each with 30 independent runs, show that DPSO frequently outperforms standard PSO on multimodal problems, with improvements of 2-8× on functions such as Pinter, Ackley, and Levy, and up to 5× reduction in run-to-run variance. On unimodal landscapes the modulation term is counterproductive, confirming that DPSO targets the exploration-exploitation trade-off rather than offering a universal improvement. The method adds one hyperparameter, incurs 15-25% wall-clock overhead, and does not increase the asymptotic per-iteration complexity of PSO. Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Under Review Version 1 posted Reviews received at journal 18 May, 2026 Reviewers agreed at journal 18 May, 2026 Reviewers agreed at journal 17 May, 2026 Reviews received at journal 17 May, 2026 Reviewers agreed at journal 15 May, 2026 Reviewers agreed at journal 14 May, 2026 Reviewers invited by journal 14 May, 2026 Editor assigned by journal 12 May, 2026 Submission checks completed at journal 26 Apr, 2026 First submitted to journal 15 Apr, 2026 You are reading this latest preprint version Research Square lets you share your work early, gain feedback from the community, and start making changes to your manuscript prior to peer review in a journal. As a division of Research Square Company, we’re committed to making research communication faster, fairer, and more useful. We do this by developing innovative software and high quality services for the global research community. Our growing team is made up of researchers and industry professionals working together to solve the most critical problems facing scientific publishing. Also discoverable on Platform About Our Team In Review Editorial Policies Advisory Board Help Center Resources Author Services Accessibility API Access RSS feed Manage Cookie Preferences © Research Square 2026 | ISSN 2693-5015 (online) Privacy Policy Terms of Service Do Not Sell My Personal Information {"props":{"pageProps":{"initialData":{"identity":"rs-9431774","acceptedTermsAndConditions":true,"allowDirectSubmit":false,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":640655104,"identity":"2fbb122f-4462-4232-a2bf-b09a2658aad2","order_by":0,"name":"Kleyton da Costa","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAA6ElEQVRIie2RMYvCMBiGUz75XMJlTYj6GwoFcdIfc9Cpm0vFwaHgeuv9ksyVgC4F14IOVwVnHTzOzbRF3BLchMszvLzD+4SEEOLxvCG8++zBjwn64VTARN52CGsFX1GQN+lSRAZreU73JNzq0+yajHtIoDqUFkUCxjwvTiQs4+Gurz7NxTCKEosyADrkq6Um4pviTigwCkVpV9hvq3wVOBVq4VakObZRGEkwuCjtVkSG0agoNGU8jmSgNhTB8Ra+yaoyTfUAma4uNzWfsG5WHW2KoVN/B60btGmfN5PzowV/7rXH4/H8Q+7kNT6Q1GON3AAAAABJRU5ErkJggg==","orcid":"","institution":"Pontifical Catholic University of Rio de Janeiro","correspondingAuthor":true,"prefix":"","firstName":"Kleyton","middleName":"da","lastName":"Costa","suffix":""},{"id":640655105,"identity":"e404011e-458c-4604-92ad-197f35048685","order_by":1,"name":"Bernardo Modenesi","email":"","orcid":"","institution":"University of Utah","correspondingAuthor":false,"prefix":"","firstName":"Bernardo","middleName":"","lastName":"Modenesi","suffix":""},{"id":640655106,"identity":"6b9b9b11-f058-4f51-a7f1-9db4e0afb1a8","order_by":2,"name":"Ivan F.M. Menezes","email":"","orcid":"","institution":"Pontifical Catholic University of Rio de Janeiro","correspondingAuthor":false,"prefix":"","firstName":"Ivan","middleName":"F.M.","lastName":"Menezes","suffix":""},{"id":640655107,"identity":"b62dc458-f1e7-45ef-97a9-eed07d44b86f","order_by":3,"name":"Helio Vieira Lopes","email":"","orcid":"","institution":"Pontifical Catholic University of Rio de Janeiro","correspondingAuthor":false,"prefix":"","firstName":"Helio","middleName":"Vieira","lastName":"Lopes","suffix":""}],"badges":[],"createdAt":"2026-04-16 01:23:17","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-9431774/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-9431774/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":109405554,"identity":"5f4cbb4c-8e73-41a1-babc-e87580c1b15a","added_by":"auto","created_at":"2026-05-17 13:18:57","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":20777348,"visible":true,"origin":"","legend":"","description":"","filename":"paperdpso.pdf","url":"https://assets-eu.researchsquare.com/files/rs-9431774/v1_covered_c65fdbfa-8910-4ad7-9587-e781026cc08c.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"Divergence-guided Particle Swarm Optimization","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"hideJournal":false,"highlight":"","institution":"","isAcceptedByJournal":false,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"swarm-intelligence","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"swrm","sideBox":"Learn more about [Swarm Intelligence](http://link.springer.com/journal/11721)","snPcode":"11721","submissionUrl":"https://submission.nature.com/new-submission/11721/3","title":"Swarm Intelligence","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"em","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false},"keywords":"","lastPublishedDoi":"10.21203/rs.3.rs-9431774/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-9431774/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"\u003cp\u003eParticle Swarm Optimization (PSO) is susceptible to premature convergence when the swarm collapses around the global best, particularly on multimodal landscapes in higher dimensions. We propose Divergence-guided PSO (DPSO), which augments the velocity update with a modulation term that repels particles whose personal bests have converged near the global best. The repulsion is gated by a Gaussian similarity kernel, which we prove is equivalent to an exponentially decaying function of the KL divergence between Gaussian-embedded personal and global bests, connecting the mechanism to the family of f-divergences and providing a principled basis for kernel design. Experiments on 36 benchmark functions (15 unimodal, 21 multimodal) across dimensions D ∈ {10, 30, 50}, each with 30 independent runs, show that DPSO frequently outperforms standard PSO on multimodal problems, with improvements of 2-8× on functions such as Pinter, Ackley, and Levy, and up to 5× reduction in run-to-run variance. On unimodal landscapes the modulation term is counterproductive, confirming that DPSO targets the exploration-exploitation trade-off rather than offering a universal improvement. The method adds one hyperparameter, incurs 15-25% wall-clock overhead, and does not increase the asymptotic per-iteration complexity of PSO.\u003c/p\u003e","manuscriptTitle":"Divergence-guided Particle Swarm Optimization","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2026-05-15 17:45:14","doi":"10.21203/rs.3.rs-9431774/v1","editorialEvents":[{"type":"communityComments","content":0},{"type":"editorInvitedReview","content":"","date":"2026-05-18T19:35:24+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"229524729301057698520273985025058586500","date":"2026-05-18T06:23:47+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"202389984109645796892722993205740117193","date":"2026-05-17T14:27:35+00:00","index":"hide","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2026-05-17T06:51:08+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"14148253658835715188337546423816953720","date":"2026-05-15T06:24:44+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"61564178701646880543192965341299015840","date":"2026-05-14T13:37:15+00:00","index":"hide","fulltext":""},{"type":"reviewersInvited","content":"","date":"2026-05-14T08:22:40+00:00","index":"","fulltext":""},{"type":"editorAssigned","content":"","date":"2026-05-12T13:29:58+00:00","index":"","fulltext":""},{"type":"checksComplete","content":"","date":"2026-04-26T06:42:45+00:00","index":"","fulltext":""},{"type":"submitted","content":"Swarm Intelligence","date":"2026-04-16T01:10:50+00:00","index":"","fulltext":""}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"swarm-intelligence","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"swrm","sideBox":"Learn more about [Swarm Intelligence](http://link.springer.com/journal/11721)","snPcode":"11721","submissionUrl":"https://submission.nature.com/new-submission/11721/3","title":"Swarm Intelligence","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"em","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false}}],"origin":"","ownerIdentity":"93eb5afc-ff64-4ed2-a9ef-781cc57fb569","owner":[],"postedDate":"May 15th, 2026","published":true,"recentEditorialEvents":[{"type":"editorInvitedReview","content":"","date":"2026-05-18T19:35:24+00:00","index":17,"fulltext":""},{"type":"reviewerAgreed","content":"229524729301057698520273985025058586500","date":"2026-05-18T06:23:47+00:00","index":15,"fulltext":""},{"type":"reviewerAgreed","content":"202389984109645796892722993205740117193","date":"2026-05-17T14:27:35+00:00","index":14,"fulltext":""},{"type":"editorInvitedReview","content":"","date":"2026-05-17T06:51:08+00:00","index":13,"fulltext":""},{"type":"reviewerAgreed","content":"14148253658835715188337546423816953720","date":"2026-05-15T06:24:44+00:00","index":12,"fulltext":""},{"type":"reviewerAgreed","content":"61564178701646880543192965341299015840","date":"2026-05-14T13:37:15+00:00","index":11,"fulltext":""},{"type":"reviewersInvited","content":"5","date":"2026-05-14T08:22:40+00:00","index":"","fulltext":""},{"type":"editorAssigned","content":"","date":"2026-05-12T13:29:58+00:00","index":"","fulltext":""}],"rejectedJournal":[],"revision":"","amendment":"","status":"under-review","subjectAreas":[],"tags":[],"updatedAt":"2026-05-15T17:45:14+00:00","versionOfRecord":[],"versionCreatedAt":"2026-05-15 17:45:14","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-9431774","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-9431774","identity":"rs-9431774","version":["v1"]},"buildId":"XKTyCvWXoU3ODBz1xrDgd","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}

Text is read by the "Ask this paper" AI Q&A widget below. Extraction quality varies by source — PMC NXML preserves structure cleanly, OA-HTML may include some navigation residue, and OA-PDF can have broken hyphenation. The publisher copy (via DOI) is the canonical version.

My notes (saved in your browser only)

Ask this paper AI returns verbatim quotes from the full text · source: preprint-html

Answers must be backed by verbatim quotes from this paper's full text. Hallucinated quotes are dropped automatically; if no verbatim passage answers the question, we say so. How this works

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. This is a recent paper (2026) — citers typically take a year or two to land, and the OpenAlex reference graph may still be filling in.

Source provenance

europepmc
last seen: 2026-05-20T01:45:00.602351+00:00