Compositional sparsity of learnable functions
From MaRDI portal
Publication:6554713
Recommendations
- The unreasonable effectiveness of deep learning in artificial intelligence
- Learning sparse features can lead to overfitting in neural networks
- A mathematical perspective of machine learning
- Why does deep and cheap learning work so well?
- What Kinds of Functions Do Deep Neural Networks Learn? Insights from Variational Spline Theory
Cites work
- A new scheme for the tensor representation
- A theory of the learnable
- Approximation by tree tensor networks in high dimensions: Sobolev and compositional functions
- Deep vs. shallow networks: an approximation theory perspective
- Hierarchical Singular Value Decomposition of Tensors
- scientific article; zbMATH DE number 5595162 (Why is no real title available?)
- scientific article; zbMATH DE number 3738628 (Why is no real title available?)
- scientific article; zbMATH DE number 1965513 (Why is no real title available?)
- scientific article; zbMATH DE number 1405266 (Why is no real title available?)
- Limitations of deep learning for inverse problems on digital hardware
- Nonparametric regression using deep neural networks with ReLU activation function
- On best approximation by ridge functions
- On deep learning as a remedy for the curse of dimensionality in nonparametric regression
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Optimal nonlinear approximation
- The enduring appeal of Szemerédi's theorem
This page was built for publication: Compositional sparsity of learnable functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6554713)
