Learning sparse polynomial functions
From MaRDI portal
Recommendations
- Learning sparse multivariate polynomials over a field with queries and counterexamples.
- Learning polynomials with queries: The highly noisy case
- On PAC learning algorithms for rich Boolean function classes
- Interpolation and Approximation of Sparse Multivariate Polynomials over GF(2)
- On noise-tolerant learning of sparse parities and related problems
Cited in
(18)- Recovery guarantees for polynomial coefficients from weakly dependent data with outliers
- Learning multivariate functions with low-dimensional structures using polynomial bases
- Deep Neural Networks for Solving Large Linear Systems Arising from High-Dimensional Problems
- Machine learning the real discriminant locus
- On learning multivariate polynomials under the uniform distribution
- Gradient descent with identity initialization efficiently learns positive-definite linear transformations by deep residual networks
- Improved noisy population recovery, and reverse Bonami-Beckner inequality for sparse functions
- Learning sparse multivariate polynomials over a field with queries and counterexamples.
- Attribute-efficient learning of monomials over highly-correlated variables
- Learning polynomials with queries: The highly noisy case
- On PAC learning algorithms for rich Boolean function classes
- Learning general sparse additive models from point queries in high dimensions
- Lifelong learning in costly feature spaces
- Learning sparse linear combinations of basis functions over a finite domain
- scientific article; zbMATH DE number 1696656 (Why is no real title available?)
- Sparse polynomial prediction
- scientific article; zbMATH DE number 7415102 (Why is no real title available?)
- Nonlinear meta-learning can guarantee faster rates
This page was built for publication: Learning sparse polynomial functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5383997)
