S-CARD-CMSA: A Score-Aware Candidate Archive with Density-Filtered Reporting for Multimodal Optimization

• URL: http://arxiv.org/abs/2607.13764v1
• Date: Wed, 15 Jul 2026 12:27:52 GMT
• Title: S-CARD-CMSA: A Score-Aware Candidate Archive with Density-Filtered Reporting for Multimodal Optimization
• Abstract summary: This paper presents emphS-CARD-CMSA, a score-aware candidate-archive and density-filtered reporting framework.<n>The method is developed for the IEEE CEC 2026 Competition on Benchmarking Niching Methods for Multimodal Optimization.
• Score: 0.8122270502556375
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Multimodal optimization aims to locate multiple globally optimal or near-optimal solutions in a single run. This paper presents \emph{S-CARD-CMSA}, a score-aware candidate-archive and density-filtered reporting framework built on the covariance matrix self-adaptation evolution strategy with repelling subpopulations (RS-CMSA-ESII). The method is developed for the IEEE CEC 2026 Competition on Benchmarking Niching Methods for Multimodal Optimization. Rather than modifying the core search dynamics of RS-CMSA-ESII, S-CARD-CMSA preserves its sampling, covariance adaptation, taboo-region update, restart, and termination mechanisms. Two conservative extensions are introduced. First, a passive secondary candidate archive records the restart-level best candidates without influencing the search trajectory. Second, a score-aware density-filtered reporting rule constructs the final solution set by balancing robust peak ratio and precision-driven F1-score. Development experiments show that the density-filtered rule preserves the peak coverage obtained by a medium score-aware rule while reducing redundant reports. On a broader validation subset, it maintains the same mean RPR while improving mean precision, F1-score, and the official-score-oriented average. The method does not use true global-minimum locations during optimization; such information is used only for offline development analysis and post-run scoring. The source code of S-CARD-CMSA is available at https://github.com/ChauhanDikshit.

Related papers

• DE-2LS: Differential Evolution with Lightweight Late Local Search for Constrained Numerical Optimization [2.4923006485141284]
  This paper proposes a late-stage, locally search-enhanced variant of differential evolution built on the RDEx framework.<n>A lightweight coordinate-pattern local search is added as a guarded component around the current best solution.<n>Results show that the DE-2LS configuration achieves the best U-score among all tested variants.
  arXiv  Detail & Related papers  (2026-06-26T06:45:46Z)
• DE-2LS: Differential Evolution with Late-Stage local-search for Unconstrained Single-Objective Numerical Optimization [0.8122270502556375]
  We present DE-2LS, a late-stage, local-search-enhanced differential evolution framework built on RDEx for unconstrained single-objective optimization with variable bounds.<n>The proposed method preserves the original RDEx evolutionary search engine and introduces two conservative refinements.<n> Experimental results show that DE-2LS consistently improves the original RDEx in direct head-to-head comparison.
  arXiv  Detail & Related papers  (2026-06-26T06:43:08Z)
• MIRA: Mid-training Rubric Anchoring for Source-Aware Data Selection [59.34281845159177]
  We propose MIRA, a source-aware filtering framework based on self-anchored rubric discovery.<n>On code-oriented mid-training with 21 sources and 5 source groups, MIRA outperforms selection baselines across nine code benchmarks.
  arXiv  Detail & Related papers  (2026-05-28T17:40:40Z)
• F-GRPO: Factorized Group-Relative Policy Optimization for Unified Candidate Generation and Ranking [79.49893545611779]
  Large Language Models (LLMs) can generate a subset and order it within a single autoregressive pass.<n>This flexibility introduces a new optimization challenge: the model must search an output space while receiving utility feedback only after the full ranked list is generated.<n>This credit assignment gap makes end-to-end optimization unstable and sample-inefficient.<n>We propose a unified framework that performs both within a single autoregressive rollout and optimize them end-to-end via factorized group-relative policy optimization.
  arXiv  Detail & Related papers  (2026-05-13T04:52:33Z)
• Distributionally Robust Multi-Objective Optimization [47.16280600850848]
  We introduce distributionally robust multi-objective optimization (DRMOO)<n>We propose a double-loop MGDA that uses an inner loop to estimate dual variables and achieves a total sample complexity $mathcalO(-12)$ for reaching an $$-Pareto-stationary point.<n>To further improve efficiency, we handle generalized-smooth biased estimates, removing the need for double sampling.
  arXiv  Detail & Related papers  (2026-05-07T04:24:17Z)
• MMR1: Enhancing Multimodal Reasoning with Variance-Aware Sampling and Open Resources [113.33902847941941]
  Variance-Aware Sampling (VAS) is a data selection strategy guided by Variance Promotion Score (VPS)<n>We release large-scale, carefully curated resources containing 1.6M long CoT cold-start data and 15k RL QA pairs.<n> Experiments across mathematical reasoning benchmarks demonstrate the effectiveness of both the curated data and the proposed VAS.
  arXiv  Detail & Related papers  (2025-09-25T14:58:29Z)
• Exact Reformulation and Optimization for Direct Metric Optimization in Binary Imbalanced Classification [10.140989590842224]
  We study two key classification metrics, precision and recall, under three practical binary IC settings.<n>Unlike existing methods that rely on smooth approximations to deal with the indicator function involved, textitwe introduce, for the first time, exact constrained reformulations for these direct metric optimization (DMO) problems.
  arXiv  Detail & Related papers  (2025-07-21T04:52:51Z)
• Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergence [131.41894248194995]
  We propose context-oriented decomposition adaptation (CorDA), a novel method that initializes adapters in a task-aware manner.<n>Thanks to the task awareness, our method enables two optional adaptation modes, knowledge-preserved mode (KPM) and instruction-previewed mode (IPM)
  arXiv  Detail & Related papers  (2025-06-16T07:55:14Z)
• Adaptive Neural Ranking Framework: Toward Maximized Business Goal for Cascade Ranking Systems [33.46891569350896]
  Cascade ranking is widely used for large-scale top-k selection problems in online advertising and recommendation systems. Previous works on learning-to-rank usually focus on letting the model learn the complete order or top-k order. We name this method as Adaptive Neural Ranking Framework (abbreviated as ARF)
  arXiv  Detail & Related papers  (2023-10-16T14:43:02Z)
• Divide and Contrast: Source-free Domain Adaptation via Adaptive Contrastive Learning [122.62311703151215]
  Divide and Contrast (DaC) aims to connect the good ends of both worlds while bypassing their limitations. DaC divides the target data into source-like and target-specific samples, where either group of samples is treated with tailored goals. We further align the source-like domain with the target-specific samples using a memory bank-based Maximum Mean Discrepancy (MMD) loss to reduce the distribution mismatch.
  arXiv  Detail & Related papers  (2022-11-12T09:21:49Z)
• Stochastic Optimization of Areas Under Precision-Recall Curves with Provable Convergence [66.83161885378192]
  Area under ROC (AUROC) and precision-recall curves (AUPRC) are common metrics for evaluating classification performance for imbalanced problems. We propose a technical method to optimize AUPRC for deep learning.
  arXiv  Detail & Related papers  (2021-04-18T06:22:21Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.