arXiv (All)
open access
Stability-Constrained Approximation in Spline KANs: Exact Layer Balancing and Budget-Compatible Saturation
Deep spline superposition networks face a tension between approximation order and stability across depth. We study approximation under a hard layerwise Lipschitz budget, and organise it around two quantities: the factorisation stability complexity of a given deep factorisation, and the budget-compat
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
- CasEm: A Cascade Architecture for Long-Horizon Neural Emulation#1119319
- Towards Bounding the Behaviour of Neural Networks#261620
- Anon: Extrapolating Adaptivity Beyond SGD and Adam#1062898
- DanLing NestedTensor: Composable Multi-Ragged Tensors for Deep Learning#1104578
- LipKernel: Lipschitz-Bounded Convolutional Neural Networks via Dissipative Layers#128315
Record · ID 1011351
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