Better Understandings and Configurations in MaxSAT Local Search Solvers via Anytime Performance Analysis (2403.06568v2)
Abstract: 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.
- Tobias Achterberg. SCIP: solving constraint integer programs. Mathematical Programming Computation, 1(1):1–41, 2009.
- Haifa Hamad AlKasem and Mohamed El Bachir Menai. Stochastic local search for partial max-sat: an experimental evaluation. Artificial Intelligence Review, 54(4):2525–2566, 2021.
- Maxsat evaluation 2023. Department of Computer Science Series of Publications B, B-2023-2, 2023.
- Old techniques in new ways: Clause weighting, unit propagation and hybridization for maximum satisfiability. Artificial Intelligence, 287:103354, 2020.
- Tailoring local search for partial maxsat. In Carla E. Brodley and Peter Stone, editors, Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, July 27 -31, 2014, Québec City, Québec, Canada, pages 2623–2629. AAAI Press, 2014.
- From decimation to local search and back: A new approach to maxsat. In Carles Sierra, editor, Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, Melbourne, Australia, August 19-25, 2017, pages 571–577. ijcai.org, 2017.
- Nuwls: Improving local search for (weighted) partial maxsat by new weighting techniques. In Brian Williams, Yiling Chen, and Jennifer Neville, editors, Thirty-Seventh AAAI Conference on Artificial Intelligence, AAAI 2023, Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence, IAAI 2023, Thirteenth Symposium on Educational Advances in Artificial Intelligence, EAAI 2023, Washington, DC, USA, February 7-14, 2023, pages 3915–3923. AAAI Press, 2023.
- IOHexperimenter: Benchmarking platform for iterative optimization heuristics. Evolutionary Computation, pages 1–6, 2023.
- On the impact of the performance metric on efficient algorithm configuration. Artificial Intelligence, 303:103629, 2022.
- COCO: performance assessment. CoRR, abs/1605.03560, 2016.
- Anytime performance assessment in blackbox optimization benchmarking. IEEE Transactions on Evolutionary Computation, 26(6):1293–1305, 2022.
- Large neighbourhood search for anytime maxsat solving. In Luc De Raedt, editor, Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, IJCAI 2022, Vienna, Austria, 23-29 July 2022, pages 1818–1824. ijcai.org, 2022.
- Solving (weighted) partial maxsat by dynamic local search for SAT. In Jérôme Lang, editor, Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI 2018, July 13-19, 2018, Stockholm, Sweden, pages 1346–1352. ijcai.org, 2018.
- SMAC3: A versatile bayesian optimization package for hyperparameter optimization. Journal of Machine Learning Research, 23:54:1–54:9, 2022.
- Automatically improving the anytime behaviour of optimisation algorithms. European Journal Of Operational Research, 235(3):569–582, 2014.
- The irace package: Iterated racing for automatic algorithm configuration. Operations Research Perspectives, 3:43–58, 2016.
- IOHanalyzer: Detailed performance analyses for iterative optimization heuristics. ACM Transactions on Evolutionary Learning and Optimization, 2(1):3:1–3:29, 2022.
- Automated configuration of genetic algorithms by tuning for anytime performance. IEEE Transactions on Evolutionary Computation, 26(6):1526–1538, 2022.
- Bandmaxsat: A local search maxsat solver with multi-armed bandit. In Luc De Raedt, editor, Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, IJCAI 2022, Vienna, Austria, 23-29 July 2022, pages 1901–1907. ijcai.org, 2022.
- Farsighted probabilistic sampling: A general strategy for boosting local search maxsat solvers. In Brian Williams, Yiling Chen, and Jennifer Neville, editors, Thirty-Seventh AAAI Conference on Artificial Intelligence, AAAI 2023, Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence, IAAI 2023, Thirteenth Symposium on Educational Advances in Artificial Intelligence, EAAI 2023, Washington, DC, USA, February 7-14, 2023, pages 4132–4139. AAAI Press, 2023.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.