Research map / Learning theory and algorithms / Combinatorial and search optimization
Improving Local Search Algorithms via Probabilistic Configuration Checking
Weilin Luo, Rongzhen Ye, Hai Wan, Shaowei Cai, Biqing Fang, Delong Zhang
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 |
|---|---|---|---|
| Replace CC2FS configuration checking with trained probabilistic configuration checking | CC2FS · MWDS T1 test | sum of difference in min solution weight: -2129 | Improved |
| Replace CC2FS configuration checking with trained probabilistic configuration checking | CC2FS · MWDS T2 test | sum of difference in min solution weight: -697 | Improved |
| Replace CC2FS configuration checking with trained probabilistic configuration checking | CC2FS · MWDS UDG test | sum of difference in min solution weight: 541 | Hurt |
| Replace CC2FS configuration checking with trained probabilistic configuration checking | CC2FS · MWDS BHOSLIB test | sum of difference in min solution weight: -52 | Improved |
| Replace CC2FS configuration checking with trained probabilistic configuration checking | CC2FS · MWDS DIMACS test | sum of difference in min solution weight: -4 | Improved |
| Replace LSCC configuration checking with trained probabilistic configuration checking | LSCC · MWCP BHOSLIB test | sum of difference in max solution weight: 315 | Improved |
| Replace LSCC configuration checking with trained probabilistic configuration checking | LSCC · MWCP DIMACS test | sum of difference in max solution weight: -19 | Mixed |
| Use a random half of the neighborhoods at each level in the configuration (ablation) | CC2FS · MWDS BHOSLIB | average solution value: 214.2 -> 212.0 | Improved |
| Train a separate probabilistic configuration for each benchmark | CC2FS-P · MWDS UDG test | sum of difference in min solution weight: -555 | Improved |
| Use a random probabilistic configuration instead of tuning its probabilities (ablation) | CC2FS-P · MWDS | solution score | Hurt |
| Replace configuration checking with probabilistic configuration checking | CC2FS and LSCC · MWDS and MWCP | number of different candidate solutions visited | Improved |
Closest papers by meaning
- Local Search with Dynamic-Threshold Configuration Checking and Incremental Neighborhood Updating for Maximum k-plex Problem (AAAI 2020 · similarity 0.89)
- Bayesian Optimization of Functions over Node Subsets in Graphs (NeurIPS 2024 · similarity 0.86)
- Theoretical Aspects of Generating Instances with Unique Solutions: Pre-assignment Models for Unique Vertex Cover (AAAI 2024 · similarity 0.84)
- COMBHelper: A Neural Approach to Reduce Search Space for Graph Combinatorial Problems (AAAI 2024 · similarity 0.84)
- Differentiable Quadratic Optimization For the Maximum Independent Set Problem (ICML 2025 · similarity 0.84)
- Tackling Prevalent Conditions in Unsupervised Combinatorial Optimization: Cardinality, Minimum, Covering, and More (ICML 2024 · similarity 0.83)
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.
