Research map / Learning theory and algorithms / Combinatorial and search optimization
Meta-Search Through the Space of Representations and Heuristics on a Problem by Problem Basis
Raquel Fuentetaja, Michael Barley, Daniel Borrajo, Jordan Douglas, Santiago Franco, Patricia Riddle
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 |
|---|---|---|---|
| use per-problem meta-search (MSP) instead of fixed original representation with FD pre-processor | RIDA* · IPC'11+'14 coverage | problems solved: 276 -> 323 | Improved |
| use per-problem meta-search instead of original representation with h2 pre-processor | RIDA* · IPC'11+'14 coverage | problems solved: 315 -> 323 | Improved |
| use per-problem meta-search instead of Baggy representation with h2 pre-processor | RIDA* · IPC'11+'14 coverage | problems solved: 123 -> 323 | Improved |
| compare MSP with FD+LMCut | MSP · IPC'11+'14 coverage | problems solved: 264 -> 323 | Improved |
| compare MSP with SYMBA* (IPC14 winner) | MSP · IPC'11+'14 coverage | problems solved: 339 -> 323 | Hurt |
| exclude Openstacks14 when comparing with SYMBA* | MSP · IPC'11+'14 coverage | problems solved: 320 vs 319 | No clear effect |
| replace greedy meta-search/f-limit evaluation by random walk over the meta-search space (ablation) | MSP · IPC'11+'14 coverage | problems solved: 323 -> 256 | Hurt |
| use random order of meta-search operators instead of preferred order (ablation) | MSP · IPC'11+'14 coverage | problems solved: 323 -> 324 | No clear effect |
| halve time limit to 900s assuming negligible meta-search cost (ablation) | MSP · IPC'11+'14 coverage | problems solved: 323 -> 321 | No clear effect |
| halve time limit to 900s for baseline configs | OFD/Oh2/Bh2 · IPC'11+'14 coverage | problems solved: 276 -> 267; 315 -> 306; 123 -> 118 | Hurt |
| use non-alphabetical reordering of operators (inverse, random) as representation change (ablation) | MSP with FD · IPC'11+'14 coverage | problems solved | No clear effect |
| use alphabetical-inverse operator ordering as representation change (ablation) | MSP with FD · IPC'11+'14 heuristic behavior | problems solved | Improved |
Closest papers by meaning
- Reactive Dialectic Search Portfolios for MaxSAT (AAAI 2017 · similarity 0.83)
- Hierarchical Representations for Cross-task Automated Heuristic Design using LLMs (ICML 2026 · similarity 0.83)
- Learning Domain-Independent Heuristics for Grounded and Lifted Planning (AAAI 2024 · similarity 0.82)
- Large Language Models as End-to-end Combinatorial Optimization Solvers (NeurIPS 2025 · similarity 0.82)
- PathWise: Planning through World Model for Automated Heuristic Design via Self-Evolving LLMs (ICML 2026 · similarity 0.82)
- On the Meta-Design of Allocation Problems (NeurIPS 2026 · 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.
