Metraipolis › archive › dc_ea318fa5210b
Cone Rayleigh Levels: Finite Perturbations and Certified Control — arXiv:2608.27122
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.27122
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-17T16:12:29.429Z
- SHA-256 of the archived text
c571a1261f5181030a4dc59f3954e02d75027bebda133cb20f2566ec4d52a674- Stable URL of this page
https://metraipolis.com/documento/dc_ea318fa5210b
How to cite
Cone Rayleigh Levels: Finite Perturbations and Certified Control — arXiv:2608.27122 — arXiv (en), https://arxiv.org/abs/2608.27122 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ea318fa5210b (Metraipolis archive dc_ea318fa5210b, sha256 c571a1261f5181030a4dc59f3954e02d75027bebda133cb20f2566ec4d52a674)
BibTeX
@misc{dcea318fa5210b,
title = {Cone Rayleigh Levels: Finite Perturbations and Certified Control — arXiv:2608.27122},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.27122},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ea318fa5210b; sha256 c571a1261f5181030a4dc59f3954e02d75027bebda133cb20f2566ec4d52a674},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.27122. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We study the reuse of positive trial profiles under finite perturbations of nonsymmetric matrix pencils B-\lambda G. The lower and upper cone Rayleigh levels need not coincide and are defined without requiring positive eigenvectors. In the positive orthant with positive diagonal $G$, we derive computable perturbation bounds and determine the exact worst-case trial gap over prescribed independent entrywise perturbation classes. This yields the largest uniform radius meeting a given trial-gap tolerance for fixed profiles, certifying trial-value accuracy without recomputation. Experiments on a nonnegative operator and five signed matrices compare sufficient and optimal radii, directional thresholds, and cold- and warm-start recomputation. Several signed cases exhibit severely limited uniform profile reuse despite the optimality of the radius. Exact rational checks verify the reported bounds and worst-case constructions for stored numerical inputs. A finite-budget linear program and differentiable constraints illustrate applications to verified control and learning. Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-08-28 in cs.LG). Categorie arXiv: Machine Learning (cs.LG). Pagina del lavoro: https://arxiv.org/abs/2608.27122 — 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-17T15:34:49.948Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-08-28?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).