acceptodds
Under review as a conference paper at ICLR 2027

Learning to Propose Joint Sensing Actions under Shared Uncertainty

Abstract

A sensing action can be valuable because of what it enables another action to reveal. Under shared receiver uncertainty, calibration can make a subsequent target observation informative even when calibration alone leaves target uncertainty unchanged. We study learning to propose executable sensing groups for a budget-limited physics-based evaluator. A two-slot Gaussian construction shows that exact singleton screening and sequential marginal greedy selection can recover an arbitrarily small fraction of the optimal variance reduction. An explicit calibration–repetition boundary identifies when resolving receiver ambiguity is more valuable than averaging extraction noise. Our recurrent proposer combines a joint target–receiver belief, learned control generation, executable projection, and group-cost prediction, with forecast feedback supporting within-decision refinement. On 192 simulated test episodes across eight scenarios, averaged over three training seeds, the full relational variant reduces mean GOSPA by 15.0% and RF energy by 7.0% relative to numerical search under matched forecast and construction budgets. Target recall improves by 4.37 percentage points, with both tracking metrics improving in every scenario mean. Fixed-checkpoint ablations identify control generation as the largest contributor: learning changes the executable choices available to the evaluator, as well as their ordering.

Primary area:
applications to robotics, autonomy, planning
Keywords:
active sensing, joint sensing actions, sensor management, uncertainty-aware planning, relational attention, physics-based evaluation, multi-target tracking, cognitive radar

Reviews

Among:
Shape:
1234this paper, Top 30%
Figure 1. Mean review rating of the reviewed papers at ICLR 2027. This paper averages 2.67 over 3 reviews, above 70% of the others.
Reviewer_Rk7QOpenReview ↗
Rating
3(+1)
Confidence
2
Informativeness
2
Presentation
3
Soundness
3
Read review
Paper summary

In radar sensing, an action may be useful because it improves a later observation, even if it does not immediately reduce uncertainty about the target. One example is receiver calibration: learning about a shared receiver error can make a subsequent target measurement more informative. The challenge considered here is how to select such combinations when sensing resources and the number of physics-based forecast evaluations are limited.

The authors first analyze a two-slot Gaussian model. They derive a condition under which calibration is more valuable than repeating a target measurement and construct an example where both singleton screening and exact marginal-gain greedy selection achieve an arbitrarily small fraction of the optimal variance reduction.

The proposed system uses a recurrent neural network to encode the current joint target–receiver belief, generate continuous sensing controls, and predict the costs of candidate action groups. These controls are projected onto device and scheduling constraints. A common two-cycle physical forecast then evaluates a limited number of candidates and determines which group to execute. Forecast feedback can also be used to refine proposals within the same decision.

The evaluation covers eight simulated radar scenarios. Under matched candidate-construction and forecast-evaluation budgets, the full relational model reduces mean GOSPA by 15.0% and RF energy use by 7.0% relative to numerical search, while increasing target recall by 4.37 percentage points. The inference-time ablation attributes most of the tracking improvement to learned control generation, with a much smaller and less certain additional effect from forecast feedback.

Critical strengths

1. The analysis gives a clear example of why sensing actions should sometimes be considered jointly.

The Gaussian example in Section 2 is simple but effective. In this Gaussian example, calibration alone leaves target uncertainty unchanged, yet it can substantially improve a subsequent target observation by reducing uncertainty about a shared receiver bias. The authors also derive an explicit condition for choosing calibration over a repeated measurement.

Proposition 1 makes a stronger point: even when individual and conditional marginal gains are computed exactly, greedy selection can recover an arbitrarily small fraction of the optimal variance reduction. This shows a limitation of the selection rule itself, rather than a failure caused by inaccurate scoring. I find the example useful and mathematically convincing, although its novelty relative to prior work is a separate concern.

2. The closed-loop experiments show a meaningful benefit from learned control generation.

The reported tracking improvements are substantial within the evaluated simulator. Compared with numerical search, the full relational model reduces mean GOSPA from 67.91 to 57.74 m and increases target recall from 76.45% to 80.82%, while using the same candidate-construction and forecast-evaluation budgets.

Table 3 is particularly informative. With feedback disabled, enabling learned controls reduces GOSPA from 70.69 to 59.02 m. Adding forecast feedback further reduces it to 57.74 m, but the confidence interval for this additional effect includes zero. The results therefore support a fairly specific conclusion: generating executable controls is the main source of improvement in this system, whereas feedback contributes much less. This is more informative than reporting the full model's final performance alone.

Critical weaknesses

1. The paper does not clearly establish what is new beyond existing work on correlated observations and learned experimental design.

The main motivation is that sensing actions can be complementary when measurements share an uncertain receiver state. This is a meaningful problem, but the broader issue is well established. Das and Kempe (2018) study variable selection and greedy optimization when the objective does not satisfy the usual diminishing-returns property. Liu et al. (2016) address sensor selection with correlated measurement noise and extend their framework to multi-step sensor scheduling. Foster et al. (2021) demonstrate that adaptive experimental designs can be generated by a learned model instead of being optimized from scratch at every step.

