Papers › Accurate Peak Detection in Multimodal Optimization via Approximated Landscape Learning

Accurate Peak Detection in Multimodal Optimization via Approximated Landscape Learning

23 Mar 2025arXiv:2503.18066archive 2025-07-28

Zeyuan Ma, Hongqiao Lian, Wenjie Qiu, Yue-Jiao Gong

Detecting potential optimal peak areas and locating the accurate peaks in these areas are two major challenges in Multimodal Optimization problems (MMOPs). To address them, much efforts have been spent on developing novel searching operators, niching strategies and multi-objective problem transformation pipelines. Though promising, existing approaches more or less overlook the potential usage of landscape knowledge. In this paper, we propose a novel optimization framework tailored for MMOPs, termed as APDMMO, which facilitates peak detection via fully leveraging the landscape knowledge and hence capable of providing strong optimization performance on MMOPs. Specifically, we first design a novel surrogate landscape model which ensembles a group of non-linear activation units to improve the regression accuracy on diverse MMOPs. Then we propose a free-of-trial peak detection method which efficiently locates potential peak areas through back-propagation on the learned surrogate landscape model. Based on the detected peak areas, we employ SEP-CMAES for local search within these areas in parallel to further improve the accuracy of the found optima. Extensive benchmarking results demonstrate that APDMMO outperforms several up-to-date baselines. Further ablation studies verify the effectiveness of the proposed novel designs. The source-code is available at ~\href{}{https://github.com/GMC-DRL/APDMMO}.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2503.18066")

Code

Syntology Ran 0 of 13 code samples harvested from 1 repository linked to this paper; 13 have no recorded run.

By repository: official repository: 13 samples from 1 repository, 0 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

gmc-drl/apdmmo officialmentioned in papermentioned on GitHubpytorchBSD-2-Clause report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

13 samples harvested; 0 ran; 0 honoured the contract we drafted; 13 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

13unverified

Licence: 0 of the 13 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from gmc-drl/apdmmo. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

FGrienwank gmc-drl/apdmmo/np_parallel_cec2013/cec2013/cfunction.py official repository unverified BSD-2-Clause (permissive) · 072bf23d8e9864c5 · report
FRastrigin gmc-drl/apdmmo/np_parallel_cec2013/cec2013/cfunction.py official repository unverified BSD-2-Clause (permissive) · 7cda5ec50592db8e · report
FSphere gmc-drl/apdmmo/np_parallel_cec2013/cec2013/cfunction.py official repository unverified BSD-2-Clause (permissive) · 82c67bef14a53e91 · report
equal_maxima gmc-drl/apdmmo/np_parallel_cec2013/cec2013/functions.py official repository unverified BSD-2-Clause (permissive) · 8622b863c948755c · report
find_seeds gmc-drl/apdmmo/local_refine.py official repository unverified BSD-2-Clause (permissive) · 4c9a1b6cf4dac0f6 · report
find_seeds_indices gmc-drl/apdmmo/np_parallel_cec2013/cec2013/cec2013.py official repository unverified BSD-2-Clause (permissive) · 01fd44766aa8bd58 · report
fit gmc-drl/apdmmo/surrogate.py official repository unverified BSD-2-Clause (permissive) · 8131b3f5abb83bbf · report
five_uneven_peak_trap gmc-drl/apdmmo/np_parallel_cec2013/cec2013/functions.py official repository unverified BSD-2-Clause (permissive) · 1a313c1e6ba3c136 · report
generate_optimize_sampling gmc-drl/apdmmo/optimize.py official repository unverified BSD-2-Clause (permissive) · ceaffe429cac21cd · report
how_many_goptima gmc-drl/apdmmo/np_parallel_cec2013/cec2013/cec2013.py official repository unverified BSD-2-Clause (permissive) · 537db54df938bf97 · report
local_optimization_parallel gmc-drl/apdmmo/optimize.py official repository unverified BSD-2-Clause (permissive) · a31c18d10cf806c6 · report
tosolve_func gmc-drl/apdmmo/local_refine.py official repository unverified BSD-2-Clause (permissive) · 89c58d8548cd8d64 · report
uneven_decreasing_maxima gmc-drl/apdmmo/np_parallel_cec2013/cec2013/functions.py official repository unverified BSD-2-Clause (permissive) · 3c1b73ff70f8b793 · report

Tasks

Benchmarking

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections