Research map / Learning theory and algorithms / Combinatorial and search optimization
Fine-Grained Search Space Classification for Hard Enumeration Variants of Subset Problems
Juho Lauri, Sourav Dutta
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 |
|---|---|---|---|
| Apply learned vertex-classification preprocessing before clique enumeration | cliquer · socfb-Texas84 | runtime (seconds): 4.10 -> 1.87 | Improved |
| Apply learned vertex-classification preprocessing before clique enumeration | cliquer · bio-WormNet-v3 | runtime (seconds): 1.04 -> 0.89 | Improved |
| Apply learned vertex-classification preprocessing before clique enumeration | cliquer · soc-google-plus | speedup: 214.20 -> 310.40 | Improved |
| Use probabilistic pruning on real-world network instances | Maximum clique enumeration · Real-world networks in Table 1 | clique accuracy | Improved |
| Transfer a classifier trained on (64,10) instances to larger planted-clique graphs | Planted-clique preprocessing · Planted clique, n=128, k=13 | vertex classification accuracy: 0.858 -> 0.844 | No clear effect |
| Transfer a classifier trained on (64,10) instances to larger planted-clique graphs | Planted-clique preprocessing · Planted clique, n=256, k=14 | vertex classification accuracy: 0.747 -> 0.728 | No clear effect |
| Transfer a classifier trained on (64,10) instances to larger planted-clique graphs | Planted-clique preprocessing · Planted clique, n=512, k=16 | vertex classification accuracy: 0.678 -> 0.665 | No clear effect |
| Increase planted-clique graph size while relying on local graph features | Planted-clique preprocessing · Planted clique | clique accuracy | Hurt |
Closest papers by meaning
- COMBHelper: A Neural Approach to Reduce Search Space for Graph Combinatorial Problems (AAAI 2024 · similarity 0.87)
- Improved Approximations for Hard Graph Problems using Predictions (ICML 2025 · similarity 0.85)
- Accelerating data-driven algorithm selection for combinatorial partitioning problems (NeurIPS 2025 · similarity 0.85)
- Geometric Algorithms for Neural Combinatorial Optimization with Constraints (NeurIPS 2025 · similarity 0.85)
- Approximation algorithms for combinatorial optimization with predictions (ICLR 2025 · similarity 0.85)
- Differentiable Quadratic Optimization For the Maximum Independent Set Problem (ICML 2025 · 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.
