{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/a-bi-population-particle-swarm-optimizer-for","title":"A Bi-population Particle Swarm Optimizer for Learning Automata based Slow Intelligent System","arxiv_id":"1804.00768","date":"2018-04-03","proceeding":null,"authors":["Mohammad Hasanzadeh Mofrad","S. K. Chang"],"abstract":"Particle Swarm Optimization (PSO) is an Evolutionary Algorithm (EA) that\nutilizes a swarm of particles to solve an optimization problem. Slow\nIntelligence System (SIS) is a learning framework which slowly learns the\nsolution to a problem performing a series of operations. Moreover, Learning\nAutomata (LA) are minuscule but effective decision making entities which are\nbest suited to act as a controller component. In this paper, we combine two\nisolate populations of PSO to forge the Adaptive Intelligence Optimizer (AIO)\nwhich harnesses the advantages of a bi-population PSO to escape from the local\nminimum and avoid premature convergence. Furthermore, using the rich framework\nof SIS and the nifty control theory that LA derived from, we find the perfect\nmatching between SIS and LA where acting slowly is the pillar of both of them.\nBoth SIS and LA need time to converge to the optimal decision where this\nenables AIO to outperform standard PSO having an incomparable performance on\nevolutionary optimization benchmark functions.","url_abs":"http://arxiv.org/abs/1804.00768v1","url_pdf":"http://arxiv.org/pdf/1804.00768v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"a-bi-population-particle-swarm-optimizer-for","repo_url":"https://github.com/hmofrad/pso","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"decision-making","task_name":"Decision Making"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"hmofrad/pso","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"4a506422a5c7ceb6d19a81bcf1f149c4e2db164ce4047cd289a03274586ea807","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}