These works do not cover the exact radar setting in this submission. In particular, the calibration example, the explicit two-slot result, and the combination of task selection with continuous sensing controls are specific to the present study. I would not dismiss those contributions simply because related ideas exist.

Nevertheless, the paper does not sufficiently explain what important new conclusion follows from this formulation. The Gaussian example illustrates a known type of dependence between observations, while the proposed model combines familiar techniques such as relational attention, recurrent memory, supervised control prediction, and model-based evaluation. The combination is reasonable and appears effective, but I do not see a sufficiently distinct learning principle or new explanation that would make the contribution stand out beyond this application.

For me, this is a more important limitation than the absence of additional experiments: even accepting the reported results, the paper's main scientific advance remains difficult to identify.

References:

Das, Abhimanyu, and David Kempe. 2018. Approximate Submodularity and its Applications: Subset Selection, Sparse Approximation and Dictionary Selection. Journal of Machine Learning Research, 19(3):1–34.

Liu, Sijia, Sundeep Prabhakar Chepuri, Makan Fardad, Engin Masazade, Geert Leus, and Pramod K. Varshney. 2016. Sensor Selection for Estimation with Correlated Measurement Noise. IEEE Transactions on Signal Processing, 64(13):3509–3522.

Foster, Adam, Desi R. Ivanova, Ilyas Malik, and Tom Rainforth. 2021. Deep Adaptive Design: Amortizing Sequential Bayesian Experimental Design. In Proceedings of the 38th International Conference on Machine Learning, volume 139 of Proceedings of Machine Learning Research, pages 3384–3395.

2. The theoretical analysis does not adequately explain the improvement produced by the learned method.

Section 2 establishes that selecting sensing actions individually can miss valuable combinations. However, the experimental Rank variants are not the greedy algorithms considered in Proposition 1. They already rank candidate groups rather than isolated actions, and all compared proposers share the same protected pair construction, joint belief representation, and two-cycle physical evaluator.

This distinction matters. The protection of potentially useful pairs is already built into the common scheduler, so the improvement of Full over Rank cannot directly be taken as evidence that learning overcomes the greedy-selection failure established by the theory.

The ablations instead show that the largest improvement comes from generating continuous controls. Such gains could arise from better pointing directions, dwell times, start times, or search coverage, without necessarily relying on the calibration–tracking complementarity emphasized in Section 2. This interpretation is also consistent with the reported results: the main improvements are in aggregate GOSPA and target recall, while changes in matched-position accuracy and final receiver-bias estimation are small or uncertain (Tables 1, A5, and A6).

The analysis gives a sound reason to preserve and evaluate joint sensing actions, and the experiments show that learned controls improve tracking. Equation (9) explains how receiver correlations affect calibration value, while Appendix A.8 separates candidate coverage from evaluation allocation. However, neither result establishes that the observed control-generation gains arise specifically from the calibration–tracking complementarity in Proposition 1. Without stronger evidence connecting the analysis to the main empirical improvement, I see an effective learning-based radar scheduler, but not a convincing theory-to-method contribution.

This gap is central to my recommendation because the learned components themselves are not especially novel. Showing why this particular approach works, rather than only that it works, would make the scientific contribution considerably stronger.

Questions for authors

1. Clarification — What is the main new finding relative to the closest prior work?

Could the authors clarify what Proposition 1 and the calibration-versus-repetition analysis establish beyond existing results on correlated-observation selection? In particular, Das and Kempe (2018) study greedy selection when diminishing returns cannot be assumed, while Liu et al. (2016) address correlated measurement noise in sensor selection and scheduling.

I recognize that neither paper uses the same radar model or proves the identical two-slot result. The question is whether the present formulation reveals a new property or decision principle, beyond providing a clear example of an established phenomenon. A precise distinction would materially affect my assessment of the paper's novelty.

References:

Das, Abhimanyu, and David Kempe. 2018. Approximate Submodularity and its Applications: Subset Selection, Sparse Approximation and Dictionary Selection. Journal of Machine Learning Research, 19(3):1–34.

Liu, Sijia, Sundeep Prabhakar Chepuri, Makan Fardad, Engin Masazade, Geert Leus, and Pramod K. Varshney. 2016. Sensor Selection for Estimation with Correlated Measurement Noise. IEEE Transactions on Signal Processing, 64(13):3509–3522.

2. Decision-critical question — What connects the main control-generation gains to the theoretical failure mode?

The Rank variants already evaluate joint action groups and share the same physical forecast and protected pair construction as the full method. Which part of the failure described by Proposition 1 is therefore specifically addressed by learned control generation?

Do the available decision records show that the improvement is associated with calibration decisions or stronger use of target–receiver correlations? Or is the main benefit better continuous control optimization for search and tracking more generally?

Clarifying this point is important to my overall assessment. It would determine whether the experiments support the paper's proposed explanation or mainly demonstrate the usefulness of learned control generation in the simulated radar scheduler.

Reviewer_pA6DOpenReview ↗
Rating
3(+1)
Confidence
2
Informativeness
2
Presentation
1
Soundness
2
Read review
Paper summary

