通过交互式精炼解决约束获取中的过拟合问题
Overcoming Over-Fitting in Constraint Acquisition via Query-Driven Interactive Refinement
- 结合被动学习与查询驱动的交互精炼,避免模型过拟合
- 在有限样本下实现高覆盖率和准确率,查询次数可控
- 适合数据稀缺场景下的约束建模,提升自动化可靠性
约束编程中的手工建模是主要瓶颈,约束获取(CA)旨在自动化这一过程。然而,被动式CA方法容易过拟合,常在小样本数据上学习到虚假全局约束;而纯主动方法则查询成本过高。本文提出一种混合框架,先用被动学习生成候选约束,再通过基于概率置信度的查询驱动交互精炼,系统识别过拟合约束,并引入专用子集探索机制从被拒候选中恢复有效子结构。最后以主动学习阶段确保模型完整性。在多个基准测试上的实验表明,该交互精炼阶段对在有限样本下实现高目标模型覆盖率和整体准确性至关重要,且查询复杂度可控。该框架显著推进了数据受限场景下鲁棒、实用的约束获取。
原文摘要 · Abstract (English)
Manual modeling in Constraint Programming is a substantial bottleneck, which Constraint Acquisition (CA) aims to automate. However, passive CA methods are prone to over-fitting, often learning models that include spurious global constraints when trained on limited data, while purely active methods can be query-intensive. We introduce a hybrid CA framework specifically designed to address the challenge of over-fitting in CA. Our approach integrates passive learning for initial candidate generation, a query-driven interactive refinement phase that utilizes probabilistic confidence scores (initialized by machine learning priors) to systematically identify over-fitted constraints, and a specialized subset exploration mechanism to recover valid substructures from rejected candidates. A final active learning phase ensures model completeness. Extensive experiments on diverse benchmarks demonstrate that our interactive refinement phase is crucial for achieving high target model coverage and overall model accuracy from limited examples, doing so with manageable query complexity. This framework represents a substantial advancement towards robust and practical constraint acquisition in data-limited scenarios.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。