On the expressivity of the ExSpliNet KAN model
From MaRDI portal
Cites work
- A practical guide to splines.
- Approximation by superpositions of a sigmoidal function
- Breaking the curse of dimensionality with convex neural networks
- Deep ReLU Networks Overcome the Curse of Dimensionality for Generalized Bandlimited Functions
- Error bounds for approximations with deep ReLU networks
- Error bounds for deep ReLU networks using the Kolmogorov-Arnold superposition theorem
- Error estimates for the cardinal spline interpolation
- ExSpliNet: An interpretable and expressive spline-based neural network
- Foundations of spline theory: B-splines, spline approximation, and hierarchical refinement
- scientific article; zbMATH DE number 3147701 (Why is no real title available?)
- scientific article; zbMATH DE number 5190601 (Why is no real title available?)
- scientific article; zbMATH DE number 1928659 (Why is no real title available?)
- Multilayer feedforward networks are universal approximators
- New error bounds for deep ReLU networks using sparse grids
- On a constructive proof of Kolmogorov's superposition theorem
- On uniform spline approximation
- Physics-informed neural networks: a deep learning framework for solving forward and inverse problems involving nonlinear partial differential equations
- Sharp error estimates for spline approximation: explicit constants, n-widths, and eigenfunction convergence
- Universal approximation bounds for superpositions of a sigmoidal function
This page was built for publication: On the expressivity of the ExSpliNet KAN model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6894208)
