- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper studies probabilistic prediction under hard structural constraints, where every generated sample must satisfy a prescribed feasible set. To address the limitations of predict-then-project and penalty-based approaches, the authors propose SLP-ProbHard, which learns a probabilistic model in an unconstrained or lower-dimensional latent space and maps samples into the feasible output space through a constraint-specific structural map, thereby guaranteeing feasibility by construction. The paper also develops a taxonomy of structural maps and analyzes how different parameterizations affect stochastic dimension, boundary mass, dependence structure, tractability, and calibration. Experiments on synthetic constraint families and hydrological flow-duration-curve prediction, including linear equality, monotone ordering, simplex, nonlinear circle, and real-world affine/nonlinear constraints, show exact or near-machine-precision feasibility while maintaining competitive or improved predictive performance against projection-based and hard-constrained baselines.
Critical strengths
The strongest aspect of the paper is the clean separation between probabilistic modeling and hard feasibility. By learning a latent predictive law and enforcing the constraint entirely through a structural map, SLP-ProbHard guarantees that every generated sample is feasible without a post-hoc projection step. This is conceptually simple but practically useful, particularly when downstream applications require physical or logical consistency for every sampled trajectory rather than only in expectation.
A second strength is the breadth and care of the empirical and theoretical analysis. The paper does not treat all feasible parameterizations as equivalent; instead, it explicitly studies how map geometry changes stochastic dimension, boundary behavior, covariance structure, and computational cost. The experiments span several qualitatively different constraint families and include comparisons against projection-based methods and the released ProbHardE2E/DPPL implementation.
Critical weaknesses
The first concern is that the practical success of SLP-ProbHard depends strongly on the choice of structural map, but the paper provides limited guidance for selecting among multiple valid parameterizations of the same feasible set. Different maps can induce different latent dimensions, boundary masses, dependence structures, and calibration properties even though they enforce exactly the same hard constraint. This makes the method partly a manual modeling framework rather than a fully specified learning procedure, and weak map choices may introduce substantial representation bias.
A second concern is the limited generality beyond constraints admitting convenient explicit parameterizations. The method is particularly attractive for affine equalities, ordering constraints, simplices, circles, and other structured sets with known feasible maps, but constructing an expressive differentiable map may be difficult for complicated nonconvex or implicitly defined feasible sets. In such settings, projection or correction methods may remain substantially easier to deploy. The paper acknowledges this limitation, but it narrows the scope of the general claims.
Questions for authors
Could the authors provide clearer guidance for choosing among multiple structural maps that represent the same feasible set? Since the experiments and theory show that parameterization affects stochastic dimension, boundary probability, dependence structure, and calibration, it would be useful to know whether there is a principled criterion, e.g., likelihood, validation CRPS, latent dimension, Jacobian conditioning, or some notion of representation distortion, for selecting the map rather than treating it as a manual design choice.
Could the authors also clarify how far they expect the framework to extend to feasible sets without a convenient explicit parameterization? In particular, for highly nonconvex, disconnected, or implicitly defined constraints, would the intended solution be to learn an approximate structural map, compose several maps, or revert to projection/correction? This distinction would help better define the practical boundary between SLP-ProbHard and projection-based approaches.
2 comments
Thanks for addressing my concerns. I will maintain my score.
Thank you for your interest in practical guidance. The selection of the map falls to the modeler; the framework does not automatically determine it.
Selecting an SFLP map is akin to choosing a distribution family or architectural framework-the training process learns the predictive rules within the chosen representation. Our geometry-derived maps are fixed, while the latent parameters are what we learn and adapt. Feasibility and Events: When using softmax, it approaches simplex faces but does not consider exact zeros in real arithmetic. True zeros are essential for creating maps that can handle face mass; any rounding or censoring will require proper observation modeling. This distinction also applies when dealing with ties. Validation: To validate candidates, it is essential to compare them in a common output space while applying similar preprocessing, latent flexibility, and resource allocation. Metrics to use include marginal CRPS, the joint Energy Score, coverage, width, and boundary frequencies, ensuring that the likelihood accounts for boundary mass. Always use reserved test data for this process. Numeric: In terms of computational efficiency, make direct comparisons in runtime and dimensionality; also assess Jacobians in relevant tangent or active regions, accepting intentional rank loss for boundary atoms. Be mindful that distortion requires a metric or reference law and cannot solely determine predictive quality. Keep in mind that these guidelines are meant to be analytical rather than a guaranteed automatic selection procedure.
The presence of nonconvexity allows for explicit maps, as illustrated by the circle. Continuous maps originating from connected domains cannot cover disconnected feasible components. An idea worth exploring, though not yet tested, is a discrete component selector with maps tailored for specific components.
When composing maps, every constraint must be met; later maps can potentially undo any guarantees established earlier. Small learned residuals do not, by themselves, confirm universal feasibility. If suitable explicit maps are lacking, it may be better to rely on solvers while keeping the stated conditions and tolerances in mind. ProbHardE2E considers initialization, curvature, and conditioning dependence, but this does not eliminate our need for maps or imply a broader equivalent scope. Our work aims to enhance representation analysis and facilitate direct generation with a clear structure, rather than claiming to provide universally optimal maps or solutions for arbitrary sets.