arXiv (All)
open access
Scalability Analysis of Distributed Kolmogorov-Arnold Network Training on High-Performance Computing Systems
Kolmogorov-Arnold Networks (KANs) replace the fixed activation functions and linear weights of Multi-Layer Perceptrons (MLPs) with learnable univariate functions on network edges, offering improved interpretability and, in some settings, competitive parameter efficiency. While the approximation prop
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
- Kolmogorov-Arnold Classifier Systems as Universal Approximators#1142261
- Kolmogorov-Arnold Classifier Systems as Universal Approximators#1122312
- Optimization Risk Bounds for Kolmogorov-Arnold Networks Trained by DP-SGD with Correlated Noise#1130549
- Kolmogorov--Arnold stability for discontinuous functions#975293
- Convex Optimization Is Free When Accuracy Is Expensive#1130006
Record · ID 984641
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