Fast cross-validation in harmonic approximation
From MaRDI portal
Publication:778015
DOI10.1016/j.acha.2020.05.002OpenAlexW3026879920MaRDI QIDQ778015
Ralf Hielscher, Daniel Potts, Felix Bartel
Publication date: 30 June 2020
Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1903.10206
regularizationdiscrete Fourier transformscross-validationNFFTspherical Fourier transformfast evaluation of cross-validation score
Ill-posedness and regularization problems in numerical linear algebra (65F22) Trigonometric approximation (42A10) Numerical methods for discrete and fast Fourier transforms (65T50)
Related Items (3)
Concentration inequalities for cross-validation in scattered data approximation ⋮ Grouped Transformations and Regularization in High-Dimensional Explainable ANOVA Approximation ⋮ Error guarantees for least squares approximation with noisy samples in domain adaptation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Smoothing by spline functions. II
- Marcinkiewicz-Zygmund measures on manifolds
- On the computation of spherical designs by a new optimization approach based on fast spherical Fourier transforms
- Spherical harmonics and approximations on the unit sphere. An introduction
- Efficient algorithms for robust generalized cross-validation spline smoothing
- Spherical quadrature formulas with equally spaced nodes on latitudinal circles
- A note on stability results for scattered data interpolation on Euclidean spheres
- Probabilistic spherical Marcinkiewicz-Zygmund inequalities
- Efficient computation for Whittaker-Henderson smoothing
- Asymptotic optimality of \(C_ L\) and generalized cross-validation in ridge regression with application to spline smoothing
- Fast spherical Fourier algorithms.
- Numerical Fourier analysis
- Lectures on constructive approximation. Fourier, spline, and wavelet methods on the real line, the sphere, and the ball
- Smoothing inversion of Fourier series using generalized cross-validation
- Adaptive kernel methods using the balancing principle
- Approximation of multivariate periodic functions by trigonometric polynomials based on rank-1 lattice sampling
- Efficient reconstruction of functions on the sphere from scattered data
- Uniform approximation on the sphere by least squares polynomials
- Fast generalized cross validation using Krylov subspace methods
- Regularized Least Squares Approximations on the Sphere Using Spherical Designs
- Using NFFT 3---A Software Library for Various Nonequispaced Fast Fourier Transforms
- Optimal mollifiers for spherical deconvolution
- CROSS-VALIDATION BASED ADAPTATION FOR REGULARIZATION OPERATORS IN LEARNING THEORY
- Fast summation based on fast trigonometric transforms at non‐equispaced nodes
- Algorithm 772
- Generalized Cross-Validation as a Method for Choosing a Good Ridge Parameter
- Reconstruction Algorithms in Irregular Sampling
- Strictly Positive Definite Functions on Spheres
- Random Sampling of Multivariate Trigonometric Polynomials
- Approximation Theory and Harmonic Analysis on Spheres and Balls
- Parameter Choice Strategies for Least-squares Approximation of Noisy Smooth Functions on the Sphere
- Localized Linear Polynomial Operators and Quadrature Formulas on the Sphere
- Polynomial approximation on the sphere using scattered data
- Fast evaluation of quadrature formulae on the sphere
- How good can polynomial interpolation on the sphere be?
This page was built for publication: Fast cross-validation in harmonic approximation
