A portfolio-based analysis method for competition results

05/30/2022
by   Nguyen Dang, et al.
0

Competitions such as the MiniZinc Challenges or the SAT competitions have been very useful sources for comparing performance of different solving approaches and for advancing the state-of-the-arts of the fields. Traditional competition setting often focuses on producing a ranking between solvers based on their average performance across a wide range of benchmark problems and instances. While this is a sensible way to assess the relative performance of solvers, such ranking does not necessarily reflect the full potential of a solver, especially when we want to utilise a portfolio of solvers instead of a single one for solving a new problem. In this paper, I will describe a portfolio-based analysis method which can give complementary insights into the performance of participating solvers in a competition. The method is demonstrated on the results of the MiniZinc Challenges and new insights gained from the portfolio viewpoint are presented.

READ FULL TEXT

page 1

page 3

page 5

page 6

page 7

page 9

research
05/05/2015

The Configurable SAT Solver Challenge (CSSC)

It is well known that different solution strategies work well for differ...
research
08/09/2023

Competitions in AI – Robustly Ranking Solvers Using Statistical Resampling

Solver competitions play a prominent role in assessing and advancing the...
research
05/29/2022

A Framework for Generating Informative Benchmark Instances

Benchmarking is an important tool for assessing the relative performance...
research
08/07/2020

Competition Report: CHC-COMP-20

CHC-COMP-20 is the third competition of solvers for Constrained Horn Cla...
research
09/10/2021

Competition Report: CHC-COMP-21

CHC-COMP-21 is the fourth competition of solvers for Constrained Horn Cl...
research
10/07/2021

Solving Rep-tile by Computers: Performance of Solvers and Analyses of Solutions

A rep-tile is a polygon that can be dissected into smaller copies (of th...
research
04/16/2020

Taxonomy of Dual Block-Coordinate Ascent Methods for Discrete Energy Minimization

We consider the maximum-a-posteriori inference problem in discrete graph...

Please sign up or login with your details

Forgot password? Click here to reset