A new subspace-based algorithm for efficient spatially adaptive sparse grid regression, classification and multi-evaluation

DOI10.1007/978-3-319-28262-6_9zbMATH Open1338.65025OpenAlexW2484553474MaRDI QIDQ2808025FDOQ2808025

Authors: David Pfander, Alexander Heinecke, Dirk Pflüger 

Publication date: 26 May 2016

Published in: Lecture Notes in Computational Science and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-28262-6_9

Recommendations

• Data mining with sparse grids
• On the convergence rate of sparse grid least squares regression
• Spatially adaptive sparse grids for high-dimensional data-driven problems
• scientific article; zbMATH DE number 2101400
• Efficient Pseudorecursive Evaluation Schemes for Non-adaptive Sparse Grids

Mathematics Subject Classification ID

Cites Work

• Multivariate adaptive regression splines
• Pattern recognition and machine learning.
• Sparse grids
• Spatially adaptive sparse grids for high-dimensional data-driven problems
• Data mining with sparse grids

Cited In (6)

• Heterogeneous distributed big data clustering on sparse grids
• Spatially adaptive sparse grids for high-dimensional data-driven problems
• Alternating direction method of multipliers for hierarchical basis approximators
• Comparison of data-driven uncertainty quantification methods for a carbon dioxide storage benchmark scenario
• Fast sparse grid operations using the unidirectional principle: a generalized and unified framework
• On the convergence rate of sparse grid least squares regression

Uses Software

• Fastsg

This page was built for publication: A new subspace-based algorithm for efficient spatially adaptive sparse grid regression, classification and multi-evaluation

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