Research map / Learning theory and algorithms / Combinatorial and search optimization
Finding Good Subtrees for Constraint Optimization Problems Using Frequent Pattern Mining
Hongbo Li, Jimmy Lee, He Mi, Minghao Yin
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 |
|---|---|---|---|
| increase top rate r% of sample solutions from 1% to 30% (ablation) | FPMS · UncapWLP | total optimal subtree length L: 60 -> 24 | Hurt |
| increase top rate r% from 1% to 30% (ablation) | FPMS · MKnap | total optimal subtree length L: 276 -> 192 | Hurt |
| increase top rate r% from 1% to 30% (ablation) | FPMS · TSP | instances with optimal subtree N: 6 -> 4 | Hurt |
| increase top number of frequent patterns from 1 to 10 (ablation) | FPMS · UncapWLP | total optimal subtree length L: 28 -> 49 | Improved |
| increase top number of frequent patterns from 1 to 50 (ablation) | FPMS · MKnap | total optimal subtree length L: 122 -> 322 | Improved |
| increase top number of frequent patterns from 1 to 5 (ablation) | FPMS · UncapWLP | instances with optimal subtree N: 8 -> 8 | No clear effect |
| increase number of random samples from 0.01% to 0.3% of feasible solutions (ablation) | frequent pattern mining · MKnap instance | opt rate: 33% -> 100% | Improved |
| use FPMS instead of naive search ABSO+MinVS | branch-and-bound · MKnap | overall winning instances (naive : FPMS): 9 : 29 | Improved |
| use FPMS instead of naive search ABSO+BIVS | branch-and-bound · TTPPV | overall winning instances (naive : FPMS): 14 : 6 | Hurt |
| use FPMS instead of naive search DW+BIVS | branch-and-bound · TSP | overall winning instances (naive : FPMS): 11 : 4 | Hurt |
| use FPMS instead of naive search ABSO+OBSVS | branch-and-bound · TSP | overall winning instances (naive : FPMS): 1 : 14 | Improved |
| use FPMS instead of naive search DW+BIVS | branch-and-bound · UncapWLP | overall winning instances (naive : FPMS): 8 :7 | No clear effect |
Closest papers by meaning
- Anchor Search: A Unified Framework for Suboptimal Bidirectional Search (AAAI 2025 · similarity 0.84)
- Prediction-Based Adaptive Variable Ordering Heuristics for Constraint Satisfaction Problems (AAAI 2025 · similarity 0.84)
- Scenario-Based Robust Optimization of Tree Structures (AAAI 2025 · similarity 0.84)
- ACM-MILP: Adaptive Constraint Modification via Grouping and Selection for Hardness-Preserving MILP Instance Generation (ICML 2024 · similarity 0.83)
- OptiTree: Hierarchical Thoughts Generation with Tree Search for LLM Optimization Modeling (NeurIPS 2025 · similarity 0.82)
- Learning Valid Dual Bounds in Constraint Programming: Boosted Lagrangian Decomposition with Self-Supervised Learning (AAAI 2025 · similarity 0.82)
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.
