Optimal learning - MaRDI portal

Linear regression; mixed models (62J05) Learning and adaptive systems in artificial intelligence (68T05) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20)

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Estimation and testing under sparsity. École d'Été de Probabilités de Saint-Flour XLV -- 2015
A mathematical introduction to compressive sensing
On the stability and accuracy of least squares approximations
Tractability of multivariate problems. Volume I: Linear information
Lasso-type recovery of sparse representations for high-dimensional data
Data assimilation and sampling in Banach spaces
The sparsity of LASSO-type minimizers
A new upper bound for sampling numbers
Best subset, forward stepwise or Lasso? Analysis and recommendations based on extensive comparisons
A unifying representer theorem for inverse problems and machine learning
Function values are enough for \(L_2\)-approximation
Simultaneous analysis of Lasso and Dantzig selector
Correcting for unknown errors in sparse high-dimensional function approximation
Minimization of functions having Lipschitz continuous first partial derivatives
Compressed sensing and best 𝑘-term approximation
Square-root lasso: pivotal recovery of sparse signals via conic programming
Universal approximation bounds for superpositions of a sigmoidal function
Sobolev bounds on functions with scattered zeros, with applications to radial basis function surface fitting
Robust instance-optimal recovery of sparse signals at unknown noise levels
Sparse Polynomial Approximation of High-Dimensional Functions
The Group Square-Root Lasso: Theoretical Properties and Fast Algorithms
Neural network approximation
Compressed sensing