mlsanityData to 14 Oct 2026

Better Understandings and Configurations in MaxSAT Local Search Solvers via Anytime Performance Analysis

arXiv 2403.06568 ↗First posted 11 Mar 2024cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Though numerous solvers have been proposed for the MaxSAT problem, and the benchmark environment such as MaxSAT Evaluations provides a platform for the comparison of the state-of-the-art solvers, existing assessments were usually evaluated based on the quality, e.g., fitness, of the best-found solutions obtained within a given running time budget. However, concerning solely the final obtained solutions regarding specific time budgets may restrict us from comprehending the behavior of the solvers along the convergence process. This paper demonstrates that Empirical Cumulative Distribution Functions can be used to compare MaxSAT stochastic local search solvers' anytime performance across multiple problem instances and various time budgets. The assessment reveals distinctions in solvers' performance and displays that the (dis)advantages of solvers adjust along different running times. This work also exhibits that the quantitative and high variance assessment of anytime performance can guide machines, i.e., automatic configurators, to search for better parameter settings. Our experimental results show that the hyperparameter optimization tool, i.e., SMAC, can achieve better parameter settings of solvers when using the anytime performance as the cost function, compared to using the metrics based on the fitness of the best-found solutions.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 8 of its 27 references that are in the map. First posted on arXiv 11 Mar 2024.

Builds on

8 of 27 references.

References · 8

  1. 2021SMAC3: A Versatile Bayesian Optimization Package for Hyperparameter Optimizationcited by 230
  2. 2021IOHexperimenter: Benchmarking Platform for Iterative Optimization Heuristicscited by 24
  3. 2020IOHanalyzer: Detailed Performance Analyses for Iterative Optimization Heuristicscited by 20
  4. 2019Benchmarking Discrete Optimization Heuristics with IOHprofilercited by 14
  5. 2021Automated Configuration of Genetic Algorithms by Tuning for Anytime Performancecited by 9
  6. 2016COCO: Performance Assessmentcited by 8
  7. 2022BandMaxSAT: A Local Search MaxSAT Solver with Multi-armed Banditcited by 6
  8. 2021Farsighted Probabilistic Sampling: A General Strategy for Boosting Local Search MaxSAT Solverscited by 4

Built on by

Not cited yet.