Boosted optimal weighted least-squares
DOI10.1090/MCOM/3710OpenAlexW4213390110MaRDI QIDQ5070542FDOQ5070542
Authors: Cécile Haberstich, A. Nouy, G. Perrin 
Publication date: 13 April 2022
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1912.07075
Numerical interpolation (65D05) Approximation by polynomials (41A10) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Numerical analysis (65-XX) Algorithms for approximation of functions (65D15) Least squares and related methods for stochastic control systems (93E24)
Cites Work
- Slice sampling. (With discussions and rejoinder)
- Title not available (Why is that?)
- Hyperbolic cross approximation. Lecture notes given at the courses on constructive approximation and harmonic analysis, Barcelona, Spain, May 30 -- June 3, 2016
- Sparse grids
- User-friendly tail bounds for sums of random matrices
- A general multipurpose interpolation procedure: The magic points
- Rank-one modification of the symmetric eigenproblem
- On the stability and accuracy of least squares approximations
- Adaptive Leja sparse grid constructions for stochastic collocation and high-dimensional approximation
- Some Modified Matrix Eigenvalue Problems
- Computing multivariate Fekete and Leja points by numerical linear algebra
- Computing approximate Fekete points by QR factorizations of Vandermonde matrices
- Ramanujan Graphs and the Solution of the Kadison-Singer Problem
- Sequential Sampling for Optimal Weighted Least Squares Approximations in Hierarchical Spaces
- Correction to: ``On the stability and accuracy of least squares approximations
- Fast Leja points
- Refined perturbation bounds for eigenvalues of Hermitian and non-Hermitian matrices
- Coherence motivated sampling and convergence analysis of least squares polynomial chaos regression
- Optimal weighted least-squares methods
- Convergence estimates in probability and in expectation for discrete least squares with noisy evaluations at random points
- Adaptive Approximation by Optimal Weighted Least-Squares Methods
- A Christoffel function weighted least squares algorithm for collocation approximations
- Optimal pointwise sampling for \(L^2\) approximation
- A new upper bound for sampling numbers
- Weighted Approximate Fekete Points: Sampling for Least-Squares Polynomial Approximation
- Lower bounds for the largest eigenvalue of a symmetric matrix under perturbations of rank one
Cited In (9)
- Optimal sampling and Christoffel functions on general domains
- On the reconstruction of functions from values at subsampled quadrature points
- Randomized least-squares with minimal oversampling and interpolation in general spaces
- Constructive subsampling of finite frames with applications in optimal function recovery
- Towards optimal sampling for learning sparse approximation in high dimensions
- An Adaptive Sampling and Domain Learning Strategy for Multivariate Function Approximation on Unknown Domains
- Error guarantees for least squares approximation with noisy samples in domain adaptation
- Mini-workshop: Nonlinear approximation of high-dimensional functions in scientific computing. Abstracts from the mini-workshop held October 15--20, 2023
- Active Learning of Tree Tensor Networks using Optimal Least Squares
This page was built for publication: Boosted optimal weighted least-squares
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5070542)
