Metraipolis › archive › dc_f36bf72ddf09
Certifying Distributionally Robust Decisions from Projection Observations — arXiv:2610.34493
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.34493
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-27T08:01:27.026Z
- SHA-256 of the archived text
6c042a01802d31837b38910d71b8e43345180f3c8eedff8f4de0315e8cd1ac2b- Stable URL of this page
https://metraipolis.com/documento/dc_f36bf72ddf09
How to cite
Certifying Distributionally Robust Decisions from Projection Observations — arXiv:2610.34493 — arXiv (en), https://arxiv.org/abs/2610.34493 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_f36bf72ddf09 (Metraipolis archive dc_f36bf72ddf09, sha256 6c042a01802d31837b38910d71b8e43345180f3c8eedff8f4de0315e8cd1ac2b)
BibTeX
@misc{dcf36bf72ddf09,
title = {Certifying Distributionally Robust Decisions from Projection Observations — arXiv:2610.34493},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.34493},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_f36bf72ddf09; sha256 6c042a01802d31837b38910d71b8e43345180f3c8eedff8f4de0315e8cd1ac2b},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.34493. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
A scalar measurement can determine a robust decision without identifying the latent covariance or every decision risk. We study finite Gaussian projection experiments with a fixed mean-plus-standard-deviation target. The observation laws define a set of indistinguishable moment models. We exhibit decisions that agree throughout that set despite unidentified risk values, and give a confidence-set certificate that returns a decision or an unresolved outcome. We prove soundness, necessary abstention for indistinguishable models with incompatible optima, and a fixed-checkpoint certification guarantee. A scalar profile reduces nonlinear risk comparisons to convex inner problems. Across seven synthetic instances, jointly calibrated moment regions give sufficient budgets 21 to 52 times explicit expected-sample information lower bounds. Separately measured stopping times are lower, with zero decision errors in 1,900 simulated streams. These comparisons do not constitute matching bounds, and the guarantees require Gaussian replication. Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.AI, nuovi lavori del giorno). Categorie arXiv: Machine Learning (stat.ML) ; Artificial Intelligence (cs.AI); Machine Learning (cs.LG); Optimization and Control (math.OC). Pagina del lavoro: https://arxiv.org/abs/2610.34493 — 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-27T07:55:30.907Z dalla pagina https://arxiv.org/list/cs.AI/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).