Boosted optimal weighted least-squares

DOI10.1090/mcom/3710OpenAlexW4213390110MaRDI QIDQ5070542

Anthony Nouy, Cécile Haberstich, Guillaume 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

Mathematics Subject Classification ID

Least squares and related methods for stochastic control systems (93E24) Numerical interpolation (65D05) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Approximation by polynomials (41A10) Algorithms for approximation of functions (65D15) Numerical analysis (65-XX)

Related Items

An Adaptive Sampling and Domain Learning Strategy for Multivariate Function Approximation on Unknown Domains, Optimal sampling and Christoffel functions on general domains, Constructive subsampling of finite frames with applications in optimal function recovery, Error guarantees for least squares approximation with noisy samples in domain adaptation, On the reconstruction of functions from values at subsampled quadrature points, Active Learning of Tree Tensor Networks using Optimal Least Squares, Towards optimal sampling for learning sparse approximation in high dimensions

Cites Work

• Unnamed Item
• On the stability and accuracy of least squares approximations
• User-friendly tail bounds for sums of random matrices
• Convergence estimates in probability and in expectation for discrete least squares with noisy evaluations at random points
• Computing approximate Fekete points by QR factorizations of Vandermonde matrices
• Rank-one modification of the symmetric eigenproblem
• Fast Leja points
• Slice sampling. (With discussions and rejoinder)
• Correction to: ``On the stability and accuracy of least squares approximations
• Coherence motivated sampling and convergence analysis of least squares polynomial chaos regression
• Hyperbolic cross approximation. Lecture notes given at the courses on constructive approximation and harmonic analysis, Barcelona, Spain, May 30 -- June 3, 2016
• Optimal pointwise sampling for \(L^2\) approximation
• A new upper bound for sampling numbers
• A general multipurpose interpolation procedure: The magic points
• A Christoffel function weighted least squares algorithm for collocation approximations
• Computing Multivariate Fekete and Leja Points by Numerical Linear Algebra
• Lower bounds for the largest eigenvalue of a symmetric matrix under perturbations of rank one
• Weighted Approximate Fekete Points: Sampling for Least-Squares Polynomial Approximation
• Optimal weighted least-squares methods
• Sequential Sampling for Optimal Weighted Least Squares Approximations in Hierarchical Spaces
• Adaptive Leja Sparse Grid Constructions for Stochastic Collocation and High-Dimensional Approximation
• Refined Perturbation Bounds for Eigenvalues of Hermitian and Non-Hermitian Matrices
• Adaptive Approximation by Optimal Weighted Least-Squares Methods
• Sparse grids
• Ramanujan Graphs and the Solution of the Kadison-Singer Problem
• Some Modified Matrix Eigenvalue Problems