arXiv (OAI Expanded)
open access
Computing Robustness to Sparse Diagonal Uncertainty
A new robustness metric $ν$ was recently proposed as a substitute for the structured singular value $μ$ to better capture robustness to sparse diagonal uncertainty, but its computation has remained an open problem. In this paper, we show that computing $ν$ is equivalent to maximizing the spectral ra
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Improving the Gaussian Process Sparse Spectrum Approximation by Representing Uncertainty in Frequency Inputs#252879
- Learning Polyhedral Conformal Sets for Robust Optimization#973165
- Exact Bayes Regret and Asymptotic Optimality in High-Dimensional Gaussian Bandits#1076374
- Comparison theorems for the extreme eigenvalues of a random symmetric matrix#996885
- The End of Approximate Computing_ RIC and the First Fully Deterministic Execution Substrate#108883
Record · ID 1083878
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive