- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper presents NetAgent, a differentiable planning framework for wireless base-station deployment. It optimizes spatial latents and power weights through a frozen RadioDiff-based radio-map prior to generate candidate station locations. A shared multi-source optimization then constructs nested Top-K deployments, from which a constraint-first rule selects the station count. The method is evaluated on 30 OpenStreetMap-derived scenarios using the independent WinProp propagation simulator and compared with AutoBS, a 3GPP TR 38.901 proxy, and Sionna Exhaustive. The results suggest that Auto-K offers a competitive trade-off between deployment quality and computational cost, although its mean attainment remains below that of the exhaustive reference.
Critical strengths
1.Meaningful constrained planning problem. The paper addresses a practical deployment problem involving strong-region coverage, weak-region suppression, signal-strength margins, and station-count selection. Using a differentiable generated propagation field to guide deployment optimization is a reasonable and potentially useful approach.
2.Independent simulation-based evaluation. The final deployments are evaluated using WinProp rather than solely through the learned propagation model. The experiments also compare fixed-K and variable-K planning and report both deployment quality and runtime, providing useful evidence about the practical trade-offs of the proposed framework.
Critical weaknesses
1.The independent contribution of the proposed Auto-K mechanism is not sufficiently isolated. The proposed Auto-K pipeline combines shared multi-source optimization, power-weight-based ranking, nested Top-K construction, and constraint-first selection. Table 6 reports an attainment of 0.5885 for Auto-K, compared with 0.5393 for the independently optimized Full variant, while reducing runtime from 29.84 s to 8.21 s. These results provide positive evidence for the overall pipeline. However, the current ablation does not distinguish the contributions of shared optimization, weight-based ranking, and nested-prefix construction. Consequently, while the results support the effectiveness of the overall Auto-K pipeline, they do not fully establish the independent contribution of its individual design choices or whether simpler shared-optimization and candidate-selection strategies could achieve similar gains.
2.The baseline comparison does not fully isolate the benefit of the proposed planning method from that of learned power allocation. The paper states that NetAgent learns per-source power weights, whereas the baselines use uniform weights, and acknowledges that this favors NetAgent in the main comparison. Consequently, the reported performance gains may reflect both the planning strategy and the additional flexibility of learned power allocation. The weight ablation provides some evidence for the benefit of learned weights, but it is limited to a ten-scenario subset and does not fully establish how much of the overall gain comes from this component. A more controlled comparison would help clarify the contribution of the proposed planning mechanism.
Questions for authors
1.Could the authors provide additional ablations to distinguish the effects of shared optimization and nested-prefix construction in Auto-K? In particular, how much of the reported gain over independently optimized fixed-K deployments is attributable to sharing the optimization across station counts, rather than to the candidate-selection rule itself?
2.For prefixes deemed feasible by the differentiable surrogate, how often do the corresponding deployments satisfy the original constraints under WinProp? Could the authors report the agreement between surrogate-based feasibility and simulator-based feasibility, together with the distribution of constraint violations for the selected Auto-K deployments? This would help clarify the reliability of the station-count selection rule without assuming that a discrepancy necessarily exists.
3.Could the authors clarify how the reported Auto-K attainment of 0.5885 relates to the three random seeds? The paper states that the first seed provides the reported deployment while also discussing results across three seeds. Please clarify which results are based on the first seed and which are aggregated across seeds, and specify the paired statistical test used to obtain the reported (p < 0.05) results.
4.Could the authors clarify the search-space comparison between NetAgent and Sionna Exhaustive? The implementation details describe 1 m-resolution coordinate extraction for NetAgent and an 8 m-spaced candidate grid for Sionna Exhaustive, whereas the reproducibility statement says that all methods share the same candidate grid. Clarifying the intended meaning of this statement and the candidate spaces used by the respective methods would make the comparison easier to interpret.
4 comments
3. Repeated-Run Aggregation
The revised Auto-K Attainment of 0.7083 aggregates 30 scenes and three runs per scene, giving 90 scene–run evaluations. Quantitative aggregates are distinguished from individual deployments shown as illustrations. The value quoted from the original submission is superseded by the rerun result.
Table 4. Station-count selection and source-selection ablations with a shared deployment region.
| Method / variant | Mean K | Attainment ↑ | Δ versus Auto-K | Mean time (s) |
|---|---|---|---|---|
| NetAgent Auto-K | 1.80 | 0.7083 | 0 | 30.1 |
| NetAgent Full | 2.32 | 0.7452 | +0.0369 | 110.6 |
| AutoBS | 3.07 | 0.4570 | -0.2513 | 0.62 |
| Ordinal prefix | N/A | 0.6630 | -0.0453 | 30.1 |
| Best subset | N/A | 0.6660 | -0.0423 | 936.0 |
| Equal power | N/A | 0.6490 | -0.0593 | 30.1 |
Attainment summarizes the evaluation cohort. Δ is relative to Auto-K. N/A marks mean K values not defined for these controls.
Attainment is calculated before cohort averaging. For normalized components , each deployment has . The table reports . Clipping deployment-level components before averaging preserves the intended target-completion interpretation. An illustrated first-run deployment does not define this aggregate.
Section 5 and Appendix A.3 specify the common cohort and aggregation. The revised comparisons above report observed means under that protocol.
4. Common Search Resolution and Computational Scaling
All urban experiments were rerun on the common 1 m grid. Maps contain 256 × 256 pixels at 1 m per pixel. NetAgent extracts deployment coordinates on this grid, while Sionna Exhaustive searches 1 m-spaced coordinates in the permitted regions. The earlier 1 m versus 8 m mismatch is therefore removed in the revised evaluation.
Table 2. Urban fixed-count Scores with transmitter-specific deployment regions.
| Method | K=1 | K=2 | K=3 | K=4 | K=5 | Matched mean |
|---|---|---|---|---|---|---|
| NetAgent | 3.128 | 3.692 | 3.977 | 4.226 | 4.322 | 3.869 |
| Sionna Exhaustive | 3.447 | 4.008 | N/A | N/A | N/A | N/A |
| TR 38.901 Proxy | 2.815 | N/A | N/A | N/A | N/A | N/A |
| AutoBS | 2.917 | 3.307 | 3.611 | 3.903 | 4.026 | 3.553 |
| Gain over AutoBS | 7.2% | 11.6% | 10.1% | 8.3% | 7.4% | 8.9% |
Matched means cover all five counts. NetAgent is emphasized as the proposed method. N/A denotes an exhaustive search exceeding the 1,200 s budget, so its Score was not recorded.
The revised grid is aligned while the planning procedures remain distinct. NetAgent differentiates regional objectives through its frozen prior to update source representations jointly. Sionna enumerates candidate combinations. The recorded quality comparison retains Sionna's leading Scores at K=1 and K=2, while NetAgent exceeds AutoBS at every reported count.
Table 3. Fixed-K weight ablation and uniform-power AutoBS placement control.
| Score / difference | K=2 | K=3 | K=4 | K=5 | Mean |
|---|---|---|---|---|---|
| NetAgent learned weights | 3.692 | 3.977 | 4.226 | 4.322 | 4.054 |
| NetAgent uniform weights | 3.611 | 3.868 | 4.166 | 4.200 | 3.961 |
| AutoBS uniform power | 3.307 | 3.611 | 3.903 | 4.026 | 3.712 |
| Learned-weight increment | +0.081 | +0.109 | +0.060 | +0.122 | +0.093 |
| Uniform-power placement gain | +0.304 | +0.257 | +0.263 | +0.174 | +0.250 |
Weight increment = NetAgent learned minus uniform. Placement gain = uniform-power NetAgent minus AutoBS. All conditions use the same 30 scenes and three runs per scene. Reported means and differences retain the manuscript's rounding.
Power allocation is also controlled on 30 scenes and three runs per scene, replacing the earlier ten-scene subset. Uniform-power NetAgent scores 3.961 versus 3.712 for uniform-power AutoBS, an approximately 6.7% gain. Learned weights then add 0.093 Score, or 2.35%. The placement advantage therefore remains under matched allocation, with a separate learned-weight increment.
Table 19. Candidate tuples in exhaustive joint search under equal candidate-set sizes.
| Transmitters K | Tuples | Relative to K=1 |
|---|---|---|
| 1 | ||
| 2 | ||
| 3 | ||
| 4 | ||
| 5 |
This is symbolic search-space size. Unequal candidate sets give tuples.
Table 5. Decision times by geometry and station count.
Transmitter-specific deployment regions
| Method | K=1 | K=2 | K=3 | K=4 | K=5 |
|---|---|---|---|---|---|
| NetAgent | 14.7 s | 17.3 s | 20.1 s | 24.3 s | 29.2 s |
| AutoBS | 0.67 s | 0.71 s | 0.74 s | 0.76 s | 0.81 s |
| Sionna | 16.9 s | 62.7 s | 47.3 h† | 26.0 yr† | 1.52 × 10⁵ yr† |
| TR 38.901 Proxy | 102.0 s | 4.11 d† | 40.0 yr† | 1.80 × 10⁵ yr† | 9.92 × 10⁸ yr† |
Shared deployment region
| Method | K=1 | K=2 | K=3 | K=4 | K=5 |
|---|---|---|---|---|---|
| NetAgent | 16.6 s | 17.9 s | 21.3 s | 24.7 s | 30.1 s |
| AutoBS | 0.57 s | 0.59 s | 0.61 s | 0.64 s | 0.68 s |
| Sionna | 354.3 s | 2.30 h† | 11.8 yr† | 5.77 × 10⁵ yr† | 2.81 × 10¹⁰ yr† |
| TR 38.901 Proxy | 50.5 min† | 3.78 yr† | 1.84 × 10⁵ yr† | 9.00 × 10⁹ yr† | 4.39 × 10¹⁴ yr† |
Unmarked entries are recorded times. † Throughput-based exhaustive-search projections after the 1,200 s timeout, not observed completion times.
The product search space grows exponentially with source count. NetAgent completes in 14.7–30.1 s, while exhaustive multi-source searches exceed the budget and require marked throughput projections. The source-specific K=5 Sionna projection is 1.52 × 10⁵ years. This supports repeated planning within a minute-scale update cycle, with independent WinProp retained as the quality evaluator. The complete runtime table distinguishes recorded values from projections rather than treating projected searches as completed quality evaluations.
2. Independence Issue Between Winprop and Surrogates
WinProp serves as the independent electromagnetic evaluator, while the differentiable surrogate is used to guide deployment optimization. The two components have distinct roles. Deployment coordinates and power allocations are first generated by the optimizer and then evaluated independently in WinProp under the original regional requirements. The reported simulator-based results are determined by WinProp outputs, rather than by agreement with surrogate predictions. Accordingly, numerical agreement with the surrogate is not imposed as an evaluation criterion, and surrogate predictions do not override the external evaluation. This separation allows the resulting deployments to be assessed beyond the propagation model used during optimization.
1. Auto-K Mechanism Contributions
Additional real world measurement has been included in two 5 × 5 m obstacle layouts, each tested with one and two transmitters. Nine Strong and nine Weak points per method and setting yield 288 point records and 5,715 valid RSS readings. NetAgent uses the same 50-epoch budget as the main configuration. Two-source measurements are fused in linear power.
Table 6. Real world measurement across both layouts and station counts.
A1/A2 and B1/B2 denote layouts A/B with K=1/2. S, W, M, and C18 are mean components. C18 is the fraction of all 18 sampled points passing the service cutoff. Means weight the four settings equally.
NetAgent achieves the highest mean measured Score of 3.999 and leads three of four settings. At K=1, its A1/B1 mean Score is 4.006, compared with 3.874 for Sionna and 3.200 for AutoBS under identical transmitter settings. This single-source comparison supports a placement advantage without inter-transmitter allocation.
The revised ablations separate shared reuse from alternatives for ordering, candidate construction, and allocation. Full optimizes every station count independently. Auto-K constructs candidates from one joint maximum-count solution. Their revised comparison is given below.
Table 4. Station-count selection and source-selection ablations with a shared deployment region.
Attainment summarizes the evaluation cohort. Δ is relative to Auto-K. N/A marks mean K values not defined for these controls.
Auto-K retains 95.0% of Full's Attainment with 72.8% less decision time and 22.4% fewer stations. Full's Attainment is 0.7452, compared with 0.7083 for Auto-K. The revised evidence supports a quality–computation trade-off rather than an Attainment gain over Full.
The three controls test different parts of the shared procedure. Ordinal prefix uses source-index order instead of weight order, retaining learned weights after normalization. Best subset evaluates all subsets of each cardinality from the shared solution, again renormalizing their weights. Equal power keeps the ranked candidate locations but assigns weights of 1/k. Auto-K exceeds them by 0.0453, 0.0423, and 0.0593 Attainment, respectively. The broader subset search reports 936.0 s, versus 30.1 s for Auto-K.
For descending weight order π, the main candidates are Ck={π1,…,πk}, with w^j(C)=wj/∑i∈Cwi. Equation 7 selects the smallest k with violation Vk≤10−6. If none qualifies, (Vk,−Uk,k) is minimized lexicographically. Ordering constructs the candidates, normalization defines their powers, and the constraint-first rule selects K.
The candidate definitions and power rules are specified in Appendix G.3. The tested simpler ordering and broader subset-search alternatives do not match the complete pipeline's reported quality–cost combination. The controls characterize interacting choices rather than an additive causal decomposition. The matched-power planning comparison is addressed separately below.