Overcoming Over-Fitting in Constraint Acquisition via Query-Driven Interactive Refinement
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 3 of its 43 references that are in the map. First posted on arXiv 29 Sep 2025.
Builds on
3 of 43 references.
References · 3
- 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,166
- 2023Guided Bottom-Up Interactive Constraint Acquisitioncited by 3
- 2023Learning to Learn in Interactive Constraint Acquisitioncited by 2
Built on by
Not cited yet.