Geometry and optimization of shallow polynomial networks

Cites work

Activation degree thresholds and expressiveness of polynomial neural networks
An analytical theory of curriculum learning in teacher–student networks*
Best rank-k approximations for tensors: generalizing Eckart-Young
Choosing roots of polynomials smoothly
Critical points of matrix least squares distance functions
Effective criteria for specific identifiability of tensors and forms
Focal loci of algebraic varieties i
Function space and critical points of linear convolutional networks
Geometry of linear convolutional networks
Geometry of polynomial neural networks
scientific article; zbMATH DE number 1827070 (Why is no real title available?)
scientific article; zbMATH DE number 773851 (Why is no real title available?)
Low-rank matrix approximation with weights or missing data is NP-hard
Moment Estimation for Nonparametric Mixture Models through Implicit Tensor Decomposition
Moment Varieties for Mixtures of Products
On generic identifiability of symmetric tensors of subgeneric rank
On real typical ranks
On the typical rank of real binary forms
Spurious valleys in one-hidden-layer neural network optimization landscapes
Stationary points of a shallow neural network with quadratic activations and the global optimality of the gradient descent algorithm
Symmetric Tensors and Symmetric Tensor Rank
Tensor decompositions for learning latent variable models
The effect of smooth parametrizations on nonconvex optimization landscapes
The Euclidean distance degree of an algebraic variety
Theoretical Insights Into the Optimization Landscape of Over-Parameterized Shallow Neural Networks
Typical real ranks of binary forms

This page was built for publication: Geometry and optimization of shallow polynomial networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7254643)