Metraipolis › archive › dc_bb165b4c129c

SLP-ProbHard: Probabilistic Hard-Constrained Learning via Structural Latent Parameterization — arXiv:2609.33515

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.33515
License (as archived)
CC0-1.0
Archived
2026-10-07T22:37:31.739Z
SHA-256 of the archived text
6610d5a4acf1802a2744adc79bd3db4ce98c497f3169e3523380aa23afcffce4
Stable URL of this page
https://metraipolis.com/documento/dc_bb165b4c129c

How to cite

SLP-ProbHard: Probabilistic Hard-Constrained Learning via Structural Latent Parameterization — arXiv:2609.33515 — arXiv (en), https://arxiv.org/abs/2609.33515 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_bb165b4c129c (Metraipolis archive dc_bb165b4c129c, sha256 6610d5a4acf1802a2744adc79bd3db4ce98c497f3169e3523380aa23afcffce4)
BibTeX
@misc{dcbb165b4c129c,
  title = {SLP-ProbHard: Probabilistic Hard-Constrained Learning via Structural Latent Parameterization — arXiv:2609.33515},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.33515},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_bb165b4c129c; sha256 6610d5a4acf1802a2744adc79bd3db4ce98c497f3169e3523380aa23afcffce4},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.33515. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Many probabilistic predictors must satisfy exact structure in every stochastic realization, yet common hard-constraint approaches form predictions in ambient coordinates and then correct or project them. We introduce SLP-ProbHard, a cross-family, representation-centered framework for probabilistic hard-constrained learning when explicit structural parameterizations are available. Its core object, a Structural Feasible Latent Parameterization (SFLP), combines a structural latent law $Z \sim P^Z_\theta(\cdot\mid x)$ with a feasible map $Y=h_\phi(x,Z)$ that satisfies the constraint for every latent realization. Together these components define the predictive law itself, including its support and boundary probabilities, rather than serving as a final feasibility wrapper. We study how feasible coordinates and maps affect stochastic dimension, dependence, calibration, expressiveness, and computation. Experiments use Gaussian latent laws and fixed geometry-derived maps across affine equalities, ordering and simplex constraints, nonlinear manifolds, and three structural representations of seven-basin hydrological flow-duration-curve (FDC) data. In an official-source affine comparison with ProbHardE2E/DPPL, both methods achieve zero practical constraint violations. SLP-ProbHard uses 8 instead of 11 stochastic coordinates and improves MSE/MAE, while DPPL yields better marginal CRPS and closer-to-nominal coverage; a paired test detects no Energy Score difference across ten seeds. Real-world affine and nonlinear FDC representations reduce 13 to 7 and 14 to 8 ambient versus computational coordinates, respectively. Exact feasibility alone thus does not determine a predictive law, motivating direct structural generation when meaningful feasible coordinates are available.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-29 in cs.LG).
Categorie arXiv: Machine Learning (cs.LG) ; Machine Learning (stat.ML).
Pagina del lavoro: https://arxiv.org/abs/2609.33515 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T22:14:27.970Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-09-29?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).