- Rating
- 1
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
The paper proposes a method for piecewise symbolic equation discovery. It employs an EM-style algorithm to identify segment boundaries (partitioning) and utilizes symbolic regression to evolve explicit mathematical expressions within each segment.
Critical strengths
The problem targeted by this work extends the boundaries of traditional symbolic regression, shifting attention toward the discovery of piecewise functions. This direction is highly valuable and relevant, as many real-world physical and engineering systems exhibit regime-dependent behaviors that cannot be captured by a single global formula.
Critical weaknesses
-
Severe writing deficiencies and AI-generation artifacts. The overall writing quality is poor and fundamentally impedes readability. The text exhibits clear signs of AI-assisted generation without adequate human review: individual paragraphs appear superficially logical in isolation, but inter-paragraph transitions are incoherent and disjointed. This creates an illusion of content while leaving readers unable to grasp the paper's central thesis after reading. Basic academic writing literacy—such as constructing a clear narrative—is lacking.
-
Unclear motivation and failure to articulate core challenges. The Introduction does not clearly explain the specific difficulties in piecewise function discovery, nor does it position the proposed method relative to existing limitations. A fundamental logical progression—from problem hardness to current algorithmic status to the authors' angle of innovation—is entirely missing. Readers cannot understand why this work is necessary or what exactly it contributes.
-
Absence of a methodological framework figure. The paper provides no pipeline or overview diagram to illustrate the proposed approach. Given the complexity of combining genetic algorithms with EM-style gate creation, such a visual aid is essential for reader comprehension; its absence further exacerbates the readability problem.
\textit{(Note: The severity of these writing and presentation issues alone substantially undermines the paper's publishability, regardless of experimental merit.)}
Questions for authors
-
What is the core innovation of this work? Is the application of the EM algorithm a direct, off-the-shelf adoption, or has it been specifically modified/adapted to address the unique challenges of piecewise function discovery (e.g., non-differentiable argmax routing)?
-
What is the motivation for using an EM-style algorithm rather than heuristic methods or even a simple grid search? Specifically, since symbolic regression for different segments can be performed independently and in parallel without interference, a grid search over partition boundaries could systematically explore the space and guarantee optimality (or at least a globally optimal partition given fixed expressions). Why was this straightforward baseline not considered, analyzed, or compared against?
-
The proportion of datasets derived from real-world systems in the experimental validation is too small. Given that the paper targets "behavioral partitions from data," the evaluation relies heavily on synthetic or engineered benchmarks. More realistic datasets are needed to demonstrate practical utility beyond controlled settings.
2 comments
The revised paper is now uploaded, and the supplementary material and the anonymous repository are updated.
Weakness 1, writing: we went through the text again and revised the wording, mainly in Sec. 1, 3, 5.2 and 6.
Weakness 2, introduction: it now names the challenges of recovering piecewise laws first, followed by the existing methods and our approach (p. 1).
Weakness 3, overview figure: Fig. 2 shows the model and its search (p. 4).
Our reply quoted the numbers of the submitted version. In the revision the regime suite has 46 problems and BePart was run again, so the values are slightly different. The EM mixture has an ARI of 0.39 and BePart (srbench-cap) of 0.90 (Tab. 1, p. 8). The default configuration reaches 0.79 at 3.1 s per fit, and CluBS 0.16 at 5,557 s. The linear model tree has an ARI of 0.59 on the 23 problems with axis-aligned boundaries and of 0.21 on the 23 others, against 0.95 and 0.84 for BePart (Tab. 17, p. 46). 22 of the 46 problems are built from engineering laws and hybrid systems.
We would be grateful if you could take a look at the revised paper and let us know whether it addresses your concerns.
Thank you very much for your feedback! First, one correction to the summary: BePart does not find the boundaries with EM and then run symbolic regression per segment. Whole partitions, i.e. gates and experts together, are evolved jointly by a genetic algorithm under Pareto selection on error and complexity. The EM-style gate step is only one of its optimizations.
Weaknesses
1. Writing and narrative
We would be grateful for examples of passages the reviewer found incoherent, so that we can fix them directly. As stated in our AI use statement, AI was used for drafting and editing, but every sentence, claim, number and citation was checked, and most of the text was written or adjusted by hand. Nonetheless, we will check our text for the issues you mentioned and improve them.
2. Logical progression of the introduction
We agree that the introduction lacks the core challenges of piecewise function recovery and a logical progression, and we have revised it accordingly. Motivation and positioning however are, in our view, covered in the first paragraph and the related work.
3. Overview figure
We agree. Fig. 1 shows the model and the shortcomings of the baselines, but not the search. The revision, uploaded during the discussion period, adds a method overview figure to Sec. 3.
Questions
1.1 Core innovation
BePart is, to our knowledge, the first model in which the partition and the laws are both symbolic and searched for jointly. The technical contribution is the search machinery that makes this joint search work, since plain variation and selection almost never create a useful regime.
1.2 Is the EM step an off-the-shelf adoption?
No. The off-the-shelf version is one of our baselines: a mixture of linear regressions fitted by EM with a logistic router. On the regime suite its ARI is 0.35, against 0.91 for BePart (srbench-cap, Tab. 1). Adapting EM to our model required solving two issues. (1) Vanilla EM takes its E-step from the router's likelihoods, but our gates are not probabilistic and the routed error is a step function. The oracle assignment (that routes a point to its best fitting expert) supplies the missing target. (2) A gate has to win the argmax against the other gates on its points. The +1/-1 target around the strongest competitor's gate turns this into a least-squares problem, so the gate is fitted in closed form.
2.1 Why EM-style rather than heuristic methods?
BePart is a genetic algorithm and therefore itself a heuristic method. The EM-style step is an additional optimization, added because random variation rarely produces a useful gate, while the EM step is cheap (with the experts frozen, a candidate gate costs one gate evaluation and an argmax).
2.2 Could a grid search with independent SR per segment guarantee optimality?
Only within a fixed family of boundaries and at high cost. Every candidate partition costs one SR run per segment, and the number of candidates grows exponentially with the input dimension and the number of segments, so the grid soon becomes infeasible even with parallelization. BePart can be parallelized as well, but even on one core a fit takes 2.6 s (default, Tab. 1). The optimum of a grid search is also guaranteed only within the grid's family and resolution, and only if SR solves every cell optimally.
2.3 Why was this baseline not compared?
Two of our baselines follow this idea. CluBS (Zdankin et al., 2026) clusters the points by the SR model that explains them and fits one PySR expression per cluster. It reaches an ARI of 0.15 at a median of 4,979 s per fit, against 0.79 and 2.6 s for BePart (default, Tab. 1). The linear model tree is a greedy version of the grid search: it tries axis-aligned thresholds and fits a model on both sides of each. Its ARI is 0.48 on the 23 axis-aligned problems and 0.16 on the 15 others (BePart srbench-cap: 0.95 and 0.86).
3.1 Why mostly synthetic or engineered problems?
Partitions and laws can only be scored where the true partition and laws are known. In measured data the regimes are generally not labelled. We therefore built 14 of the 38 problems from textbook engineering laws and hybrid systems, over their physical input ranges and with up to 10% target noise.
3.2 Evidence of practical utility on realistic data?
Real data are in the paper, but can only be scored for accuracy: the SRBench black-box suite (122 PMLB datasets, 60 of them not synthetic Friedman problems) and the 35 datasets of OpenML-CTR23 (App. D). On SRBench, BePart has the best median test R2 at k=1 (Tab. 2). On CTR23, allowing several cells raises the median R2 from 0.776 to 0.821 (srbench-cap, Tab. 16). We agree that a case study on measured data with physically known regimes would show the practical use more directly and is part of ongoing research.