arXiv (All)
open access
Parameterized Complexity of $L_p$-Lipschitz Constants for Input Convex Neural Networks and $L_p$-Norm Maximization over Zonotopes
Lipschitz constants are a standard way to quantify the sensitivity of neural networks to small input perturbations, but computing them is difficult even for shallow ReLU networks. We study this problem for two-layer input-convex neural networks (ICNNs), a restricted architecture where nonnegative ou
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
- Near-optimal estimates for the $\ell^p$-Lipschitz constants of deep random ReLU neural networks#997975
- Statistical Properties of Deep Neural Networks with Dependent Data#1063726
- Sharp bounds in perturbed smooth optimization#1249311
- Configuration-Dependent Lower Bounds for Approximation by Shallow ReLU$^k$ Networks on the Sphere#998028
- Genericity of Polyak-Lojasiewicz Inequalities for Entropic Mean-Field Neural ODEs#1035301
Record · ID 1401016
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