- Rating
- 1
- Confidence
- 2
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
This paper introduces the CPPZ framework and explores how a single compressed probabilistic representation can be leveraged to simultaneously satisfy the requirements of multiple prediction tasks. It further demonstrates that, under specific conditions, this approach can maintain optimal prediction risk. Additionally, the authors find that even when tasks are pairwise compatible, it does not necessarily follow that a single representation can simultaneously satisfy the requirements of all these tasks.
Critical strengths
-
The problem explored in this paper holds some value: while maintaining multi-task prediction capabilities, is it possible to restore a consistent probability object through shared compression, even though the problem is not new.
-
Their research ensures both the prediction accuracy of each task and that they all originate from the same probabilistic object.
Critical weaknesses
-
I find this paper hard to read. The motivation for this work is not clear enough.
-
My primary concerns are whether the assumptions and the setting of this work are practically meaningful, and whether the (highly complex) tools used are actually necessary.
Questions for authors
I suggest that the author further elaborate on their motivations and the necessity of the tools employed.
2 comments
Response to Reviewer 6dnJ (2/2): details
1. Motivation, and whether the setting is practically meaningful
One probability model, instead of a decoder per task, is needed when the predictions must be mutually consistent, or when the model itself is sampled or propagated, as probabilistic zonotopes are in reachability analysis (Althoff et al., 2009; Modares et al., 2026), which CPPZs contain as degree-one cases (Appendix A.2). But one model is a restriction. The decoder must output a valid object, so it may need more coordinates, or accept higher risk, than separate decoders. The paper asks how large this price is and what the code has to measure.
A concrete case: the unknown object is a smooth convex surface sampled by area. Each task uses the same detector, looking from directions drawn from its own distribution, and predicts how often it fires. Under area sampling, the distribution of surface normals is fixed by the shape. Separate task decoders can therefore output firing rates that no single surface produces. Requiring one surface with its area law rules this out.
What we found:
- In this family the restriction costs nothing to leading order: the rates and constants are the same (Theorem 4.1).
- Measurement design matters. Three geometry-adapted queries meet a request that every fixed three-query scheme misses (Proposition 5.2).
- Checking tasks in pairs can underestimate the joint budget. In a six-task MNIST family every pair fits in 34 coordinates, but the six tasks together need 36 (Section 6.2). Pairwise sizing fails in 38 of 192 image-derived families and in 36 of 192 new ones, all certified. The worst-case analogue of grouping by pairwise affinities (Standley et al., 2020; Fifty et al., 2021) therefore accepts groups that no shared code serves (Appendix F.4).
- The bounds bind practical codes. On image-derived tasks the shared construction meets 2,303 of 2,304 boundary requests, while PCA misses all of them, by a median 46% (Appendix F.2); in 192 task families, request-weighted PCA needs a median 1.47 times its coordinates (Appendix F.4). On 45 image targets that the collective bound excludes, every trained neural encoder we tried violates the requests, yet a random-start Adam search reports 66 of 120 such networks as compliant (Appendix F.4).
The nonlinear family's assumptions make the exact leading constants computable. At finite budgets the conclusion persists, certified, when the detector, the law or the strata are changed (Appendix F.1). The last two findings do not depend on these assumptions: they use linear tasks built from image statistics, and Theorem 5.3 holds for any two compact linear tasks on a Hilbert ball.
2. Are the tools necessary?
Where a simpler argument suffices, the paper uses it: for one task and a fixed message, classical closure of area laws shows a legal output costs nothing (Proposition A.6), but builds no shared code. The tools below serve one code and one object for all tasks, with exact constants:
- Polynomial constraints let a polynomial model carry a law on a surface: by Proposition A.3, no finite mixture of polynomial maps of a source with a density carries the sphere's uniform law, but one constraint equation does.
- A prescribed law is the consistency requirement itself: the law must be the one the reconstructed geometry determines, not a separately fitted density.
- Observation semantics define what a task asks of the object, so one object answers every task by the same rule.
- Elliptic and Weyl asymptotics: "no extra cost" is a statement about constants, not only rates, and rate arguments cannot see a constant-factor penalty. In a task pair where one task predicts a vector and the other only its length, one object keeps the rate but at least doubles the constant (Appendix C.3). Because the tasks need not share an eigenbasis, Theorem 4.2 needs a joint construction rather than a diagonal one.
- Coarse geometry first: linearising at one fixed shape leaves a relative error proportional to the radius that does not shrink with the budget; sending coarse geometry first makes it vanish at fixed .
3. Novelty
As far as we know, the closest work (Spantini et al., 2017; Zhang et al., 2021; Hu et al., 2023; Guo et al., 2025; Section 2) does not characterise the joint worst-case risk region, with its constants, when one valid probability object must serve all tasks. We also know of no earlier statement of three results: in the nonlinear family, one object costs nothing at leading order (Theorem 4.1); for two compact linear tasks, continuous, linear and adaptive-linear codes have the same exact risk region at every budget (Theorem 5.3); and complete pairwise information does not determine the joint budget (Proposition D.6). If you have a specific reference in mind, we would gladly discuss it.
We hope this addresses your concerns, and we would be glad to clarify any remaining point.
Response to Reviewer 6dnJ (1/2): summary
Thank you for stating your concerns directly. Each led to a change in the revised PDF. Brief answers follow, under your own sentences; the comment under this one gives the details.
"The motivation for this work is not clear enough."
One compressed code is often read by several tasks. If every task has its own decoder, the predictions need not agree with any single probability model. The paper asks what it costs to require one valid model, and how many coordinates a shared code needs. The introduction now opens with a concrete example, and the redrawn Figure 1 shows both options.
"... whether the assumptions and the setting of this work are practically meaningful"
"... whether the (highly complex) tools used are actually necessary"
Where a simpler argument suffices, the paper uses it (Proposition A.6). The heavier tools are needed because the main claim is about constants, which rate arguments cannot see: in a simple pair of tasks, one model keeps the rate but at least doubles the constant (Appendix C.3). The details say what each tool does.
"I find this paper hard to read."
The introduction now starts from a concrete example. Section 3 has a notation table, and each quantity has its own symbol. Figure 1 is redrawn as one path from input to predictions, with fewer words and larger labels. The wording of the main text was also edited throughout for readability.