Learning sparse linear combinations of basis functions over a finite domain

DOI10.1007/3-540-60454-5_34MaRDI QIDQ6083907zbMATH OpenFDO

Authors Atsuyoshi Nakamura, Shinji Miura

Publication date 8 December 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-60454-5_34

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Recommendations

• Classification using a sparse combination of basis functions
• Sparse Bayesian Learning for Basis Selection
• Sparse machine learning in Banach spaces
• Learning with Structured Sparsity
• Learning functions of few arbitrary linear parameters in high dimensions
• Learning sparse polynomial functions
• An empirical feature-based learning algorithm producing sparse approximations
• Learning Sparsifying Transforms

Cites work

• Exact learning of linear combinations of monotone terms from function value queries
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 1351104 (Why is no real title available?)
• Interpolation and Approximation of Sparse Multivariate Polynomials over GF(2)

Cited in

(2)

• From basis functions to basis fields: Vector field approximation from sparse data
• Learning multivariate functions with low-dimensional structures using polynomial bases

This page was built for publication: Learning sparse linear combinations of basis functions over a finite domain

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