- Rating
- 3
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 3
Read review
Paper summary
The paper studies how signaling architecture affects learning in strategic populations. Public signaling can make populations observationally indistinguishable despite requiring different optimal decisions, while targeted private signaling can reveal the relevant differences. The paper establishes regret lower bounds, gives a canonical construction with matching guarantees, and presents nonlinear synthetic experiments.
Critical strengths
-
This paper has an interesting mechanism and motivation. The paper clearly connects strategic aggregation, information architecture, and decision learnability. Its distinction between identifying the population and learning an optimal decision is useful.
-
The paper has substantial theoretical analysis. The central arguments withstand close checking, including the observational-equivalence obstruction, KL lower bound, and canonical matching policy. Assumptions and scope limitations are generally stated carefully. (Theorems 1–5.)
Critical weaknesses
-
The incremental novelty needs sharper justification. The canonical private problem reduces to a two-arm Gaussian bandit, as acknowledged in Appendix C.6. Much of the regret analysis then follows familiar bandit principles. The paper should clarify which contributions extend beyond the strategic construction and its architecture separation.
-
The main acquisition comparison is confounded. Decision + LR and D-Optimal differ in both probe selection and their rules for switching to exploitation. Their performance gap therefore cannot be attributed solely to decision-focused acquisition. A comparison using a shared exploitation rule is needed. (Appendix F.4.)
Questions for authors
as above
Contribution and the Matched Acquisition Comparison
Thank you for checking the analysis closely. We address the contribution and the requested acquisition comparison below; these also answer the questions referring to those concerns.
W1. Contribution beyond the Gaussian-bandit reduction.
We agree that the private canonical problem reduces to a two-arm Gaussian bandit. The common-optimum obstruction and KL allocation also use established tools. These connections are now explicit in the main text and contribution statements.
The model-specific results derive the observation laws from signaling and equilibrium, establish the public/private learning separation, and calculate exact canonical exploration coefficients with a matching policy. We have focused the contribution claims on these results rather than claiming a new general bandit technique.
Appendix C.7 adds a separation where public experiments are themselves the unique full-library optima. Public observations cannot distinguish the two populations, and learning requires costly private probes. Public-only policies have summed regret at least T/30, whereas one full-library policy achieves O(logT) regret at both fixed populations. This extension addresses the original construction's private dominance, but does not assert matching exploration constants.
W2. Confounded acquisition comparison.
You are right: the original comparison cannot isolate acquisition because the exploitation rules also differ. We ran the requested ablation with a shared exploitation rule and report it in Appendix F.5.
Both methods use the same four initialization probes, estimator, refit schedule, population constraints, likelihood searches, and LR threshold. Both exploit when certified and otherwise use their respective acquisition scores over the same 15 experiments. The extra free-information bypass is disabled in both. The rule is the same function of history; certification times can differ because acquisitions produce different histories.
At T=3000, mean regrets are:
The paired 95% bootstrap intervals for Decision minus D-optimal regret are [−70.266,−35.734], [−10.627,−6.016], and [−3.603,−2.676], respectively. Resampling uses population clusters for the random suite and paired seeds for each fixed endpoint. Both methods make the correct terminal decision in all 100 runs at each fixed endpoint.
The lower regret does not simply come from fewer acquisition rounds. At P−, Decision acquisition uses more such rounds (70.03 versus 47.53), but far fewer of those choices are suboptimal (1.43 versus 43.04). This supports the benefit of the selected probes under the common rule. The experiment reuses the existing evaluation populations and does not establish superiority over greedy or an anytime guarantee for the LR threshold.