Learning general sparse additive models from point queries in high dimensions
From MaRDI portal
Publication:2007617
DOI10.1007/s00365-019-09461-6zbMath1429.41031arXiv1801.08499OpenAlexW2942947262MaRDI QIDQ2007617
Publication date: 22 November 2019
Published in: Constructive Approximation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1801.08499
Multidimensional problems (41A63) Rate of convergence, degree of approximation (41A25) Algorithms for approximation of functions (65D15)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A mathematical introduction to compressive sensing
- A lasso for hierarchical interactions
- Survey of modeling and optimization strategies to solve high-dimensional design problems with computationally-expensive black-box functions
- Convergence rates of best \(N\)-term Galerkin approximations for a class of elliptic SPDEs
- Sparsity in multiple kernel learning
- Approximation of functions of few variables in high dimensions
- Iterative hard thresholding for compressed sensing
- Tight conditions for consistency of variable selection in the context of high dimensionality
- Function spaces in Lipschitz domains and optimal rates of convergence for sampling
- Component selection and smoothing in multivariate nonparametric regression
- The restricted isometry property and its implications for compressed sensing
- Widths of embeddings in function spaces
- Variable selection in nonparametric additive models
- A simple proof of the restricted isometry property for random matrices
- High-dimensional additive modeling
- Second-order cone programming
- Approximation of infinitely differentiable multivariate functions is intractable
- Minimax-optimal nonparametric regression in high dimensions
- Statistical inference in compound functional models
- Sampling numbers and function spaces
- Exact and Stable Covariance Estimation From Quadratic Sampling via Convex Programming
- Surface estimation, variable selection, and the nonparametric oracle property
- Learning juntas
- Sparse Volterra and Polynomial Regression Models: Recoverability and Estimation
- Sparse Additive Models
- Algorithms for learning sparse additive models with interactions in high dimensions*
- Variable Selection With the Strong Heredity Constraint and Its Oracle Property
- Variable Selection Using Adaptive Nonlinear Interaction Structures in High Dimensions
- Minimax-optimal rates for sparse additive models over kernel classes via convex programming
- A Bound on Tail Probabilities for Quadratic Forms in Independent Random Variables
