面向学习引导的极值几何构造发现:一项PatternBoost研究
Towards Learning-Guided Discovery of Extremal Geometric Constructions: A PatternBoost Study
AI总结:
该研究基于PatternBoost框架,结合机器学习与领域知识,发现了组合几何问题的新极值构造,提升了相关整性间隙的下界。
摘要:
极值构造在算法的设计与分析中发挥核心作用:整性间隙实例可揭示松弛方法的局限性,而困难构型则能暴露计算难度的结构性来源。然而,这类构造通常仍需通过缓慢的人工过程发现。本文研究机器学习如何加速极值构造的发现,以支撑算法设计与分析。我们基于PatternBoost(一种将局部搜索与训练后的Transformer生成相结合的框架),利用其Axplorer实现研究三类问题:矩形最大独立集的整性间隙、用轴平行直线刺穿单位正方形的整性间隙,以及递归 Guillotine 切割的困难实例。通过探索候选表示、局部搜索操作及精确验证前用于对候选排序的代理模型,我们精心调整该框架以适配这些组合几何问题。若采用朴素表示与搜索策略,将无法发现非平凡实例;而我们的定制化调整则能发现大量非平凡构造。对于刺穿单位正方形问题,该方法达到了20/13≈1.54的间隙,优于文献中已知的最佳下界3/2。纯自动化搜索会快速收敛后进入平台期,这引发了需采取何种措施进一步提升该下界的问题。我们发现初始实例多样性具有重要作用:通过结构化阶梯构造提供适度的专家输入,系统可达到改进后的整性间隙14/9≈1.555。这些结果表明,机器学习与领域专业知识相结合,能够发现可推进算法下界的新极值构造。
英文摘要:
Extremal constructions play a central role in the design and analysis of algorithms. Integrality-gap instances expose the limitations of relaxations, while hard configurations reveal structural sources of computational difficulty. Such constructions, however, are still typically discovered through a slow, manual process. This paper investigates how machine learning can accelerate their discovery to support algorithm design and analysis. We build on PatternBoost, a framework alternating local search with generation from a trained transformer, using its Axplorer implementation to investigate three problems: integrality gaps for maximum independent set of rectangles, integrality gaps for stabbing unit squares with axis-parallel lines, and hard instances for recursive guillotine cutting. By exploring candidate representations, local search operations, and surrogate models used to rank candidates before exact verification, we carefully adapt the framework to these combinatorial geometry problems.While naive representations and search strategies fail to find non-trivial instances, our tailored adaptation discovers numerous non-trivial constructions. For stabbing unit squares, the method reaches a gap of $20/13\approx 1.54$, improving on the literature's best known lower bound of $3/2$. Purely automated search converges rapidly and then plateaus, prompting the question of what is required to push the bound higher still. We find that initial instance diversity plays an important role: with modest expert input via a structured staircase construction, the system reaches an improved integrality gap of $14/9\approx 1.555$. These results demonstrate that machine learning and domain expertise can be combined to discover new extremal constructions that advance algorithmic lower bounds.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。