Research map / Learning theory and algorithms / Combinatorial and search optimization
Learning Hard Optimization Problems: A Data Generation Perspective
James Kotary, Ferdinando Fioretto, Pascal Van Hentenryck
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Generate JSS targets sequentially, choosing optimal solutions close to the adjacent instance | JSS learning with Optimal Design data · JSS ta25 | prediction error: 193.9 -> 23.4 | Improved |
| Generate JSS targets sequentially, choosing optimal solutions close to the adjacent instance | JSS learning with Optimal Design data · JSS swv03 | optimality gap (%): 18.0 -> 2.2 | Improved |
| Generate JSS targets sequentially, choosing optimal solutions close to the adjacent instance | JSS learning with Optimal Design data · JSS swv11 | prediction error: 1090.0 -> 51.2 | Improved |
| Generate OPF targets using consistent generator commitments that remove symmetries | OPF learning with Optimal Design data · Pegase-89 | prediction error: 89.17 -> 2.78 | Improved |
| Generate OPF targets using consistent generator commitments that remove symmetries | OPF learning with Optimal Design data · Pegase-89 | constraint violation: 1.353 -> 0.003 | Improved |
| Generate OPF targets using consistent generator commitments that remove symmetries | OPF learning with Optimal Design data · IEEE-118 | optimality gap (%): 3.80 -> 0.36 | Improved |
Closest papers by meaning
- Unsupervised Learning for Combinatorial Optimization with Principled Objective Relaxation (NeurIPS 2022 · similarity 0.87)
- Learning-Augmented Approximation Algorithms for Maximum Cut and Related Problems (NeurIPS 2024 · similarity 0.86)
- Solver-Free Decision-Focused Learning for Linear Optimization Problems (NeurIPS 2025 · similarity 0.86)
- Geometric Algorithms for Neural Combinatorial Optimization with Constraints (NeurIPS 2025 · similarity 0.86)
- Parsimonious Learning-Augmented Approximations for Dense Instances of $\mathcal{NP}$-hard Problems (ICML 2024 · similarity 0.86)
- Piecewise Constant and Linear Regression Trees: An Optimal Dynamic Programming Approach (ICML 2024 · similarity 0.85)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
