GA-PC is presented, a novel genetic algorithm that modifies NSGA-II by introducing auxiliary calibration variables with a quadratic penalty that is scalable, exhibits transferability of hyperparameters, and is applicable to any number of criteria.
Abstract
In regression tasks, point estimates are insufficient—interval uncertainty must be quantified. The two main criteria for evaluating prediction intervals—Prediction Interval Coverage Probability (PICP) and Normalized Average Width (PINAW)—are conflicting, forming a Pareto front. This paper presents GA-PC, a novel genetic algorithm that modifies NSGA-II by introducing auxiliary calibration variables with a quadratic penalty. Unlike heuristic approaches, the introduction of these variables is theoretically justified via Noether’s second theorem and Bianchi identities: they correspond to gauge degrees of freedom, and the penalty acts as gauge fixing, improving convergence without altering the Pareto set. On ZDT2, GA-PC yields results that match the best reported values. On real financial data, the method provides full PICP coverage (0.000–1.000) and a wider PINAW range than NSGA-II and MOEA/D. The algorithm is scalable, exhibits transferability of hyperparameters, and is applicable to any number of criteria. Code available in the Supplementary File.
In large-scale stochastic many-objective time–cost–environment trade-off problems, influence is unevenly distributed: each objective is governed by a reduced subset of the decision variables that drive most of the controllable variation, while the remaining variables enlarge the Pareto search space—and the set of lever...
Javier Ortiz-Ávila, Freddy A. Lucay· Applied Sciences· 0 citations
Accurate calibration of the Heston model is essential for reliable option pricing, yet it remains a challenging task due to the nonlinear structure of the model and the presence of multiple conflicting objectives. Most existing approaches rely on single-objective formulations that focus solely on price fitting, which m...
Yan Fang· Poster Volume 0008 The 2026...· 0 citations
This paper includes new mutation techniques with a Pareto-based differential evolution algorithm, leveraging Generative AI to increase candidate solution diversity and a non-dominated sorting technique to lower the computational complexity involved in Pareto dominance.
Sunil Kumar Gouda, S. Ramasubbareddy, Kumar Surjeet Chaudhury et al.· Scientific Reports· 0 citations
In predictive maintenance, early and late RUL prediction errors carry asymmetric consequences, yet hyperparameter optimization typically targets a single accuracy metric that treats both directions equally. This study treats the optimization objective itself as a design variable. Five architectures (MLP, LSTM, XGBoost,...
Gold price volatility poses a major challenge for investors in making accurate and timely investment decisions, as price movements are influenced by complex and nonlinear financial dynamics. Conventional forecasting models often fail to capture these patterns optimally due to suboptimal parameter selection. This study...
Chairunnisyah Widi Pratiwi, A. Wanto, Hendry Qurniawan· Jurnal Teknik Informatika (J...· 0 citations
ANFIS rely on gradient-based optimization methods, which are prone to local optima, slow convergence, and sensitivity to parameter initialization. To address these limitations, this study proposes a Differential Evolution–optimized ANFIS framework. The proposed approach integrates FCM clustering to initialize the fuzzy...
Ji-Ying Zhang· International Conference on...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.