Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2609.35657

CMDO: A Cognitive Memory-Driven Optimization Algorithm for Adaptive Population-Based Search

Mohammed Yusuf Mujawar·Shahram Rahimi·Noorbakhsh Amiri Golilarz
View original source ↗Read source document ↗Export metadata ↓

Abstract

Population-based optimization methods often use previous search information through successful solutions, parameter adaptation, or operator performance, but they rarely retain the context in which a search behavior succeeded or failed. We introduce Cognitive Memory-Driven Optimization (CMDO), a derivative-free population-based optimizer that represents experience as the relationship between search context, search behavior, and observed outcome. CMDO organizes these experiences across working, episodic, and consolidated memory, retrieves them according to similarity with the current search state, and uses both positive and negative evidence to guide subsequent search. Retrieved experience does not replay previous candidate locations; instead, it selects search recipes that are reconstructed from the current population through exploratory, directed, and local search behaviors with adaptive search geometry. We evaluate CMDO on selected Blackbox Optimization Benchmarking test suite on COCO (BBOB/COCO) and Congress on Evolutionary Computation 2017 (CEC2017) problems against DE, CMA-ES, SHADE, GWO, HHO, and ORCA, and further study its application to seven-parameter photovoltaic model estimation using measured current--voltage data. The results show problem-dependent but competitive optimization performance, including the lowest median error among the compared methods on CEC2017 F10. More importantly, analysis of the search traces shows that context-dependent recall changes the distribution of executed search behaviors, while unsuccessful experiences remain available as negative evidence for later decisions, showing that accumulated experience directly influences subsequent search behavior. These results support the use of explicit context--behavior--outcome memory as an active mechanism for controlling population-based search.

Explore related subjects

cs.NEcs.AI

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mohammed Yusuf Mujawar, Shahram Rahimi, Noorbakhsh Amiri Golilarz. 2026-09-28. CMDO: A Cognitive Memory-Driven Optimization Algorithm for Adaptive Population-Based Search. https://arxiv.org/abs/2609.35657

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

What your brain activity says about you: A review of neuropsychiatric disorders identified in resting-state and sleep EEG data

Electroencephalogram monitoring devices and online data repositories hold large amounts of data from individuals participating in research and medical studies without direct reference to personal identifiers. This paper explores what types of personal and health information have been detected and classified within task-free EEG data. Additionally, we investigate key characteristics of the collected resting-state and sleep data, in order to determine the privacy risks involved with openly available EEG data. We used Google Scholar, Web of Science and searched relevant journals to find studies which classified or detected the presence of various disorders and personal information in resting state and sleep EEG. Only English full-text peer-reviewed journal articles or conference papers about classifying the presence of medical disorders between individuals were included. A quality analysis carried out by 3 reviewers determined general paper quality based on specified evaluation criteria. In resting state EEG, various disorders including Autism Spectrum Disorder, Parkinson's disease, and alcohol use disorder have been classified with high classification accuracy, often requiring only 5 mins of data or less. Sleep EEG tends to hold classifiable information about sleep disorders such as sleep apnea, insomnia, and REM sleep disorder, but usually involve longer recordings or data from multiple sleep stages. Many classification methods are still developing but even today, access to a person's EEG can reveal sensitive personal health information. With an increasing ability of machine learning methods to re-identify individuals from their EEG data, this review demonstrates the importance of anonymization, and the development of improved tools for keeping study participants and medical EEG users' privacy safe.

cs.NE↗
arXiv2026

Quantifying How Training Gradient Sparsity Affect Spiking Neural Network Accuracy And Robustness

Spiking Neural Networks (SNNs) have recently received increasing attention in both computational neuroscience and artificial intelligence owing to their potential for energy-efficient computation and reduced memory requirements. Despite these advantages, improving adversarial robustness in SNNs (particularly for vision-based applications) remains an emerging and relatively underexplored research problem. Recent work has suggested that encouraging sparse gradients can act as a regularization mechanism to improve resistance against adversarial perturbations. In this study, we report an unexpected observation: under certain architectural configurations, SNNs inherently exhibit sparse gradients and can attain state-of-the-art adversarial defense performance without requiring any explicit regularization strategy. Further investigation reveals an inherent trade-off between robustness and generalization. Specifically, increased gradient sparsity enhances resistance to adversarial attacks but may reduce the model's generalization capability, whereas denser gradients tend to improve generalization while simultaneously increasing susceptibility to adversarial perturbations. These findings provide new perspectives on the role of gradient sparsity in the training dynamics of SNNs.

cs.NE↗
arXiv2026

Black-Box Optimization of Mixed Binary-Continuous Variables: Challenges and Opportunities in Evolutionary Model Merging

Model merging has emerged as a cost-effective paradigm for combining capabilities of multiple large language models (LLMs) without additional training. Among existing approaches, Data Flow Space (DFS) merging operates by selectively activating parameter groups across model layers, offering greater flexibility than naive parameter averaging. However, the optimization challenges underlying DFS merging remain poorly understood. In this paper, we formally characterize the DFS merging problem as a mixed binary-continuous black-box optimization problem, identifying three fundamental challenges: (1) mixed binary-continuous variable types, (2) high-dimensional search spaces with up to 291 parameter groups, and (3) conditional variable dependencies corresponding to Type-I interaction as characterized by Akimoto et al. [1]. We demonstrate that this characterization directly motivates the application of evolutionary algorithms designed for mixed-variable optimization. Empirically, we evaluate Structured DFS with CMA-ES against Parameter Space (PS) merging, Unstructured DFS, TIES-Merging, DARE, and DELLA on Mistral-7B models across official GSM8K (1,319 questions) and MMLU (14,042 questions, 57 subjects) benchmarks. Our structured approach achieves a 49.5% reduction in effective search space while maintaining competitive performance. Results reveal that standard parameter space methods (TIES: 30.48%, DELLA: 26.93% on full MMLU) perform significantly worse than optimization-aware approaches, while also identifying an important tension between task-specific reasoning performance and general knowledge preservation.

cs.NE↗