跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.26011 · v1

A Matter of Representation: Evolving Partial Spreads for Bent Functions

首次提交 2026-11-19 20:29
版本更新 2026-11-19 20:29
雷达观测 2026-11-20 16:53
arXiv ↗PDF ↗

摘要

Partial spread (PS\mathcal{PS}) bent functions are Boolean functions of maximum nonlinearity built from families of subspaces that pairwise intersect only in the null vector. We design an Evolution Strategy (ES) to construct such partial spread families, comparing two encodings: one based on generator matrices of the subspaces, and one based on spread sets. With the latter, combined with a ruin-and-rebuild operator, the ES finds PS\mathcal{PS} functions up to n=10n=10 variables. An ablation study shows that mutation is necessary, while the population size is not, and that a restarted look-ahead greedy heuristic outperforms the ES on the hardest instance. We investigate this finding with a landscape analysis of the stagnation points, and we also introduce a quality-diversity variant of the ES which finds PS\mathcal{PS} functions of low algebraic degree for 8 variables. Interestingly, the bent functions evolved by the ES have higher 2-ranks and mostly higher degrees than those obtained by a baseline Genetic Programming optimizer.

作者备注:16 pages, 2 figures, 2 tables

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-19 20:29 · 最新观测版本

A Matter of Representation: Evolving Partial Spreads for Bent Functions

Partial spread (PS\mathcal{PS}) bent functions are Boolean functions of maximum nonlinearity built from families of subspaces that pairwise intersect only in the null vector. We design an Evolution Strategy (ES) to construct such partial spread families, comparing two encodings: one based on generator matrices of the subspaces, and one based on spread sets. With the latter, combined with a ruin-and-rebuild operator, the ES finds PS\mathcal{PS} functions up to n=10n=10 variables. An ablation study shows that mutation is necessary, while the population size is not, and that a restarted look-ahead greedy heuristic outperforms the ES on the hardest instance. We investigate this finding with a landscape analysis of the stagnation points, and we also introduce a quality-diversity variant of the ES which finds PS\mathcal{PS} functions of low algebraic degree for 8 variables. Interestingly, the bent functions evolved by the ES have higher 2-ranks and mostly higher degrees than those obtained by a baseline Genetic Programming optimizer.

查看此版本解读 →查看此版本原文 ↗