- Rating
- 1
- Confidence
- 2
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper studies information limitations in coordination with private objectives. It constructs strongly convex instances with identical responses to permitted local queries but different globally optimal allocations, and characterizes the resulting decision loss. It also examines supplementary local messages and optimality certificates, with experiments on resource-allocation tasks.
Critical strengths
None
Critical weaknesses
- The problem and main conclusions appear largely straightforward. The central result, Theorem 4.1, uses a simple indistinguishability construction with an elementary proof and an unsurprising conclusion. I find the technical and conceptual contributions insufficient for ICLR.
- The paper is unnecessarily long and lacks focus. The core proof occupies roughly two pages, while numerous loosely connected auxiliary results obscure the main argument, leaving the central message and intuition unclear.
Questions for authors
None
2 comments
Thanks for the reply, I still feel that the submission is clearly below the standards of ICLR, so I keep my score.
W1: Theorem 4.1 is intentionally a simple construction, designed to make the underlying information limitation transparent. Its contribution is not the indistinguishability argument itself, but the mechanism it reveals: all permitted local queries return solutions in a region where the private objectives agree, while the shared constraint requires allocations in a different region where those objectives disagree. Consequently, even exact local optimization cannot reveal the information needed for the globally optimal decision. Theorem 4.1 establishes this phenomenon, but it does not explain when it occurs more generally or which hidden differences actually matter. These are the questions addressed by the subsequent results. Theorem 4.2 characterizes the decision loss for general strongly convex objectives with identical response maps and establishes exactly when this loss vanishes. Corollary 4.3 goes further: indistinguishable objectives do not necessarily imply different optimal decisions or positive decision loss. Whether they do depends on how the hidden differences interact with the shared constraints. The corollary provides necessary and sufficient conditions for this distinction and quantifies the resulting loss, including cases with active constraints. Thus, the theoretical contribution is not an elementary indistinguishability argument, but a characterization of when locally invisible objective differences become globally consequential and how much decision loss they cause.
W2: We have reorganized the paper around this progression: when local responses are insufficient, how much decision loss results, and what additional information can help? Theorem 4.1 now serves as an intuitive starting example, followed by the general results in Theorem 4.2 and Corollary 4.3. Section 5 then examines two ways to use additional local information: selecting the optimal allocation within a known family and certifying the quality of a proposed allocation without a candidate list. We have also simplified the introduction and section transitions, and reduced the emphasis on auxiliary protocol and query-scheduling studies so that the central theoretical argument is easier to follow.