- Rating
- 4
- Confidence
- 3
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
This paper studies the hypergraph partitioning problem. In this paper, the authors design a harness to generate the hypergraph partitioner, including placing the programs in the MAP-Elites grid by behavior and feeding the measured data into the LLM prompt. Then, the authors propose EvoPart, a lightweight partitioner which is better than KaHypar.
Critical strengths
S1. Using the harness to address the hypergraph partitioning problem is interesting.
S2. This paper is well-motivated.
S3. The harness pipeline is described in detail.
Critical weaknesses
W1. The reason why the authors use KaHyPar in harnessing could be more explained more clearly.
W2. Harness may lead to a better hypergraph partitioning algorithm. However, harnessing incurs high runtime and memory cost.
Questions for authors
Q1. In this paper, the harness process focuses on KaHypar. Since more recent hypergraph partitioning algorithms (e.g., SIGHP [1]) have been proposed, could the authors discuss whether and how harnessing could be applied to this method?
Q2. Could the authors provide a discussion of the trade-off mentioned in W2?
[1] Guan et al. SIGHP: Scalable Information-Guided Hypergraph Partitioner. KDD 2026
2 comments
Thank you for your response. My concerns are addressed. I choose to maintain my positive score.
We sincerely thank the reviewer for the positive assessment. We are glad that you found the use of a harness for hypergraph partitioning interesting, the paper well motivated, and the pipeline described in detail.
Your questions on the role of KaHyPar and on the cost of the harness helped us make both points explicit in the paper. Our detailed responses follow.
W1. The reason why the authors use KaHyPar in harnessing could be more explained more clearly.
Authors' answer: KaHyPar serves only as a reference. The score is computed from the ratio of a candidate's cut and running time to KaHyPar's on the same training instance. The model cannot see KaHyPar's code and cannot run it; the evolution starts from a program that assigns vertices round-robin. We chose KaHyPar because it is the most widely used open-source single-threaded partitioner, so "lower cut, less time, less code" has a clear meaning against it. In principle, any other partitioner could take this role.
Authors' action: We added this explanation to the description of the score in Section 3.
W2. Harness may lead to a better hypergraph partitioning algorithm. However, harnessing incurs high runtime and memory cost.
Q2. Could the authors provide a discussion of the trade-off mentioned in W2?
Authors' answer: Two costs should be separated. EvoPart itself is a single-threaded C++ program that calls no LLM when it is used; its running time and memory are those of a partitioner, as reported in the paper. The cost of the evolution is paid once. The reported run took 8.7 hours of wall time, including the evaluation of all candidates with four workers in parallel, and about 150 USD of API calls (4.4 million input and 0.9 million output tokens). Its memory cost is not significant: the harness only compiles and runs the candidate partitioner on the training instances, and its peak memory was about 5 GB.
The trade-off is therefore as follows. For the standard hypergraph partitioning problem, EvoPart can be used directly and no further evolution is needed. Only when the objective or the constraints change does the harness have to be adapted and run again, at the one-time cost above, in return for a solver tailored to the new problem. This is why we release both the partitioner and the harness.
Authors' action: We report the cost of the evolution runs (tokens, wall time) in Table 15 in the appendix and added a discussion of this trade-off there.
Q1. In this paper, the harness process focuses on KaHypar. Since more recent hypergraph partitioning algorithms (e.g., SIGHP [1]) have been proposed, could the authors discuss whether and how harnessing could be applied to this method?
Authors' answer: Yes, in two ways. First, as the reference: the harness needs only the objective value and running time of the reference partitioner on each training instance, so KaHyPar can be replaced by other recent hypergraph partitioners such as SIGHP. Second, as the starting point: the evolution could start from an implementation of an existing partitioner such as SIGHP, instead of the round-robin program. In both cases, the prompt, the score and the training set should follow the target method: SIGHP minimizes the (k−1) metric on large real-world hypergraphs for distributed processing, whereas this paper uses the cut-net metric on VLSI benchmarks.
Authors' action: We added this discussion to Appendix G.