English(EN) Selection Hyper-heuristics Can Automatically Adjust the Learning Period to Optimally Solve Pseudo-Boolean Problems

新的超启发式算法可自动调整优化问题的参数

作者 PulseAugur 编辑部 · [2 个来源] · 2026-05-28 13:31

研究人员开发了一种新的超启发式方法，该方法可自动调整伪布尔问题的优化学习周期这一关键学习参数。此方法消除了对该参数进行手动调整的需要，而手动调整以前对用户来说是一项艰巨的任务。新方法已被证明可以有效地选择最优的邻域大小，从而在LeadingOnes等基准测试中实现最佳优化时间。 AI

影响自动化优化算法中的参数调整，有望提高复杂问题的效率和可访问性。

排序理由该集群包含一篇详细介绍优化问题新算法方法的学术论文。

AI 生成摘要 · Google Gemini · 来自 2 个来源。我们如何撰写摘要 →

本文如何被排名

Signal score: 0 / 100; Composite score across the factors below. Higher = stronger signal that this story matters right now.
Newsworthiness bucket: Research; 该集群包含一篇详细介绍优化问题新算法方法的学术论文。
Source corroboration: 2 independent sources; Multiple independent publishers reporting the same story raises confidence that it's real and newsworthy.
Topics: paper, other; Editorial topic classification. Feeds into how the story surfaces on /topic/<slug> hub pages and into the per-entity coverage mix.
AI-industry relevance: High; Clearly on-topic for AI-industry coverage.
Story freshness: 152 days old; Aged out of breaking-news scoring windows; ranking reflects the durable signal from the full source set.

完整方法见我们的编辑标准。

arXiv cs.AI TIER_1 English(EN) · Benjamin Doerr, Pietro S. Oliveto, John Alasdair Warwicker · 2026-05-29 04:00

选择性超启发式算法可自动调整学习周期以最优地解决伪布尔问题

arXiv:2605.29916v1 Announce Type: cross Abstract: The Random Gradient hyper-heuristic was recently shown to be able to learn the optimal neighbourhood size when optimizing the LeadingOnes benchmark via the Randomised Local Search (RLS) meta-heuristic. However, for this to happen,…
arXiv cs.NE (Neural & Evolutionary) TIER_1 English(EN) · John Alasdair Warwicker · 2026-05-28 13:31

选择性超启发式算法可自动调整学习周期以最优地解决伪布尔问题

The Random Gradient hyper-heuristic was recently shown to be able to learn the optimal neighbourhood size when optimizing the LeadingOnes benchmark via the Randomised Local Search (RLS) meta-heuristic. However, for this to happen, a learning period of a certain length $τ$ had to …