arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2603.14801stat.APstat.CO
收藏

回归中的遗传算法

Genetic Algorithms in Regression

University of Louisiana at Lafayette(路易斯安那大学拉斐特分校);Virginia Commonwealth University(弗吉尼亚联邦大学);University of California, Santa Cruz(加利福尼亚大学圣克鲁兹分校);University of Nebraska-Lincoln(内布拉斯加大学林肯分校)

Mo Li, QiQi Lu, Robert Lund, Xueheng Shi

AI总结:

本文提出GAReg,一种统一的遗传算法包,用于解决离散优化回归问题,通过紧凑染色体表示和约束保持的交叉突变操作,高效搜索高维模型空间,提供近优解。

摘要:

许多统计问题涉及在具有未知维度的离散参数空间上的优化。在这些设置中,基于梯度的方法往往失效,因为目标函数的非可导性或非凸或大规模的搜索空间,目标函数具有许多局部极值。本文提出了GAReg,一种统一的遗传算法包,用于处理离散优化回归问题,当标准算法不适用时表现良好。GAReg提供紧凑的染色体表示,支持回归样条的最佳结点放置、最佳子集回归变量选择及相关问题。该包允许统一初始化、约束保持的交叉和突变、稳态替换以及可选的岛屿模型并行化。GAReg高效地搜索高维模型空间,在穷举枚举或整数或动态规划方法不可行的设置中提供近优解。

英文摘要:

Many statistical problems involve optimization over a discrete parameter space having an unknown dimension. In such settings, gradient-based methods often fail due to the non-differentiability of the objective function or a non-convex or massive search space with an objective function having many local maxima/minima. This paper presents GAReg, a unified genetic algorithm package that handles discrete optimization regression problems, which works well when standard algorithms are unjustified. GAReg provides a compact chromosome representation supporting optimal knot placement for regression splines, best-subset regression variable selection, and related problems. The package allows for uniform initialization, constraint-preserving crossover and mutation, steady-state replacement, and an optional island-model parallelization. GAReg efficiently searches high-dimensional model spaces, providing near-optimal solutions in settings where exhaustive enumeration or integer or dynamic programming approaches are infeasible.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