Fitting multidimensional data using gradient penalties and the sparse grid combination technique
From MaRDI portal
Publication:1014352
DOI10.1007/s00607-009-0027-xzbMath1166.65004OpenAlexW2068953972MaRDI QIDQ1014352
Publication date: 27 April 2009
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00607-009-0027-x
numerical examplessparse gridsregularisationregressioncombination techniqueleast squares fittinghigh dimensional data
Nonparametric regression and quantile regression (62G08) Numerical smoothing, curve fitting (65D10) General nonlinear regression (62J02)
Related Items
Principal manifold learning by sparse grids ⋮ High-dimensional approximation with kernel-based multilevel methods on sparse grids ⋮ B-spline quasi-interpolation sampling representation and sampling recovery in Sobolev spaces of mixed smoothness ⋮ Multiparametric response surface construction by means of proper generalized decomposition: an extension of the PARAFAC procedure ⋮ Sampling and cubature on sparse grids based on a B-spline quasi-interpolation ⋮ Sampling inequalities for sparse grids ⋮ Spatially adaptive sparse grids for high-dimensional data-driven problems ⋮ Explicit error bounds for randomized Smolyak algorithms and an application to infinite-dimensional integration ⋮ Error Estimates for Multivariate Regression on Discretized Function Spaces ⋮ A new multivariate spline based on mixed partial derivatives and its finite element approximation ⋮ Practical considerations when using sparse grids with Bayesian inference for parameter estimation
Cites Work
- The combination technique and some generalisations
- Regularisierung schlecht gestellter Probleme durch Projektionsverfahren
- Elliptic partial differential equations of second order
- Extrapolation, combination, and sparse grid techniques for elliptic boundary value problems
- Arbitrary discontinuities in finite elements
- Some Estimates for a Weighted L 2 Projection
- Data mining with sparse grids
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item