Optimal Quadrature-Sparsification for Integral Operator Approximation
DOI10.1137/17M1123614zbMATH Open1490.41018OpenAlexW2622534955WikidataQ129030536 ScholiaQ129030536MaRDI QIDQ4553791FDOQ4553791
Authors: Johan A. K. Suykens, Bertrand Gauthier 
Publication date: 31 October 2018
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/17m1123614
Recommendations
- Optimized general sparse grid approximation spaces for operator equations
- Optimal quadratures in H(sub)p spaces
- Optimal numerical approximation of a linear operator
- Sparse approximate multiquadric interpolation
- scientific article; zbMATH DE number 3901922
- Quadrature based optimal iterative methods with applications in high-precision computing
- scientific article; zbMATH DE number 3979701
- scientific article; zbMATH DE number 3956308
- Integral Operators on Sparse Grids
- Sparse quadrature for high-dimensional integration with Gaussian measure
RKHSconvex quadratic programmingspectral approximationone-class SVMsparse quadrature\(\ell^{1}\)-type penalizationsquared-kernel discrepancy
Numerical integration (65D30) Approximate quadratures (41A55) Hilbert spaces with reproducing kernels (= (proper) functional Hilbert spaces, including de Branges-Rovnyak and other structured spaces) (46E22) Numerical methods for integral transforms (65R10) Integral operators (45P05) Integral operators (47G10)
Cites Work
- Equivalence of distance-based and RKHS-based statistics in hypothesis testing
- Support Vector Machines
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A new approach to variable selection in least squares problems
- On the equivalence between kernel quadrature rules and random feature expansions
- Generalized inverses. Theory and applications.
- Title not available (Why is that?)
- Estimating the support of a high-dimensional distribution
- Revisiting the Nyström method for improved large-scale machine learning
- Learning theory estimates via integral operators and their approximations
- On energy, discrepancy and group invariant measures on measurable subsets of Euclidean space
- Geometry on probability spaces
- On the Nyström method for approximating a gram matrix for improved kernel-based learning
- Title not available (Why is that?)
- Design of experiments in nonlinear models. Asymptotic normality, optimality criteria and small-sample properties
- Some comments on Wolfe's ‘away step’
- Near-optimal column-based matrix reconstruction
- Improving CUR matrix decomposition and the Nyström approximation via adaptive sampling
- A walk through energy, discrepancy, numerical integration and group invariant measures on measurable subsets of Euclidean space
- Convex relaxation for IMSE optimal design in random-field models
- Spectral approximation of the IMSE criterion for optimal designs in kernel-based interpolation models
Cited In (6)
- Nyström landmark sampling and regularized Christoffel functions
- Approximation of kernel matrices by circulant matrices and its application in kernel selection methods
- Energy-based sequential sampling for low-rank PSD-matrix approximation
- Kernel embedding of measures and low-rank approximation of integral operators
- Integral Operators on Sparse Grids
- Optimized general sparse grid approximation spaces for operator equations
Uses Software
This page was built for publication: Optimal Quadrature-Sparsification for Integral Operator Approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4553791)
