- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper proposes a new generation framework for initializing a design of 3D electromagnetic coil. This paper introduced a tailored structure of diffusion model for the problem, and sampling method (sec 4.5). Training data is composed by random (bad data) and simulations (good data). The model is pretrained with the former, and further trained with the latter. Experimental results show that the proposed method consistently outperforms all four learning-based baselines.
Critical strengths
This paper addresses a niche yet potentially high-impact problem.
Critical weaknesses
A primary concern is that, is this really a deep-learning problem? I am somewhat not familiar with this domain (3D electromagnetic coil design), but the voxel grids used in the study (e.g., 11 x 10 x 6) seem small enough to be explored via non deep-learning methods. This paper lacks a rigorous comparison to show why a complex diffusion model should be used, in terms of runtime, computational cost, or generalizability. I also do not see novelties on methodologies that can be useful in other problems, although each modules are reasonably employed. Moreover, the training data themselves are generated by simulations. Then, why do we need NN to mimic the dataset? The paper fails to provide a compelling reason for it. Can model generate a new sample that is effectively not in the dataset?
Questions for authors
-
Why do you need to build NN even though you have a training dataset? 1-1. Can the method generalize in a different configuration (from training dataset)? 1-2. Is computational cost significantly smaller than traditional methods? 1-3. Can you compare the computational costs of generating training dataset with sampling with your method? 1-4. Can model generate a new sample that is effectively not in the dataset?
-
Is there any possibilities or necessities of scaling-up (so that traditional / handcraft methods can not easily be applied)?
6 comments
Responses to Reviewer YHpJ [2/2]
Q4. Can the method generalize in a different configuration (from training dataset)?
A4. Yes. Our framework can be adapted to new coil configurations and broader constrained path-design tasks. For a new scene, feasible paths can be generated through geometric checks without physical simulation, supporting geometry pretraining, while a small labeled subset enables preference guidance and elite initialization. The core architecture and constrained search procedure remain unchanged. We have described the data needed to adapt the framework to a new coil configuration in Section 6 under “Generalization.”
Q5. 1-2. Is computational cost significantly smaller than traditional methods? 1-3. Can you compare the computational costs of generating training dataset with sampling with your method?
A5. Our method achieves runtime comparable to GDP and substantially lower than 3D-CDM and predictor-based baselines, though higher than Random-DFS, which we use to generate unlabeled training paths. We measured the time to generate 100 valid, unique candidate paths on our proposed scene Staggered using a single NVIDIA RTX 3090 GPU. Results are reported as the mean ± sample standard deviation over five runs. Timing covers the full online pipeline, including loading, generation, failed DFS attempts, backtracking, retries, deduplication, screening, elite updates, and output processing. For fairness, physical evaluation time was excluded for all methods. We have clarified how the training paths and labels are obtained in Section 3 under “Data and budget,” and reported the online sampling comparison in Section 5.1 and Appendix G.1 (Table 21).
Table 3. Online sampling time (seconds; lower is better). Predictor-based methods incur additional costs from large-pool generation and screening (10,000 paths); 3D-CDM requires iterative voxel denoising and constrained decoding.
| Method | Time (s) ↓ |
|---|---|
| Random-DFS | 46.17 ± 2.42 |
| GDP | 88.40 ± 9.82 |
| Pathformer-Predictor | 3657.53 ± 50.95 |
| Voxel-Predictor | 3605.89 ± 44.32 |
| 3D-CDM | 202.88 ± 3.27 |
| Ours | 92.18 ± 2.71 |
Q6. Can model generate a new sample that is effectively not in the dataset?
A6. Yes, our method explicitly rejects duplicates of labeled and previously accepted paths during inference. To further verify novelty, we compared all 4,500 generated candidates against each scene's 10,000-path catalog and labeled set. No complete-path duplicates were found, confirming that our method generates novel paths beyond the existing dataset. We have clarified the inference-time duplicate checks against labeled paths and previously accepted candidates in Section 4.5.
Q7. Is there any possibilities or necessities of scaling-up (so that traditional / handcraft methods can not easily be applied)?
A7. Yes, larger routing domains, finer voxel grids, and more complex obstacles motivate scaling beyond traditional methods. Our framework can be extended by adapting scene inputs, action representations, and training data while retaining preference-guided reconstruction and hard geometric constraints. Larger-scale applications may require additional training data and computational resources. We have discussed the effects of grid resolution, routing-domain size, and obstacle density in Section 6 under “Scalability.”
We sincerely hope our clarifications above have addressed your questions.
Looking Forward to the Response from Reviewer YHpJ
Dear Reviewer YHpJ,
We express our gratitude for your valuable feedback aimed at enhancing our work. We have provided detailed responses addressing your initial concerns.
We look forward to more discussions with you if you have any outstanding concerns or questions.
Best regards,
The Authors
Responses to Reviewer YHpJ [1/2]
We appreciate your thoughtful questions about the role of learning in coil design. They helped us explain the motivation for our approach more clearly. We would like to address your questions below.
A1. Yes, non-deep-learning methods can explore these voxel grids, but the enormous search space makes efficient optimization challenging. Even an 11×10×6 grid has approximately 1082 possible paths.
To evaluate the benefit of learned guidance under limited evaluation budgets, we compared against non-deep-learning methods GA [A] and PSO [B] using the same 100 labeled paths and 100 additional physical evaluations per scene. Ours outperforms both across all scenes and metrics, demonstrating the effectiveness of learned guidance under equal evaluation budgets. We have clarified in Section 1 that this count refers to unconstrained action sequences and reported the equal-budget GA and PSO comparison in Section 5.1 and Appendix G.2 (Table 22).
Table 1: Comparison with non-deep-learning baselines (five-run mean ± sample SD; higher is better ↑).
[A] Adaptation in Natural and Artificial Systems. MIT Press, 1992.
[B] Particle swarm optimization. ICNN, 1995.
A2. Our methodological contribution extends beyond coil initialization by integrating action-level inpainting, performance-preference guidance, and hard-constrained search. This framework can potentially be adapted to other constrained design tasks, such as cable or pipe routing, by modifying the action representation, geometric constraints, and evaluation objectives. We have clarified the method contribution in Section 1 and discussed the cable- and pipe-routing examples in Section 6 under “Generalization.”
A3. Our neural network aims to generate higher-quality initializations beyond training samples to improve downstream optimization efficiency, rather than simply reuse existing training samples. We compared Best-of-Training and Ours using the same downstream optimizer CMA-ES[A], with 300 labeled paths and 200 additional physical evaluations per scene (200 for refinement vs. 100 for generation + 100 for refinement). Ours achieves higher mean final scores across all three scenes, demonstrating the benefit of learned generation over directly refining the best training sample under the same evaluation budget. We have reported the two allocations of the 200-evaluation budget and their final scores in Section 5.3 (Table 4).
Table 2. Post-refinement best scores (five-run mean ± SD; higher is better).
[A] Completely Derandomized Self-Adaptation in Evolution Strategies. Evolutionary Computation, 2001.