arXiv — cs.AI preprintsInternational12 October 2026
MPMMine: Better Benchmarks for Constraint Acquisition
This is an official announcement record
Firsthand records what arXiv — cs.AI preprints announced and links to the original. The wording below is theirs, not ours.
arXiv:2605.26279v2 Announce Type: replace Abstract: Constraint Acquisition (CA) and related research on the validation and enhancement of Mathematical Programming (MP) models using domain knowledge artifacts are currently limited by inadequate benchmarks. The existing benchmarks are loosely organized, provide inconsistent types and formats of artifacts for individual problems, are designed for benchmarking solvers rather than CA algorithms, include narrow classes of problems, or omit crucial details for the reproducibility of experiments and fair comparison of CA methods. We develop a benchmar
Read the official announcement
Opens arxiv.org
More from arXiv — cs.AI preprints
- Faithfulness Without Anchors: A Position Paper on the Structural Misalignments of Explainable AI Faithfulness Metrics for Feature Importance12 October 2026
- EliteTable: Self-Improving Program Search for Executable Control Policies12 October 2026
- Equal-Budget Monte Carlo Tree Search versus Randomized-Restart List Scheduling for DAG Workflows: A Controlled Equal-Budget Computational Study12 October 2026
- Know What You Don't Know: Agentic Data Synthesis by Evolving Generation Space for Closed-Loop Learning12 October 2026
- SpireBench: Evaluating Long-Horizon Strategic Play of Agentic Models with Slay the Spire12 October 2026
This content is for informational purposes only and is not professional advice. Specifications, prices, plan tiers, and features change frequently and may differ from what is shown here; verify current details on the manufacturer's or company's official page before purchasing. Ratings are based on analysis of published documentation, not independent lab testing.