arXiv (All)
open access
Quadratic Characterizations for Reachability Analysis of Neural Networks
Quadratic constraints (QCs) are widely used to characterize nonlinearities and uncertainties, but generic analytical characterizations can be conservative on bounded domains. This paper develops a framework for constructing verified quadratic characterizations of scalar relations in the two-dimensio
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
- Survey of Optimization Algorithms in Modern Neural Networks#19716
- Non-Euclidean Gradient Descent Has Many Edges of Stability#1326473
- HUANet: Hard-Constrained Unrolled ADMM for Constrained Convex Optimization#1155166
- Smooth solutions to systems of linear inequalities on $\mathbb{R}$#630050
- Smooth solutions to systems of linear inequalities on $\mathbb{R}$#628188
Record · ID 1297138
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