The paper aims to propose sensing groups for evaluation that jointly consider both tracking and calibration and their dependent impact. The model starts with a prediction (encoder-decoder) that estimates the impact and costs of the groups and then a physical forecast selects what to execute. The method is then evaluated on a radar simulator.

Critical strengths
  1. The paper solve an important problem
  2. The need for calibration is well motivated as well as the shortcoming of only considering individual scores. Though as I highlight a bit later, Sec. 2, which motivates these needs, can be a bit reduced to allow for a more detailed explanation of the main model in Sec 3.
  3. The case studies are well design, practical and extensive within the model proposed.
Critical weaknesses

The two critical weaknesses of the paper are that it is written in a manner that is very hard to follow. The modeling approach, equations and intuition need to be clearly defined and explained. Also the paper should acknowledge the literature in the area, clearly highlight what is new and compare with what exists in this active field. Below are some concerns, questions and suggestions:

  1. The authors are strongly encouraged to add intuition and explanations to their paper, especially in Sec 3.
  2. To give some examples: (i) Figure 1 is not explained. It contains a lot of terms that are not explained, making understanding the overall methodology very hard. (ii) The same applies for Equations 7 and 8 which are the central modeling parts. There needs to be some intuition of the modeling choices and explanations of their novelty. (iii) A lot of paragraphs in the paper lists a large number of design elements very briefly where one needs to go to the appendix to understand what is being done. (iv) Figure 2 is also hard to understand, the images are very small and it is not clear what the matched 0/1 part means.
  3. Along this line, Sec 3.2 is especially hard to follow. What projection is done and what is admissible ? What objective is used to learn \theta ? why does the \rho take \bar{h} as an input ? and what are the valid entities ?
  4. A suggestion is to expand section 3.1-3.4 and reduce section 2 which motivates the need for calibration and that individual scores care not optimal: which are intuitive results.
  5. The authors are suggested to highlight their contribution and novelty in lieu of what exists in the literature,. Until section 3, the paper only has a single citation on the utility of greedy methods from 2005. There needs to a clear positioning relative to what already exists in this area including methods that use: Fisher information, submodular optimization, Bayesian optimization, Dynamic programming and RL, etc..
  6. This lack of acknowledgement of literature is also reflected in Sec. 5. You state very few existing works and then add at the end of each paragraph a sentence of what your model does. I suggest you highlight what is new and why the cited methods cannot directly address the joint sensing/dependance problem: and what models already do so
  7. In (6), P_{X,b} is not a function of time. Why is that ? Time dependence can help improve the group selection.
  8. In Sec 3.3, why is priority given to overdue search or due calibration? Can these be incorporated into the model itself with an acquisition function ?
  9. While the many experiments are a strength of the paper, the comparison mainly focuses on different encoder settings (self-attention, deep sets). For a field that in an active research area, the authors are suggested to compare with other technique (see previous comments), rather than only doing an ablation study on their own modeling choice (i.e. the encoder)
  10. In (12), \mathcal{L}'s are not defined but assuming they are the loss functions, why are they given a weight of 1 for group and control and 1/4 for the rest? How did you chose1/4 ? Why not add a tuning weight for each loss here ?
Questions for authors

I have added questions to the section above

Reviewer_kqo3OpenReview ↗
Rating
2(+1)
Confidence
2
Informativeness
2
Presentation
2(+1)
Soundness
3(+2)
Read review
Paper summary

The paper proposes useful sensing plans for a radar system, wherein individual scores in a plan may not be as effective in selecting the right joint acquisition. Authors show how greedy selection can be ineffective in returning the optimal pair, which motivates the idea of learnt proposals. The overall framework is validated on a radar simulator setup with baseline comparisons.

Critical strengths

The concept of joint actions being valuable and the fact that accurate individual scores can end up selecting the wrong pair is useful. This, in addition to Proposition 1 validates the merit of generating an executable sensing plan. The physical modeling, costs, group costs, and energy considerations in Section 3.1 and 3.2 ground the proposed setup in practical considerations.

Critical weaknesses
  1. The paper is ill-written and quite hard to follow, takes several attempts to read through properly. For example, the paper lacks a definitive problem statement anywhere, page 3 is when the first reference in the paper appears, and related work is in Section 5, towards the very end of the paper. Metrics are used throughout the paper without being introduced till Section 4.
  2. Experimental setup is fairly simple and simulator only, it is difficult to estimate scalability of the work to real world, complex applications from just the setup considered in the paper.
Questions for authors
  1. What motivates the restriction of action group size to two? Is it prohibitively expensive to consider larger groups or another reason motivates this choice?
  2. How well does the radar simulator setup mimic a more complex experimental setup (such as software testbeds, semi-physical setups) and what limits the applicability of this work to real sensors for demonstration?
  3. Are there existing works on learning based approaches for developing sensor plans for radar systems? If so, what is the key distinguishing feature for this paper?

From OpenReview, CC BY 4.0. Authors as signed there; shown unedited.

Related papers

Loading the map…

Discussion (0)

Sign in to comment.