NEMay 4
Robust Differential Evolution via Nonlinear Population Size Reduction and Adaptive Restart: The ARRDE AlgorithmKhoirul Faiq Muzakka, Ahsani Hafizhu Shali, Haris Suhendar et al.
This study is motivated by a robustness issue in numerical optimization of bound-constrained problems: many algorithms that perform well on a particular benchmark suite, such as the IEEE CEC2017 problems, struggle to maintain the same level of performance when applied to other suites that differ in dimensionality, landscape complexity, or the maximum number of function evaluations ($N_{\text{max}}$). To address this issue, we propose the Adaptive Restart--Refine Differential Evolution (ARRDE) algorithm, a variant of Differential Evolution (DE) built on jSO. ARRDE is centered on two main design contributions: an adaptive restart--refine mechanism, which includes final-stage refinement and local exclusion during restart, and a nonlinear population-size reduction strategy whose shape depends on problem dimensionality. We evaluate ARRDE on five benchmark suites: CEC2011, CEC2017, CEC2019, CEC2020, and CEC2022. To the best of our knowledge, this is one of the most comprehensive experimental studies conducted in this context. Because the official metrics of these benchmark suites emphasize different performance aspects, we additionally introduce a bounded accuracy-based scoring metric derived from relative error for cross-suite robustness assessment. Using both the official suite-specific metrics and the proposed robustness-oriented metric, ARRDE consistently demonstrates top-tier performance and one of the most stable aggregate profiles across all benchmark suites. These results support ARRDE as a competitive and robust DE variant across heterogeneous benchmark regimes.
LGJan 24, 2025
Humanity's Last ExamLong Phan, Alice Gatti, Ziwen Han et al. · amazon-science, apple-ml
Benchmarks are important tools for tracking the rapid advancements in large language model (LLM) capabilities. However, benchmarks are not keeping pace in difficulty: LLMs now achieve over 90\% accuracy on popular benchmarks like MMLU, limiting informed measurement of state-of-the-art LLM capabilities. In response, we introduce Humanity's Last Exam (HLE), a multi-modal benchmark at the frontier of human knowledge, designed to be the final closed-ended academic benchmark of its kind with broad subject coverage. HLE consists of 2,500 questions across dozens of subjects, including mathematics, humanities, and the natural sciences. HLE is developed globally by subject-matter experts and consists of multiple-choice and short-answer questions suitable for automated grading. Each question has a known solution that is unambiguous and easily verifiable, but cannot be quickly answered via internet retrieval. State-of-the-art LLMs demonstrate low accuracy and calibration on HLE, highlighting a significant gap between current LLM capabilities and the expert human frontier on closed-ended academic questions. To inform research and policymaking upon a clear understanding of model capabilities, we publicly release HLE at https://lastexam.ai.
NEApr 29
RCMAES: A Robust CMA-ES Variant for CEC2026 CompetitionKhoirul Faiq Muzakka, Sören Möller, Martin Finsterbusch
This paper proposes RCMAES, a novel variant of the Covariance Matrix Adaptation Evolution Strategy (CMA-ES) for CEC benchmark optimization. RCMAES integrates a dimension-dependent nonlinear population-size reduction strategy with an adaptive restart mechanism within a pure CMA-ES framework. RCMAES is evaluated on three benchmark suites (CEC2017, CEC2020, and CEC2022) and compared with state-of-the-art DE algorithms as well as its closely related counterpart, BIPOP-aCMAES. Experimental results show that RCMAES achieves competitive and robust performance across all benchmarks.
MLDec 13, 2025
Towards a pretrained deep learning estimator of the Linfoot informational correlationStéphanie M. van den Berg, Ulrich Halekoh, Sören Möller et al.
We develop a supervised deep-learning approach to estimate mutual information between two continuous random variables. As labels, we use the Linfoot informational correlation, a transformation of mutual information that has many important properties. Our method is based on ground truth labels for Gaussian and Clayton copulas. We compare our method with estimators based on kernel density, k-nearest neighbours and neural estimators. We show generally lower bias and lower variance. As a proof of principle, future research could look into training the model with a more diverse set of examples from other copulas for which ground truth labels are available.