CORTEXA
← Browse
arxivcond-mat.mtrl-scicond-mat.dis-nncs.AIcs.LGmath.OC2026-07-08

Bayesian Optimization of Genetic Algorithm Hyperparameters in a Multi-Fidelity Framework for Efficient Lattice Material Design

Sergei Zorkaltsev, Maciej Haranczyk, Christina Schenk

This study presents a multi-fidelity framework for the systematic optimization of genetic algorithm (GA) hyperparameters. The framework integrates three fidelity levels: high-fidelity Fast Fourier Transform (FFT) homogenization for validation, a medium-fidelity 3D convolutional neural network surrogate for rapid property evaluation, and a low-fidelity Gaussian process (GP) surrogate within a Bayesian optimization (BO) framework to guide the hyperparameter search. Various acquisition functions are evaluated, with logNEI achieving the best performance by effectively accounting for the noise inherent in GA evaluations. The proposed framework identifies hyperparameter configurations that enable a 25-generation GA run to achieve elastic modulus values comparable to those obtained in a full 75-generation optimization. Furthermore, introducing a penalized BO objective significantly reduces the number of required lattices with only minor decreases in absolute achieved elastic modulus, revealing a practical trade-off between performance and the number of structures that must be evaluated. High-fidelity FFT validation verifies the effectiveness of the surrogate-driven optimization strategy. The optimized hyperparameters allow for rapid convergence, eliminate the need for lattice mutation, and reduce the overall computational cost by 24% (from 225 to 171 hours) while preserving mechanical performance. These results demonstrate the potential of multi-fidelity optimization as an efficient and practical approach for GA hyperparameter tuning and future experimental lattice design studies.

View free PDFSource page

Related papers

arxivmath.OCcs.AIcs.LGstat.ML2026-07-24

Explicit Iteration Complexity of Exact Data-Driven Inverse Optimization for Integer Linear Programs

Akira Kitaoka

A data-driven inverse optimization problem (DDIOP) is the problem of estimating the objective-function parameters (weights) that explain observed optimal-solution data, and it arises in many applications, including integer linear programming (ILP). It is known that, by applying g…

View free PDFSource page
arxivmath.OCcs.AIcs.LG2026-07-23

Barzilai-Borwein Fails Superlinear Convergence on an Open Set of Quadratics for Every Dimension $n\geq 4$

Dawei Li, Xiaotian Jiang, Mingyi Hong

Barzilai--Borwein (BB) method has shown strong practical performance in continuous optimization, yet its convergence dynamics remains poorly understood. In particular, a central unresolved question is whether BB converges superlinearly for almost every strictly convex quadratic p…

View free PDFSource page
arxivcs.ROcs.AIcs.LG2026-07-24

One Hand Watches The Other: Dynamic Multi-Agent Cooperation for Sample-Efficient Bimanual Manipulation in Dynamic Environments

Jan Ole von Hartz, Abhinav Valada, Joschka Boedecker

Multi-stream robot manipulation policies achieve unparalleled sample efficiency and generalization by modeling actions relative to environmental reference frames. However, existing approaches typically assume these frames to be strictly exogenous. This causal assumption collapses…

View free PDFSource page
arxivcs.LGcs.AI2026-07-24

Optimization of time-consuming experimental conditions using pseudo-experimental data guided by adaptive polynomial regression

Hirotaka Sugawara, Yujin Taguchi, Kei Minagawa, Yusuke Hiki, Takashi Morikura, Akira Funahashi

Bayesian optimization (BO) is an optimization method that sequentially proposes the next candidate explainable variables for optimizing target variables by balancing exploration and exploitation. BO is often used under a limited evaluation budget, such as hyperparameter tuning of…

View free PDFSource page
arxiveess.AScs.AIcs.LGcs.SD2026-07-31

Stable Autoregressive Speech Generation with Low-Frame-Rate High-Dimensional Continuous Tokens

Yi Luo, Rongzhi Gu, Jixun Yao

Balancing sequence length, representational capacity, and long-horizon stability is a central problem in autoregressive (AR) speech and audio generation. Representations with higher frame rates or greater capacity can preserve more signal detail, but they also make streaming gene…

View free PDFSource page
arxivcs.LGcs.AIcs.CL2026-07-24

Teaching LLMs to Self-Evolve: Cultivating Core Meta-Skills with Reinforcement Learning

Shujin Wu, Cheng Qian, Xiusi Chen, Heng Ji

Test-time scaling through iterative self-evolution with environment feedback, as demonstrated by AlphaEvolve, shows remarkable performance gains. We hypothesize that the success of such evolution frameworks hinges on meta-skills, such as self-reflection with environment feedback,…

View free PDFSource page